The advantage of indices of dispersion in queueing approximations

DOI10.1016/j.orl.2019.01.001zbMath1476.90097OpenAlexW2910703003WikidataQ128563299 ScholiaQ128563299MaRDI QIDQ2294276

Wei You, Ward Whitt

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2019.01.001

zbMATH Keywords

queuesgeneralized Jackson networksopen queueing networksindex of dispersion for countsqueueing approximationsrobust queueing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

A robust queueing network analyzer based on indices of dispersion ⋮ Heavy-traffic limits for stationary network flows ⋮ Queues with path-dependent arrival processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The QNET method for two-moment analysis of open queueing networks
• The heavy-traffic bottleneck phenomenon in open queueing networks
• The Fourier-series method for inverting transforms of probability distributions
• A Light Traffic Approximation for a Single-Server Queue
• Open Queueing Networks in Heavy Traffic
• Robust Queueing Theory
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Inequalities for moments of tails of random variables, with a queueing application
• Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
• Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues
• Heavy-Traffic Limit of the GI/GI/1 Stationary Departure Process and Its Variance Function
• On the relation between customer and time averages in queues
• Some inequalities for the queue GI/G/1