Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient Mapping of Range Classifier into Ternary-CAM
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Algorithms for advanced packet classification with ternary CAMs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Survey and taxonomy of packet classification techniques
ACM Computing Surveys (CSUR)
Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)
Efficient multi-match packet classification with TCAM
HOTI '04 Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium
ClassBench: a packet classification benchmark
IEEE/ACM Transactions on Networking (TON)
Fast and scalable packet classification
IEEE Journal on Selected Areas in Communications
Layered interval codes for TCAM-based classification
Computer Networks: The International Journal of Computer and Telecommunications Networking
A prefix-based approach for managing hybrid specifications in complex packet filtering
Computer Networks: The International Journal of Computer and Telecommunications Networking
Managing hybrid packet filter's specifications
International Journal of Security and Networks
Space and speed tradeoffs in TCAM hierarchical packet classification
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In recent years, hardware based packet classification has became an essential component in many networking devices. Ternary Content-Addressable Memories (TCAMs) are one of the most popular solutions in this domain, allowing to compare in parallel the packet header against a large set of rules, and to retrieve the first match. However, using TCAM to match a range of values is much more problematic and dramatically reduces the cost effectiveness of the solution. In this paper we study ways to use simple built-in TCAM mechanisms in order to increase the efficiency of range coverage. While current techniques have a worst expansion ratio of 2ċW-4, we present an efficient algorithm enabling to encode any range with at most W TCAM entries (where W in the number of bits), without using additional processing, extra bits, and without any external encoding. The same paradigm can be applied to multiple raging rules as well, resulting in significant improvement over current known techniques. Moreover, our simulation results indicate that these techniques can be used to reduce the actual TCAM size of hardware networking devices under realistic scenarios.