Efficient multimatch packet classification and lookup with TCAM
Yu, F.
Katz, R.H.
Lakshman, T.V.
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA;
This paper appears in: Micro, IEEE
Publication Date: Jan.-Feb. 2005
Volume: 25,
Issue: 1
On page(s): 50- 59
ISSN: 0272-1732
INSPEC Accession Number: 8350559
Digital Object Identifier: 10.1109/MM.2005.8
Current Version Published: 2005-04-04
Abstract
Today's packet classification systems are designed to provide the highest-priority matching result, such as the longest prefix match, even if a packet matches multiple classification rules. However, new network applications demanding multimatch classification - that is, requiring all matching results instead of only the highest-priority match - are emerging. Ternary content-addressable memory is becoming a common extension to network processors, and its capability and speed make it attractive for high-speed networks. The proposed TCAM-based scheme produces multimatch classification results with about 10 times fewer memory lookups than a pure software approach. In addition, their scheme for removing negation in rule sets saves up to 95 percent of the TCAM space used by a straightforward implementation.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
