NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
공과대학
전자전기공학전공
Journal papers
View : 1000 Download: 0
Utilizing 2-D leaf-pushing for packet classification
Title
Utilizing 2-D leaf-pushing for packet classification
Authors
Lee J.
;
Byun H.
;
Mun J.H.
;
Lim H.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙
Issue Date
2017
Journal Title
Computer Communications
ISSN
0140-3664
Citation
Computer Communications vol. 103, pp. 116 - 129
Keywords
Area-based quad-trie
;
Bloom filter
;
Decision tree
;
Internet
;
Leaf pushing
;
Packet classification
;
Router
;
Trie
Publisher
Elsevier B.V.
Indexed
SCIE; SCOPUS
Document Type
Article
Abstract
Packet classification is one of the most challenging functionalities performed by routers at wire-speed for every incoming packet. For search spaces composed of multiple rules represented geometrically, various space decomposition algorithms have been studied to provide effective search methods. While an area-based quad-trie (AQT) provides a simple and intuitive way of mapping the geometrical search space into a two-dimensional (2-D) trie structure, it does not provide high-speed classification performance because the mapping is incomplete. This paper proposes the application of leaf-pushing into the 2-D trie to improve the classification performance of the AQT. The leaf-pushing AQT provides a more effective method of searching rules covering each input packet in the decomposed space. We also discuss an efficient implementation technique for our algorithm using a Bloom filter and a hash table. Simulation results show that our proposed leaf-pushing AQT improves the packet classification performance up to 37 times for sets with up to 100,000 rules compared with the AQT. To be compared with other space decomposition algorithms, a refined structure of the leaf-pushing AQT is also proposed. Simulation results show that the proposed refined structure provides an effective space decomposition method as well as the balance between memory requirements and classification speed, while most of other space decomposition algorithms show a trade-off between them. © 2017 Elsevier B.V.
DOI
10.1016/j.comcom.2017.02.005
Appears in Collections:
공과대학
>
전자전기공학전공
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject