Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

DOI10.1287/mnsc.41.10.1704zbMath0865.60077MaRDI QIDQ5689383

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 traffic; tandem queues; queueing network; two-moment approximation

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)

Related Items

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, Dependence among single stations in series and its applications in productivity improvement, The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes, 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, Class dependent departure process from multiclass phase queues: Exact and approximate analyses, Decomposition approximations for time-dependent Markovian queueing networks, Approximating class-departure variability in tandem queues with downtime events: regression-based variability function, A hybrid method for performance analysis of \(G/G/m\) queueing networks, Taking account of correlations between streams in queueing network approximations