Optimal queue-size scaling in switched networks

We consider a switched (queueing) network in which there are constraints on which queues may be served simultaneously; such networks have been used to effectively model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time, based on the current state or past history of the system. In the main result of this paper, we provide a new class of online scheduling policies that achieve optimal average queue-size scaling for a class of switched networks including input-queued switches. In particular, it establishes the validity of a conjecture about optimal queue-size scaling for input-queued switches.

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

[2]  Alexandre Proutière,et al.  Insensitivity in processor-sharing networks , 2002, Perform. Evaluation.

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

[4]  John N. Tsitsiklis,et al.  Optimal scaling of average queue sizes in an input-queued switch: an open problem , 2011, Queueing Syst. Theory Appl..

[5]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

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

[7]  Alexander L. Stolyar,et al.  Large Deviations of Queues Sharing a Randomly Time-Varying Server , 2008, Queueing Syst. Theory Appl..

[8]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[9]  J. Kingman.  On Queues in Heavy Traffic , 1962 .

[10]  Eytan Modiano,et al.  Logarithmic delay for N × N packet switches under the crossbar constraint , 2007, TNET.

[11]  PrabhakarBalaji,et al.  Optimal throughput-delay scaling in wireless networks , 2006 .

[12]  Devavrat Shah,et al.  Optimal delay scheduling in networks with arbitrary constraints , 2008, SIGMETRICS '08.

[13]  John N. Tsitsiklis,et al.  Qualitative properties of α-fair policies in bandwidth-sharing networks , 2014 .

[14]  Xiaojun Lin,et al.  Structural Properties of LDP for Queue-Length Based Wireless Scheduling Algorithms , 2007 .

[15]  John Michael Harrison,et al.  Balanced fluid models of multiclass queueing networks: a heavy traffic conjecture , 1995 .

[16]  Laurent Massoulié,et al.  Resource pooling in congested networks: proportional fairness and product form , 2009, Queueing Syst. Theory Appl..

[17]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[18]  Alexandre Proutière,et al.  Insensitive Bandwidth Sharing in Data Networks , 2003, Queueing Syst. Theory Appl..

[19]  J. Tsitsiklis,et al.  Qualitative properties of $\alpha$-fair policies in bandwidth-sharing networks , 2011, 1104.2340.

[20]  J. Harrison.  A broader view of Brownian networks , 2003 .

[21]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[22]  S. Zachary.  A Note on Insensitivity in Stochastic Networks , 2006, Journal of Applied Probability.

[23]  Devavrat Shah,et al.  Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse , 2010, ArXiv.

[24]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[25]  Heriot-Watt University.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS , 2004 .

[26]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[27]  Devavrat Shah,et al.  Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets , 2006, IEEE Transactions on Information Theory.

[28]  Søren Asmussen,et al.  Applied probability and queues, Second Edition , 2003, Applications of mathematics.

[29]  Sean P. Meyn.  Stability and Asymptotic Optimality of Generalized MaxWeight Policies , 2008, SIAM J. Control. Optim..

[30]  R. J. Williams,et al.  State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy , 2009, 0910.3821.

[31]  J. Dai,et al.  Asymptotic optimality of maximum pressure policies in stochastic processing networks. , 2008, 0901.2451.

[32]  S. Foss,et al.  AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS( Network Design, Control and Optimization) , 2004 .

[33]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[34]  John N. Tsitsiklis,et al.  Qualitative properties of α-weighted scheduling policies , 2010, SIGMETRICS '10.

[35]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

[36]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[37]  Devavrat Shah,et al.  Fluid models of congestion collapse in overloaded switched networks , 2011, Queueing Syst. Theory Appl..

[38]  John N. Tsitsiklis,et al.  On Queue-Size Scaling for Input-Queued Switches , 2014, ArXiv.

[39]  N. Walton.  Proportional fairness and its relationship with multi-class queueing networks , 2008, 0809.2697.

[40]  J. Harrison.  Correction: Brownian models of open processing networks: canonical representation of workload , 2000, math/0610352.

[41]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[42]  J. G. Dai,et al.  Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..