Towards high-performance flow-level packet processing on multi-core network processors
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Balanced HiCuts: an optimized packet classification algorithm
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Three different designs for packet classification
WSEAS Transactions on Computers
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Hint-based cache design for reducing miss penalty in HBS packet classification algorithm
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Packet classification on multiple header fields is one of the basic techniques used in network devices such as routers and firewalls, and usually the most computation intensive task among others. To determine what action needs to be taken to a packet, a network device responsible for packet classification must identify the packetýs property, such as associated packet flow, based on multiple fields of its header. Fast packet classification on multiple fields is known to be difficult mathematically and expensive practically. In this paper, we describe and discuss a fast packet classification algorithm using a multiple stage reduction scheme similar to the previously well-know Recursive Flow Classification (RFC) algorithm. The proposed Hierarchical Space Mapping (HSM) algorithm requires much less memory usage than RFC while keeps average search time on the same order. HSM has been proved to be very effective with commercial products in real networks.