A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
Journal of the ACM (JACM)
Use of Polya distributions in approximate solutions to nonstationary M/M/s queues
Communications of the ACM - Special issue on simulation modeling and statistical computing
Modeling computer systems with time-varying markov chains.
Modeling computer systems with time-varying markov chains.
External control variance reduction for nonstationary simulation
WSC '83 Proceedings of the 15th conference on Winter simulation - Volume 1
Time-dependent queueing network approximations as simulation external control variates
Operations Research Letters
| Hi-index | 0.00 |
This paper describes approximations for nonstationary queueing models. Explicit consideration of the time-dependent vector of probabilities associated with complex queueing systems requires numerical integration of the Chapman-Kolmogorov differential difference equations. The number of differential equations increases nonlinearly as the complexity of the system increases, for example priority or network systems. The research methods described in this paper are approximation approaches to reduce the number of differential equations numerially integrated, or simulated, necessary to represent complex stochastic models to a small and possibly constant number.