To provide new services such as packet filtering and quality of services in the next generation network, routers need to classify incoming packets. We propose a novel and scalable packet classification method that utilizes the Universal B-tree (UB-tree) data structure. UB-tree is an index structure for multi-dimensional data which is balanced and has guaranteed performance characteristics of B-tree. A filter set consists of a number of rules for classifying packets based on header fields. Thus, packet classification is also a multi-dimensional indexing problem, then, we can use UB-tree. Based on simulation results, we believe our method has a better performance in terms of speed of classification and memory requirement compared to the previous proposed methods.
6th Mosharaka International Conference on Communications, Propagation, and Electronics (MIC-CPE 2013)
Congress
2013 Global Congress on Communications, Propagation, and Electronics (GC-CPE 2013), 1-3 February 2013, Kenitra, Morocco
Pages
1-6
Topics
Network Security and Privacy Network Access Control
ISSN
2227-331X
DOI
BibTeX
@inproceedings{505CPE2013,
title={Universal B-tree Based Packet Classification(UB-PC)
},
author={Besat Jafarian, and Nasser Yazdani},
booktitle={2013 Global Congress on Communications, Propagation, and Electronics (GC-CPE 2013)},
year={2013},
pages={1-6},
doi={}},
organization={Mosharaka for Research and Studies}
}
