This is the authors' abstract. We don't add key points for this paper.
This paper studies the continuous-time join-the-shortest-queue (JSQ) system with general interarrival and service distributions. Under a much weaker assumption than the one in the literature, we prove that each station's scaled steady-state queue length weakly converges to an identical exponential random variable in heavy traffic. Specifically, we establish our results by only assuming 2+δ₀ moment on the arrival and service distributions for some δ₀>0. Our proof exploits the Palm version of the basic adjoint relationship (BAR) approach as a key technique.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Dai et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: