Heavy-Traffic Behavior of the MaxWeight Algorithm in a Switch with Uniform Traffic

We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse. We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation of the sum queue lengths in steady-state. Specifically, in the case of Bernoulli arrivals, we show that the heavy-traffic scaled queue length is (n -- 3/2 + 1/2n). Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern. This settles the heavy-traffic version of an open conjecture.

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

[2]  Tianxiong Ji,et al.  On Optimal Scheduling Algorithms for Small Generalized Switches , 2010, IEEE/ACM Transactions on Networking.

[3]  Devavrat Shah,et al.  Optimal queue-size scaling in switched networks , 2011, SIGMETRICS '12.

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

[5]  Lei Ying,et al.  Communication Networks - An Optimization, Control, and Stochastic Networks Perspective , 2014 .

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

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

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

[9]  J. Tsitsiklis,et al.  Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions , 2001 .

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

[11]  Kyomin Jung,et al.  Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads , 2007, STOC '07.

[12]  R. Srikant,et al.  Asymptotically tight steady-state queue length bounds implied by drift conditions , 2011, Queueing Syst. Theory Appl..

[13]  Alexander L. Stolyar,et al.  MaxWeight Scheduling: Asymptotic Behavior of Unscaled Queue-Differentials in Heavy Traffic , 2015, SIGMETRICS 2015.

[14]  B. Hajek.  Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[15]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[16]  Jon C. Dattorro,et al.  Convex Optimization & Euclidean Distance Geometry , 2004 .

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

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