Economies-of-scale in many-server queueing systems: tutorial and partial review of the Qed Halfin-Whitt heavy-traffic regime

Johan S.H. van Leeuwaarden, Britt W.J. Mathijsen, Bert Zwart

Research output: Contribution to journalArticleAcademicpeer-review

2 Downloads (Pure)

Abstract

Multiserver queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless networks, and delayed service in cloud data centers. These are all situations with jobs (clients, patients, tasks) and servers (agents, beds, processors) that have large capacity levels, ranging from the order of tens (checkouts) to thousands (processors). This survey investigates how to design such systems to exploit resource pooling and economies-of-scale. In particular, we review the mathematics behind the quality- and efficiency-driven (QED) regime, which lets the system operate close to full utilization, while the number of servers grows simultaneously large and delays remain manageable. Aimed at a broad audience, we describe in detail the mathematical concepts for the basic Markovian many-server system, and we provide only sketches or references for more advanced settings related to, e.g., load balancing, overdispersion, parameter uncertainty, general service requirements, and queueing networks. While serving as a partial survey of a massive body of work, the tutorial is not meant to be exhaustive.

Original languageEnglish
Pages (from-to)403-440
Number of pages38
JournalSIAM Review
Volume61
Issue number3
DOIs
Publication statusPublished - Sep 2019

Fingerprint

Heavy Traffic
Queueing System
Servers
Server
Partial
Data Center
Multi-server
Queueing networks
Overdispersion
Queueing Networks
Pooling
Parameter Uncertainty
Load Balancing
Airports
Resource allocation
Wireless Networks
System Design
Queue
Buffer
Wireless networks

Keywords

  • Central limit theorem
  • Heavy traffic
  • Limit theorems
  • Queueing theory
  • Stochastic-process limits
  • queueing theory
  • central limit theorem
  • heavy traffic
  • stochastic-process limits
  • limit theorems

Cite this

@article{6b4d2c41eb78408a8893e7e810d6765e,
title = "Economies-of-scale in many-server queueing systems: tutorial and partial review of the Qed Halfin-Whitt heavy-traffic regime",
abstract = "Multiserver queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless networks, and delayed service in cloud data centers. These are all situations with jobs (clients, patients, tasks) and servers (agents, beds, processors) that have large capacity levels, ranging from the order of tens (checkouts) to thousands (processors). This survey investigates how to design such systems to exploit resource pooling and economies-of-scale. In particular, we review the mathematics behind the quality- and efficiency-driven (QED) regime, which lets the system operate close to full utilization, while the number of servers grows simultaneously large and delays remain manageable. Aimed at a broad audience, we describe in detail the mathematical concepts for the basic Markovian many-server system, and we provide only sketches or references for more advanced settings related to, e.g., load balancing, overdispersion, parameter uncertainty, general service requirements, and queueing networks. While serving as a partial survey of a massive body of work, the tutorial is not meant to be exhaustive.",
keywords = "Central limit theorem, Heavy traffic, Limit theorems, Queueing theory, Stochastic-process limits, queueing theory, central limit theorem, heavy traffic, stochastic-process limits, limit theorems",
author = "{van Leeuwaarden}, {Johan S.H.} and Mathijsen, {Britt W.J.} and Bert Zwart",
year = "2019",
month = "9",
doi = "10.1137/17M1133944",
language = "English",
volume = "61",
pages = "403--440",
journal = "SIAM Review",
issn = "0036-1445",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "3",

}

Economies-of-scale in many-server queueing systems : tutorial and partial review of the Qed Halfin-Whitt heavy-traffic regime. / van Leeuwaarden, Johan S.H.; Mathijsen, Britt W.J.; Zwart, Bert.

In: SIAM Review, Vol. 61, No. 3, 09.2019, p. 403-440.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Economies-of-scale in many-server queueing systems

T2 - tutorial and partial review of the Qed Halfin-Whitt heavy-traffic regime

AU - van Leeuwaarden, Johan S.H.

AU - Mathijsen, Britt W.J.

AU - Zwart, Bert

PY - 2019/9

Y1 - 2019/9

N2 - Multiserver queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless networks, and delayed service in cloud data centers. These are all situations with jobs (clients, patients, tasks) and servers (agents, beds, processors) that have large capacity levels, ranging from the order of tens (checkouts) to thousands (processors). This survey investigates how to design such systems to exploit resource pooling and economies-of-scale. In particular, we review the mathematics behind the quality- and efficiency-driven (QED) regime, which lets the system operate close to full utilization, while the number of servers grows simultaneously large and delays remain manageable. Aimed at a broad audience, we describe in detail the mathematical concepts for the basic Markovian many-server system, and we provide only sketches or references for more advanced settings related to, e.g., load balancing, overdispersion, parameter uncertainty, general service requirements, and queueing networks. While serving as a partial survey of a massive body of work, the tutorial is not meant to be exhaustive.

AB - Multiserver queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless networks, and delayed service in cloud data centers. These are all situations with jobs (clients, patients, tasks) and servers (agents, beds, processors) that have large capacity levels, ranging from the order of tens (checkouts) to thousands (processors). This survey investigates how to design such systems to exploit resource pooling and economies-of-scale. In particular, we review the mathematics behind the quality- and efficiency-driven (QED) regime, which lets the system operate close to full utilization, while the number of servers grows simultaneously large and delays remain manageable. Aimed at a broad audience, we describe in detail the mathematical concepts for the basic Markovian many-server system, and we provide only sketches or references for more advanced settings related to, e.g., load balancing, overdispersion, parameter uncertainty, general service requirements, and queueing networks. While serving as a partial survey of a massive body of work, the tutorial is not meant to be exhaustive.

KW - Central limit theorem

KW - Heavy traffic

KW - Limit theorems

KW - Queueing theory

KW - Stochastic-process limits

KW - queueing theory

KW - central limit theorem

KW - heavy traffic

KW - stochastic-process limits

KW - limit theorems

UR - http://www.scopus.com/inward/record.url?scp=85072129879&partnerID=8YFLogxK

U2 - 10.1137/17M1133944

DO - 10.1137/17M1133944

M3 - Article

AN - SCOPUS:85072129879

VL - 61

SP - 403

EP - 440

JO - SIAM Review

JF - SIAM Review

SN - 0036-1445

IS - 3

ER -