Robust heavy-traffic approximations for service systems facing overdispersed demand

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
24 Downloads (Pure)

Abstract

Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete-time stochastic models for which we derive heavy-traffic approximations that are scalable in the system size. Subsequently, we show how this leads to novel capacity sizing rules that acknowledge the presence of overdispersion. This, in turn, leads to robust approximations for performance characteristics of systems that are of moderate size and/or may not operate in heavy traffic.

Original languageEnglish
Pages (from-to)257-289
Number of pages33
JournalQueueing Systems
Volume90
Issue number3-4
DOIs
Publication statusPublished - 1 Dec 2018

Fingerprint

Heavy Traffic
Stochastic models
Overdispersion
Approximation
Discrete-time Model
Stochastic Model
Siméon Denis Poisson
Fluctuations
Demand
Heavy traffic
Service system
Discrete-time
Stochastic model
Performance characteristics
Sizing

Keywords

  • Heavy-traffic approximations
  • Overdispersion
  • Random walk
  • Saddle point method

Cite this

@article{c463fac99fc2488a82f39395ab5efc74,
title = "Robust heavy-traffic approximations for service systems facing overdispersed demand",
abstract = "Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete-time stochastic models for which we derive heavy-traffic approximations that are scalable in the system size. Subsequently, we show how this leads to novel capacity sizing rules that acknowledge the presence of overdispersion. This, in turn, leads to robust approximations for performance characteristics of systems that are of moderate size and/or may not operate in heavy traffic.",
keywords = "Heavy-traffic approximations, Overdispersion, Random walk, Saddle point method",
author = "Mathijsen, {Britt W.J.} and Janssen, {A. J.E.M.} and {van Leeuwaarden}, {Johan S.H.} and Bert Zwart",
year = "2018",
month = "12",
day = "1",
doi = "10.1007/s11134-018-9584-z",
language = "English",
volume = "90",
pages = "257--289",
journal = "Queueing Systems: Theory and Applications",
issn = "0257-0130",
publisher = "Springer",
number = "3-4",

}

Robust heavy-traffic approximations for service systems facing overdispersed demand. / Mathijsen, Britt W.J.; Janssen, A. J.E.M.; van Leeuwaarden, Johan S.H.; Zwart, Bert.

In: Queueing Systems, Vol. 90, No. 3-4, 01.12.2018, p. 257-289.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Robust heavy-traffic approximations for service systems facing overdispersed demand

AU - Mathijsen, Britt W.J.

AU - Janssen, A. J.E.M.

AU - van Leeuwaarden, Johan S.H.

AU - Zwart, Bert

PY - 2018/12/1

Y1 - 2018/12/1

N2 - Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete-time stochastic models for which we derive heavy-traffic approximations that are scalable in the system size. Subsequently, we show how this leads to novel capacity sizing rules that acknowledge the presence of overdispersion. This, in turn, leads to robust approximations for performance characteristics of systems that are of moderate size and/or may not operate in heavy traffic.

AB - Arrival processes to service systems often display fluctuations that are larger than anticipated under the Poisson assumption, a phenomenon that is referred to as overdispersion. Motivated by this, we analyze a class of discrete-time stochastic models for which we derive heavy-traffic approximations that are scalable in the system size. Subsequently, we show how this leads to novel capacity sizing rules that acknowledge the presence of overdispersion. This, in turn, leads to robust approximations for performance characteristics of systems that are of moderate size and/or may not operate in heavy traffic.

KW - Heavy-traffic approximations

KW - Overdispersion

KW - Random walk

KW - Saddle point method

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

U2 - 10.1007/s11134-018-9584-z

DO - 10.1007/s11134-018-9584-z

M3 - Article

C2 - 30956380

AN - SCOPUS:85046720604

VL - 90

SP - 257

EP - 289

JO - Queueing Systems: Theory and Applications

JF - Queueing Systems: Theory and Applications

SN - 0257-0130

IS - 3-4

ER -