Debankur Mukherjee (GT)
Many-server asymptotics for Join-the-Shortest Queue policy

ABSTRACT:

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, even under Markovian assumption on the service requirements, is an open question to date, 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 talk, we will discuss some of these advances in the analysis of the JSQ policy, focusing particularly on the behavior in the super-Halfin-Whitt scaling window.

This is a joint work with Zhisheng Zhao (Georgia Tech) and Sayan Banerjee (UNC Chapel Hill).

For upcoming events of the SPOR seminar, as well as a history of previous talks, see: https://www.eurandom.tue.nl/eindhoven-spor-seminar/.