Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using multidimensional cutting
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient table lookup algorithms for the next generation ip networks
Efficient table lookup algorithms for the next generation ip networks
Hi-index | 0.00 |
In order to provide more value added services, the Internet needs to classify packets into flows for different treatment. High performance packet classification algorithms for large classifiers and edge classifiers are highly demanded. In this paper, we will describe a new algorithm for packet classification that makes use of bits distribution features. It is a high level classification method. It always takes the bits from every dimension into account, instead of constraining the search process in some of the dimensions at every stage. The experiments provide the evidence that it has outstanding performance even for large edge classifiers. It is also scalable to IPv6.