Efficient simulation of a tandem Jackson network

The two-node tandem Jackson network serves as a convenient reference model for the analysis and testing of different methodologies and techniques in rare event simulation. In this paper we consider a new approach to efficiently estimate the probability that the content of the second buffer exceeds some high level L before it becomes empty, starting from a given state. The approach is based on a Markov additive process representation of the buffer processes, leading to an exponential change of measure to be used in an importance sampling procedure. Unlike changes of measures proposed and studied in recent literature, the one derived here is a function of the content of the first buffer. We prove that when the first buffer is finite, this method yields asymptotically efficient simulation for any set of arrival and service rates. In fact, the relative error is bounded independent of the level L; a new result which is not established for any other known method. When the first buffer is infinite, we propose a natural extension of the exponential change of measure for the finite buffer case. In this case, the relative error is shown to be bounded (independent of L) only when the second server is the bottleneck; a result which is known to hold for some other methods derived through large deviations analysis. When the first server is the bottleneck, experimental results using our method seem to suggest that the relative error is bounded linearly in L.

[1]  Paul Glasserman,et al.  Analysis of an importance sampling estimator for tandem queues , 1995, TOMC.

[2]  Philip Heidelberger,et al.  Fast simulation of steady-state availability in non-Markovian highly dependable systems , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[3]  Pieter-Tjerk de Boer,et al.  Dynamic importance sampling simulation of queueing networks: an adaptive approach based on cross-entropy , 2000 .

[4]  E. Çinlar.  Markov additive processes. II , 1972 .

[5]  P. Tsoucas.  Rare events in series of queues , 1992 .

[6]  P. Glasserman,et al.  Counterexamples in importance sampling for large deviations probabilities , 1997 .

[7]  P. Ney,et al.  MARKOV ADDITIVE PROCESSES II. LARGE DEVIATIONS , 1987 .

[8]  E. Çinlar.  Markov additive processes. I , 1972 .

[9]  J. Kingman.  A convexity property of positive matrices , 1961 .

[10]  Dirk P. Kroese,et al.  Efficient Simulation of Backlogs in Fluid Flow Lines , 1997 .

[11]  Philip Heidelberger,et al.  Fast simulation of rare events in queueing and reliability models , 1993, TOMC.

[12]  T. Chihara,et al.  An Introduction to Orthogonal Polynomials , 1979 .

[13]  Philip Heidelberger,et al.  Effective Bandwidth and Fast Simulation of ATM Intree Networks , 1994, Perform. Evaluation.

[14]  Jean C. Walrand,et al.  Decoupling bandwidths for networks: a decomposition approach to resource management , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Dirk P. Kroese,et al.  On the entrance distribution in RESTART simulation , 1999 .

[16]  Jean Walrand,et al.  A quick simulation method for excessive backlogs in networks of queues , 1989 .

[17]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[18]  R. Rubinstein.  The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .

[19]  Reuven Y. Rubinstein,et al.  Steady State Rare Events Simulation in Queueing Models and its Complexity Properties , 1994 .

[20]  Michael R. Frater,et al.  Optimally efficient estimation of the statistics of rare events in queueing networks , 1991 .

[21]  Michael R. Frater,et al.  Fast estimation of the statistics of excessive backlogs in tandem networks of queues , 1989 .

[22]  P. Ney,et al.  Markov Additive Processes I. Eigenvalue Properties and Limit Theorems , 1987 .