Queueing network simulation analysis: developing efficient simulation methodology for complex queueing networks

ABSTRACT

Simulation can provide insight to the behavior of a complex queueing system by identifying the response surface of several performance measures such as delays and backlogs. However, simulations of large systems are expensive both in terms of CPU time and use of available resources (e.g. processors). Thus, it is of paramount importance to carefully select the inputs of simulation in order to adequately capture the underlying response surface of interest and at the same time minimize the required number of simulation runs. In this study, we present a methodological framework for designing efficient simulations for complex networks. Our approach works in sequential and combines the methods of CART (Classification And Regression Trees) and the design of experiments. A generalized switch model is used to illustrate the proposed methodology and some useful applications are described.

REFERENCES

• 1: Alexander, W. P., and S. D. Grimshaw. 1996. Treed regression. Journal of Computational and Graphical Statistics 5: 156--175.
• 2: Baccelli, F., and P. Bremaud. 1994. Elements of queueing theory. Berlin: Springer-Verlag.
• 3: Nicholas Bambos , George Michailidis, ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS, Probability in the Engineering and Informational Sciences, v.16 n.2, p.185-203, April 2002 [doi>10.1017.S0269964802162048]
• 4: George E P Box , Norman R Draper, Empirical model-building and response surface, John Wiley & Sons, Inc., New York, NY, 1986
• 5: Breiman, L., J. H. Friedman, R. A. Olshen, and C. J. Stone. 1984. Classification and regression trees. Monterey: Wadsworth.
• 6: Currin, C., T. Mitchell, M. Morris, and D. Ylvisaker. 1991. Bayesian prediction of deterministic functions with applications to the design and analysis of computer experiments. Journal of the American Statistical Association 86: 953--963.
• 7: Dai, J. G., and S. P. Meyn. 1994. Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Transactions on Automatic Control 40: 1889--1904.
• 8: Dai, J. G. 1995. On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 5: 49--77.
• 9: Federov, V. V. 1972. Theory of optimal experiments. New York: Academic Press.
• 10: Friedman, J. 1991. Multivariate adaptive regression splines. Annals of Statistics 19: 1--141.
• 11: Hajek, B. 1982. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability 14: 502--525.
• 12: Hung, Y. C. 2002. Modeling and analysis of stochastic networks with shared resources. Ph.D. thesis. Department of Statistics, The University of Michigan, Ann Arbor, Michigan.
• 13: Meyn, S. P. 1996. Stability and optimization of queueing networks and their fluid models. Proceedings of the Summer Seminar on "The Mathematics of Stochastic Manufacturing Systems", 17--21.
• 14: Sacks, J., W. J. Welch, T. J. Mitchell, and H. P. Wynn. 1989. Design and analysis of computer experiments. Statistical Science 4: 409--423.
• 15: Schwartz, A., and G. Weiss. 1994. Large deviations for performance analysis, queues, communication and computing. New York: Chapman and Hall.
• 16: Serfozo, R. 1999. Introduction to stochastic networks. New York: Springer.
• 17: Walrand, J. 1988. Introduction to queueing networks. Englewood Cliffs: Prentice Hall.
• 18: Wu, C. F. J., and M. Hamada. 2000. Experiments: Planning, analysis, and parameter design. New York: Wiley.
• 19: Cathy H. Xia , George Michailidis , Nicholas Bambos , Peter W. Glynn, OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE, Probability in the Engineering and Informational Sciences, v.16 n.3, p.289-307, July 2002 [doi>10.1017.S0269964802163029]