A High-Speed Range-Matching TCAM for Storage-Efficient Packet Classification

A critical issue in the use of TCAMs for packet classification is how to efficiently represent rules with ranges, known as range matching. A range-matching ternary content addressable memory (RM-TCAM) including a highly functional range-matching cell (RMC) is presented in this paper. By offering various range operators, the RM-TCAM can reduce storage expansion ratio from 4.21 to 1.01 compared with conventional TCAMs, under real-world packet classification rule sets, which results in reduced power consumption and die area. A new pre-discharging match-line scheme is used to realize high-speed searching in a dynamic match-line structure. An additional charge-recycling driver further reduces the power consumption of search lines. Simulation results of a 256times64-bit range-matching TCAM, when implemented in the 0.13-mum CMOS technology, achieves a 1.99-ns search time with an energy efficiency of 1.26 fJ/bit/search. While a TCAM including range encoding approach requires an additional SRAM or DRAM, the RM-TCAM can improve storage efficiency without any extra components as well as reduce the die area.

[1]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[2]  Ali Sheikholeslami,et al.  A mismatch-dependent power allocation technique for match-line sensing in content-addressable memories , 2003 .

[3]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[4]  Suhwan Kim,et al.  A Storage- and Power-Efficient Range-Matching TCAM for Packet Classification , 2006, 2006 IEEE International Solid State Circuits Conference - Digest of Technical Papers.

[5]  Jonathan S. Turner,et al.  Packet classification using extended TCAMs , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[6]  Anand Rangarajan,et al.  Algorithms for advanced packet classification with ternary CAMs , 2005, SIGCOMM '05.

[7]  T. V. Lakshman,et al.  Efficient Multimatch Packet Classification for Network Security Applications , 2006, IEEE Journal on Selected Areas in Communications.

[8]  Huan Liu,et al.  Efficient mapping of range classifier into ternary-CAM , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[9]  Lee-Sup Kim,et al.  A low-power CAM using pulsed NAND-NOR match-line and charge-recycling search-line driver , 2005 .

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

[11]  Yingtao Jiang,et al.  CAM-based label search engine for MPLS over ATM networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  E TaylorDavid.  Survey and taxonomy of packet classification techniques , 2005 .

[13]  Lee-Sup Kim,et al.  A low-power CAM using pulsed NAND-NOR match-line and charge-recycling search-line driver , 2005, IEEE Journal of Solid-State Circuits.

[14]  Hoi-Jun Yoo,et al.  A 0.7-fJ/bit/search 2.2-ns search time hybrid-type TCAM architecture , 2004, IEEE Journal of Solid-State Circuits.

[15]  José G. Delgado-Frias,et al.  Decoupled dynamic ternary content addressable memories , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  Bin Liu,et al.  DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors , 2008, IEEE Transactions on Computers.

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

[18]  Michel Verleysen,et al.  A high-storage capacity content-addressable memory and its learning algorithm , 1989 .

[19]  So-Young Kim,et al.  Closed-Form RC and RLC Delay Models Considering Input Rise Time , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.