A Critical Study on a New Efficient Packet Classification Deterministic Algorithm Using Boundary Cutting for Improved Search Performance and Efficient Memory Management

Yeedi Venkata Tapaswini, B. Madhav Rao, G. Manoj Someswar


Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. However, decision tree algorithms involve complicated heuristics for determining the field and number of cuts. Moreover, fixed interval-based cutting not relating to the actual space that each rule covers is ineffective and results in a huge storage requirement. A new efficient packet classification algorithm using boundary cutting is proposed in this paper. The proposed algorithm finds out the space that each rule covers and performs the cutting according to the space boundary. Hence, the cutting in the proposed algorithm is deterministic rather than involving the complicated heuristics, and it is more effective in providing improved search performance and more efficient in memory requirement. For rule sets with 1000–100 000 rules, simulation results show that the proposed boundary cutting algorithm provides a packet classification through 10–23 on-chip memory accesses and 1–4 off-chip memory accesses in average.
KEYWORDS: Mean time between failures (MTBF); Set Splitting Algorithm (SSA); Ternary Content Addressable Memories (TCAMs); Multi match Using Discriminators (MUD); Network Intrusion Detection System (NIDS).

Full Text:


Copyright (c) 2016 Yeedi Venkata Tapaswini, B. Madhav Rao, G. Manoj Someswar

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 

Paper submission: ijr@pen2print.org