Fast and scalable packet classification

被引:123
作者
van Lunteren, J [1 ]
Engbersen, T [1 ]
机构
[1] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland
关键词
associative memories; communication system routing; communication systems; Internet; routing; search methods; table lookup; tree data structures; tree searching;
D O I
10.1109/JSAC.2003.810527
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Emerging Internet applications create the need for advanced packet classifiers. We propose a novel multifield classification scheme, called (PC)-C-2, which exploits the strengths of state-of-the-art memory technologies to provide wire-speed classification performance for OC-192 and beyond, in combination with very high storage efficiency and the support of fast incremental updates. Key features of the new scheme are its ability to adapt to the complexity of a classification rule set, whereas the storage requirements and update dynamics can be tuned at the granularity of individual rules. This makes (PC)-C-2 suitable for a broad spectrum of applications.
引用
收藏
页码:560 / 571
页数:12
相关论文
共 28 条
[1]  
[Anonymous], EMBEDDED MICROPROCES
[2]  
[Anonymous], 1998, P ACM SIGCOMM 98
[3]   Scalable packet classification [J].
Baboescu, F ;
Varghese, G .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :199-210
[4]  
BRODNIK A, 1997, COMPUT COMMUN REV, V27, P3
[5]  
CAO Z, 2000, P IEEE INFOCOM 2000, V1, P332
[6]  
Feldman A., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1193, DOI 10.1109/INFCOM.2000.832493
[7]  
Gupta P, 2001, IEEE NETWORK, V15, P2
[8]  
Gupta P, 1999, COMP COMM R, V29, P147, DOI 10.1145/316194.316217
[9]  
Gupta P, 2000, LECT NOTES COMPUT SC, V1815, P528
[10]  
GUPTA P, 1999, P HOT INT 7 STANF U