• Corpus ID: 235265755

Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window

@inproceedings{Zhao2021ManyserverAF,
  title={Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window},
  author={Zhisheng Zhao and Sayantan Banerjee and Debankur Mukherjee},
  year={2021}
}
The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analysis of the JSQ policy is an open question to date, even under Markovian assumption on the service requirements, recently, there has been a significant progress in understanding its many-server asymptotic behavior since the work of Eschenfeldt and Gamarnik (Math.~Oper.~Res.~43 (2018) 867--886). In this paper, we… 

Tables from this paper