On the speedup required for work-conserving crossbar switches

被引:63
作者
Krishna, P [1 ]
Patel, NS
Charny, A
Simcoe, RJ
机构
[1] Compaq Comp Corp, Marlborough, MA 01752 USA
[2] Digital Comp Corp, Littleton, MA 01460 USA
[3] Nexabit Networks, Marlborough, MA 01752 USA
[4] Cabletron Syst, Andover, MA 01810 USA
[5] Sycamore Networks, Tewksbury, MA 01876 USA
关键词
crossbar switches; quality-of-service (QoS); scheduling; work-conservation;
D O I
10.1109/49.772435
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper describes the architecture for a work-conserving server using a combined I/O-buffered crossbar switch. The switch employs a novel algorithm based on output occupancy, the lowest occupancy output first algorithm (LOOFA), and a speedup of only two. A work-conserving switch provides the same throughput performance as an output-buffered switch. The work-conserving property of the switch is independent of the switch size and input traffic pattern. We also present a suite of algorithms that can be used in combination with LOOFA. These algorithms determine the fairness and delay properties of the switch. We also describe a mechanism to provide delay bounds for real-time traffic using LOOFA, These delay bounds are achievable without requiring output-buffered switch emulation.
引用
收藏
页码:1057 / 1066
页数:10
相关论文
共 19 条
[1]   HIGH-SPEED SWITCH SCHEDULING FOR LOCAL-AREA NETWORKS [J].
ANDERSON, TE ;
OWICKI, SS ;
SAXE, JB ;
THACKER, CP .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1993, 11 (04) :319-352
[2]  
Bennett J., 1996, P INFOCOM
[3]  
CHARNY A, 1998, P IWQOS NAP VALL CA
[4]  
CHARNY A, 1998, THESIS MIT CAMBRIDGE
[5]   THROUGHPUT ANALYSIS, OPTIMAL BUFFER ALLOCATION, AND TRAFFIC IMBALANCE STUDY OF A GENERIC NONBLOCKING PACKET SWITCH [J].
CHEN, JSC ;
STERN, TE .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (03) :439-449
[6]  
CHUANG ST, CSLTR98758 STANF U
[7]  
GUERIN R, 1997, 20892 RC IBM
[8]   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
[9]  
LI SQ, 1989, P IEEE GLOB 89, P1754
[10]  
LUND C, 1996, P BROADB COMM