ANALYSIS FOR THE DESIGN OF SIMULATION EXPERIMENTS

This paper will be Chapter 13 in Simulation in the Elsevier series of Handbooks in Operations Research and Management Science, edited by Shane Henderson and Barry Nelson. Herein we discuss analysis for the design of simulation experiments. By that we mean, not the traditional (important) methods to design statistical experiments, but rather techniques that can be used, before a simulation is conducted, to estimate the computational effort required to obtain desired statistical precision for contemplated simulation estimators. In doing so, we represent computational effort by simulation time, and that in turn by either the number of replications or the run length within a single simulation run. We assume that the quantities of interest will be estimated by sample means. In great generality, the required length of a single simulation run can be determined by computing the asymptotic variance and the asymptotic bias of the sample means. Existing theory supports this step for a sample mean of a function of a Markov process. We would prefer to do the calculations directly for the intended simulation model, but that usually is prevented by model complexity. Thus, as a first step, we usually approximate the original model by a related Markovian model that is easier to analyze. For example, relatively simple diffusion-process approximations to estimate required simulation run lengths for queueing models can often be obtained by heavy-traffic stochastic-process limits.

[1]  W. Whitt,et al.  Transient behavior of the M/M/1 queue via Laplace transforms , 1988, Advances in Applied Probability.

[2]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[3]  Ward Whitt,et al.  Asymptotic Formulas for Markov Processes with Applications to Simulation , 1992, Oper. Res..

[4]  S. Karlin,et al.  A second course in stochastic processes , 1981 .

[5]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[6]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[7]  P. Glynn On the Markov property of the GI/G/∞ Gaussian limit , 1982, Advances in Applied Probability.

[8]  W. Whitt Planning queueing simulations , 1989 .

[9]  Winfried K. Grassmann,et al.  The asymptotic variance of a time average in a birth-death process , 1987 .

[10]  Ward Whitt,et al.  Dependence in packet queues , 1989, IEEE Trans. Commun..

[11]  P. Glynn Some asymptotic formulas for markov chains with applications to simulation , 1984 .

[12]  P. Glynn Poisson's equation for the recurrent M/G/1 queue , 1994, Advances in Applied Probability.

[13]  W. Whitt,et al.  The correlation functions of rbm and m/m/1 , 1988 .

[14]  P. Glynn A Lyapunov Bound for Solutions of Poisson's Equation , 1989 .

[15]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[16]  P. Glynn A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[17]  W. Whitt,et al.  PIECEWISE-LINEAR DIFFUSION PROCESSES , 1995 .

[18]  C. F. Jeff Wu,et al.  Experiments: Planning, Analysis, and Parameter Design Optimization , 2000 .

[19]  Karl Sigman Stationary marked point processes , 1995 .

[20]  W. Whitt Heavy-Traffic Limits for the G / H ∗ 2 / n / m Queue Ward Whitt , 2005 .

[21]  Paul Bratley,et al.  A guide to simulation , 1983 .

[22]  R. Srikant,et al.  Simulation run lengths to estimate blocking probabilities , 1996, TOMC.

[23]  E. L. Lehmann,et al.  Theory of point estimation , 1950 .

[24]  Ward Whitt,et al.  The Asymptotic Efficiency of Simulation Estimators , 1992, Oper. Res..

[25]  Ward Whitt,et al.  Transient behavior of the M/M/l queue: Starting at the origin , 1987, Queueing Syst. Theory Appl..

[26]  James J. Filliben,et al.  NIST/SEMATECH e-Handbook of Statistical Methods; Chapter 1: Exploratory Data Analysis , 2003 .

[27]  W. G. Cochran,et al.  Experimental Designs Second Edition , 1958 .

[28]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[29]  K. Sigman Stationary marked point processes : an intuitive approach , 1995 .

[30]  M. Braga,et al.  Exploratory Data Analysis , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[31]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[32]  Winfried K. Grassmann,et al.  Means and variances of time averages in Markovian environments , 1987 .

[33]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[34]  R. R. P. Jackson,et al.  Introduction to the Theory of Queues , 1963 .

[35]  D. Applebaum Stable non-Gaussian random processes , 1995, The Mathematical Gazette.

[36]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[37]  Jerry Banks,et al.  Discrete Event Simulation , 2002, Encyclopedia of Information Systems.

[38]  R. Srikant,et al.  Variance Reduction in Simulations of Loss Models , 1999, Oper. Res..

[39]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[40]  Ward Whitt,et al.  The Physics of the Mt/G/∞ Queue , 1993, Oper. Res..

[41]  Søren Asmussen,et al.  Applied probability and queues, Second Edition , 2003, Applications of mathematics.

[42]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.