Skip to main content
Log in

Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In [13], real-time measurements from LANs, variable-bit-rate video sources, ISDN control-channels, the World Wide Web and other communication systems have shown that traffic exhibits a behaviour of self-similar nature. In this paper, we give new lower bounds to buffer-overflow and cell-loss probabilities for an ATM queue system with a self-similar cell input traffic and finite buffer. The bounds are better than those obtained in [20], in an important region of parameters. As in [20], they decay hyperbolically with buffer size, when the latter goes to infinity. However, in some region, a factor which accompanies the decay is higher in this paper than in [20].

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. V. Anantharam, On the sojourn time of sessions at an ATM buffer with long-range dependent input traffic, in: Proc.of the 34th IEEE Conf.on Decision and Control (December 1995).

  2. J. Beran, R. Sherman, M.S. Taqqu and W. Willinger, Long-range dependence in variable-bit-rate video traffic, IEEE Trans. Commun. 43(2–4) (1995) 1566–1579.

    Article  Google Scholar 

  3. N.H. Bingham, C.M. Goldie and J.L. Teugels, Regular Variation (Cambridge Univ. Press, Cambridge, 1987).

    Google Scholar 

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

    Google Scholar 

  5. O.J. Boxma, Fluid queues and regular variation, CWI Report BS-R9608 (1996).

  6. O.J. Boxma, Regular variation in a multi-source fluid queue, CWI Report BS-R9614 (1996).

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

    Google Scholar 

  8. D.R. Cox and V. Isham, Point Processes (Chapman and Hall, London, 1980).

    Google Scholar 

  9. M.E. Crovella and A. Bestavros, Self-similarity in World Wide Web traffic: Evidence and possible causes, IEEE/ACM Trans. Networking 5(6) (1997) 835–846.

    Article  Google Scholar 

  10. 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.

  11. T. Konstantopoulos and S.-J. Lin, Macroscopic models for long-range dependent traffic, Queueing Systems (to appear in 1998).

  12. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic, in: Proc.of ACM SIGCOMM’ 93, San Francisco, CA (1993) pp. 183–193.

  13. 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 

  14. N. Likhanov, B. Tsybakov and N.D. Georganas, Analysis of an ATM buffer with self-similar (fractal) input traffic, in: Proc.of IEEE INFOCOM’ 95, Boston, MA (1995) pp. 985–992.

  15. 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).

  16. A. de Meyer and J.L. Teugels, On the asymptotic behaviour of the distributions of the busy period and service-time in M/G/1, J. Appl. Probab. 17(1980) 802–813.

    Article  Google Scholar 

  17. M. Parulekar and A.M. Makowski, Tail probabilities for a multiplexer with self-similar traffic, in: Proc.of the IEEE INFOCOM’ 96 Conf. (March 26–28, 1996) pp. 1452–1459.

  18. V. Paxon and S. Floyd, Wide area traffic: The failure of Poisson modeling, IEEE/ACM Trans. Networking 3(1995) 226–244.

    Article  Google Scholar 

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

    Google Scholar 

  20. 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 

  21. 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 

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

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

    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, A model of self-similar communications-network traffic, in: Proc.of Internat.Conf.“Distributed Computer Communication Networks” (DCCN’ 97), Tel-Aviv, Israel (1997) pp. 212–217.

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

    Google Scholar 

  27. 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, 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 loss probabilities in a finite ATM buffer fed by self-similar traffic. Queueing Systems 32, 233–256 (1999). https://doi.org/10.1023/A:1019143221956

Download citation

  • Issue Date:

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

Navigation