Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

DOI10.1287/MNSC.41.10.1704MaRDI QIDQ5689383zbMATH OpenOpenAlexFDO

Authors Ward Whitt

Publication date 20 July 1997

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.41.10.1704

zbMATH Keywords

heavy trafficqueueing networktandem queuestwo-moment approximation

Mathematics Subject Classification ID

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

Recommendations

• Towards better multi-class parametric-decomposition approximations for open queueing networks
• The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
• A robust queueing network analyzer based on indices of dispersion
• Queues with Slowly Varying Arrival and Service Processes

Cited in

(18)

• Class dependent departure process from multiclass phase queues: Exact and approximate analyses
• Decomposition approximations for time-dependent Markovian queueing networks
• Towards better multi-class parametric-decomposition approximations for open queueing networks
• Approximating class-departure variability in tandem queues with downtime events: regression-based variability function
• Point and interval estimation of decomposition error in discrete-time open tandem queues
• A hybrid method for performance analysis of \(G/G/m\) queueing networks
• Analysis of variance of customer balances for a family of stochastic service networks
• Taking account of correlations between streams in queueing network approximations
• Dependence among single stations in series and its applications in productivity improvement
• 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
• Buffer allocation in flow-shop-type production systems with general arrival and service patterns
• A robust queueing network analyzer based on indices of dispersion
• The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
• Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a machine learning approach
• The heavy-traffic bottleneck phenomenon under splitting and superposition
• Evaluation of the end-to-end delay of a multiphase queuing system using artificial neural networks
• A new renewal approximation for certain autocorrelated processes

This page was built for publication: Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

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