Decomposition approximations for time-dependent Markovian queueing networks
DOI10.1016/S0167-6377(99)00007-3zbMATH Open0967.90026OpenAlexW2037897258MaRDI QIDQ1306456FDOQ1306456
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
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
systems of ordinary differential equationsair traffic managementdecomposition approximationsproduct-form approximationsproduct-form queueing networkstelephone call centerstime-dependent Markov chains
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)
Cites Work
- Networks of infinite-server queues with nonstationary Poisson input
- Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
- Strong approximation for Markovian service networks
- Some Effects of Nonstationarity on Multiserver Markovian Queueing Systems
- Server Staffing to Meet Time-Varying Demand
- A Closure Approximation for the Nonstationary M/M/s Queue
- Uniform acceleration expansions for Markov chains with time-varying rates
- Decomposition Algorithms for Analyzing Transient Phenomena in Multiclass Queueing Networks in Air Transportation
- Time-dependent queueing network approximations as simulation external control variates
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
Cited In (8)
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- On decomposition of closed networks with dependent service times
- Equivalence and decomposition in queueing systems—A unified approach
- The analytical method of transient behavior of the \(M|M|1|n\) queuing system for piece-wise constant information flows
- Title not available (Why is that?)
- Approximate transient analysis of queuing networks by quasi product forms
- Algorithmic Computation of the Time-Dependent Solution of Structured Markov Chains and Its Application to Queues
- Nonstationary analysis of the loss queue and of queueing networks of loss queues
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)
