Hierarchical Binary Search Tree (HBST) for Packet Classification 


Vol. 32,  No. 3, pp. 143-152, Mar.  2007


PDF
  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 tree. 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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. N. Chu and H. Lim, "Hierarchical Binary Search Tree (HBST) for Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 143-152, 2007. DOI: .

[ACM Style]

Ha Neul Chu and Hyesook Lim. 2007. Hierarchical Binary Search Tree (HBST) for Packet Classification. The Journal of Korean Institute of Communications and Information Sciences, 32, 3, (2007), 143-152. DOI: .

[KICS Style]

Ha Neul Chu and Hyesook Lim, "Hierarchical Binary Search Tree (HBST) for Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 143-152, 3. 2007.