Analysis of an Importance Sampling Estimator for Tandem Queues

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Volumn 5, Issue 1, 1995, Pages 22-42

  Glasserman, Paul ^a   Kou, Shing Gang ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

importance sampling; Markov chains; queueing networks; rare events

Indexed keywords

EID: 84976805635     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/203091.203093     Document Type: Article

References (20)

1. ANANTHARAM, V. 1989. The optimal buffer allocation problem. IEEE Trans. Inf. Theor. 35, 721-725.
2. ANANTHARAM, V., AND GANESH, A. Correctness within a constant of an optimal buffer allocation rule of thumb. IEEE Trans. Inf. Theor. (to appear).
3. ANANTHARAM, V., HEIDELBERGER, P., AND TSOUCAS, P. 1990. Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation. IBM Res. Rep. RC16820. Yorktown Heights, N.Y.
4. ASMUSSEN, S. 1982. Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/1 queue. Adv. Appl. Prob. 14, 143-170.
5. ASMUSSEN, S. 1987. Applied Probability and Queues. Wiley, New York.
6. BUCKLEW, J. A. 1990. Large Deviations Techniques in Decision, Simulation, and Estimation. Wiley, New York.
7. CHANG, C. S., HEIDELBERGER, P., JUNEJA, S., AND SHAHABUDDIN, P. 1994 Effective bandwidth and fast simulation of ATM Intree Networks. Perform. Eval. 20, 45-65.
8. DUPUIS, P., ISHII, H., AND SONER, H. M. 1990. A viscosity solution approach to the asymptotic analysis of queueing systems. Ann. Probab. 18, 226-255.
9. FRATER, M. R., LENON, T. M., AND ANDERSON, B. D. O. 1991. Optimally efficient estimation of the statistics of rare events in queueing networks. IEEE Trans. Autom. Control TAC-36, 1395-1405.
10. GLASSERMAN, P., AND KOU, S.-G. 1993. Overflow probabilities in Jackson networks. In Proceedings of the 32nd IEEE Conference on Decision and Control. IEEE Press, New York, 3178-3182.
11. GLYNN, P. W., AND IGLEHART, D. L. 1989. Importance sampling for stochastic simulations. Manage. Sci. 35, 1367-1392.
12. JANSON, S. 1986. Moments for first-passage and last-exit times, the minimum, and related quantities for random walks with positive drift. Adv. Appl. Probab. 18, 865-879.
13. KELLY, F. J. 1979. Reversibility and Stochastic Networks. Wiley, New York.
14. KESIDIS, G., AND WALRAND, J. 1993. Quick simulation of ATM buffers with on-off multiclass Markov fluid sources. ACM Trans. Model. Comput. Simul. 3, 269-276.
15. PAREKH, S., AND WALRAND, J. 1989. Quick simulation of rare events in networks. IEEE Trans. Autom. Control TAC-34, 54-66.
16. SADOWSKY, J. S. 1991. Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queues. IEEE Trans. Autom. Control TAC-36, 1383-1394.
17. SIEGMUND, D. 1976. Importance sampling in the Monte Carlo study of sequential tests. Ann. Statist. 4, 673-684.
18. SIMON, B. 1979. Functional Integration and Quantum Physics. Academic Press, New York.
19. TSOUCAS, P. 1992. Rare events in series of queues. J. Appl. Probab. 29, 168-175.
20. WEBER, R. R. 1979. The interchangeability of M/M/l queues in series. J. Appl. Probab. 16, 690-695.