Fast Updating Algorithms for TCAMs
IEEE Micro
Sorting and Searching using Ternary CAMs
IEEE Micro
Packet Classification Using Extended TCAMs
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
CoPTUA: Consistent Policy Table Update Algorithm for TCAM without Locking
IEEE Transactions on Computers
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
IEEE Transactions on Computers
Scalable packet classification
IEEE/ACM Transactions on Networking (TON)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Power-Efficient TCAM partitioning for IP lookups with incremental updates
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile 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
| Hi-index | 14.98 |
As the demand for high-quality Internet increases, emerging network applications are spurring the need for faster, feature-rich, and cost-effective routers. Multifield packet classification in routers has been a computation-intensive data path function for software implementation. Therefore, solutions for packet classification based on hardware design, such as Ternary Content Addressable Memory (TCAM), are necessary to sustain gigabit line processing rate. Traditionally, TCAMs have been designed for storing prefixes. However, multifield packet classification usually involves two fields of arbitrary ranges that are TCP/IP layer 4 source and destination ports. Storing ranges in TCAMs relies on decomposing each individual range into multiple prefixes, which leads to range-to-prefix blowout. To reduce the total number of prefixes needed to represent all ranges, this paper proposes a 2-level TCAM architecture and two range-to-prefix conversion schemes. In the first proposed scheme, designed for disjoint ranges, the maximum number of entries needed in TCAM is 2m-1 for m disjoint ranges. In the second proposed scheme, designed for contiguous ranges, only m TCAM entries are needed. In a general case of n arbitrary ranges, all ranges can first be converted into disjoint ranges or contiguous ranges and then the proposed algorithms can be applied. As a result, only 4n-3 TCAM entries are needed for the disjoint ranges and only 2n+1 TCAM entries are needed for contiguous ranges. This paper also proposes insertion and deletion algorithms to accommodate incremental changes to the range sets. The experiments made show that the proposed range-to-prefix conversion schemes perform better than the existing schemes in terms of the number of required TCAM entries and execution time for range update operations.