This Article 
 Bibliographic References 
 Add to: 
Efficient Multidimensional Packet Classification with Fast Updates
April 2009 (vol. 58 no. 4)
pp. 463-479
Yeim-Kuan Chang, National Cheng Kung University, Tainan
Packet classification has continued to be an important research topic for high-speed routers in recent years. In this paper, we propose a new packet classification scheme based on the binary range and prefix searches. The basic data structure of the proposed packet classification scheme for multidimensional rule tables is a hierarchical list of sorted ranges and prefixes that allows the binary search to be performed on the list at each level to find the best matched rule. We also propose a set of heuristics to further improve the performance of the proposed algorithm. We test our schemes by using rule tables of various sizes generated by ClassBench and compare them with the existing schemes, EGT, EGT-PC, and HyperCuts. The performance results show that in a test using a 2D segmentation table, the proposed scheme not only performs better than the EGT, EGT-PC, and HyperCuts in classification speed and memory usage but also achieves faster table update operations that are not supported in the existing schemes.

[1] F. Baboescu, S. Singh, and G. Varghese, “Packet Classification for Core Routers: Is There an Alternative to CAMs?” Proc. IEEE INFOCOM, 2003.
[2] F. Baboescu and G. Varghese, “Scalable Packet Classification,” Proc. ACM SIGCOMM, 2001.
[3] Y.-K. Chang, “Fast Binary and Multiway Prefix Searches for Packet Forwarding,” Computer Networks, vol. 51, no. 3, pp. 588-605, Feb. 2007.
[4] Y.-K. Chang and Y.-C. Lin, “Dynamic Segment Trees for Ranges and Prefixes,” IEEE Trans. Computers, vol. 57, no. 6, pp. 769-784, June 2007.
[5] E. Cohen and C. Lund, “Packet Classification in Large ISPs: Design and Evaluation of Decision Tree Classifiers,” Proc. ACM SIGMETRICS/Performance '05, June 2005.
[6] Q. Dong, S. Banerjee, J. Wang, and D. Agrawal, “Wire Speed Packet Classification without TCAMs: A Few More Registers (and a Bit of Logic) Are Enough,” Proc. ACM SIGMETRICS '07, June 2007.
[7] EGT and EGT-PC, http://www.ial.ucsd.educlassification/, 2008.
[8] A. Feldmann and S. Muthukrishnan, “Tradeoffs for Packet Classification,” Proc. IEEE INFOCOM '00, pp. 1193-1202, Mar. 2000.
[9] P. Gupta, S. Lin, and N. McKeown, “Routing Lookups in Hardware at Memory Access Speeds,” Proc. IEEE INFOCOM '98, pp. 1240-1247, Apr. 1998.
[10] P. Gupta and N. McKeown, “Packet Classification on Multiple Fields,” Proc. ACM SIGCOMM '99, pp. 147-160, Aug. 1999.
[11] P. Gupta and N. McKeown, “Packet Classification Using Hierarchical Intelligent Cuttings,” Proc. Seventh Hot Interconnects (HOTI '99), Aug. 1999.
[12] P. Gupta and N. Mckeown, “Algorithms for Packet Classification,” IEEE Network, vol. 15, no. 2, pp. 24-32, 2001.
[13] Hypercut, htm , 2008.
[14] T.V. Lakshman and D. Stiliadis, “High-Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” Proc. ACM SIGCOMM '98, pp. 203-214, 1998.
[15] B. Lampson, V. Srinivasan, and G. Varghese, “IP Lookups Using Multiway and Multicolumn Search,” IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 324-334, June 1999.
[16] H. Lu and S. Sahni, “${\rm O}(\log {\rm n})$ Dynamic Router-Tables for Prefixes and Ranges,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1217-1230, Oct. 2004.
[17] M.A. Ruiz-Sanchez, E.W. Biersack, and W. Dabbous, “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001.
[18] S. Sahni and K. Kim, “${\rm O}(\log {\rm n})$ Dynamic Router-Table Design,” IEEE Trans. Computers, vol. 53, no. 3, pp. 351-363, Mar. 2004.
[19] S. Singh, F. Baboescu, G. Varghese, and J. Wang, “Packet Classification Using Multidimensional Cutting,” Proc. ACM SIGCOMM '03, pp. 25-29, Aug. 2003.
[20] V. Srinivasan, S. Suri, and G. Varghese, “Packet Classification Using Tuple Space Search,” Proc. ACM SIGCOMM '99, pp.135-146, Aug. 1999.
[21] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvagel, “Fast and Scalable Layer Four Switching,” Proc. ACM SIGCOMM '98, pp. 191-202, Aug. 1998.
[22] D.E. Taylor and J.S. Turner, “ClassBench: A Packet Classification Benchmark,” Proc. IEEE INFOCOM '05, May 2005.
[23] D.E. Taylor, “Surveys and Taxonomy of Packet Classification Techniques,” ACM Computing Surveys, vol. 37, no. 3, pp. 238-275, Sept. 2005.
[24] T. Woo, “A Modular Approach to Packet Classification: Algorithms and Results,” Proc. IEEE INFOCOM, 2000.
[25] F. Zane, G. Narlikar, and A. Basu, “CoolCAMs: Power-Efficient TCAMs for Forwarding Engines,” Proc. IEEE INFOCOM '03, May 2003.

Index Terms:
Packet classification, rule table partitioning, binary search.
Yeim-Kuan Chang, "Efficient Multidimensional Packet Classification with Fast Updates," IEEE Transactions on Computers, vol. 58, no. 4, pp. 463-479, April 2009, doi:10.1109/TC.2008.181
Usage of this product signifies your acceptance of the Terms of Use.