Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Sensitivity on the Heavy-traffic Parameter

Consider a system of N parallel single-server queues with unit-exponential service time distribution and a single dispatcher where tasks arrive as a Poisson process of rate λ(N). When a task arrives, the dispatcher assigns it to one of the servers according to the Join-the-Shortest Queue (JSQ) policy. Eschenfeldt and Gamarnik (Math. Oper. Res., 43(3):867-886, 2018) identified a novel limiting diffusion process that arises as the weak-limit of the appropriately scaled occupancy measure of the system under the JSQ policy in the Halfin-Whitt regime, where (N - λ(N)) / √(N)→β > 0 as N →∞. The analysis of this diffusion goes beyond the state of the art techniques, and even proving its ergodicity is non-trivial, and was left as an open question. Recently, exploiting a generator expansion framework via the Stein's method, Braverman (arXiv:1801.05121, 2018) established its exponential ergodicity, and adapting a regenerative approach, Banerjee and Mukherjee (Ann. Appl. Probab., 29(2):1262-1309, 2018) analyzed the tail properties of the stationary distribution and path fluctuations of the diffusion. However, the analysis of the bulk behavior of the stationary distribution, viz., the moments, remained intractable until this work. In this paper, we perform a thorough analysis of the bulk behavior of the stationary distribution of the diffusion process, and discover that it exhibits different qualitative behavior, depending on the value of the heavy-traffic parameter β. Moreover, we obtain precise asymptotic laws of the centered and scaled steady state distribution, as β tends to 0 and ∞. Of particular interest, we also establish a certain intermittency phenomena in the β→∞ regime and a surprising distributional convergence result in the β→ 0 regime.