Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/MM.2005.8 | Micro, IEEE |
Keywords | Field | DocType |
content-addressable storage,packet switching,workstation clusters,high-speed networks,memory lookup,multimatch packet classification,network processors,ternary content-addressable memory | Network processor,Content-addressable memory,Computer science,Parallel computing,Network packet,Software,Longest prefix match,Content-addressable storage,Packet switching,Packet classification | Journal |
Volume | Issue | ISSN |
25 | 1 | 0272-1732 |
Citations | PageRank | References |
42 | 2.13 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fang Yu | 1 | 818 | 39.11 |
| Randy H. Katz | 2 | 16819 | 3018.89 |
| T. V. Lakshman | 3 | 4189 | 405.35 |