Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy-traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and queues of length exactly two weakly converges to a two-dimens...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2019
|
| Online Access: | http://hdl.handle.net/1721.1/120946 https://orcid.org/0000-0003-4865-7645 https://orcid.org/0000-0001-8898-8778 |