High speed IP lookup algorithm with scalability and parallelism based on CAM array and TCAM

• Published in: 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) Vol. 2; pp. 1085 - 1089 Vol.2
• Main Authors: Tan Mingfeng, Gong Zhenghu
• Format: Conference Proceeding
• Language: English
• Published: Piscataway, New Jersey IEEE 2004
• Subjects: Applied sciences; Bandwidth; CADCAM; Computer aided manufacturing; Conferences; Exact sciences and technology; Hardware; Interconnected networks; Internet; Networks and services in france and abroad; Parallel processing; Routing; Scalability; Software algorithms; Spine; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Transmission and modulation (techniques and equipments); Performance evaluation; Routing algorithm; High performance; Associative memory; Access time; Scalability; Computer aided manufacturing; Storage management; Routing; Router; Internet
• ISBN: 0780385330; 9780780385337
• DOI: 10.1109/ICC.2004.1312668

With fast increasing of Internet's bandwidth, higher performance routers are needed, and their speed depends a lot on the IP routing lookup process. This paper proposes a high performance IP routing lookup algorithm based on CAM array and TCAM. Using smaller memory it does faster searching. For real route tables with 128K prefixes this scheme needs only 17 CAMs with total volume of 1.55 MB and a TCAM with 2K entries. It needs only 1 memory access time for each lookup and few memory accesses for each update in average. Using 10 ns CAM and TCAM, it can fully match the link speed of OC-768. For its good scalability and parallelism, it can be extended to adapt larger forwarding tables and faster forwarding requirements.