View : 177 Download: 0

Two-dimensional packet classification algorithm using a quad-tree

Title
Two-dimensional packet classification algorithm using a quad-tree
Authors
Lim H.Kang M.Y.Yim C.
Ewha Authors
임혜숙
SCOPUS Author ID
임혜숙scopus
Issue Date
2007
Journal Title
Computer Communications
ISSN
0140-3664JCR Link
Citation
vol. 30, no. 6, pp. 1396 - 1405
Indexed
SCIE; SCOPUS WOS scopus
Abstract
For the last few years, there is an explosive growth in the development and the deployment of network applications that transmit and receive audio and video over the Internet. In order for such multimedia applications to function properly, networks need to provide the level of performance, which is called the quality of services (QoS). An essential element for the Internet routers to provide the QoS is the packet classification which classifies incoming packets into classified flows. Based on the pre-defined rules composed of multiple header fields, incoming packets are classified into a specific flow, and packets are treated differently according to the classified flow. Efficient packet classification algorithms have been widely studied, but none of known algorithms except the linear search considers the priority of rules in constructing the data structure of classification tables. In this paper, we propose a priority-based quad-tree (PQT) algorithm for packet classification. In constructing a quad-tree generated based on recursive space decomposition, the priority of rules is primarily considered in the proposed algorithm. In the simulation using the class-bench databases, the proposed algorithm achieves very good performance in the required memory size and reasonable performance in the classification speed. The proposed algorithm also provides good scalability toward large classifiers. © 2007 Elsevier B.V. All rights reserved.
DOI
10.1016/j.comcom.2007.01.004
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