## The Annals of Applied Probability

### Patterns of buffer overflow in a class of queues with long memory in the input stream

#### Abstract

We study the time it takes until a fluid queue with a finite, but large, holding capacity reaches the overflow point. The queue is fed by an on/off process with a heavy tailed on distribution which is known to have long memory. It turns out that the expected time until overflow, as a function of capacity L, increases only polynomially fast; so overflows happen much more often than in the "classical" light tailed case, where the expected over-flow time increases as an exponential function of L. Moreover, we show that in the heavy tailed case overflows are basically caused by single huge jobs. An implication is that the usual $GI/G/1$ queue with finite but large holding capacity and heavy tailed service times will overflow about equally often no matter how much we increase the service rate. We also study the time until overflow for queues fed by a superposition of k iid on/off processes with a heavy tailed on distribution, and we show the benefit of pooling the system resources as far as time until overflow is concerned.

#### Article information

Source
Ann. Appl. Probab., Volume 7, Number 4 (1997), 1021-1057.

Dates
First available in Project Euclid: 29 January 2003

https://projecteuclid.org/euclid.aoap/1043862423

Digital Object Identifier
doi:10.1214/aoap/1043862423

Mathematical Reviews number (MathSciNet)
MR1484796

Zentralblatt MATH identifier
0905.60070

#### Citation

Heath, David; Resnick, Sidney; Samorodnitsky, Gennady. Patterns of buffer overflow in a class of queues with long memory in the input stream. Ann. Appl. Probab. 7 (1997), no. 4, 1021--1057. doi:10.1214/aoap/1043862423. https://projecteuclid.org/euclid.aoap/1043862423

#### References

• Abate, J., Choudhury, G. and Whitt, W. (1994). Waiting-time tail probabilities in queues with long-tail service-time distributions. Queueing Sy stems Theory Appl. 16 311-338.
• Anick, D., Mitra, D. and Sondhi, M. (1982). Stochastic theory of a data-handling sy stem with multiple sources. Bell Sy stem Technical Journal 61 1871-1894.
• Asmussen, S. (1987). Applied Probability and Queues. Wiley, New York.
• Asmussen, S. (1998). Subexponential asy mptotics for stochastic processes: extremal behavior, stationary distributions and first passage probabilities. Ann. Appl. Probab. To appear.
• Asmussen, S. and Perry, D. (1992). On cy cle maxima, first passage problems and extreme value theory for queues. Stochastic Models 8 421-458.
• Avram, F. and Taqqu, M. S. (1986). Weak convergence of moving averages with infinite variance. In Dependence in Probability and Statistics (E. Eberlein and M. Taqqu, eds.) 399-415. Birkh¨auser, Boston.
• Avram, F. and Taqqu, M. S. (1989). Probability bounds for M-Skorohod oscillations. Stochastic Process. Appl. 33 63-72.
• Avram, F. and Taqqu, M. S. (1992). Weak convergence of sums of moving averages in the -stable domain of attraction. Ann. Probab. 20 483-503.
• Berger, A. and Whitt, W. (1995). Maximum values in queueing processes. Probab. Engrg. Inform. Sci. 9 375-409.
• Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
• Bingham, N., Goldie, C. and Teugels, J. (1987). Regular variation. In Ency clopedia of Mathematics and Its Applications 27. Cambridge Univ. Press.
• Brichet, F., Roberts, J., Simonian, A. and Veitch, D. (1996). Heavy traffic analysis of a storage model with long range dependent On/Off sources. Queueing Sy stems Theory Appl. 23 197-215.
• Choudhury, G. and Whitt, W. (1995). Long-tail buffer-content distributions in broadband networks. Preprint, AT&T Bell Laboratories, Murray Hill, NJ.
• Crovella, M. and Bestavros, A. (1995). Explaining World Wide Web traffic self-similarity. Preprint. (Available as TR-95-015 from crovella,best @cs.bu.edu.)
• Cunha, C., Bestavros, A. and Crovella, M. (1995). Characteristics of www client-based traces. Preprint. (Available as BU-CS-95-010 from crovella,best @cs.bu.edu.)
• Embrechts, P. and Veraverbeke, N. (1982). Estimates for the probability of ruin with special emphasis on the possibility of large claims. Insurance: Mathematics and Economics 1 55-72.
• Feller, W. (1971). An Introduction to Probability Theory and Its Applications 2, 2nd ed. Wiley, New York.
• Heath, D., Resnick, S. and Samorodnitsky, G. (1996). Heavy tails and long range dependence in on/off processes and associated fluid models. Math. Oper. Res. To appear. (Available as TR1144.ps.Z at http://www.orie.cornell.edu/trlist/trlist.html.)
• Iglehart, D. (1972). Extreme values in the GI/G/1 queue. Ann. Math. Statist. 43 627-635.
• Kella, O. and Whitt, W. (1992). A storage model with a two-state random environment. Oper. Res. 40 257-262.
• Leland, W., Taqqu, M., Willinger, W. and Wilson, D. (1993). On the self-similar nature of ethernet traffic. ACM/SIGCOMM Computer Communications Review 23 183-193.
• Leland, W., Taqqu, M., Willinger, W. and Wilson, D. (1994). On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Transactions on Networking 2 1-15.
• Pacheco, A. and Prabhu, N. U. (1996). A Markovian storage model. Ann. Appl. Probab. 6 76-91.
• Prabhu, N. U. and Pacheco, A. (1995). A storage model for data communication sy stems. Queueing Sy stems Theory Appl. 19 1-40.
• Pratt, J. (1960). On interchanging limits and integrals. Ann. Math. Statist. 31 74-77.
• Resnick, S. (1986). Point processes, regular variation and weak convergence. Adv. in Appl. Prob. 18 66-138.
• Resnick, S. (1987). Extreme Values, Regular Variation, and Point Processes. Springer, New York.
• Resnick, S. (1992). Adventures in Stochastic Processes. Birkh¨auser, Boston.
• Willinger, W., Taqqu, M., Leland, W. and Wilson, D. (1995). Self-similarity in high-speed packet traffic: analysis and modeling of Ethernet traffic measurements. Statist. Sci. 10 67-85.
• Willinger, W., Taqqu, M., Sherman, R. and Wilson, D. (1995). Self-similarity through highvariability: statistical analysis of Ethernet LAN traffic at the source level. Preprint.