Communication Network with Self-Similar Traffic

  • Boris Tsybakov


The paper is a review of some results on the discrete-time finite-buffer queueing system which models a communication network multiplexer fed by a self-similar cell traffic. The review includes also some new results. First, the definitions of second-order self-similar processes are given. Then, a queue model is introduced. It has a finite buffer, 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. A source generates a Bernoulli sequence of cells. The asymptotic bounds to the buffer-overflow and cell-loss probabilities are given in some cases. The bounds show a true asymptotic behaviour of the probabilities. The bounds decay polynomially with buffer-size growth and exponentially with excess of channel capacity over traffic rate.


Active Period Channel Capacity Buffer Size Loss Probability Traffic Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N.H. Bingham, C.M. Goldie, and J.L. Teugels, Regular Variation, Cambridge, New York, Melburn: Cambridge Univ. Press, 1987.Google Scholar
  2. [2]
    A.A. Borovkov, “Asymptotic Methods in Queueing Theory, Wiley, 1984.Google Scholar
  3. [3]
    D.R. Cox, “Long-Range Dependence: A Review,” in Statistics: An Appraisal, H.A. David and H.T. David, eds. Ames, IA: The Iowa State University Press, 1984, 55–74.Google Scholar
  4. [4]
    M.E. Crovella and A. Bestavros, “Self-Similarity in Word Wide Web Traffic: Evidence and possible causes,” Proceedings of the 1996 ACM SIG-METRICS. International Conference on Measurement and Modeling of Computer Systems, May, 1996 and IEEE/A CM Trans. on Networking 5, No. 6, 1997, 835–846.CrossRefGoogle Scholar
  5. [5]
    A. Dembo and O. Zeitouni, “Large Deviation Techniques and Applications, Jones and Bartlett, Boston (MA), 1993.Google Scholar
  6. [6]
    N.G. Duffield, “On the Relevance of Long-Tailed Durations for the Statistical Multiplexing of Large Aggregations,” Proc. 34-th Annual Allerton Conf. on Communication, Control, and Computing, Oct. 2–4, 1996, 741–750.Google Scholar
  7. [7]
    N.G. Duffield, “Queueing at Large Resources Driven by Long-Tailed M/D/oo-modulated Processes”, a manuscript, 1996, December 30.Google Scholar
  8. [8]
    N.G. Duffield and N. O’Connell, “Large Deviations and Overflow Probabilities for the General Single-server Queue with Applications,” Math. Proc. Cam. Phil. Soc. 118, 1995, 363–374.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    A.N. Kolmogorov, “Wiener’s Spiral and Some Other Interesting Curves in Hilbert’s Space,” Dokl. Akad. Nauk USSR 26, No. 2, 1940, 115–118.Google Scholar
  10. [10]
    W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, “On the Self-Similar Nature of Ethernet Traffic,” Proc. ACM SIGCOMM’93, San Fransisco, CA, 1993, 183–193.Google Scholar
  11. [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. on Networking 2, No. 1, 1994, 1–15.CrossRefGoogle Scholar
  12. [12]
    N. Likhanov, B. Tsybakov, and N.D. Georganas, “Analysis of an ATM Buffer with Self-Similar (”Fractal“) Input Traffic”, Proc. IEEE INFOCOM’95, Boston, MA, 1995, 985–992.Google Scholar
  13. [13]
    Z. Liu, P. Nain, D. Towsley, and Z.-L. Zhang, “Asymptotic Behavior of a Multiplexer Fed by a Long-Range Dependent Process,” CMPSCI Technical Report 97–16, University of Massachusetts at Amherst, 1997.Google Scholar
  14. [14]
    M. Parulekar and A.M. Makowski, “Tail Probabilities for a Multiplexer with Self-Similar Traffic,” Proc. IEEE INFOCOM’96 Conf., Mar. 26–28, 1996, 1452–1459.Google Scholar
  15. [15]
    M. Parulekar and A.M. Makowski, “Tail Probabilities for M/G/co Input Processes (I): Preliminary Asymptotics,” Preprint, University of Maryland, 1996.Google Scholar
  16. [16]
    M. Parulekar and A.M. Makowski, “M/G/oo Input Processes: A Versatile Class of Models for Network Traffic”, Preprint, University of Maryland, 1996.Google Scholar
  17. [17]
    Y.G. Sinai, “Automodel Probability Distributions,” Probab. Theory and its Applic. 21, No. 1, 1976, 63–80 (in Russian).MathSciNetGoogle Scholar
  18. [18]
    B. Tsybakov, “Decay of Loss Probabilities in a Network with Self-Similar Input,” submitted IEEE Trans. Inform. Theory. Google Scholar
  19. [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. on Networing 5, No. 3, 1997, 397–409.CrossRefGoogle Scholar
  20. [20]
    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.CrossRefGoogle Scholar
  21. [21]
    B. Tsybakov and N.D. Georganas, “Self-Similar Processes in Communications Networks,” IEEE Trans. Inform. Theory 44, 1998, 1713–1725.MathSciNetzbMATHCrossRefGoogle Scholar
  22. [22]
    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.Google Scholar
  23. [23]
    B.Tsybakov and N.D.Georganas, “Buffer Overflow under Self-Similar Traffic,” Proceedings of SPIE (SPIE-The International Society for Optical Engineering), Performance and Control of Network Systems III, Eds. R.D. van der Mei, D.P. Heyman, Vol. 3841, 1999, 172–183.Google Scholar
  24. [24]
    B.Tsybakov and N.D.Georganas, “Overflow and Losses in a Network Queue with Self-Similar Input”, submitted IEEE Trans. Inform. Theory.Google Scholar
  25. [25]
    B.Tsybakov and P.Papantoni-Kazakos, “The Best and Worst Packet Transmission Policies”, Problems of Information Transmission, Vol. 32, No. 4, 1996, 365–382.MathSciNetzbMATHGoogle Scholar
  26. [26]
    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“, Ed. F.P.Kelly, S.Zachary, and I.Ziedins, Clarendon Press (Oxford University Press), Oxford, 1996, 339–366.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Boris Tsybakov
    • 1
  1. 1.QUALCOMM Inc.San DiegoUSA

Personalised recommendations