Hierarchical Binary Search Tree (HBST) for Packet Classification
Vol. 32, No. 3, pp. 143-152, Mar. 2007
Abstract
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.
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.