The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2005 vol. 25)
ISSN: 0272-1732
pp: 50-59
Fang Yu , University of California, Berkeley
Randy H. Katz , University of California, Berkeley
T.V. Lakshman , Bell Laboratories, Lucent Technologies
ABSTRACT
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 authors' 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
CITATION

R. H. Katz, F. Yu and T. Lakshman, "Efficient Multimatch Packet Classification and Lookup with TCAM," in IEEE Micro, vol. 25, no. , pp. 50-59, 2005.
doi:10.1109/MM.2005.8
92 ms
(Ver 3.3 (11022016))