Packet classification using adaptive rules cutting (ARC)

This paper introduces an advanced packet classification algorithm called adaptive rules cutting (ARC). In the same way as the HiCuts and HyperCuts Algorithm, ARC is based on cutting the multi-dimensional space into smaller segments for rule reduction. Unlike HiCuts where dividing the region takes more than 1 level, and unlike HyperCuts in which each node represents a k-dimensional hypercube, ARC allows the flexibility of considering all dimensions. This extra degree of freedom and a new set of heuristics allow adaptation for optimum rule cutting for a given amount of storage. Rule cutting simulations and performance studies show that ARC can provide a reduction of up to 98% of the given rules in the first instance.