View : 14 Download: 0

High-speed packet classification using binary search on length

Title
High-speed packet classification using binary search on length
Authors
Lim H.Mun J.H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2007
Journal Title
ANCS'07 - Proceedings of the 2007 ACM Symposium on Architecture for Networking and Communications
Indexed
SCOPUS scopus
Abstract
Packet classification is one of the major challenges for next generation routers since it involves complicated multi-dimensional search as well as it should be performed in wire-speed for all incoming packets. Area-based quad-trie is an excellent algorithm in the sense that it constructs a two-dimensional trie using source and destination prefix fields for packet classification. However, it does not achieve good search performance since search is linearly performed for prefix length. In this paper, we propose a new packet classification algorithm which applies binary search on prefix length to the area-based quad-trie. In order to avoid the pre-computation required in the binary search on length, the proposed algorithm constructs multiple disjoint tries depending on relative levels in rule hierarchy. We also propose two new optimization techniques considering rule priorities. For different types of rule sets having about 5000 rules, performance evaluation result shows that the average number of memory accesses is 18 to 67 and the memory consumption is 22 to 41 bytes per rule. Copyright 2007 ACM.
DOI
10.1145/1323548.1323572
ISBN
9781595939456
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE