Queues allocation for multiple input-queued switches

To meet the increasing requirement for high speed switches, a multiple input-queued (MIQ) switch is explored. Rather than handling the scheduling problem heavily focused on by many researchers, a proposed dynamic queue allocation algorithm is used to handle non-uniform or hot-spot traffic. Although the performance of the original algorithm is analyzed by N.K. Sharma and M.R. Pinnu (see Parallel Computing, vol.23, p.777-81, 1997) and the orderly property is enhanced by us, Wu and Lin, (see Parallel Computing, vol.24, p.2143-8, 1998), the correctness of the algorithm has not been proven yet. In this report, with the help of the inherent properties of FIFO queues, we prove that the algorithm, and the related MIQ switch, is free from deadlock.

[1]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Ying-Dar Lin,et al.  A novel pairing algorithm for high-speed large-scale switches , 2000, IEEE Communications Letters.

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

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

[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]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[7]  Neeraj K. Sharma,et al.  An Efficient Implementation of Bypass Queue Under Bursty Traffic , 1997, Parallel Comput..

[8]  George Thomas.  Bifurcated queueing for throughput enhancement in input-queued switches , 1997, IEEE Communications Letters.

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

[10]  Panayotis Antoniadis,et al.  FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Ying-Dar Lin,et al.  An efficient and orderly implementation of bypass queue under bursty traffic , 1998, Parallel Comput..