Packet classification through hierarchical rulebase partitioning

A new scalable packet classification algorithm is presented, which substantially improves the performance of a classifier by hierarchically partitioning the rulebase into smaller independent sub-rulebases. The experimentation results show that the algorithm can significantly outperform existing classifiers by reducing the size of a rulebase by more than four orders of magnitude with just two-levels of partitioning.