Fast routing table lookup using CAMs

Key Points

Key points are not available for this paper at this time.

Abstract

The authors investigate fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those found in a national telephone network. The hierarchical addresses provide important benefits in large networks, but existing fast routing table lookup techniques, based on hardware such as content addressable memory (CAM), work only with flat addresses. Several fast routing table lookup solutions for hierarchical address based on binary and ternary CAMs are presented, and their advantages and drawbacks are analyzed.>

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Cite This Study

McAuley et al. (Mon,) studied this question.

synapsesocial.com/papers/6a210dcb657fe1985fef0f9c https://doi.org/https://doi.org/10.1109/infcom.1993.253403

Discussion

References and Citations

Add This Paper to Your Research Feed

Any time a new paper drops it will be there.