On the maximum queue length in the supermarket model
There are $n$ queues, each with a single server. Customers arrive in a Poisson process at rate $\lambda n$, where $0<\lambda<1$. Upon arrival each customer selects $d\geq2$ servers uniformly at random, and joins the queue at a least-loaded server among those chosen. Service times are i...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
2006
|