Segregating the encompassing prefixes to enhance the performance of packet forwarding engines

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2004, Pages 1612-1616

  Akhbarizadeh, Mohammad J ^a   Nourani, Mehrdad ^a   Cantrell, Cyrus D ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IP PACKETS; PACKET FORWARDING ENGINES; PSEUDO CODES; TERNARY CONTENT ADDRESSABLE MEMORY (TCAM);

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SOFTWARE; INTERNET; NETWORK PROTOCOLS; SEARCH ENGINES; STORAGE ALLOCATION (COMPUTER); TABLE LOOKUP;

PACKET NETWORKS;

EID: 18144427102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Ruiz-Sanchez, E. Biersack and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," IEEE Network Magazine, March 2001.
2. A. McAuley and Paul Francis, "Fast Routing Table Lookup Using CAMs," Proceedings of INFOCOM'93 Conf., 1993.
3. V. Srinivasan, B. Nataraj, and S. Khanna, "Methods For Longest Prefix Matching In a Content Addressable Memory," US Patent 6,237,061, January 1999.
4. D. Shah and P. Gupta, "Fast Updating Algorithms for TCAMs," IEEE Micro, February 2001.
5. J. Wang and C. Huang, "High-Speed and Low-Power CMOS Priority Encoders," IEEE Journal of Solid State Circuits, vol. 35, no. 10, Oct. 2000.
6. Synopsys Design Analyzer, "User Manuals for SYNOPSYS Toolset," Synopsys, Inc., 2003.