Abstract
In some B-ISDN applications running on ATM networks (e.g., for audio/video connections), the occasional loss of a single ATM cell may not affect the user’s perceived QoS requirement. However, the QoS may be degraded due to the loss of a multiple (consecutive) ATM cells. As the event of consecutive cell loss is (typically) rare, its probability cannot be estimated efficiently using standard simulation. In this paper we propose a fast simulation method, based on importance sampling, to efficiently estimate the probability of a rare consecutive-cell-loss event. As an example, we consider a queueing model of the Leaky Bucket source policing algorithm, operating in a bursty traffic environment. We present empirical results to demonstrate the validity and effectiveness of our fast simulation method.
Chapter PDF
Similar content being viewed by others
References
Bucklew, J. A. (1990) Large Deviation Techniques in Decision, Simulation and Estimation. New York, NY: J. Wiley & Sons, Inc.
Chang, C. S., P. Heidelberger, S. Juneja and P. Shahabuddin. (1993) Effective bandwidth and fast simulation of ATM intree networks. In Proc. of the Performance’83 conference.
Cooper, R. B. (1981) Introduction to Queueing Theory. London: Arnold.
Hammersley, J. M. and D. C. Handscomb. (1964) Monte Carlo Methods. London: Methuen.
Hoffes, H. and D. M. Lucantoni. (1986) A Markov modulated characterization of paeketizod voice and data traffic and related statistical multiplexer performance. IEEE J. Select. Areas Commun. 4, 6: 856–868.
Heidelberger, P. (1993) Fast simulation of rare events in queueing and reliability models. In Models and Techniques for Performance Evaluation of Computer and Communications Systems, Springer-Verlag, Lecture Notes in Comp. Sc., 729: 165–202.
Nicola, V. F., P. Shahabuddin and P. Heidelberger. (1993) Techniques for fast simulation of highly dependable systems. In Proc. of the Second International Workshop on Performability Modelling of Computer and Communication Systems.
Nicola, V. F., G. A. Hagesteijn and B. G. Kim. (1994) Fast simulation of the Leaky Bucket algorithm. In Proceedings of the 1994 Winter Simulation Conference, IEEE Press, 266–273.
Parekh, S. and J. Walrand. (1989) A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Autom. Contr. 34, 1: 54–66.
Rathgeb, E. P. (1991) Modeling and performance comparison of policing mechanisms for ATM networks. IEEE J. Select. Areas Commun. 9, 3: 325–334.
Sadowsky, J. S. (1991) Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/rn queue. IEEE Duns. Autom. Contr. 36, 12: 1383–1394.
Turner, J. S. (1986) New directions in communications (or which way to the information age?). IEEE Commun. Mag. 25, 10: 8–15.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Nicola, V.F., Hagesteijn, G.A. (1996). Efficient Simulation of Consecutive Cell Loss in ATM Networks. In: Kouvatsos, D.D. (eds) ATM Networks. ATM 1995. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35068-4_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-35068-4_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2902-2
Online ISBN: 978-0-387-35068-4
eBook Packages: Springer Book Archive