View : 19 Download: 0

A new hierarchical packet classification algorithm

Title
A new hierarchical packet classification algorithm
Authors
Lim H.Lee S.Swartzlander Jr. E.E.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2012
Journal Title
Computer Networks
ISSN
1389-1286JCR Link
Citation
vol. 56, no. 13, pp. 3010 - 3022
Indexed
SCIE; SCOPUS WOS scopus
Abstract
Packet classification is one of the most challenging functions in Internet routers since it involves a multi-dimensional search that should be performed at wire-speed. Hierarchical packet classification is an effective solution which reduces the search space significantly whenever a field search is completed. However, the hierarchical approach using binary tries has two intrinsic problems: back-tracking and empty internal nodes. To avoid back-tracking, the hierarchical set-pruning trie applies rule copy, and the grid-of-tries uses pre-computed switch pointers. However, none of the known hierarchical algorithms simultaneously avoids empty internal nodes and back-tracking. This paper describes various packet classification algorithms and proposes a new efficient packet classification algorithm using the hierarchical approach. In the proposed algorithm, a hierarchical binary search tree, which does not involve empty internal nodes, is constructed for the pruned set of rules. Hence, both back-tracking and empty internal nodes are avoided in the proposed algorithm. Two refinement techniques are also proposed; one for reducing the rule copy caused by the set-pruning and the other for avoiding rule copy. Simulation results show that the proposed algorithm provides an improvement in search performance without increasing the memory requirement compared with other existing hierarchical algorithms. © 2012 Elsevier B.V. All rights reserved.
DOI
10.1016/j.comnet.2012.04.014
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