Prefix segregation scheme for a TCAM-based IP forwarding engine

A novel design for IP packet forwarding based on a new ternary content-addressable-memory configuration offers an efficient hardware solution for the longest-prefix matching problem in Internet routers. The architecture has lower update complexity, lower cost, and shorter search latency compared to the conventional TCAM structure.

[1]  Chung-Hsun Huang,et al.  High-speed and low-power CMOS priority encoders , 2000, IEEE Journal of Solid-State Circuits.

[2]  Tutomu Murase,et al.  A longest prefix match search engine for multi-gigabit IP processing , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[3]  N. Yazdani,et al.  Fast and scalable schemes for the IP address lookup problem , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).

[4]  Francis Zane,et al.  Coolcams: power-efficient TCAMs for forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Nen-Fu Huang,et al.  A fast IP routing lookup scheme for gigabit switching routers , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Mohammad Peyravian,et al.  Search engine implications for network processor efficiency , 2003, IEEE Netw..

[7]  Hisatada Miyatake,et al.  A design for high-speed low-power CMOS fully parallel content-addressable memory macros , 2001 .

[8]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[9]  Huan Liu.  Routing Table Compaction in Ternary CAM , 2002, IEEE Micro.

[10]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[11]  Paul Francis,et al.  Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[12]  Rina Panigrahy,et al.  Sorting and searching using ternary CAMs , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[13]  Thomas A. DeMassa,et al.  Digital Integrated Circuits , 1985, 1985 IEEE GaAs IC Symposium Technical Digest.

[14]  C. Zukowski,et al.  Putting routing tables in silicon , 1992, IEEE Network.

[15]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  G. Kasai,et al.  200MHz/200MSPS 3.2W at 1.5V Vdd, 9.4Mbits ternary CAM with new charge injection match detect circuits and bank selection scheme , 2003, Proceedings of the IEEE 2003 Custom Integrated Circuits Conference, 2003..

[17]  J.P. Wade,et al.  Dynamic cross-coupled bitline content addressable memory cell for high density arrays , 1987, 1985 International Electron Devices Meeting.

[18]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[19]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[20]  Geoff Huston,et al.  Analyzing the Internet's BGP Routing Table , 2001 .

[21]  Rina Panigrahy,et al.  Reducing TCAM power consumption and increasing throughput , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[22]  Toshiaki Miyazaki,et al.  High-speed table lookup engine for IPv6 longest prefix match , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[23]  Mehrdad Nourani,et al.  Reconfigurable memory architecture for scalable IP forwarding engines , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[24]  Peter Newman,et al.  IP switching and gigabit routers , 1997, IEEE Commun. Mag..