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
External control variance reduction for nonstationary simulation
WSC '83 Proceedings of the 15th conference on Winter simulation - Volume 1
Techniques for data-truncation in digital computer simulation.
Techniques for data-truncation in digital computer simulation.
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Steady-state simulation of queueing processes: survey of problems and solutions
ACM Computing Surveys (CSUR)
Proceedings of the 33nd conference on Winter simulation
Time dependent analysis of M/M/1 queue with server vacations and a waiting server
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
The transient solution to M/Ek/1 queue
Operations Research Letters
Modeling and analyzing transient military air traffic control
Proceedings of the Winter Simulation Conference
| Hi-index | 48.22 |
The transient probabilistic structure of M/Em/1 and Em/M/1 queues initialized in an arbitrary deterministic state is derived in discrete time. Computational algorithms for obtaining the required probabilities are provided, and their application in calculating a variety of system performance measures is illustrated. The results are used to investigate the question of initializing simulations of systems such as these to promote rapid convergence to steady state, if that is the object of the simulation. These results are consistent with earlier studies for transient queueing systems, such as the M/M/s, but allow greater flexibility in specification of interarrival or service-time models inherent in the Erlang distributions.