Efficient multimatch packet classification and lookup with TCAM |
| |
Authors: | Yu F Katz RH Lakshman TV |
| |
Affiliation: | Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA; |
| |
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. |
| |
Keywords: | |
|
|