Abstract
The paper recommends new methods to estimate effectively the probabilities of buffer overflow in high-speed communication networks. The probability of buffer overflow in queuing system is very small; therefore the overflow is defined as a rare event and can be estimated using rare event simulation with continuous-time Markov chains. First, a two-node queuing system is considered and the buffer overflow at the second node is studied. Two efficient rare event simulation algorithms, based on the Importance sampling and Cross-entropy methods, are developed and applied to accelerate the buffer overflow simulation with Markov chain modeling. Then, the buffer overflow in self-similar queuing system is studied and simulations with long-range dependent self-similar traffic source models are conducted. A new efficient simulation algorithm, based on the RESTART method with limited relative error technique, is developed and applied to accelerate the buffer overflow simulation with SSM/M/1/B modeling using different parameters of arrival processes and different buffer sizes. Numerical examples and simulation results are provided for all methods to estimate the probabilities of buffer overflow, proposed in this paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bobbio, A., Horváth, A., Scarpa, M., & Telek, M. (2003). Acyclic discrete phase type distributions: Properties and a parameter estimation algorithm. Performance Evaluation, 54(1), 1–32.
Bolch, G., Greiner, S., Meer, H., & Trivedi, K. (1998). Queueing networks and Markov Chains: Modeling and performance evaluation with computer science applications. New York, NY: Wiley.
Bueno, D. R., Srinivasan, R., Nicola, V., van Etten, W., & Tattje, H. (2000). Adaptive importance sampling for performance evaluation and parameter optimization of communication systems. IEEE Transactions on Communications, 48(4), 557–565.
Bucklew, J. (2004). An introduction to rare event simulation., Springer Series in Statistics, XI Berlin: Springer.
C’erou, F., LeGland, F., Del Moral, P., & Lezaud P. (2005). Limit theorems for the multilevel splitting algorithm in the simulation of rare events. In Proceedings of the 2005 winter simulation conference (pp. 682–691). San Diego, USA.
De Boer, P., Kroese, D., & Rubinstein, R. (2002). Estimating buffer overflows in three stages using cross-entropy. In Proceedings of the 2002 winter simulation conference (pp. 301–309), San Diego, USA.
Georg, C., & Schreiber, F. (1996). The RESTART/LRE method for rare event simulation. In Proceedings of the winter simulation conference (pp. 390–397), Coronado, CA, USA.
Giambene, G. (2005). Queueing theory and telecommunications: Networks and applications. New York: Springer.
Heidelberger, P. (1995). Fast simulation for rare event in queueing and reliability models. ACM Transactions of Modeling and Computer Simulation, 5(1), 43–85.
Kalashnikov, V. (1997). Geometric sums: Bounds for rare events with applications: Risk analysis, reliability, queueing. Berlin: Kluwer Academic Publishers.
Keith, J., & Kroese, D. P. (2002). SABRES: Sequence alignment by rare event simulation. In Proceedings of the 2002 winter simulation conference (pp. 320–327). San Diego, USA.
Kroese, D., & Nicola, V. F. (1999). Efficient simulation of a tandem Jackson Network. In Proceedings of the second international workshop on rare event simulation RESIM’99 (pp. 197–211).
Lokshina, I. (2014). Study on estimating probability of buffer overflow in high-speed communication networks. In Proceedings of the 2014 networking and electronic commerce conference (NAEC 2014) (pp. 306–321), Trieste, Italy.
Lokshina, I. (2012). Study about effects of self-similar IP network traffic on queuing and network performance. International Journal of Mobile Network Design and Innovation, 4(2), 76–90.
Lokshina, I., & Bartolacci, M. (2012). Accelerated rare event simulation with Markov chain modelling in wireless communication networks. International Journal of Mobile Network Design and Innovation, 4(4), 185–191.
Radev, D., & Lokshina, I. (2006a). Performance analysis of mobile communication networks with clustering and neural modelling. International Journal of Mobile Network Design and Innovation, 1(3/4), 188–196.
Radev, D., & Lokshina, I. (2006b). Rare event simulation with Tandem Jackson networks. In Proceedings of the fourteen international conference on telecommunication systems: Modeling and analysis—ICTSM 2006 (pp. 262–270). Penn State Berks, Reading, PA, USA.
Radev, D., & Lokshina, I. (2010). Advanced models and algorithms for self-similar network traffic simulation and performance analysis. Journal of Electrical Engineering, 61(6), 341–349.
Rubino, G., & Tuffin, B. (2009). Rare event simulation using Monte Carlo methods. Chichester, UK: Wiley.
Villen-Altamirano, M., & Villen-Altamirano, J. (2006). On the efficiency of RESTART for multidimensional systems. ACM Transactions on Modeling and Computer Simulation, 16(3), 251–279.
Acknowledgments
The author would like to thank her colleagues Michael R. Bartolacci from Penn State University—Berks, USA and Cees J. M. Lanting from CSEM, Switzerland for their time, thoughtful insights and review during the preparation of this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lokshina, I. Study on estimating probabilities of buffer overflow in high-speed communication networks. Telecommun Syst 62, 289–302 (2016). https://doi.org/10.1007/s11235-015-0055-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-015-0055-0