View : 53 Download: 0

Hierarchical binary search tree for packet classification

Title
Hierarchical binary search tree for packet classification
Authors
Lim H.Chu H.N.Yim C.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2007
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 11, no. 8, pp. 689 - 691
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
In order to provide value-added services such as policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments. Since packet classification should be performed in wire-speed for every packet incoming in several hundred gigabits per second, it becomes a major challenge in the Internet routers. In this letter, we propose a new packet classification scheme based on hierarchical binary search tree. The proposed scheme hierarchically connects binary search trees without empty internal nodes, and hence the proposed architecture significantly improves the search performance as well as greatly reduces the memory requirement compared with trie-based schemes. © 2007 IEEE.
DOI
10.1109/LCOMM.2007.070477
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