Algorithms for advanced packet classification with ternary CAMs

Lakshminarayanan, Karthik; Rangarajan, Anand; Srinivasan, V.

doi:10.1145/1080091.1080115

Cited by 181 publications

(137 citation statements)

References 11 publications

Supporting

Mentioning

137

Contrasting

Order By: Relevance

“…a) Hardware-based solutions: The basic idea of hardware-based solutions is to modify TCAM circuits and architecture [2], [4]- [7]. For example, van Lunteren et al proposed a method of adding comparators at each entry to better accommodate range matching in packet classifiers [6].…”

Section: Related Workmentioning

confidence: 99%

“…• Forward redundancy: A rule r in a packet classifier is forward redundant if and only if there exists another rule r listed below r such that the following three conditions hold: (i) all packets that match r also match r , (ii) r and r have the same decision, and (iii) for each rule r listed between r and r , either r and r have the same decision, or no packet matches both r and r . has overlapping redundancy because of [2,4].…”

Section: Redundancy In Packet Classifiersmentioning

confidence: 99%

“…Thus, it takes O(1) time to find the decision for any given packet. Because of their high speed, TCAMs have become the industrial standard for high speed packet classification [2].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Tree-Based Minimization of TCAM Entries for Packet Classification

Sun

Kim

2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-Packet classification is a fundamental task for network devices such as edge routers, firewalls, and intrusion detection systems. Currently, most vendors use Ternary Content Addressable Memories (TCAMs) to achieve high-performance packet classification. TCAMs use parallel hardware to check all rules simultaneously. Despite their high speed, TCAMs have a fundamental in dealing with ranges efficiently. Many packet classification rules contain range specifications, each of which needs to be translated into multiple prefixes to store in TCAMs. Such translation may result in an explosive increase in the number of required TCAM entries. In this paper, we propose a redundancy removal algorithm using a tree representation of rules. The proposed algorithm removes redundant rules and combines overlaying rules to build an equivalent, smaller rule set for a given packet classifier. This equivalent transformation can significantly reduce the number of required TCAM entries. Our experiments show a reduction of 70.9% in the number of TCAM entries. Besides, our algorithm eliminates requirement of priority encoder circuits. It can also be used as a preprocessor, in tandem with other methods, to achieve further performance imrpovement.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Redundancy In Packet Classifiersmentioning

confidence: 99%

See 1 more Smart Citation

Tree-Based Minimization of TCAM Entries for Packet Classification

Sun

Kim

2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…This is done through an if − else construct (lines [8][9][10][11][12][13][14][15]. The first case is when neither k l nor k s are defined (i.e., no matching), thus we can insert k n into any row (lines 8-9).…”

Section: : Return (False)mentioning

confidence: 99%

“…Moreover, most commodity TCAMs run at low speed compared to SRAM memory [3]. Hence many researchers proposed optimizations to the TCAM architecture [9,10,11,12].…”

Section: Introductionmentioning

confidence: 99%

CHAP: Enabling Efficient Hardware-Based Multiple Hash Schemes for IP Lookup

et al. 2009

View full text Add to dashboard Cite

Abstract. Building a high performance IP lookup engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP tables. An emerging approach for IP lookup is the use of set associative memory architecture, which is basically a hardware implementation of an open addressing hash table with the property that each row of the hash table can be searched in one memory cycle. While open addressing hash tables, in general, provide good average-case search performance, their memory utilization and worst-case performance can degrade quickly due to bucket overflows. This paper presents a new simple hash probing scheme called CHAP (Content-based HAsh Probing) that tackles the hash overflow problem. In CHAP, the probing is based on the content of the hash table, thus avoiding the classical side effects of probing. We show through experimenting with real IP tables how CHAP can effectively deal with the overflow.

show abstract

Scalable packet classification using a compound algorithm

Wang¹

2009

Int J Communication

View full text Add to dashboard Cite

In next-generation networks, packet classification is used to categorize incoming packets into multiple forwarding classes based on pre-defined filters and make information accessible for quality of service or security handling in the network. To pursue better search performance, numerous algorithms of packet classification have been proposed and optimized for certain filter databases; however, these algorithms may not scale in either storage or speed performance or both for the filter databases with different characteristics. This paper presents an efficient algorithm by combining two complementary algorithms, Cross-producting and Pruned Tuple Space Search, to make packet classification both fast and scalable. Unlike the existing algorithms whose performance is contingent on the filter database attributes, our algorithm shows better scalability and feasibility. We evaluate the performance of our scheme with filter databases of varying sizes and characteristics. The experimental results demonstrate that the new algorithm improves the speed and storage performance simultaneously. We also introduce the procedure of incremental updates. Copyright (C) 2009 John Wiley & Sons, Ltd

show abstract

Algorithms for advanced packet classification with ternary CAMs

Cited by 181 publications

References 11 publications

Tree-Based Minimization of TCAM Entries for Packet Classification

Tree-Based Minimization of TCAM Entries for Packet Classification

CHAP: Enabling Efficient Hardware-Based Multiple Hash Schemes for IP Lookup

Scalable packet classification using a compound algorithm

Contact Info

Product

Resources

About