We show that the steady-state distribution of the join-the-shortest-queue (JSQ) system converges, in the Halfin-Whitt regime, to its diffusion limit at a rate of at least $1/\sqrt{n}$, where $n$ is the number of servers. Our proof uses Stein's method and, specifically, the recently proposed prelimit generator comparison approach. The JSQ system is non-trivial, high-dimensional, and has a state-space collapse component, and our analysis may serve as a helpful example to readers wishing to apply the approach to their own setting
We consider a system of $N$ parallel single-server queues with unit exponential service rates and a ...
In this paper, we investigate the stability and performance of randomized dynamic routing schemes f...
We present an overview of scalable load balancing algorithms which provide favorable delay performan...
Consider a system of $N$ parallel single-server queues with unit-exponential service time distributi...
We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in ...
The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server...
We analyse Join-the-Shortest-Queue in a contemporary scaling regime known as the Non-Degenerate Slow...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
We consider a system of N parallel queues with identical exponential service rates and a single disp...
We consider a system of $N$ parallel queues with identical exponential service rates and a single di...
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regi...
We consider a system of N parallel queues with unit exponential service rates and a single dispatche...
We consider a system of $N$ parallel single-server queues with unit exponential service rates and a ...
In this paper, we investigate the stability and performance of randomized dynamic routing schemes f...
We present an overview of scalable load balancing algorithms which provide favorable delay performan...
Consider a system of $N$ parallel single-server queues with unit-exponential service time distributi...
We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in ...
The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server...
We analyse Join-the-Shortest-Queue in a contemporary scaling regime known as the Non-Degenerate Slow...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
We consider a system of N parallel queues with identical exponential service rates and a single disp...
We consider a system of $N$ parallel queues with identical exponential service rates and a single di...
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regi...
We consider a system of N parallel queues with unit exponential service rates and a single dispatche...
We consider a system of $N$ parallel single-server queues with unit exponential service rates and a ...
In this paper, we investigate the stability and performance of randomized dynamic routing schemes f...
We present an overview of scalable load balancing algorithms which provide favorable delay performan...