Scalable high speed IP 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
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 using tuple space search
Proceedings of the 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
Scalable packet classification
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the structure and application of BGP policy atoms
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
Packet classification using multidimensional cutting
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Performance improvement of two-dimensional packet classification by filter rephrasing
IEEE/ACM Transactions on Networking (TON)
High-speed packet classification for differentiated services in next-generation networks
IEEE Transactions on Multimedia
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Ternary content-addressable memory (TCAM) has been widely used to perform fast packet classification due to its ability of solving the problem in O(1) time without considering the number of entries, mask continuity and their lengths. However, it also comes with several shortcomings, such as the limited number of entries, expensive cost and power consumption. We propose an efficient algorithm to reduce the required TCAM bits by encoding the IP address portion of the policies. With the proposed scheme, the achieved compression ratio can be as small as 9% for IPv6 policies. Moreover, the TCAM throughput is improved by a factor of 175% with pipelining design. Obviously, the proposed scheme is attractive for the forthcoming IPv6.