On the code length of TCAM coding schemes

All high-speed Internet devices need to implement classification, i.e. they must determine whether incoming packet headers belong to a given subset of a search space. To do it, they encode the subset using ternary arrays in special high-speed devices called TCAMs (ternary content-addressable memories). However, the optimal coding for arbitrary subsets is unknown. In particular, to encode an arbitrary range subset of the space of all W-bit values, previous works have successively reduced the upper-bound on the code length from 2W–2 to 2W–4, then 2W–5, and finally W TCAM entries. In this paper, we prove that this final result is optimal for typical prefix coding and cannot be further improved, i.e. the bound of W is tight. To do so, we introduce new analytical tools based on independent sets and alternating paths.

[1]  George Varghese,et al.  Network algorithmics , 2004 .

[2]  Ramei Cohen,et al.  Simple Efficient TCAM Based Range Classification , 2010, 2010 Proceedings IEEE INFOCOM.

[3]  Guido Appenzeller,et al.  Implementing an OpenFlow switch on the NetFPGA platform , 2008, ANCS '08.

[4]  Isaac Keslassy,et al.  Worst-Case TCAM Rule Expansion , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[6]  Danny Hendler,et al.  Space-Efficient TCAM-Based Classification Using Gray Coding , 2007, IEEE Transactions on Computers.

[7]  H. Jonathan Chao,et al.  High Performance Switches and Routers , 2007 .

[8]  David E. Taylor Survey and taxonomy of packet classification techniques , 2005, CSUR.

[9]  Baruch Schieber,et al.  Computing the minimum DNF representation of Boolean functions defined by intervals , 2005, Discret. Appl. Math..

[10]  Tsutomu Sasao On the Complexity of Classification Functions , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).