This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DPPC-RE: TCAM-Based Distributed Parallel Packet Classification with Range Encoding
August 2006 (vol. 55 no. 8)
pp. 947-961
Packet classification has been a critical data path function for many emerging networking applications. An interesting approach is the use of Ternary Content Addressable Memory (TCAM) to achieve deterministic, high-speed packet classification performance. However, apart from high cost and power consumption, due to slow growing clock rate for memory technology, in general, the traditional single TCAM-based solution has difficulty to keep up with fast growing line rates. Moreover, the TCAM storage efficiency is largely affected by the need to support rules with ranges or range matching. In this paper, a distributed TCAM scheme that exploits chip-level-parallelism is proposed to greatly improve the throughput performance. This scheme seamlessly integrates with a range encoding scheme which not only solves the range matching problem, but also ensures a balanced high throughput performance. A thorough theoretical worst-case analysis of throughput, processing delay, and power consumption, as well as the experimental results show that the proposed solution can achieve scalable throughput performance matching up to OC768 line rate or higher. The added TCAM storage overhead is found to be reasonably small for the five real-world classifiers studied.

[1] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Fast and Scalable Layer Four Switching,” Proc. ACM SIGCOMM Conf., 1998.
[2] T.V. Lakshman and D. Stiliadis, “High-Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” Proc. ACM SIGCOMM Conf., 1998.
[3] M. Buddhikot, S. Suri, and M. Waldvogel, “Space Decomposition Techniques for Fast Layer-4 Switching,” Proc. Conf. Protocols for High Speed Networks IV (PfHSN '99), 1999.
[4] A. Feldmann and S. Muthukrishnan, “Tradeoffs for Packet Classification,” Proc. IEEE INFOCOM Conf., 2000.
[5] F. Baboescu, S. Singh, G. Varghese, “Packet Classification for Core Routers: Is There an Alternative to CAMs?” Proc. IEEE INFOCOM Conf., 2003.
[6] P. Gupta and N. McKeown, “Packet Classification on Multiple Fields,” Proc. ACM SIGCOMM Conf., 1999.
[7] P. Gupta and N. McKeown, “Packet Classification Using Hierarchical Intelligent Cuttings,” IEEE Micro Magazine, vol. 20, no. 1, pp. 34-41, Jan.-Feb. 2000.
[8] V. Srinivasan, S. Suri, and G. Varghese, “Packet Classification Using Tuple Space Search,” Proc. ACM SIGCOMM Conf., 1999.
[9] S. Singh, F. Baboescu, G. Varghese, and J. Wang, “Packet Classification Using Multidimensional Cutting,” Proc. ACM SIGCOMM Conf., 2003.
[10] E. Spitznagel, D. Taylor, and J. Turner, “Packet Classification Using Extended TCAMs,” Proc. 11th Int'l Conf. Network Protocol (ICNP '03), 2003.
[11] T. Lakshman and D. Stiliadis, “High-Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” ACM SIGCOMM Computer Comm. Rev., vol. 28, no. 4, pp. 203-214, Oct. 1998.
[12] H. Liu, “Effcient Mapping of Range Classier into Ternary CAM,” Proc. 10th Symp. High Performance Interconnects (HotI '02), Aug. 2002.
[13] J. van Lunteren and A.P.J. Engbersen, “Dynamic Multi-Field Packet Classification,” Proc. Globecom '02 Conf., pp. 2215-2219, Nov. 2002.
[14] J. van Lunteren and A.P.J. Engbersen, “Fast and Scalable Packet Classification,” IEEE J. Selected Areas in Comm., vol. 21, no. 4, pp.560-571, May 2003.
[15] H. Che, Z. Wang, K. Zheng, and B. Liu, “DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors,” technique report, Univ. of Texas at Arlington, http://crystal.uta.edu/hchedres.pdf, 2006.
[16] K. Zheng, C.C. Hu, H.B. Lu, and B. Liu, “An Ultra High Throughput and Power Efficient TCAM-Based IP Lookup Engine,” Proc. IEEE INFOCOM Conf., Apr. 2004.
[17] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, third ed. Morgan Kaufmann, 2002.
[18] J. Turner, “Real-World Rule Databases,” St. Louis, Mo.: Washington Univ., 2004.
[19] Z. Wang, H. Che, M. Kumar, and S.K. Das, “CoPTUA: Consistent Policy Table Update Algorithm for TCAM without Locking,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1602-1614, 2004.
[20] Cypress Ayama 10K/20K NSE Series TCAM products, http:/www.cypress.com, 2006.
[21] Intel Pentium IV Series CPU products, http:/www.intel.com, 2006.
[22] F. Zane, G. Narlikar, A. Basu, “CoolCAMs: Power-Efficient TCAMs for Forwarding Engines,” Proc. IEEE INFOCOM '03, 2003.
[23] Cisco CRS-1 Carrier Routing System, http:/www.cisco.com, 2006.
[24] K. Zheng, H. Che, Z. Wang, and B. Liu, “TCAM-Based Distributed Parallel Packet Classification Algorithm with Range-Matching Solution,” Proc. IEEE INFOCOM '05, vol. 1, pp. 293-303, Mar. 2005.
[25] H. Lu and S. Sahni, “O(log W) Multidimensional Packet Classification,” IEEE/ACM Trans. Networking, to appear.
[26] H. Lu, “Improved Trie Partitioning for Cooler TCAMs,” Proc. IASTED Int'l Conf. Advances in Computer Science and Technology (ACST), 2004.
[27] R. Panigrahy and S. Sharma, “Reducing TCAM Power Consumption and Increasing Throughput,” Proc. 10th Symp. High Performance Interconnects HOT Interconnects (HotI '02), 2002.

Index Terms:
Packet classification, range matching, TCAM.
Citation:
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu, Xin Zhang, "DPPC-RE: TCAM-Based Distributed Parallel Packet Classification with Range Encoding," IEEE Transactions on Computers, vol. 55, no. 8, pp. 947-961, Aug. 2006, doi:10.1109/TC.2006.123
Usage of this product signifies your acceptance of the Terms of Use.