The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2009 vol.58)
pp: 1695-1709
Wencheng Lu , University of Florida, Gainesville
Sartaj Sahni , University of Florida, Gainesville
ABSTRACT
We develop fast algorithms to construct space-optimal constrained 2D multibit tries for Internet packet classifier applications. Experimental evidence suggests that space-optimal 2D multibit tries and their extensions using a bucket scheme are superior to existing 2D and multidimensional packet classification schemes in terms of both memory requirement and number of memory accesses requirement. We propose a heuristic for 2D multibit tries with switch pointers, which may be used for 2D packet classification.
INDEX TERMS
Packet classification, 2D tries, multibit tries, switch pointers, prefix expansion, fixed-stride tries, variable-stride tries, dynamic programming.
CITATION
Wencheng Lu, Sartaj Sahni, "Efficient 2D Multibit Tries for Packet Classification", IEEE Transactions on Computers, vol.58, no. 12, pp. 1695-1709, December 2009, doi:10.1109/TC.2009.127
REFERENCES
[1] F. Baboescu and G. Varghese, “Scalable Packet Classification,” Proc. ACM SIGCOMM, 2001.
[2] F. Baboescu and G. Varghese, “Fast and Scalable Conflict Detection for Packet Classifiers,” Proc. 10th IEEE Int'l Conf. Network Protocols (ICNP '02), 2002.
[3] F. Baboescu, S. Singh, and G. Varghese, “Packet Classification for Core Routers: Is There an Alternative to CAMs?” Proc. IEEE INFOCOM, 2003.
[4] M. Buddhikot, S. Suri, and M. Waldvogel, “Space Decomposition Techniques for Fast Layer-4 Switching,” Proc. Conf. High Speed Networks, 1998.
[5] W. Eatherton, G. Varghese, and Z. Dittia, “Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates,” Computer Comm. Rev., vol. 34, no. 2, pp. 97-122, 2004.
[6] D. Eppstein and S. Muthukrishnan, “Internet Packet Filter Management and Rectangle Geometry,” Proc. 12th ACM-SIAM Symp. Discrete Algorithms, pp. 827-835, 2001.
[7] A. Feldman and S. Muthukrishnan, “Tradeoffs for Packet Classification,” Proc. IEEE INFOCOM, 2000.
[8] P. Gupta and N. McKeown, “Packet Classification Using Hierarchical Intelligent Cuts,” Proc. ACM SIGCOMM, 1999.
[9] A. Hari, S. Suri, and G. Parulkar, “Detecting and Resolving Packet Filter Conflicts,” Proc. IEEE INFOCOM, 2000.
[10] T. Lakshman and D. Stidialis, “High Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” Proc. ACM SIGCOMM, 1998.
[11] B. Lampson, V. Srinivasan, and G. Varghese, “IP Lookups Using Multiway and Multicolumn Search,” Proc. IEEE INFOCOM, 1998.
[12] L. Qiu, G. Varghese, and S. Suri, “Fast Firewall Implementation for Software and Hardware Based Routers,” Proc. Ninth Int'l Conf. Network Protocolos (ICNP), 2001.
[13] M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001.
[14] S. Sahni, K. Kim, and H. Lu, “Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching,” Int'l J. Foundations of Computer Science, vol. 14, no. 3, pp. 337-358, 2003.
[15] S. Singh, F. Baboescu, G. Varghese, and J. Wang, “Packet Classification Using Multidimensional Cutting,” Proc. ACM SIGCOMM, Aug. 2003.
[16] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Fast and Scalable Layer Four Switching,” Proc. ACM SIGCOMM, 1998.
[17] V. Srinivasan, S. Suri, and G. Varghese, “Packet Classification Using Tuple Space Search,” Proc. ACM SIGCOMM, 1999.
[18] V. Srinivasan, “A Packet Classification and Filter Management System,” Proc. IEEE INFOCOM, 2001.
[19] V. Srinivasan and G. Varghese, “Faster IP Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, vol. 17, no. 1, pp.1-40, Feb. 1999.
[20] C. Kaufman, R. Perlman, and M. Speciner, Network Security: Private Communication in a Public World, second ed., chapter 17. Prentice Hall, 2002.
[21] H. Lu and S. Sahni, “O(log W) Multidimensional Packet Classification,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp.462-472, Apr. 2007.
[22] H. Lu and S. Sahni, “Conflict Detection and Resolution in Two-Dimensional Prefix Router Tables,” IEEE/ACM Trans. Networking, vol. 13, no. 6, pp. 1353-1363 Dec. 2005.
[23] S. Sahni and K. Kim, “Efficient Construction of Multibit Tries for IP Lookup,” IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 650- 662, Aug. 2003.
[24] D. Taylor and J. Turner, “ClassBench: A Packet Classification Benchmark,” Proc. IEEE INFOCOM, 2005.
[25] http://www.arl.wustl.edu~det3/, 2009.
[26] http://www.cise.ufl.edu/~wlu2dtries.pdf, 2009.
[27] V. Srinivasan, “Private Communication,” July 2006.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool