Novel heavy-traffic regimes for large-scale service systems

DOI10.1137/140960815zbMATH Open1322.60193arXiv1411.5251OpenAlexW2170159748MaRDI QIDQ5264993FDOQ5264993

Authors: Johan S. H. van Leeuwaarden, Britt Mathijsen, A. J. E. M. Janssen 

Publication date: 21 July 2015

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Abstract: We introduce a family of heavy-traffic regimes for large scale service systems, presenting a range of scalings that include both moderate and extreme heavy traffic, as compared to classical heavy traffic. The heavy-traffic regimes can be translated into capacity sizing rules that lead to Economies-of-Scales, so that the system utilization approaches 100% while congestion remains limited. We obtain heavy-traffic approximations for stationary performance measures in terms of asymptotic expansions, using a non-standard saddle point method, tailored to the specific form of integral expressions for the performance measures, in combination with the heavy-traffic regimes.

Full work available at URL: https://arxiv.org/abs/1411.5251

Recommendations

• Heavy traffic limits for queues with many deterministic servers
• Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
• Dynamic routing in large-scale service systems with heterogeneous servers
• Robust heavy-traffic approximations for service systems facing overdispersed demand
• Diffusion Approximations for a Multiclass Markovian Service System with “Guaranteed” and “Best-Effort” Service Levels

zbMATH Keywords

Riemann zeta functioncentral limit theoremqueueing theoryasymptotic analysiswaiting timesGaussian random walksaddle point methodheavy-traffic regimeslarge service systems

Mathematics Subject Classification ID

Gaussian processes (60G15) Central limit and other weak theorems (60F05) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Sums of independent random variables; random walks (60G50) Integration, integrals of Cauchy type, integral representations of analytic functions in the complex plane (30E20)

Cites Work

• NIST handbook of mathematical functions
• Sequential analysis. Tests and confidence intervals
• Analytic combinatorics
• Applied Probability and Queues
• Analytic computation schemes for the discrete-time bulk service queue
• Stochastic-Process Limits
• Title not available (Why is that?)
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Relaxation time for the discrete \(D/G/1\) queue
• Title not available (Why is that?)
• On the application of Rouché's theorem in queueing theory
• Capacity sizing under parameter uncertainty: safety staffing principles revisited
• Reducing Delays for Medical Appointments: A Queueing Approach
• Dimensioning Large Call Centers
• Heavy traffic limits for queues with many deterministic servers
• Ladder heights, Gaussian random walks and the Riemann zeta function
• On Lerch's transcendent and the Gaussian random walk
• Cumulants of the maximum of the Gaussian random walk
• Heavy-traffic limits for nearly deterministic queues
• Heavy-traffic limits for nearly deterministic queues: Stationary distributions
• Complete corrected diffusion approximations for the maximum of a random walk
• An Elementary Queueing Problem
• Queues for a Fixed-Cycle Traffic Light
• A Two-Time-Scale Approach to Time-Varying Queues in Hospital Inpatient Flow Management

Cited In (10)

• Spitzer's identity for discrete random walks
• Heavy-traffic single-server queues and the transform method
• Robust heavy-traffic approximations for service systems facing overdispersed demand
• MAD dispersion measure makes extremal queue analysis simple
• Transient error approximation in a Lévy queue
• Pollaczek contour integrals for the fixed-cycle traffic-light queue
• Dominant poles and tail asymptotics in the critical Gaussian many-sources regime
• Heavy traffic analysis of a queueing system with bounded capacity for two types of customers
• Responding to Unexpected Overloads in Large-Scale Service Systems
• Heavy traffic limits for queues with many deterministic servers

Uses Software

• Digital Library of Mathematical Functions

This page was built for publication: Novel heavy-traffic regimes for large-scale service systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264993)