Statistical efficiency of regenerative simulation methods for networks of queues
- 1 March 1983
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 15 (1) , 183-197
- https://doi.org/10.2307/1426989
Abstract
This paper is concerned with the assessment of the statistical efficiency of proposed regenerative simulation methods. We compare the efficiency of the ‘marked job' and ‘labelled jobs' methods for estimation of passage times in multiclass networks of queues with general service times. Using central limit theorem arguments, we show that the confidence intervals constructed for the expected value of a general function of the limiting passage time using the labelled jobs method are shorter than those obtained from the marked job method. This is consistent with intuition since the labelled jobs method extracts more passage-time information from a fixed-length simulation run.Keywords
This publication has 9 references indexed in Scilit:
- Simulation for passage times in closed, multiclass networks of queues with unrestricted prioritiesPerformance Evaluation, 1982
- Regenerative Simulation of Networks of Queues with General Service Times: Passage Through SubnetworksIBM Journal of Research and Development, 1982
- Regenerative simulation of response times in networks of queues: statistical efficiencyActa Informatica, 1981
- Continuity of Generalized Semi-Markov ProcessesMathematics of Operations Research, 1980
- Regenerative Simulation of Response Times in Networks of QueuesPublished by Springer Nature ,1980
- Discrete time methods for simulating continuous time Markov chainsAdvances in Applied Probability, 1976
- Discrete time methods for simulating continuous time Markov chainsAdvances in Applied Probability, 1976
- Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event SimulationsOperations Research, 1975
- Functional limit theorems for the queue GI/G/1 in light trafficAdvances in Applied Probability, 1971