Browse > Article

A Hierarchical Packet Classification Algorithm Using Set-Pruning Binary Search Tree  

Lee, Soo-Hyun (이화여자대학교 전자정보통신학과)
Lim, Hye-Sook (이화여자대학교 전자정보통신학과)
Publication Information
Journal of KIISE:Information Networking / v.35, no.6, 2008 , pp. 482-496 More about this Journal
Abstract
Packet classification in the Internet routers requires multi-dimensional search for multiple header fields for every incoming packet in wire-speed, hence packet classification is one of the most important challenges in router design. Hierarchical packet classification is one of the most effective solutions since search space is remarkably reduced every time a field search is completed. However, hierarchical structures have two intrinsic issues; back-tracking and empty internal nodes. In this paper, we propose a new hierarchical packet classification algorithm which solves both problems. The back-tracking is avoided by using the set-pruning and the empty internal nodes are avoided by applying the binary search tree. Simulation result shows that the proposed algorithm provides significant improvement in search speed without increasing the amount of memory requirement. We also propose an optimization technique applying controlled rule copy in set-pruning.
Keywords
Packet classification; Back-tracking; Set-pruning; Binary search tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. de Berg, M. Van Kreveld, M. Overmars, and O. Schwarzkopf, "Computational Geometry: Algorithms and Applications," Springer-Verlag, 2000
2 F.Baboescu, S.Singh, G.Varghese, "Packet classification for core router : is there an alternative to CAMs?" IEEE INFOCOM 2003, Vol.1, pp. 53-63, Mar. 2003
3 N.Yazdani and P. S. Min, "Fast and Scalable Schemes for the IP Address Lookup Problem," Proc, IEEE HPSR2000, pp. 83-92, 2001
4 P. Gupta and N. Mckeown, "Classification using hierarchical intelligent cuttings," IEEE Micro, Vol.20, No.1, pp. 34-41, Jan./Feb., 2000   DOI   ScienceOn
5 D. E.Taylor, J. S. Turner. The Source Code of Packet ClassifiationBench, http://www.arl.wustl.edu/ ~det3/ClassBench.index.htm
6 S. Singh, F. Baboescu, G. Varghese, and J. Wang, "Packet classification using multidimensional cutting," in Proc. SiGCOMM, 2003
7 G.Vaghese, "Network Algorithmics," Morgan Kaufmann, 2005
8 D. E.Taylor, J. S. Turner, J.S, "ClassBench: a packet classification benchmark," Proc. IEEE INFOCOM 2005, pp. 2068-2079, March 2005
9 H.Jonathan Chao, "Next Generation Routers," Predeedings of the IEEE JPROC.2002.802001, Volume 90, Issue 9, pp. 1518-1588, Sept. 2002
10 M.M. Buddhikot, S.Suri, and M.Waldvogel, "Space Decomposition Techniques for Fast Layer-4 Switching," in Proc.Conf.Protocols for High Speed Networks, pp. 25-41, Aug. 1999
11 Hyesook Lim, Min Young Kang, and Changhoon Yim, "Two-dimensional packet classification algorithm using a quad-tree," Computer Communications, Elsevier Science, Vol.30, No.6, pp. 1396-1405, Mar. 2007   DOI   ScienceOn
12 T. V. Lakshnam and D. Stiliadas, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching," in Proc. ACM SIGCOMM, pp. 203-214, 1998   DOI