Analysis of an importance sampling estimator for tandem queues

We analyze the performance of an importance sampling estimator for a rare-event probability in tandem Jackson networks. The rare event we consider corresponds to the network population reaching K before returning to ø, starting from ø, with K large. The estimator we study is based on interchanging the arrival rate and the smallest service rate and is therefore a generalization of the asymptotically optimal estimator for an M/M/1 queue. We examine its asymptotic performance for large K, showing that in certain parameter regions the estimator has an asymptotic efficiency property, but that in other regions it does not. The setting we consider is perhaps the simplest case of a rare-event simulation problem in which boundaries on the state space play a significant role.

[1]  D. Siegmund.  Importance Sampling in the Monte Carlo Study of Sequential Tests , 1976 .

[2]  R. Weber.  THE INTERCHANGEABILITY OF -/M/1 QUEUES IN SERIES , 1979 .

[3]  B. Simon.  Functional integration and quantum physics , 1979 .

[4]  S. Asmussen.  Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/ 1 queue , 1982 .

[5]  S. Janson.  Moments for first-passage and last-exit times, the minimum, and related quantities for random walks with positive drift , 1986, Advances in Applied Probability.

[6]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

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

[8]  R. D. Fresnedo.  Quick simulation of rare events in networks , 1989, WSC '89.

[9]  Venkat Anantharam.  The optimal buffer allocation problem , 1989, IEEE Trans. Inf. Theory.

[10]  Donald L. Iglehart,et al.  Importance sampling for stochastic simulations , 1989 .

[11]  P. Dupuis,et al.  A VISCOSITY SOLUTION APPROACH TO THE ASYMPTOTIC ANALYSIS OF QUEUEING SYSTEMS , 1990 .

[12]  J. Sadowsky.  Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue , 1991 .

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

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

[15]  Jean C. Walrand,et al.  Quick simulation of ATM buffers with on-off multiclass Markov fluid sources , 1993, TOMC.

[16]  Paul Glasserman,et al.  Overflow probabilities in Jackson networks , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[17]  Venkat Anantharam,et al.  Correctness within a constant of an optimal buffer allocation rule of thumb , 1994, IEEE Trans. Inf. Theory.

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