Supermarket Queueing System in the Heavy Traffic Regime. Short Queue Dynamics

We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and rate $1$ exponentially distributed service times, we consider this model in the heavy traffic regime, described by $\lambda_{n}\uparrow 1$ as $n\to\infty$. We give a simple expectation argument establishing that majority of queues have steady state length at least $\log_d(1-\lambda_{n})^{-1} - O(1)$ with probability approaching one as $n\rightarrow\infty$, implying the same for the steady state delay of a typical customer. Our main result concerns the detailed behavior of queues with length smaller than $\log_d(1-\lambda_{n})^{-1}-O(1)$. Assuming $\lambda_{n}$ converges to $1$ at rate at most $\sqrt{n}$, we show that the dynamics of such queues does not follow a diffusion process, as is typical for queueing systems in heavy traffic, but is described instead by a deterministic infinite system of linear differential equations, after an appropriate rescaling. The unique fixed point solution of this system is shown explicitly to be of the form $\pi_{1}(d^{i}-1)/(d-1), i\ge 1$, which we conjecture describes the steady state behavior of the queue lengths after the same rescaling. Our result is obtained by combination of several technical ideas including establishing the existence and uniqueness of an associated infinite dimensional system of non-linear integral equations and adopting an appropriate stopped process as an intermediate step.

[1]  Michael Mitzenmacher,et al.  On the Analysis of Randomized Load Balancing Schemes , 1997, SPAA '97.

[2]  James Norris,et al.  Strong approximation for the supermarket model , 2004 .

[3]  Yi Lu,et al.  Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks , 2011, ArXiv.

[4]  Colin McDiarmid,et al.  On the maximum queue length in the supermarket model , 2004 .

[5]  David Gamarnik,et al.  Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics , 2015, Math. Oper. Res..

[6]  N. Vvedenskaya,et al.  Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing , 1997 .

[7]  Tonghoon Suk,et al.  Randomized longest-queue-first scheduling for large-scale buffered systems , 2013, Advances in Applied Probability.

[8]  Sem C. Borst,et al.  Universality of load balancing schemes on the diffusion scale , 2016, J. Appl. Probab..

[9]  Sem C. Borst,et al.  Efficient load balancing in large-scale systems , 2016, 2016 Annual Conference on Information Science and Systems (CISS).

[10]  Yi Lu,et al.  Randomized load balancing with general service time distributions , 2010, SIGMETRICS '10.

[11]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[12]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Yi Lu,et al.  Asymptotic independence of queues under randomized load balancing , 2012, Queueing Syst. Theory Appl..

[14]  C. Graham Functional central limit theorems for a large network in which customers join the shortest of several queues , 2004, math/0403538.

[15]  Malwina Luczak,et al.  The supermarket model with arrival rate tending to one , 2012, 1201.5523.

[16]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[17]  John C. S. Lui,et al.  Block-structured supermarket models , 2014, Discret. Event Dyn. Syst..