Rate optimal scheduling schemes for asynchronous input-queued packet switches

The performance of input-queued packet switches critically depends on the scheduling scheme that connects the input ports to the output ports. We show that, when packets are switched asynchronously, simple scheduling schemes where contention is solved locally at each input or output can achieve rate optimality, without any speed-up of the internal transmission rate.

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

[2]  Philippe Robert,et al.  Random capture algorithms fluid limits and stability , 2010, 2010 Information Theory and Applications Workshop (ITA).

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

[4]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

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

[6]  Andrea Bianco,et al.  Asynchronous vs Synchronous Input-Queued Switches , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[7]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

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

[9]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[10]  E. Modiano,et al.  Greedy weighted matching for scheduling the input-queued switch , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

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

[12]  R. Srikant,et al.  The stability of longest-queue-first scheduling with variable packet sizes , 2011, IEEE Conference on Decision and Control and European Control Conference.

[13]  Devavrat Shah,et al.  Cell switching versus packet switching in input-queued switches , 2005, IEEE/ACM Transactions on Networking.

[14]  Philippe Robert.  Stochastic Networks and Queues , 2003 .