Informatics and Applications

2014, Volume 8, Issue 2, pp 28-38

ON THE OVERFLOW PROBABILITY ASYMPTOTICS IN A GAUSSIAN QUEUE

O. V. Lukashenko
E. V. Morozov
M. Pagano

Abstract

Gaussian processes are a powerful tool in networkmodeling since they permit to capture the longmemory property of actual traffic flows. In more detail, under realistic assumptions, fractional Brownian motion (FBM) arise as the limit process when a huge number of on-off sources (with heavy-tailed sojourn times) are multiplexed in backbone networks. This paper studies fluid queuing systems with a constant service rate fed by a sum of independent FBMs, corresponding to the aggregation of heterogeneous traffic flows. For such queuing systems, logarithmic asymptotics of the overflow probability, an upper bound for the loss probability in the corresponding finite-buffer queues, are derived, highlighting that the FBM with the largest Hurst parameter dominates in the estimation. Finally, asymptotic results for the workload maximum in the more general case of a Gaussian input with slowly varying at infinity variance are given.

[+] References (36)

Leland, W.E., M. S. Taqqu, W. Willinger, and D. V. Wilson. 1994. On the self-similar nature of ethernet traffic (extended version). IEEE/ACMTrans.Networking 2(1):1– 15.
Willinger, W., M. S. Taqqu, W. E. Leland, and D. Wilson. 1995. Self-similarity in high-speed packet traffic: Analysis and modeling of Ethernet traffic measurements. Stat. Sci. 10(1):67–85.
Taqqu, M. S., W. Willinger, and R. Sherman. 1997. Proof of a fundamental result in self-similar traffic modeling. Comp. Comm. Rev. 27:5–23.
Reich, E. 1958. On the integrodifferential equation of Takacs I. Ann. Math. Stat. 29:563–570.
Duffield, N., and N. O’Connell. 1995. Large deviations and overflow probabilities for the general single server queue, with applications. Proc. Cambridge Phil. Soc. 118:363–374.
Debicki, K. 1999. A note on LDP for supremumofGaussian processes over infinite horizon. Stat. Probab. Lett. 44:211–220.
Duffy, K., J. T. Lewis, and W.G. Sullivan. 2003. Logarithmic asymptotics for the supremumof a stochastic process. Ann. Appl. Probab. 13(2):430–445.
Kim, H. S., and N.B. Shroff. 2001. Loss probability calculations and asymptotic analysis for finite buffer multiplexers. IEEE/ACM Trans. Networking 9:755–768.
Kim, H. S., and N.B. Shroff. 2001. On the asymptotic relationship between the overflow probability and the loss ratio. Adv. Appl. Probab. 33:836–863.
Goricheva, R. S., O. V. Lukashenko, E. V. Morozov, and M. Pagano. 2010. Regenerative analysis of a finite buffer fluid queue. 2010 Congress (International) on UltraModern Telecommunications and Control Systems and Workshops (ICUMT) Proceedings. 1132–1136.
Lukashenko, O. V., E. V. Morozov, and M. Pagano. 2011. Estimation of loss probability in Gaussian queues. Conference (International) “Modern Probabilistic Methods for Analysis and Optimization of Information and Telecommunication Networks” Proceedings. 142–147.
Lukashenko, O. V., E.V. Morozov, R. S. Nekrasova, and M. Pagano. 2013. Performance evaluation of finite buffer queues through regenerative simulation. Comm. Comp. Inform. Sci. BWWQT 2013. 356:131–139.
Zeevi, A., and P.Glynn. 2000. On themaximumworkload in a queue fed by fractional Brownian motion. Ann. Appl. Probab. 10:1084–1099.
H.usler, J., and V. I. Piterbarg. 2004. Limit theorem for maximumof the storage process with fractional Brownian as input. Stochastic Proc. Their Appl. 114:231–250.
Lukashenko,O. V., and E.V.Morozov. 2012. Asymptotics of the maximum workload for a class of Gaussian queues. Informatics and Its Applications — Inform. Appl. 6(3):81– 89.
Lukashenko O. V., and E. V.Morozov. 2012. On the maximum workload for a class ofGaussian queues. Conference (International) “Probability Theory and Its Applications” in Commemoration of the Centennial of B. V. Gnedenko. 231–232.
Lukashenko, O. V., and E. V. Morozov. 2013. On convergence in the Lp space of the workload maximum for a class of Gaussian queueing systems. Informatics and Its Applications — Inform. Appl. 7(1):36–43.
Dieker, A.B., and M. Mandjes. 2005. On asymptotically efficient simulation of large deviation probabilities. Adv. Appl. Probab. 37:539–552.
Giordano, S.,M.Gubinelli, andM. Pagano. 2005. Bridge Monte-Carlo: A novel approach to rare events of Gaussian processes. 5th St. Petersburg Workshop on Simulation Proceedings. St. Petersburg, Russia. 281–286.
Dieker, A.B., and M. Mandjes. 2006. Fast simulation of overflow probabilities in a queue with Gaussian input. ACM Trans.Model. Comput. Simul. 16(2):119–151.
Giordano, S., M. Gubinelli, and M. Pagano. 2007. Rare events of Gaussian processes: A performance comparison between Bridge Monte-Carlo and Importance Sampling. Next generation teletraffic and wired/wireless advanced networking. St. Petersburg, Russia. 269–280.
Lukashenko, O. V., E. V. Morozov, and M. Pagano. 2012. Performance analysis of bridge Monte-Carlo estimator. Trans. KarRC RAS 3:54–60.
Takacs, L. 1967. Combinatorial methods in the theory of stochastic processes. John Wiley&Sons. 262 p.
Mandjes, M. 2007. Large deviations of Gaussian queues. Chichester: Wiley. 339 p.
Rizk, A., and M. Fidler. 2010. Sample path bounds for long memory fbm traffic. 29th Conference on Information Communications, INFOCOM’10 Proceedings. Piscataway, NJ, USA: IEEE Press. 61–65.
Rizk, A., and M. Fidler. 2012. Non-asymptotic endto- end performance bounds for networks with long range dependentFBMcross traffic. Comp.Networks. 56(1):127– 141.
Lukashenko, O., E. Morozov, and M. Pagano. 2014. On the effective envelopes for fluid queues with Gaussian input. Comm. Comp. Inform. Sci. DCCN 2013. 279:178–189.
Adler, R. J. 1990. An introduction to continuity, extrema, and related topics for general Gaussian processes. Hayward, CA: Institute ofMathematical Statistics. 160 p.
Debicki, K. 2004. Gaussian processes. Encyclopedia of actuarial sciences 2:752–757.
Dembo, A., and O. Zeitouni. 1998. Large deviations techniques and applications. Springer. 396 p.
Seneta, E. 1985. Regularly varying functions. Springer. 116 p.
Konstantopoulos, T., M. Zazanis, and G. De Veciana. 1996. Conservation laws and reflectionmappingswith application to multiclass mean value analysis for stochastic fluid queues. Stochastic Proc. Their Appl. 65:139–146.
Kulkarni, V., and T. Rolski. 1994. Fluid model driven by an Ornstein–Uhlenbeck process. Prob. Eng. Inform. Sci. 8:403–417.
Debicki, K., and T. Rolski. 1995. A Gaussian fluidmodel. Queueing Syst. 20:433–452.
Anick,D., D.Mitra, andM.M. Sondhi. 1982. Stochastic theory of a data handling system with multiple resources. Bell Syst. Techn. J. 61:1871–1894.
Addie, R., P. Mannersalo, and I. Norros. 2002. Most probable paths and performance formulae for buffers with Gaussian input traffic. Eur. Trans. Telecomm. 13:183–196.

[+] About this article