Load-balanced Three-stage Switch Architecture

A load-balanced two-stage switch is scalable and can provide close to 100% throughput. Its major problem is that packets can be mis-sequenced when they arrive at output ports. In a recent work, the packet mis-sequencing problem is elegantly solved by a feedback-based two-stage switch architecture. In this paper, we extend the feedback-based switch architecture from two-stage to three-stage to further cut down packet delay. The idea is to map the heavy flows to experience less middle-stage port delay using the switch fabric in the third stage. We show that the resulting three-stage architecture also ensures in-order packet delivery and close to 100% throughput. To identify heavy flows, a simple and practical traffic matrix estimation algorithm is also proposed. As compared with the original feedback-based two-stage switch architecture, the three-stage switch can cut down the delay performance by as large as 43.4% for a 32times32 switch under a hot-spot traffic pattern with input load at p=0.95. For random uniform traffic, the saving in delay is about 8%.

[1]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[2]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[3]  Nick McKeown,et al.  Scaling Internet Routers Using Optics (Extended Version) , 2003 .

[4]  Nick McKeown,et al.  Maintaining packet order in two-stage switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Yanming Shen,et al.  Byte-focal: a practical load balanced switch , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[6]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[7]  Kwan Lawrence Yeung,et al.  A Novel Feedback Mechanism for Load Balanced Two-Stage Switches , 2007, 2007 IEEE International Conference on Communications.

[8]  H. Jonathan Chao,et al.  On the performance of a dual round-robin switch , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[10]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[11]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[12]  Cheng-Shang Chang,et al.  Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets , 2004, IEEE INFOCOM 2004.

[13]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[14]  Roland Silver.  An algorithm for the assignment problem , 1960, CACM.

[15]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[16]  Cheng-Shang Chang,et al.  Design a simple and high performance switch using a two-stage architecture , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[17]  Seung-Woo Seo,et al.  A Load Balancing Scheme for Two-Stage Switches Maintaining Packet Sequence , 2006, 2006 IEEE International Conference on Communications.

[18]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.