A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing

An internet protocol (IP) router determines the next hop for a packet by finding the longest prefix match. This lookup often occurs in ternary content addressable memory (TCAM), which allows bit masking of the IP address. In this paper, an internet protocol content addressable memory (IPCAM) circuit that directly determines the longest prefix match to the stored address is described. The proposed IPCAM produces an encoded prefix match length that is limited by the prefix mask. Entries need not be sorted in order. One of the proposed IPCAM entries replaces on average 22 TCAM entries. Consequently the longest prefix matching CAM is less than 1/10 the size of the equivalent TCAM and dissipates 93.5% less dynamic power. The encoded outputs drive a priority encoder to determine the longest prefix match in the IPCAM arrays. A priority encoder circuit architecture appropriate to the unsorted IPCAM entries is also presented.

[1]  Rabi N. Mahapatra,et al.  TCAM architecture for IP lookup using prefix properties , 2004, IEEE Micro.

[2]  Gürhan Küçük,et al.  Energy efficient comparators for superscalar datapaths , 2004, IEEE Transactions on Computers.

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

[4]  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).

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

[6]  K. Pagiamtzis,et al.  Content-addressable memory (CAM) circuits and architectures: a tutorial and survey , 2006, IEEE Journal of Solid-State Circuits.

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

[8]  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..

[9]  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.

[10]  Aristides Efthymiou,et al.  A CAM with mixed serial-parallel comparison for use in low energy caches , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Stefanos Kaxiras,et al.  IPStash: a Power-Efficient Memory Architecture for IP-lookup , 2003, MICRO.

[12]  Chingwei Yeh,et al.  High-Speed and Low-Power Design Techniques for TCAM Macros , 2008, IEEE Journal of Solid-State Circuits.

[13]  Hung-Yu Li,et al.  An AND-type match-line scheme for high-performance energy-efficient content addressable memories , 2006, IEEE Journal of Solid-State Circuits.

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

[15]  Vojin G. Oklobdzija,et al.  An algorithmic and novel design of a leading zero detector circuit: comparison with logic synthesis , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[16]  K. J. Schultz,et al.  Fully Parallel 30-MHz , 2 . 5-Mb CAM , 1998 .

[17]  Mehrdad Nourani,et al.  A nonredundant ternary CAM circuit for network search engines , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[18]  C. G. Sodini,et al.  A ternary content addressable search engine , 1989 .

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

[20]  Chua-Chin Wang,et al.  High fan-in dynamic CMOS comparators with low transistor count , 2003 .

[21]  Lih-Chyau Wuu,et al.  A fast IP lookup scheme for longest-matching prefix , 2001, Proceedings 2001 International Conference on Computer Networks and Mobile Computing.

[22]  Lawrence T. Clark,et al.  Low power fast and dense longest prefix match content addressable memory for IP routers , 2009, ISLPED.

[23]  Y. Nishimichi,et al.  An 8Kb content-addressable and reentrant memory , 1985, 1985 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[24]  Junghwan Kim,et al.  An Efficient IP Lookup Architecture with Fast Update Using Single-Match TCAMs , 2008, WWIC.

[25]  Vikas Chaudhary,et al.  Low-power high-performance nand match line content addressable memories , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[26]  Bin Liu,et al.  An ultra high throughput and power efficient TCAM-based IP lookup engine , 2004, IEEE INFOCOM 2004.

[27]  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).