Browse > Article

Hierarchical Binary Search Tree (HBST) for Packet Classification  

Chu, Ha-Neul (이화여자대학교 정보통신학과 SoC설계연구실)
Lim, Hye-Sook (이화여자대학교 정보통신학과 SoC설계연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.32, no.3B, 2007 , pp. 143-152 More about this Journal
Abstract
In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.
Keywords
Packet Classification; QoS; Hierarchical Trie; Binary Search Tree; HBST;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Jonathan Chao, 'Next Generation Routers,' Proceedings of the IEEE JPROC.2002.802001, Volume 90, Issue 9, pp.1518 – 1558, Sept. 2002
2 D. E. Taylor, J. S. Turner, J.S, 'ClassBench: a packet classification benchmark,' Proc. IEEE INFOCOM 2005, pp.2068 - 2079, March 2005
3 D. E. Taylor, J. S. Turner. The source code of Packet Classification Bench, http://www.arl.wustl.edu/-det3/ClassBench/index.htm
4 G. Varghese, 'Network Algorithmics,' Morgan Kaufmann, 2005
5 T. V Lakshman and D. Stiliadis, 'High-speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching,' Proc. of ACM SIGCOMM, pp. 203-214, October 1998   DOI
6 F. Baboescu and G. Varghese, 'Scalable Packet Classification,' Proc. of ACM SIGCOMM, pp. 199-210, August 2001   DOI
7 Tong Liu, Huawei Li, Xiaowei Li, Yinhe Han, 'Fast Packet Classification using Group Bit Vector,' in Proc. IEEE Globecom 2006
8 M. M. Buddhikot, S. Suri, and M. Waldvogel, 'Space decomposition techniques for fast layer-4 switching,' in Proc. Conf. Protocols for High Speed Networks, Aug. 1999, pp. 25-41
9 N. Yazdani and P. S. Min, 'Fast and Scalable Schemes for the IP Address Lookup Problem,' Proc. IEEE HPSR2000, pp.83-92, 2000
10 V. Srinivasan, G. Varghese, S. Suri, and M. Waldvagel, 'Fast and scalable layer four switching,' in Proc. ACM SIGCOMM'98, pp. 191-202, Aug. 1998