Technologies and building blocks for fast packet forwarding

被引:38
作者
Bux, W [1 ]
Denzel, WE
Engbersen, T
Herkersdorf, A
Luijten, RP
机构
[1] IBM Corp, Zurich Res Lab, Dept Commun Syst, Ruschlikon, Switzerland
[2] IBM Corp, Zurich Res Lab, Network Process Hardware Grp, Ruschlikon, Switzerland
关键词
D O I
10.1109/35.894379
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We provide a review of the state of the art and the future of packet processing and switching. The industry's response to the need for wire-speed packet processing devices whose function can be rapidly adapted to continuously changing standards and customer requirements is the concept of special programmable network processors. We discuss the prerequisites of processing tens to hundreds of millions of packets per second and indicate ways to achieve scalability through parallel packet processing. Tomorrow's switch fabrics, which Will provide node-internal connectivity between the input and output ports of a router or switch, will have to sustain terabit-per-second throughput.,After reviewing fundamental switching concepts, we discuss architectural and design issues that must be addressed to allow the evolution of packet switch fabrics to terabit-per-second throughput performance.
引用
收藏
页码:70 / 77
页数:8
相关论文
共 9 条
[1]  
[Anonymous], P BROADB COMM ZUR
[2]   A FLEXIBLE SHARED-BUFFER SWITCH FOR ATM AT GB/S RATES [J].
DENZEL, WE ;
ENGBERSEN, APJ ;
ILIADIS, I .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1995, 27 (04) :611-624
[3]  
GUPTA P, 2000, P IFIP NETW PAR FRAN
[4]  
GWENNAP L, 2000, EE TIMES 0619
[5]   INPUT VERSUS OUTPUT QUEUING ON A SPACE-DIVISION PACKET SWITCH [J].
KAROL, MJ ;
HLUCHYJ, MG ;
MORGAN, SP .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1987, 35 (12) :1347-1356
[6]   The iSLIP scheduling algorithm for input-queued switches [J].
McKeown, N .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (02) :188-201
[7]  
MINKENBERG C, 2000, P INT ZUR SEM BROADB, P207
[8]  
VANLUNTEREN J, UNPUB SCALABLE ADDRE
[9]  
ZENG HHY, 1999, IEEE JSAC, V17, P1067