ABSTRACT
Many-server queues arise in a variety of applications, and are typically harder to analyze than single-server queues. I will introduce a framework for the asymptotic approximations of these queues, and describe how interesting processes with memory arise as scaling limits of these systems.
The talk is based on various joint works with Weining Kang, Haya Kaspi and Soummya Kar.