Critically loaded time-varying multiserver queues: Computational challenges and approximations

Young Myoung Ko, Natarajan Gautam

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


In this paper, we consider time-varying multiserver queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multiserver queues even if the number of servers is large. To address that concern, this paper focuses on developing a methodology by taking fluid and diffusion limits in a nontraditional fashion. We show that our approximation is significantly more accurate and also asymptotically true. We illustrate the effectiveness of our methodology by performing several numerical experiments.

Original languageEnglish (US)
Pages (from-to)285-301
Number of pages17
JournalINFORMS Journal on Computing
Issue number2
StatePublished - Mar 2013
Externally publishedYes


  • Multiserver queues
  • Nearly critically loaded
  • Strong approximations
  • Transient analysis
  • Uniform acceleration

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Critically loaded time-varying multiserver queues: Computational challenges and approximations'. Together they form a unique fingerprint.

Cite this