Skip to main content
Log in

Simulation methodology — An introduction for queueing theorists

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Simulation is a widely used methodology for queueing systems. Its superficial simplicity hides a number of pitfalls which are not all as well known as they should be. In particular simulation experiments need careful design and analysis as well as good presentations of the results. Even the elements of simulation such as the generation of arrival and service times have a chequered history with major problems lying undiscovered for 20 years. On the other hand, good simulation practice can offer much more than is commonly realized.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.M. Appleton, Modelling the performance of token ring digital telephone exchanges, Unpublished Ph.D. thesis, University of Strathclyde, 1986.

  2. J.M. Appleton and M.M. Peterson, Traffic analysis of a token ring PBX, IEEE Trans. COM-34 (1986) 417–422.

    Google Scholar 

  3. G.E.P. Box, W.G. Hunter and J.S. Hunter,Statistics for Experimenters (Wiley, New York, 1978).

    Google Scholar 

  4. P. Bratley, B.L. Fox and L.E. Schrage,A Guide to Simulation (Springer-Verlag, New York, 1983).

    Google Scholar 

  5. J.S. Carson and A.M. Law, Conservation equations and variance reduction in queueing simulations, Oper. Res. 28 (1980) 535–546.

    Google Scholar 

  6. G. Carter and E.J. Ignall, Virtual measures: a variance reduction technique for simulation, Manag. Sci. (Applications) 21 (1975) 607–616.

    Google Scholar 

  7. R.C.H. Cheng, The use of antithetic variates in computer simulations, J. Oper. Res. Soc. 33 (1982) 229–237.

    Google Scholar 

  8. R.C.H. Cheng and G.M. Feast, Some simple gamma variate generators, Appl. Statist. 28 (1979) 290–295.

    Google Scholar 

  9. W.G. Cochran,Sampling Techniques, 2nd ed. (Wiley, New York, 1963).

    Google Scholar 

  10. M. Cotterell, J. Fort and G. Malgouyres, Large deviations and rare events in the study of stochastic algorithms, IEEE Trans. AC-28 (1983) 907–920.

    Google Scholar 

  11. D.R. Cox and W.L. Smith,Queues (Methuen, London, 1961).

    Google Scholar 

  12. M.A. Crane and A.J. Lemoine,An Introduction to the Regenerative Method for Simulation Analysis, Lect. Notes Control Inform. Sci. 4 (1977).

  13. L. Devroye,Non-Uniform Random Variate Generation (Springer-Verlag, New York, 1986).

    Google Scholar 

  14. B. Efron,The Jacknife, the Bootstrap and Other Resampling Plans (SIAM, Philadelphia, 1982).

    Google Scholar 

  15. A.V. Garfarian, C.J. Ancker, Jr. and T. Morisaka, Evaluation of commonly used rules for detecting “steady state” in computer simulation, Nav. Res. Log. Q. 24 (1978) 667–678.

    Google Scholar 

  16. E.J. Hannan, The variance of the mean of a stationary process. J. Roy. Statist. Soc. B 19 (1957) 282–285.

    Google Scholar 

  17. P. Heidelberger and P.D. Welch, A spectral method for confidence interval generation and run length control in simulations, Comm. Assoc. Comput. Match. 24 (1981) 233–245.

    Google Scholar 

  18. P. Heidelberger and P.D. Welch, Simulation run length control in the presence of an initial transient, Oper. Res. 31 (1983) 1109–1144.

    Google Scholar 

  19. D.C. Hoaglin and D.F. Andrews, The reporting of computation-based results in statistics, Amer. Statist. 29 (1975) 122–126.

    Google Scholar 

  20. D.L. Iglehart and G.S. Shedler,Regenerative Simulation of Response Times in Networks of Queues, Lect. Notes Control Inform. Sci. 26 (1980).

  21. W.J. Kennedy, Jr. and J.E. Gentle,Statistical Computing (Dekker, New York, 1980).

    Google Scholar 

  22. J.P.C. Kleijnen,Statistical Techniques in Simulation, Parts 1 and 2 (Marcel Dekker, New York, 1974/5).

    Google Scholar 

  23. J.P.C. Kleijnen, R. Van der Ven and B. Sanders, Testing independence of simulation subruns: a note on the power of the von Neumann test, Eur. J. Oper. Res. 9 (1982) 92–93.

    Google Scholar 

  24. S.S. Lavenberger, T.L. Moeller and P.D. Welch, Statistical results on control variables with application to queueing network simulation, Oper. Res. 30 (1982) 182–202.

    Google Scholar 

  25. M.S. Meketon and P. Heidelberger, A renewal theoretic approach to bias reduction in regenerative simulation, Manag. Sci. 28 (1982) 173–181.

    Google Scholar 

  26. B. Mitchell, Variance reduction by antithetic variates in GI/G/1 queueing simulations, Oper. Res. 21 (1973) 988–997.

    Google Scholar 

  27. P.A.P. Moran, The estimation of standard errors in Monte Carlo simulation experiments, Biometrika 62 (1975) 1–4.

    Google Scholar 

  28. B.J.T. Morgan,Elements of Simulation (Chapman & Hall, London, 1984).

    Google Scholar 

  29. G.F. Newell,Applications of Queueing Theory, 2nd ed. (Chapman and Hall, London, 1982).

    Google Scholar 

  30. E.S. Page, On Monte Carlo methods in congestion problems II — simulation of queueing systems, Oper. Res. 13 (1965) 300–305.

    Google Scholar 

  31. S. Parekh and J. Walrand, Quick simulation of excessive backlogs in networks of queues, Preprint, 1987.

  32. B.D. Ripley,Stochastic Simulation (Wiley, New York, 1987).

    Google Scholar 

  33. B.D. Ripley, Uses and abuses of statistical simulation, Math. Progr. Studies (1988).

  34. S.M. Ross,Applied Probability Models with Optimization Applications (Holden-Day, San Francisco, 1970).

    Google Scholar 

  35. M. Rubinovitch, The slow server problem, J. Appl. Probab. 22 (1985) 205–213.

    Google Scholar 

  36. L.W. Schruben, Confidence interval estimation using standardized time series, Oper. Res. 31 (1983) 1090–1108.

    Google Scholar 

  37. L.W. Schruben and B.H. Margolin, Pseudo-random number assignment in statistically designed simulation and distribution sampling experiments, J. Amer. Statist. Assoc. 73 (1978) 504–525.

    Google Scholar 

  38. L.W. Schruben, H. Singh and L. Tierney, Optimal tests for initialization bias in simulation output, Oper. Res. 31 (1983) 1167–1178.

    Google Scholar 

  39. “Student”, The probable error of a mean, Biometrika 6 (1908) 1–25.

    Google Scholar 

  40. H.M. Wagner,Principles of Operations Research, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1975).

    Google Scholar 

  41. P.D. Welch, The statistical analysis of simulation results, inThe Computer Performance Modeling Handbook, ed. S.S. Lavenberg (Academic Press, New York, 1983) pp. 268–328.

    Google Scholar 

  42. W. Whitt, Untold horrors of the waiting room: what the steady-state distribution will never tell us about the queue length process, Manag. Sci. 29 (1983) 395–408.

    Google Scholar 

  43. J.R.B. Whittlesey, On the multidimensional uniformity of pseudorandom generator, Commun. Assoc. Comput. Mach. 12 (1969) 247.

    Google Scholar 

  44. J.R. Wilson and A.A.B. Pritsker, A survey of research on the simulation start-up problem, Simulation 31 (1978) 55–58.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ripley, B.D. Simulation methodology — An introduction for queueing theorists. Queueing Syst 3, 201–220 (1988). https://doi.org/10.1007/BF01161215

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01161215

Keywords

Navigation