The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2008 vol.57)
pp: 591-605
We propose heuristics for the construction of variable-stride one-dimensional as well as fixed- and variable-stride two-dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The variable-stride one-dimensional tries constructed by our heuristic require significantly less per-stage memory than required by optimal pipelined fixed-stride tries. Also, the pipelined two-dimensional multibit tries constructed by our proposed heuristics are superior, for pipelined architectures, to two-dimensional multibit tries constructed by the best algorithms proposed for non-pipelined architectures.
Packet classification, longest matching prefix, controlled prefix expansion, fixed-stride tries, variable-stride tries, two-dimensional tries, dynamic programming.
Wencheng Lu, Sartaj Sahni, "Packet Classification Using Space-Efficient Pipelined Multibit Tries", IEEE Transactions on Computers, vol.57, no. 5, pp. 591-605, May 2008, doi:10.1109/TC.2007.70846
[1] F. Baboescu and G. Varghese, “Scalable Packet Classification,” Proc. ACM SIGCOMM, 2001.
[2] F. Baboescu, S. Singh, and G. Varghese, “Packet Classification for Core Routers: Is There an Alternative to CAMs,” Proc. IEEE INFOCOM, 2003.
[3] A. Basu and G. Narlikar, “Fast Incremental Updates for Pipeline Forwarding Engines,” Proc. IEEE INFOCOM, 2003.
[4] D. Eppstein and S. Muthukrishnan, “Internet Packet Filter Management and Rectangle Geometry,” Proc. 12th ACM-SIAM Symp. Discrete Algorithms, pp. 827-835, 2001.
[5] P. Gupta and N. McKeown, “Packet Classification Using Hierarchical Intelligent Cuts,” Proc. ACM SIGCOMM, 1999.
[6] H. Lu and S. Sahni, “O(log W) Multidimensional Packet Classification,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp.462-472, 2007.
[7] 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, 2005.
[8] A. Hari, S. Suri, and G. Parulkar, “Detecting and Resolving Packet Filter Conflicts,” Proc. IEEE INFOCOM, 2000.
[9] E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. W.H. Freeman, 1997.
[10] E. Horowitz, S. Sahni, and S. Rajasekeran, Computer Algorithms/C++. W.H. Freeman, 1997.
[11], 2007.
[12] C. Kaufman, R. Perlman, and M. Speciner, Network Security: Private Communication in a Public World, chapter 17, second ed. Prentice Hall, 2002.
[13] K. Kim and S. Sahni, “Efficient Construction of Pipelined Multibit-Trie Router-Tables,” IEEE Trans. Computers, vol. 56, no. 1, pp. 32-43, Jan. 2007.
[14] B. Lampson, V. Srinivasan, and G. Varghese, “IP Lookup Using Multi-Way and Multi-Column Search,” Proc. IEEE INFOCOM, 1998.
[15] W. Lu and S. Sahni, “Packet Classification Using Two-Dimensional Multibit Tries,” Proc. 10th IEEE Symp. Computers and Comm., 2005.
[16] W. Lu and S. Sahni, “Packet Classification Using Pipelined Two-Dimensional Multibit Tries,” , 2008.
[17] http:/, 2008.
[18] Ris, “Routing Information Service Raw Data,” http:/data.ris.ripe. net, 2008.
[19] M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network, pp.8-23, 2001.
[20] S. Sahni and K. Kim, “Efficient Construction of Multibit Tries for IP Lookup,” IEEE/ACM Trans. Networking, vol. 11, no. 4, 2003.
[21] 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.
[22] V. Srinivasan and G. Varghese, “Faster IP Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, pp.1-40, Feb. 1999.
[23] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Scalable Algorithms for Layer Four Switching,” Proc. ACM SIGCOMM '98, vol. 8, 1998.
[24] D.E. Taylor and J.S. Turner, “ClassBench: A Packet Classification Benchmark,” Proc. IEEE INFOCOM, 2005.
3 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool