Title :
Efficient mapping of range classifier into ternary-CAM
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
Abstract :
Packet classification is inherently a multidimensional search problem which is either very computation intensive or memory intensive for software implementation. Thus, hardware based solution is necessary to keep up with gigabit line rate processing. We consider using standard ternary content addressable memory (TCAM) as a hardware classification engine. Traditionally, this approach has been deemed inefficient because ranges have to be broken into prefixes before stored in TCAM, resulting in large expansion. We propose a novel scheme where we can efficiently map ranges into TCAM. Our proposal has no expansion at all, or very little expansion for width constrained application. Our proposal enables high speed deterministic classification using low cost commodity hardware.
Keywords :
content-addressable storage; search problems; TCAM; efficient mapping; expansion factor comparison; gigabit line rate processing; hardware based solution; hardware classification engine; high speed deterministic classification; low cost commodity hardware; multidimensional search problem; packet classification; range classifier; software implementation; ternary content addressable memory; ternary-CAM; Associative memory; Coprocessors; Costs; Ethernet networks; Hardware; Proposals; Search engines; Search problems; Software algorithms; Web and internet services;
Conference_Titel :
High Performance Interconnects, 2002. Proceedings. 10th Symposium on
Print_ISBN :
0-7695-1650-5
DOI :
10.1109/CONECT.2002.1039263