Finite-N boundary and routing-miss Stein comparisons for JSQ approximations
Statement
Consider a Markov queueing system where there are servers who serve at rate 1, and new customers arrive into the system at a constant rate of . When a new customer arrives, they choose to join the queue behind the server with the shortest existing length. If there is more than one queue with the shortest length, simply choose one uniformly at random. Let us assume that so we have a stationary distribution for this chain. Denote as the stationary distribution of this process, where is the number of queues with \emph{at least} people in the queue. This model is known as the Join the shortest queue (JSQ) model.
As a simplification to this process, suppose that when a new customer arrives, and \emph{all} of the server queues have 2 people, then this customer leaves straight away. Let denote the corresponding stationary distribution for this modified process. This is a commonly used approximation for the full JSQ model. Can we use Stein's method to explicitly bound the difference for suitable ?
Consider another simplification of the full JSQ process, where an new customer joins the shortest of randomly chosen queues. Let denote the stationary distribution of this process. What can we say about ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.