Browse > Article

A Multibit Tree Bitmap based Packet Classification  

최병철 (한국전자통신연구원 광가입자망연구그룹)
이정태 (부산대학교 컴퓨터공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.29, no.3B, 2004 , pp. 339-348 More about this Journal
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 If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. 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.
Keywords
packet classification; multi-field; tree bitmap; rule table.;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Packet classification using tuple space search /
[ V.Srinivasan;S.Suri;G.Varghese ] / Proc. of SIGCOMM'99
2 Putting Routing Tables in Silicon /
[ T.B.Pei;C.Zukowski ] / IEEE Network Magazine
3 Fast IP Lookups using Controlled Prefix Expansion /
[ V.Srinivasan;G.Varghese ] / Proc. of SIGMATICS'98
4 /
[] / Internet Routing Statistics
5 High speed policy-based packet forwarding using efficient multi-dimensional range matching /
[ T.V.Laksman;D.Stidialis ] / Proc. of SIGCOMM'98
6 Packet classification on multiple fields /
[ P.Gupt;N.McKeown ] / Proc. of SIGCOMM'99
7 Classless inter-domain routing(CIDR): an address assignment and aggregation strategy /
[ S.Fuller;T.Li;J.Yu;K.Varadhan;S.Keshav;Rosen Sharma ] / RFC 1519
8 Scalable IP lookup for programmable routers /
[ D.E.Taylor;J.W.Lockwood;T.S.Sproull;J.S.Turner;D.B.Parlour ] / Proc. of IEEE INFOCOM'02
9 Scalable High Speed IP Routing Lookups /
[ M.Walvoge;G.Varhghese;J.Turner;B.Plattner ] / Proc. of SIGCOMM'97
10 Fast and scalable layer four switching /
[ V.Srinivasan;G.Varghese;S.Suri;M.Waldvogel ] / Proc. of SIGCOMM'98
11 IP switching and gigabit routers /
[ P.Newman;G.Minshall;L.Huston ] / IEEE COmmunication Magazine
12 Fast Fouting Table lookup using CAMs /
[ A.McAuley;P.Francis ] / Proc. of IEEE INFOCOM'93