Fast Simulation of Packet Loss Rates in a Shared Buffer Communications Switch

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Volumn 5, Issue 4, 1995, Pages 306-325

  Chang, Cheng Shang ^a   Heidelberger, Philip ^b   Shahabuddin, Perwez ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Commumcations switch; importance sampling; packet loss; queuing model; rare event; simulation; variance reduction

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; CHANNEL CAPACITY; MATHEMATICAL MODELS; PACKET NETWORKS; PROBABILITY; QUEUEING THEORY; TELECOMMUNICATION TRAFFIC;

BUFFER OVERFLOW; IMPORTANCE SAMPLING; PACKET LOSS RATES; QUEUEING MODEL; RARE EVENT; SHARED BUFFER COMMUNICATION SWITCH; VARIANCE REDUCTION;

COMPUTER SIMULATION;

EID: 0029389492     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/226275.226277     Document Type: Article

References (38)

1. Asmussen S. 1989. Risk theory in a Markovian environment. Scand. Actuarial J., 69“ 100.
2. Asmussen, S. 1987. Applied Probability and Queues. John Wiley, New York.
3. Asmussen, S. 1985. Conjugate processes and the simulation of ruin problems. Stochastic Process. Appl. 20, 213–229.
4. Bratley, P., Fox, B. L., and Schrage, L. E. 1987. A Guide to Simulation, 2nd ed., Springer-Verlag, New York.
5. Breiman, L. 1968. Probability. Addison-Wesley, Reading, MA.
6. Bucklew, J. 1990. Large Deviation Techniques in Decision, Simulation and Estimation. Wiley, New York,
7. Bucklew, J. A., ney, P., and sadowsky, J. S. 1990. Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains. J. Appl. Probab 27, 44–99.
8. Chang, C. S. 1994. Stability, queue length and delay of deterministic and stochastic queueing networks. IEEE Trans. Autom. Control 39, 913–931.
9. Chang, C. S. 1992. Stability, queue length and delay, Part II: Stochastic queueing networks. In Proceedings of the Thirty-First IEEE Conference on Decision and Control (Tucson, AZ), IEEE Computer Society Press, Los Alamitos, CA, 1005–1010.
10. 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.
11. chang, c. s., heidelberger, P., juneja, s., and shahabuddin, P. 1993. The application of effective bandwidth to fast simulation of communication networks. IBM Res. Rep. RC 18877, Yorktown Heights, New York.
12. Cogburn, R. 1975. A uniform theory for sums of Markov chain transition probabilities. Ann. Probab. 3, 191–214.
13. Crane, M. A. and iglehart, D. L. 1975 Simulating stable stochastic system III: regenerative processes and discrete event simulation. Oper. Res. 23, 33–45.
14. Ellis, R. 1984. Large deviations for a general class of random vectors. Ann. Probab, 12, 1–12. elwalid, A. I. and mitra, D. 1993. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/ACM Trans. Netw. 1, 329–343.
15. Elwalid, A. I. and mitra, D. 1994. Statistical multiplexing with loss priorities in rate-based congestion control of high speed networks. IEEE Trans. Commun. 42, 11, 2989–3002.
16. Elwalid, A. I. and mitra, D. 1992. Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic. In Proceedings of the IEEE INFOCOM Conference (Florence). IEEE Press, Piscataway, NJ, 415–425.
17. Frater, M. R. and anderson, B. D. O. 1989. Fast estimation of the statistics of excessive backlogs in tandem networks of queues. Aust. Telecomm. Res. 23, 49–55.
18. Frater, M. R., bitmead, R. R., kennedy, R. A., and anderson, B. D. O. 1989. Rare events and reverse time models. In Proceedings of the Twenty-Eighth Conference on Decision and Control (Tampa, FL, Dec 13–15), IEEE Press, Piscataway, NJ, 1180–1183.
19. 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 36, 1395–1405 GARTNER, J. 1977. On large deviations from invariant measure. Theor. Probab. Appl. 22, 24–39.
20. Gibbens, R. J. and hunt, P. J. 1991. Effective bandwidths for the multi-type UAS channel. Queueing Syst. 9, 17–28.
21. Glasserman, P. and Kou, S. G. 1993. Overflow probabilities in Jackson networks. In Proceedings of the Thirty-Second IEEE Conference on Decision and Control (San Antonio, TX, Dec. 15–17), IEEE Press, Piscataway, NJ, 3178–3182.
22. Glynn, P. W. and iglehart, D. L. 1989. Importance sampling for stochastic simulations. Manage. Sci. 35, 1367–1392.
23. Guerin, R., Ahmadi,H., and Naghshineh, M. 1991. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Select. Areas Commun. 9, 968–981
24. Hammersley, J. M. and handscomb, D. C. 1964. Monte Carlo Methods. Methuen and Co., Ltd., London.
25. Heidelberger, P. 1993. Fast simulation of rare events in queueing and reliability models. ACM Trans. Model Comput, Simul. 5, 42–85. kelly F. P. 1991. Effective bandwidths at multi-class queues. Queueing Syst. 9, 5–16.
26. 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.
27. Lehtonen, T. and Nyrhinen, H. 1992. Simulating level-crossing probabilities by importance sampling. Advances Appl. Probab. 24, 858–874.
28. Lehtonen, T. and Nyrhinen, H. 1992. On asymptotically efficient simulation of ruin probabilities in a Markovian environment. Scand. Actuarial. J., 60–75.
29. Nicola, V. F., shahabuddin, P., and heidelberger, P. 1993. Techniques for fast simulation of highly dependable systems. In Proceedings of the Second International Workshop on Performability Modeling of Computer and Communication Systems (La Mont Saint-Michel, France, June 28–30).
30. Nicola, V. F., shahabuddin, P., Heidelberger, P., and glynn, P. W. 1998. Fast simulation of steady-state availability in non-Markovian highly dependable systems. In Proceedings of the Twenty-Third International Symposium on Fault-Tolerant Computing (Toulouse, France, June 22–24), IEEE Computer Society Press, Piscataway, NJ, 38–47.
31. Parekh, S. and Walrand, J. 1989. A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Autom. Control 34, 54–56.
32. Sadowsky, J. S. 1993. On the optimality and stability of exponential twisting in Monte Carlo estimation. IEEE Trans. Inf. Theory 39, 119–128.
33. Sadowsky, J. S. 1991. Large deviations and efficient simulation of excessive backlogs in a GI/G/m queue, IEEE Trans. Autom. Control 36, 1383–1394.
34. Sadowsky, J. S. and bucklew, J. A. 1990. On large deviations theory and asymptotically efficient Monte Carlo estimation. IEEE Trans. Inf. Theory 36, 579–588.
35. Shahabuddin, P. 1994. Importance sampling for the simulation of highly reliable Markovian systems. Manage. Sci. 40, 333–352.
36. Siegmund, D. 1976. Importance sampling in the Monte Carlo study of sequential tests. Ann. Stat. 4, 673–684.
37. Smith, W. L. 1955. Regenerative stochastic processes. Proc. Roy. Soc. Ser. A 232, 6–31.
38. Whitt, W. 1993. Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues. Telecomm. Syst. 2, 71–107.