Decomposition approximations for time-dependent Markovian queueing networks

DOI10.1016/S0167-6377(99)00007-3MaRDI QIDQ1306456zbMATH OpenOpenAlexFDO

Authors Ward Whitt

Publication date 4 October 1999

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

Full work available at URL https://doi.org/10.1016/s0167-6377(99)00007-3

zbMATH Keywords

systems of ordinary differential equationsair traffic managementdecomposition approximationsproduct-form approximationsproduct-form queueing networkstelephone call centerstime-dependent Markov chains

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Recommendations

• Equivalence and decomposition in queueing systems—A unified approach
• Asymptotically exact decomposition approximations for open queueing networks
• scientific article; zbMATH DE number 3872446
• Decomposition of queueing networks with dependent service and negative customers
• Decomposition and aggregation in queueing networks

Cites work

• A Closure Approximation for the Nonstationary M/M/s Queue
• Decomposition Algorithms for Analyzing Transient Phenomena in Multiclass Queueing Networks in Air Transportation
• Networks of infinite-server queues with nonstationary Poisson input
• Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
• Server Staffing to Meet Time-Varying Demand
• Some Effects of Nonstationarity on Multiserver Markovian Queueing Systems
• Strong approximation for Markovian service networks
• Time-dependent queueing network approximations as simulation external control variates
• Uniform acceleration expansions for Markov chains with time-varying rates
• Variability Functions for Parametric-Decomposition Approximations of Queueing Networks

Cited in

(8)

• Equivalence and decomposition in queueing systems—A unified approach
• scientific article; zbMATH DE number 3872446 (Why is no real title available?)
• The analytical method of transient behavior of the \(M|M|1|n\) queuing system for piece-wise constant information flows
• Nonstationary analysis of the loss queue and of queueing networks of loss queues
• Approximate transient analysis of queuing networks by quasi product forms
• Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
• Algorithmic Computation of the Time-Dependent Solution of Structured Markov Chains and Its Application to Queues
• On decomposition of closed networks with dependent service times

This page was built for publication: Decomposition approximations for time-dependent Markovian queueing networks

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