CubeCuts: A Novel Cutting Scheme for Packet Classification

Packet Classification is one of the most important services provided by Internet routers nowadays. Decision-tree based schemes, such as HiCuts and HyperCuts, are the most well-known algorithms. These schemes separate search space into many equal-sized sub-spaces. But both schemes have the same rule replication problem, which might cause large memory overhead. Although another decision-tree based solution, Hyper splits, was proposed to cut space according to end-points for reducing the memory requirement, we still observe that its rule replication problem doesn´t be solved well and the memory requirement can still be improved. In this paper, we propose a scheme called Cube Cuts to build a binary decision tree that does not generate any duplicated rule. By using the hybrid scheme that combines the Cube Cuts and constrained HiCuts, we can have a memory-efficient data structure such that the entire rule table of up to10K rules can be fit into the on-chip memory of FPGA device. Our design is very suitable to be implemented with parallelism and pipeline. The experimental results show that the rule replication ratio is very low in all rule tables (ACL, FW, and IPC). The proposed parallel and pipelined architecture based on the hybrid scheme can achieve a throughput of 118 Gbps, which is enough to deal with the Internet traffic that is growing rapidly in recent years.