Skip to main content

Scheduling strategies and long-range dependence

Abstract

Consider a single server queue with unit service rate fed by an arrival process of the following form: sessions arrive at the times of a Poisson process of rate λ, with each session lasting for an independent integer time τ ⩾ 1, where P(τ = k) = p k with p k ~ αk −(1+α) L(k), where 1 < α < 2 and L(·) is a slowly varying function. Each session brings in work at unit rate while it is active. Thus the work brought in by each arrival is regularly varying, and, because 1 < α < 2, the arrival process of work is long-range dependent. Assume that the stability condition λE[τ] < 1 holds. By simple arguments we show that for any stationary nonpreemptive service policy at the queue, the stationary sojourn time of a typical session must stochastically dominate a regularly varying random variable having infinite mean; this is true even if the duration of a session is known at the time it arrives. On the other hand, we show that there exist causal stationary preemptive policies, which do not need knowledge of the session durations at the time of arrival, for which the stationary sojourn time of a typical session is stochastically dominated by a regularly varying random variable having finite mean. These results indicate that scheduling policies can have a significant influence on the extent to which long-range dependence in the arrivals influences the performance of communication networks.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    V. Anantharam, On the sojourn time of sessions at an ATM buffer with long-range dependent input traffic, in: Proceedings of the 34th IEEE Conference on Decision and Control, Vol. 1, New Orleans, LA (December 13–15, 1995) pp. 859–864.

    Google Scholar 

  2. [2]

    V. Anantharam, Networks of queues with long-range dependent traffic streams, in: Stochastic Networks: Stability and Rare Events, eds. P. Glasserman, K. Sigman and D. Yao, Lecture Notes in Statistics, Vol. 117 (Springer, Berlin, 1996) pp. 237–256.

    Google Scholar 

  3. [3]

    S. Asmussen and J. Teugels, Convergence rates for M/G/1 queues and ruin problems with heavy tails, Report R-95–2005, Institute for Electronic Systems, Aalborg University (1995).

  4. [4]

    F. Baccelli and P. Bremaud, Palm Probabilities and Stationary Queues, Lecture Notes in Statistics, Vol. 41 (Springer, Berlin, 1980).

    Google Scholar 

  5. [5]

    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) (February-April 1995) 1566–1579.

    Article  Google Scholar 

  6. [6]

    N.H. Bingham, C.M. Goldie and J.L. Teugels, Regular Variation (Cambridge University Press, New York, 1987).

    Google Scholar 

  7. [7]

    C.S. Chang, Stability, queue length, and delay of deterministic and stochastic networks, IEEE Trans. Automatic Control 39(5) (1994) 913–931.

    Article  Google Scholar 

  8. [8]

    J. Cohen, On the tail of the stationary waiting time distribution and limit theorems for the M/G/1 queue, Ann. Inst. H. Poincar´ e Section B 8(3) (1972) 255–263.

    Google Scholar 

  9. [9]

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

  10. [10]

    A. Erramilli, O. Narayan and W. Willinger, Experimental queueing analysis with long-range depen-dent packet traffic, IEEE/ACM Trans. Networking (April 1996) 4(2) 209–223.

    Article  Google Scholar 

  11. [11]

    W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 2 (Wiley, New York, 1971).

    Google Scholar 

  12. [12]

    P.R. Jelenkovic and A.A. Lazar, Asymptotic results for multiplexing subexponential on-off sources, Adv. Appl. Probab., submitted.

  13. [13]

    T. Konstantopoulos and S.-J. Lin, Fractional Brownian motion and L´ evy motions as limits of sto-chastic traffic models, in: Proceedings of the 34th Annual Allerton Conference on Communications, Control, and Computing, Urbana, IL (1996) pp. 913–922.

  14. [14]

    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 

  15. [15]

    N. Likhanov, B. Tsybakov and N.D. Georganas, Analysis of an ATM buffer with self-similar ("fractal") input traffic, in: Proceedings of the 14th Annual IEEE Infocom (1995) pp. 985–992.

  16. [16]

    Z. Liu, P. Nain, D. Towsley and Z.-L. Zhang, Asymptotic behavior of a multiplexer fed by a long-range dependent source, INRIA Report No. 3230 (August 1997). Available via http:// www.inria.fr/mistral/personnel/Philippe.Nain/research.html.

  17. [17]

    I. Norros, A storage model with self-similar input, Queueing Systems 16 (1994) 387–396.

    Article  Google Scholar 

  18. [18]

    M. Parulekar and A.M. Makowski, Tail probabilities for a multiplexer with self-similar traffic, in: Proceedings of the IEEE INFOCOM (1996) pp. 1452–1459.

  19. [19]

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

    Article  Google Scholar 

  20. [20]

    S. Vamvakos and V. Anantharam, On the departure process of a leaky bucket system with long-range dependent input traffic, Queueing Systems (to appear). Available as UCB/ERL Memorandum, No. M96/51, and UCB/ERL Memorandum, No. M96/70, Electronics Research Laboratory, Univer-sity of California, Berkeley.

  21. [21]

    B. Venkateshwara Rao, K.R. Krishnan and D.P. Heyman, Performance of finite-buffer queues under traffic with long-range dependence, in: Proceedings of the IEEE GLOBECOM 1996, Vol. 1, London, UK (1996) pp. 607–611.

    Google Scholar 

  22. [22]

    J. Walrand, An Introduction to Queueing Networks (Prentice-Hall, Englewood Cliffs, NJ, 1988).

    Google Scholar 

  23. [23]

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

    Google Scholar 

  24. [24]

    W. Willinger, M.S. Taqqu, R. Sherman and D.V. Wilson, Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level, IEEE/ACM Trans. Networking 5(1) (February 1997) 71–86.

    Article  Google Scholar 

  25. [25]

    R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223–231.

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Anantharam, V. Scheduling strategies and long-range dependence. Queueing Systems 33, 73–89 (1999). https://doi.org/10.1023/A:1019115910569

Download citation

  • single server queue
  • scheduling policies
  • long-range dependence