Achieving 100% throughput in an input-queued switch

It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument and quadratic Lyapunov function. In particular we assume that each input maintains a separate FIFO queue for each output and that the switch is scheduled using a maximum weight bipartite matching algorithm.

[1]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[2]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

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

[6]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

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

[8]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[9]  H. T. Nguyen,et al.  A neural network implementation of an input access scheme in a high-speed packet switch , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[10]  Timothy X. Brown,et al.  Neural Network Design of a Banyan Network Controller , 1990, IEEE J. Sel. Areas Commun..

[11]  Alan Huang,et al.  Starlite: a wideband digital switch , 1991 .

[12]  H. Obara.  Optimum architecture for input queuing ATM switches , 1991 .

[13]  Stephen M. Walters,et al.  Neural network architecture for crossbar switch control , 1991 .

[14]  Satoru Okamoto,et al.  Input and output queueing ATM switch architecture with spatial and temporal slot reservation control , 1992 .

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

[16]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[17]  Y. Hamazumi,et al.  Parallel contention resolution control for input queueing ATM switches , 1992 .

[18]  Kai Y. Eng,et al.  Improving the performance of input-queued ATM packet switches , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[19]  Pravin Varaiya,et al.  Scheduling cells in an input-queued switch , 1993 .

[20]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[21]  Oliver W. W. Yang,et al.  A fast algorithm for multi-channel/port traffic assignment , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

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