Steady-State Convergence of the Continuous-Time Routing System with General Distributions in Heavy Traffic

Abstract

This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those commonly found in the literature, we prove that the scaled steady-state queue length at each station converges weakly to an identical exponential random variable in heavy traffic. Specifically, our results hold under the assumption of the $(2+{\delta }_0)$th moment for the interarrival and service distributions with some ${\delta }_0>0$. The proof leverages the Palm version of the basic adjoint relationship (BAR) as a key technique.

References in corpus (5)

• Universality of Load Balancing Schemes on Diffusion Scale
• Transform Methods for Heavy-Traffic Analysis
• Join-the-Shortest Queue Diffusion Limit in Halfin-Whitt Regime: Tail Asymptotics and Scaling of Extrema
• Heavy-Traffic Optimal Size- and State-Aware Dispatching
• Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times