Birkhoff-von Neumann input buffered crossbar switches

Previously, we proposed a scheduling algorithm that is capable of providing rate guarantees for input-buffered crossbar switches. The algorithm is based on a decomposition result by Birkhoff (1945) and von Neumann (1953) for a doubly substochastic matrix. An input buffered crossbar switch that uses such an algorithm is called the Birkhoff-von Neumann switch in this paper. For the Birkhoff-von Neumann switch, the rate guarantees are uniformly good for all non-uniform traffic, and it does not require framing or internal speedup. Our objective of this paper is to make the Birkhoff-von Neumann switch more complete and practical. We do so by addressing three topics: providing best-effort services in the Birkhoff-von Neumann switch, hardware implementation of the switch fabric, and multistage Birkhoff-von Neumann switches.

[1]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[4]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[5]  A. Charny,et al.  Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[6]  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).

[7]  Nirwan Ansari,et al.  Input-queued switching with QoS guarantees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[9]  Joseph Yu Hui,et al.  Switching and Traffic Theory for Integrated Broadband Networks , 1990 .

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

[11]  A. Charny,et al.  On the speedup required for work-conserving crossbar switches , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[12]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[13]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[14]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1996 .

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

[16]  Hui Zhang,et al.  Exact emulation of an output queueing switch by a combined input output queueing switch , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[17]  Anna Charny,et al.  On the speedup required for work-conserving crossbar switches , 1999, IEEE J. Sel. Areas Commun..

[18]  Frank K. Hwang,et al.  A new decomposition algorithm for rearrangeable Clos interconnection networks , 1996, IEEE Trans. Commun..

[19]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[20]  Ingram Olkin,et al.  Inequalities: Theory of Majorization and Its Application , 1979 .

[21]  Cheuk H. Lam,et al.  Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches , 1997, IEEE J. Sel. Areas Commun..

[22]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[23]  Nick McKeown,et al.  ATM input-buffered switches with the guaranteed-rate property , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[24]  Anujan Varma,et al.  Providing bandwidth guarantees in an input-buffered crossbar switch , 1995, Proceedings of INFOCOM'95.

[25]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[26]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[27]  Nick McKeown,et al.  Matching output queueing with a combined input output queued switch , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).