DocumentCode
3413540
Title
Fast routing table lookup using CAMs
Author
McAuley, Anthony J. ; Francis, Paul
Author_Institution
Bellcore, Morristown, NJ, USA
fYear
1993
fDate
1993
Firstpage
1382
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
Keywords
content-addressable storage; table lookup; telecommunication equipment; telecommunication network routing; binary CAM; content addressable memory; fast routing table lookup; hierarchical addresses; national telephone network; ternary CAM; Associative memory; CADCAM; Cams; Computer aided manufacturing; Delay; Hardware; Packet switching; Routing; Switches; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE
Conference_Location
San Francisco, CA
Print_ISBN
0-8186-3580-0
Type
conf
DOI
10.1109/INFCOM.1993.253403
Filename
253403
Link To Document