A Survey Paper of Novel Approach towards Multidimensional Packet Classification

Packet classification plays an important role in both edge and core routers to provide advanced network services. Despite the vast body of existing work, packet classification remains an open and challenging problem. Existing algorithms such as HiCuts, HyperCuts, and boundary cutting show good search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. New efficient splitting criteria which are memory and power efficient as compared to other mentioned techniques. Its approach produce a set of different-sized cuts at each decision step, with the goal to balance the distribution of filters and to reduce the filter duplication effect.