On the maximum queue length in the supermarket model
<p style="text-align:justify;"> There are n queues, each with a single server. Customers arrive in a Poisson process at rate λn, where 0<λ<1. Upon arrival each customer selects d≥2 servers uniformly at random, and joins the queue at a least-loaded server among those ch...
| Hlavní autoři: | , |
|---|---|
| Médium: | Journal article |
| Vydáno: |
Institute of Mathematical Statistics
2006
|