Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Sensitivity on the Heavy-traffic Parameter
Sayan Banerjee, Debankur Mukherjee

TL;DR
This paper analyzes the stationary distribution of a diffusion process arising from the Join-the-Shortest Queue policy in heavy traffic, revealing different behaviors depending on the heavy-traffic parameter and establishing new asymptotic laws.
Contribution
It provides the first detailed analysis of the bulk behavior and moments of the stationary distribution, including asymptotic laws and phenomena as the heavy-traffic parameter varies.
Findings
Different qualitative behaviors depending on the heavy-traffic parameter 2
Asymptotic laws of the steady state distribution as 2 2 approaches 0 and 2 approaches 9
Discovered intermittency phenomena and distributional convergence in extreme regimes
Abstract
Consider a system of parallel single-server queues with unit-exponential service time distribution and a single dispatcher where tasks arrive as a Poisson process of rate . 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 as . 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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
