Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Space Decomposition Techniques for Fast Layer-4 Switching
PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
Hi-index | 0.00 |
Packet classification algorithms have been studied by many authors. Most of these algorithms are developed based on tree structure, rather than linear data structure which is appropriate for network processors (NPs). With the development of networks, more and more NPs are used to execute various tasks in the network. In this paper, a multidimensional packet classification algorithm called classification based on network processors (CBNPs) is put forward. This algorithm uses parallel tuple search and multi-threaded concurrency of NPs to enhance the classification speed, and also gets much less space and time complexity than other parallel algorithms. The simulation shows that CBNPs is high-speed, multidimensional and scalable, and its comprehensive performance is much better than that of the existing packet classification algorithms.