Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations

DOI10.1287/moor.2018.0947zbMath1437.60065arXiv1412.5329OpenAlexW2963349936WikidataQ127951582 ScholiaQ127951582MaRDI QIDQ5108221

Johan S. H. van Leeuwaarden, Gianmarco Bet, Remco van der Hofstad

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic analysisqueueing theoryheavy-traffic approximationscontinuous-mapping approachtransitory queueing systemsmartingale functional CLTuniform acceleration technique

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Weighted Dyck paths and nonstationary queues, Strong Embeddings for Transitory Queueing Models, An alternative approach to heavy-traffic limits for finite-pool queues, Big Jobs Arrive Early: From Critical Queues to Random Graphs, The probability of unusually large components in the near-critical Erdős–Rényi graph, A many-server functional strong law for a non-stationary loss model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The component sizes of a critical random graph with given degree sequence
• Queueing systems with pre-scheduled random arrivals
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Novel scaling limits for critical inhomogeneous random graphs
• Generating simple random graphs with prescribed degree distribution
• Proofs of the martingale FCLT
• Large finite population queueing systems: The single-server model
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Asymptotic analysis of the \(M/G/1\) queue with a time-dependent arrival rate
• Asymptotic normality of the \(L_1\) error of the Grenander estimator
• The truncated normal distribution: applications to queues with impatient customers
• A queueing model with independent arrivals, and its fluid and diffusion limits
• Stochastic-Process Limits
• Random Graphs and Complex Networks
• Critical behavior in inhomogeneous random graphs
• Critical epidemics, random graphs, and Brownian motion with a parabolic drift
• Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game
• Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
• Asymptotic Analysis of the Time Dependent M/M/1 Queue
• Some Useful Functions for Functional Limit Theorems
• Time-Dependent Queues
• The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier
• Order Statistics
• Strong Approximations for Time-Dependent Queues
• The phase transition in inhomogeneous random graphs
• On a conditionally Poissonian graph process
• Queues with time-dependent arrival rates I—the transition through saturation
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Multiple channel queues in heavy traffic. I