A Multibit Tree Bitmap based Packet Classification 


Vol. 29,  No. 3, pp. 339-348, Mar.  2004


PDF
  Abstract

Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in IP header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trie. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and 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]

B. Choi and J. Lee, "A Multibit Tree Bitmap based Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 339-348, 2004. DOI: .

[ACM Style]

Byeong-cheol Choi and Jeong-tae Lee. 2004. A Multibit Tree Bitmap based Packet Classification. The Journal of Korean Institute of Communications and Information Sciences, 29, 3, (2004), 339-348. DOI: .

[KICS Style]

Byeong-cheol Choi and Jeong-tae Lee, "A Multibit Tree Bitmap based Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 339-348, 3. 2004.