Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut)
Hediyeh Amir Jahanshahi Sistani, Sayyed Mehdi, Poustchi Amin, Haridas Acharya · 2013
The Packet classification is a key function of the firewalls and routers. Internet firewalls, routers and service providers perform different operations at different flows. With the increasing demands on router performance, there is a need for algorithms that can classify packets quickly with minimal storage requirements. This paper presents a heuristic, called Packet Classification Algorithm Based on Geometric Tree by using Recursive Dimensional Cutting (DimCut), which exploits the structure found in classifiers. It, like the previously well-known algorithm, HiCutsis based on a decision tree structure. After examinationDimCut algorithm, to classify packets based on five header fields, it is found that the algorithm can classify packets quickly. Our proposal extends HiCuts with new heuristics ideas and new implementing techniques while retaining HiCuts’ basic framework. The DimCut algorithm has two separated levels, pre-processinglevel (tree construction and making index table) and search level. The algorithm provides a full description of the chief data structures and tuneable parameters. We explain details that describe the pre-processing algorithm and the search process, also provide the source code that permits the actual implementation.