Routers with a single stage of buffering

被引:25
作者
Iyer, S [1 ]
Zhang, R [1 ]
McKeown, N [1 ]
机构
[1] Stanford Univ, Comp Syst Lab, Stanford, CA 94305 USA
关键词
routers; switching; buffers; constraint sets;
D O I
10.1145/964725.633050
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Most high performance routers today use combined input and output queueing (CIOQ). The CIOQ router is also frequently used as an abstract model for routers: at one extreme is input queueing, at the other extreme is output queueing, and in-between there is a continuum of performance as the speedup is increased from 1 to N (where N is the number of linecards). The model includes architectures in which a switch fabric is sandwiched between two stages of buffering. There is a rich and growing theory for CIOQ routers, including algorithms, throughput results and conditions under which delays can be guaranteed. But there is a broad class of architectures that are not captured by the CIOQ model, including routers with centralized shared memory, and load-balanced routers, In this paper we propose an abstract model called Single-Buffered (SB) routers that includes these architectures. We describe a method called Constraint Sets to analyze a number of SB router architectures. The model helped identify previously unstudied architectures, in particular the Distributed Shared Memory router. Although commercially deployed, its performance is not widely known. We find conditions under which it can emulate an ideal shared memory router, and believe it to,be a promising architecture. Questions remain about its complexity, but we find that the memory bandwidth, and potentially the power consumption of the router is lower than for a CIOQ router.
引用
收藏
页码:251 / 264
页数:14
相关论文
共 29 条
[1]  
Bennett JCR, 1996, IEEE INFOCOM SER, P120, DOI 10.1109/INFCOM.1996.497885
[2]  
CHANEY T, 1996, WUCS9607 COMP SCI DE
[3]  
CHANG CS, 2001, IEEE HPSR C DALL MAY
[4]   Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup [J].
Charny, A ;
Krishna, P ;
Patel, N ;
Simcoe, R .
1998 SIXTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE (IWQOS '98), 1998, :235-244
[5]  
CHARNY A, 1998, THESIS MIT
[6]  
CHI HC, 1991, IEEE INTERNATIONAL CONFERENCE ON COMPUTER-DESIGN : VLSI IN COMPUTERS AND PROCESSORS, P233, DOI 10.1109/ICCD.1991.139888
[7]   Matching output queueing with a combined input/output-queued switch [J].
Chuang, ST ;
Goel, A ;
McKeown, N ;
Prabhakar, B .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1999, 17 (06) :1030-1039
[8]   A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J].
CLOS, C .
BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02) :406-424
[9]   Edge-coloring bipartite multigraphs in O(ElogD) time [J].
Cole, R ;
Ost, K ;
Schirra, S .
COMBINATORICA, 2001, 21 (01) :5-12
[10]  
Dai J. G., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P556, DOI 10.1109/INFCOM.2000.832229