Skip to main content
Log in

Overflow and losses in a network queue with a self-similar input

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h → to ∞. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower bounds is done.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. B isdikian, Performance analysis of single-stage, output buffer packet switches with independent batch arrivals, Computer Networks ISDN Systems 27 (1995) 627–652.

    Article  Google Scholar 

  2. A.A. Borovkov, Asymptotic Methods in Queueing Theory (Wiley, Chichester, 1984).

    Google Scholar 

  3. D.R. Cox, Long-range dependence: A review, in: Statistics: An Appraisal, eds. H.A. David and H.T. David (The Iowa State Univ. Press, Ames, IA, 1984) pp. 55–74.

    Google Scholar 

  4. M.E. Crovella and A. Bestavros, Self-similarity in world wide Web traffic: Evidence and possible causes, in: Proc. of the 1996 ACM SIGMETRICS, Internat. Conf. on Measurement and Modeling of Computer Systems (May 1996), IEEE/ACM Trans. Networking 5(6) (1997) 835–846.

    Google Scholar 

  5. A. Dembo and O. Zeitouni, Large Deviation Techniques and Applications (Jones and Bartlett, Boston, MA, 1993).

    Google Scholar 

  6. N.G. Duffield, On the relevance of long-tailed durations for the statistical multiplexing of large aggregations, in: Proc. of the 34th Annual Allerton Conf. on Communication, Control, and Computing (October 2–4, 1996) pp. 741–750.

  7. N.G. Duffield, Queueing at large resources driven by long-tailed M/G/∞-modulated processes, a manuscript (December 30, 1996).

  8. N.G. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general singleserver queue with applications, Math. Proc. Cambridge Philos. Soc. 118 (1995) 363–374.

    Article  Google Scholar 

  9. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 2nd ed. (Wiley, New York, 1957).

    Google Scholar 

  10. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic, in: '93, San Fransisco, CA (1993) pp. 183–193.

  11. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic (Extended version), IEEE/ACM Trans. Networking 2(1) (1994) 1–15.

    Article  Google Scholar 

  12. N. Likhanov, B. Tsybakov and N.D. Georganas, Analysis of an ATM buffer with self-similar (“fractal”) input traffic, in: '95, Boston, MA (1995) pp. 985–992.

  13. Z. Liu, P. Nain, D. Towsley and Z.-L. Zhang, Asymptotic behavior of a multiplexer fed by a longrange dependent process, CMPSCI Technical Report 97-16, University of Massachusetts at Amherst (1997).

  14. M. Parulekar and A.M. Makowski, Tail probabilities for a multiplexer with self-similar traffic, in: '96 Conf. (March 26–28, 1996) pp. 1452–1459.

  15. M. Parulekar and A.M. Makowski, Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics, preprint, University of Maryland (1996).

  16. M. Parulekar and A.M. Makowski, M/G/∞ input processes: A versatile class of models for network traffic, Preprint, University of Maryland (1996).

  17. W.L. Smith, Regenerative stochastic processes, Proc. Roy. Soc. London Ser. A 232 (1955) 6–31.

    Article  Google Scholar 

  18. H. Takagi, Queueing Analysis; A Foundation of Performance Evaluation, Vols. I–III (Elsevier Science/North-Holland, Amsterdam, 1991).

    Google Scholar 

  19. B. Tsybakov and N.D. Georganas, On self-similar traffic in ATM queues: Definitions, overflow probability bound and cell delay distribution, IEEE/ACM Trans. Networking 5(3) (1997) 397–409.

    Article  Google Scholar 

  20. B. Tsybakov and N.D. Georganas, Self-similar traffic: Upper bounds to buffer-overflow probability in an ATM queue, in: '97, the Canadian Conf. on Broadband Research, Ottawa (April 1997) pp. 137–148.

  21. B. Tsybakov and N.D. Georganas, Overflow probability in an ATM queue with self-similar traffic, in: '97 Conference Record, Vol. 2, Montreal (1997) pp. 822–826.

    Google Scholar 

  22. B. Tsybakov and N.D. Georganas, A model of self-similar communications-network traffic, in: '97), Tel-Aviv, Israel (1997) pp. 212–217.

  23. B. Tsybakov and N.D. Georganas, Self-similar traffic and upper bounds to buffer-overflow probability in ATM queue, Performance Evaluation 32 (1998) 57–80.

    Article  Google Scholar 

  24. B. Tsybakov and N.D. Georganas, Self-similar processes in communications networks, IEEE Trans. Inform. Theory 44(5) (1998) 1713–1725.

    Article  Google Scholar 

  25. B. Tsybakov and N.D. Georganas, Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic, Queueing Systems 32 (1999) 233–256.

    Article  Google Scholar 

  26. B. Tsybakov and N.D. Georganas, On buffer overflow under self-similar packet traffic, in: Performance and Control of Network Systems Conference, Boston (September 1999), eds. R.D. van der Mei and D.P. Heyman, Proceedings of SPIE, Vol. 3841, pp. 172–183.

  27. B. Tsybakov and N.D. Georganas, Overflow and losses in a network queue with self-similar input, in: Proc. of the 37th Annual Allerton Conf. on Communication, Control, and Computing (September 1999) pp. 1113–1121.

  28. B. Tsybakov and P. Papantoni-Kazakos, The best and worst packet transmission policies, Problems Inform. Transmission 32(4) (1996) 365–382.

    Google Scholar 

  29. W. Willinger, M.S. Taqqu and A. Erramilli, A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks, in: Stochastic Networks: Theory and Applications, eds. F.P. Kelly, S. Zachary and I. Ziedins (Clarendon Press/Oxford Univ. Press, Oxford, 1996) pp. 339–366.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsybakov, B., Georganas, N.D. Overflow and losses in a network queue with a self-similar input. Queueing Systems 35, 201–235 (2000). https://doi.org/10.1023/A:1019150312811

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019150312811

Navigation