An alternative approach to heavy-traffic limits for finite-pool queues

DOI10.1007/s11134-020-09653-zzbMath1461.60072arXiv1811.09576OpenAlexW3024174152MaRDI QIDQ2210665

Gianmarco Bet

Publication date: 8 November 2020

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

queueing theoryheavy-traffic approximationscontinuous-mapping approachtransitory queueing systems

Mathematics Subject Classification ID

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 ⋮ Big Jobs Arrive Early: From Critical Queues to Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A queueing model with independent arrivals, and its fluid and diffusion limits
• Probability theory. A comprehensive course.
• Stochastic-Process Limits
• Asymptotic Analysis of the Time Dependent M/M/1 Queue
• Some Useful Functions for Functional Limit Theorems
• Time-Dependent Queues
• Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process
• Applied Probability and Queues
• Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations
• Queues with time-dependent arrival rates I—the transition through saturation
• Queues with time-dependent arrival rates. II — The maximum queue and the return to equilibrium
• Queues with time-dependent arrival rates. III — A mild rush hour
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Statistical Analysis of a Telephone Call Center