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

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.