Abstract
A goal of modern broadband networks is their ability to provide stringent QoS guarantees to different classes of users. This feature is often related to events with a small probability of occurring, but with severe consequences when they occur.
In this paper we focus on the overflow probability estimation and analyze the performance of Bridge Monte-Carlo (BMC), an alternative to Importance Sampling (IS), for the Monte-Carlo estimation of rare events with Gaussian processes.
After a short description of BMC estimator, we prove that the proposed approach has clear advantages over the widespread single-twist IS in terms of variance reduction. Finally, to better highlight the theoretical results, we present some simulation outcomes for a single server queue fed by fraction Brownian motion, the canonical model in the framework of long range dependent traffic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dȩbicki, K., Mandjes, M.R.H.: Exact overflow asymptotics for queues with many Gaussian inputs. Technical Report PNA-R0209, CWI, the Netherlands (2002)
Narayan, O.: Exact asymptotic queue length distribution for fractional Brownian traffic. Advances in Performance Analysis 1(1), 39–63 (1998)
Norros, I.: Studies on a model for connectionless traffic, based on fractional Brownian motion. In: Conference on Applied Probability in Engineering, Computer and Communications Sciences, Paris, INRIA/ORSA/TIMS/SMAI (1993)
Baldi, P., Pacchiarotti, B.: Importance Sampling for the Ruin Problem for General Gaussian Processes. Technical report (2004)
Dieker, A.B., Mandjes, M.R.H.: Fast simulation of overflow probabilities in a queue with Gaussian input. ACM Trans. Model. Comput. Simul. 16(2), 119–151 (2006)
Dupuis, P., Wang, H.: Importance Sampling, Large Deviations and differential games. Technical report, Lefschetz Center for Dynamical Systems, Brown University (2002)
Giordano, S., Gubinelli, M., Pagano, M.: Bridge Monte-Carlo: a novel approach to rare events of Gaussian processes. In: Proc. of the 5th St.Petersburg Workshop on Simulation, St. Petersburg, Russia, pp. 281-286 (2005)
Heidelberger, P.: Fast Simulation of Rare Events in Queueing and Reliability Models. Performance Eval. of Computer and Commun. Syst. 729, 165–202 (1993)
Addie, R., Mannersalo, P., Norros, I.: Most Probable Paths and performance formulae for buffers with Gaussian input traffic. Eur. Trans. on Telecommunications 13 (2002)
O’Connell, N., Procissi, G.: On the Build-Up of Large Queues in a Queueing Model with Fractional Brownian Motion Input. Technical Report HPL-BRIMS-98-18, BRIMS, HP Labs. Bristol (U.K.) (1998)
Huang, C., Devetsikiotis, M., Lambadaris, I., Kaye, A.: Modeling and simulation of self-similar variable bit rate compressed video: a unified approach. In: Proc. of SIGCOMM 1995, Cambridge, US, pp. 114–125 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giordano, S., Gubinelli, M., Pagano, M. (2007). Rare Events of Gaussian Processes: A Performance Comparison Between Bridge Monte-Carlo and Importance Sampling. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2007. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74833-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-74833-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74832-8
Online ISBN: 978-3-540-74833-5
eBook Packages: Computer ScienceComputer Science (R0)