Large Deviations Theory and Efficient Simulation of Excessive Backlogs in a GI/GI/m Queue

IEEE Transactions on Automatic Control

Volumn 36, Issue 12, 1991, Pages 1383-1394

  Sadowsky, John S ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL TECHNIQUES - ESTIMATION;

BUFFER OVERFLOW; IMPORTANCE SAMPLING; LARGE DEVIATIONS THEORY;

PROBABILITY;

EID: 0026369804     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.106154     Document Type: Article

References (24)

1. V. Anantharam, “How large delays build up in a G//G/1 queue,” Queueing Systems, vol. 5, pp. 345-368, 1988.
2. S. Asmussen, “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., vol. 14, pp. 143-170, 1982.
3. R. R. Bahadur, “A note on the fundamental identity of sequential analysis,” Ann. Math. Statis., vol. 29, pp. 534-543, 1958.
4. J. A. Bucklew, P. Ney, and J. S. Sadowsky, “Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains,” J. Appl. Probab., pp. 44-59, 1990.
5. M. Cottrell, J.-C. Fort, and G. Malgouyres, “Large deviations and rare events in the study of stochastic algorithms,” IEEE Trans. Automat. Contr., vol. AC-28, pp. 907-920, 1983.
6. P. Dupuis, R. S. Ellis, and A. Weiss, “Large deviations for Markov processes with discontinuous statistics—Part I: General upper bounds,” Center for Appl. Math, and Math. Comp., Univ. Massachusetts, Amherst (preprint).
7. R. S. Ellis, “Large deviations for a general class of random vectors,” Ann. Probab., vol. 12, pp. 1-12, 1984.
8. W. Feller, An Introduction to Probability Theory and Its Application, Vol. II, 2nd ed. New York: Wiley, 1966.
9. S. Ghahramini, “On remaining fully busy periods of GI/G/c queues and their relation to stationary point processes,” J. Appl. Prob., vol. 27, pp. 232-236, 1990.
10. P. W. Glynn and D. L. Iglehart, “Importance sampling for stochastic simulations,” Management Sci., vol. 35, pp. 1367-1392, 1989.
11. J. M. Hammersley and D. C. Handscomb, Monte Carlo Methods. New York: Chapman and Hall, 1964.
12. J. Kiefer and J. Wolfowitz, “On the theory of queues with many servers,” Trans. Amer. Math. Soc, vol. 78, pp. 1-18, 1955.
13. “On the characteristics of the general queueing process with applications to random walks,” Ann. Math. Statis., vol. 27, pp. 147-161, 1956.
14. J. F.C. Kingman, “On the algebra of queues,” J. Appl. Prob., vol. 3, pp. 285-326, 1966.
15. C. Knessl, B. J. Matkowsky, Z. Schuss, and C. Tier, “An asymptotic theory of large deviations for Markov jump processes,” SIAM J. Appl. Math., vol. 46, pp. 1006-1028, 1985.
16. P. Ney and E. Nummelin, “Markov additive process I: Eigenvalue properties and limit theorems,” Ann. Probab., vol. 15, pp. 561-609, 1987, and
17. “Markov additive process II: Large deviations,” Ann. Probab., vol. 15, 1987.
18. J. Neveu, Discrete Parameter Martingales. New York: North Holland, 1975.
19. E. Nummelin, General Irreducible Markov Chains and Nonnegative Operators. Cambridge, U.K.: Cambridge University Press, 1984.
20. S. Parekh and J. Walrand, “A quick simulation method for excessive backlogs in networks of queues,” IEEE Trans. Automat. Contr., vol. 1, pp. 54-66, 1989.
21. J. S. Sadowsky, “A dependent data extension of Wald's identity and its application to sequential test performance computation,” IEEE Trans. Inform. Theory, vol. IT-35, pp. 834-842, 1989.
22. D. Siegmund, “Importance sampling in the Monte Carlo study of sequential tests,” Ann. Statis., vol. 4, pp. 673-684, 1976.
23. Y. Takahashi, “Asymptotic exponentiality of the tail of the waiting-time distribution in a PH/PH/c queue,” Adv. Appl. Prob., vol. 13, pp. 619-630, 1981.
24. W. Whitt, “Embedded renewal processes in the GI/G/s queue,” J. Appl. Prob., vol. 9, pp. 650-658, 1972.