Optimal load-balancing

This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-balanced switches provide an appealing alternative to crossbars with centralized schedulers. A load-balanced switch has no scheduler, is particularly amenable to optics, and - most relevant here -guarantees 100% throughput. A uniform mesh is used to load-balance packets uniformly across all 2-hop paths in the switch. In this paper we explore whether this particular method of load-balancing is optimal in the sense that it achieves the highest throughput for a given capacity of interconnect. The method we use allows the load-balanced switch to be compared with ring, torus and hypercube interconnects, too. We prove that for a given interconnect capacity, the load-balancing mesh has the maximum throughput. Perhaps surprisingly, we find that the best mesh is slightly non-uniform, or biased, and has a throughput of N/(2N - 1), where N is the number of nodes.

[1]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[2]  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.

[3]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[4]  Marco Ajmone Marsan,et al.  On the stability of input-queued switches with speed-up , 2001, TNET.

[5]  Nick McKeown,et al.  A load-balanced switch with an arbitrary number of linecards , 2004, IEEE INFOCOM 2004.

[6]  Marco Ajmone Marsan,et al.  Packet scheduling in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[8]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[9]  Cheng-Shang Chang,et al.  On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[10]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[12]  Steven L. Scott,et al.  The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus , 1996 .

[13]  J. M. Bilbao,et al.  Contributions to the Theory of Games , 2005 .

[14]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[15]  Miltos D. Grammatikakis,et al.  Packet Routing in Fixed-Connection Networks: A Survey , 1998, J. Parallel Distributed Comput..

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

[17]  Odysseas I. Pentakalos.  An Introduction to the InfiniBand Architecture , 2002, Int. CMG Conference.

[18]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[19]  Nick McKeown,et al.  Scaling internet routers using optics , 2003, SIGCOMM '03.

[20]  William J. Dally,et al.  GOAL: a load-balanced adaptive routing algorithm for torus networks , 2003, ISCA '03.

[21]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[22]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[23]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .

[24]  Srinivas Naga Vutukury,et al.  Multipath routing mechanisms for traffic engineering and quality of service in the internet , 2001 .

[25]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[26]  Yuval Tamir,et al.  Symmetric Crossbar Arbiters for VLSI Communication Switches , 1993, IEEE Trans. Parallel Distributed Syst..

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

[28]  J DallyWilliam,et al.  Performance Analysis of k-ary n-cube Interconnection Networks , 1990 .

[29]  William J. Dally,et al.  Worst-case Traffic for Oblivious Routing Functions , 2002, IEEE Computer Architecture Letters.

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