Estimating Customer and Time Averages

In this paper we establish a joint central limit theorem for customer and time averages by applying a martingale central limit theorem in a Markov framework. The limiting values of the two averages appear in the translation terms. This central limit theorem helps to construct confidence intervals for estimators and perform statistical tests. It thus helps determine which finite average is a more asymptotically efficient estimator of its limit. As a basis for testing for PASTA Poisson arrivals see time averages, we determine the variance constant associated with the central limit theorem for the difference between the two averages when PASTA holds.

[1]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[2]  J. Kemeny,et al.  Finite Continuous Time Markov Chains , 1961 .

[3]  Averill M. Law.  Efficient estimators for simulated queueing systems , 1974 .

[4]  D. Iglehart,et al.  Discrete time methods for simulating continuous time Markov chains , 1976, Advances in Applied Probability.

[5]  Averill M. Law,et al.  Conservation equations and variance reduction in queueing simulations , 1977, WSC '77.

[6]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[7]  P. Brémaud.  Point Processes and Queues , 1981 .

[8]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

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

[10]  Ward Whitt,et al.  Sufficient conditions for functional-limit-theorem versions ofL = λW , 1987, Queueing Syst. Theory Appl..

[11]  Ward Whitt,et al.  A central-limit-theorem version ofL=λw , 1986, Queueing Syst. Theory Appl..

[12]  P. Glynn,et al.  Central-limit-theorem version of L = λW , 1987 .

[13]  Ward Whitt,et al.  Ordinary CLT and WLLN Versions of L = λW , 1988, Math. Oper. Res..

[14]  P. Glynn,et al.  A new class of strongly consistent variance estimators for steady-state simulations , 1988 .

[15]  W. Whitt,et al.  On averages seen by arrivals in discrete time , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

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

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

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

[19]  R. Serfozo.  Poisson functionals of Markov processes and queueing networks , 1989 .

[20]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Theory of martingales , 1989 .

[21]  Pierre Brémaud,et al.  Characteristics of queueing systems observed at events and the connection between stochastic intensity and palm probability , 1989, Queueing Syst. Theory Appl..

[22]  Ward Whitt,et al.  Indirect Estimation Via L = λW , 1989, Oper. Res..

[23]  Ward Whitt,et al.  On Arrivals That See Time Averages , 1990, Oper. Res..

[24]  R. Durrett.  Probability: Theory and Examples , 1993 .

[25]  W. Whitt,et al.  On arrivals that see time averages : a martingale approach , 1990 .

[26]  P. Brémaud,et al.  Event and time averages: a review , 1992 .

[27]  David D. Yao,et al.  On Wolff's Pasta Martingale , 1992, Oper. Res..

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

[29]  Paul Glasserman,et al.  Filtered Monte Carlo , 1993, Math. Oper. Res..

[30]  Halim Damerdji,et al.  Strong Consistency of the Variance Estimator in Steady-State Simulation Output Analysis , 1994, Math. Oper. Res..

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

[32]  Remo Guidieri.  Res , 1995, RES: Anthropology and Aesthetics.