Abstract:The Join-the-Shortest-Queue (JSQ) policy is among the most widely used load balancing algorithms and has been extensively studied. However, an exact characterization of the system behavior remains challenging. Most prior research has focused on analyzing its performance in the steady state in certain asymptotic regimes, such as the heavy-traffic regime. However, convergence to the steady state in these regimes is often slow, so steady-state and heavy-traffic characterizations may be less informative over practical time horizons. To address this limitation, we provide a finite-time convergence rate analysis of a JSQ system with two symmetric servers. In sharp contrast to the existing literature, we directly study the original system rather than an approximate limiting system such as a diffusion approximation. Our results demonstrate that for such a system, the convergence rate to its steady state, measured in the total variation distance, is $O \left(\frac{1}{(1-\rho)^3} \frac{1}{t} \right)$, where $\rho \in (0,1)$ is the traffic intensity.
From: Yuanzhe Ma [view email]
[v1]
Wed, 19 Mar 2025 22:58:41 UTC (210 KB)
[v2]
Fri, 21 Mar 2025 06:01:37 UTC (200 KB)
[v3]
Sun, 8 Feb 2026 20:28:36 UTC (107 KB)
[v4]
Wed, 11 Feb 2026 15:58:22 UTC (107 KB)
[v5]
Tue, 4 Aug 2026 13:52:02 UTC (171 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。