Skip to main content

Fractional Brownian Approximations of Queueing Networks

  • Conference paper

Part of the book series: Lecture Notes in Statistics ((LNS,volume 117))

Abstract

We consider a single-class queueing network with long-range dependent arrival and service processes and show that the normalized queue length converges to a reflected d-dimensional fractional Brownian motion. We identify the covariance of the limiting process in terms of the arrival rates and asymptotic variances of the driving processes. We discuss the case of multiple Hurst parameters and point out that only the largest survive in the limit.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anantharam, V. (1995). On the sojourn time of sessions at an ATM buffer with long-range dependent input traffic. Proc. IEEE CDC.

    Google Scholar 

  2. Baccelli, F. and Foss, S. (1993). Stability of Jackson-Type Queueing Networks, I. INRIA Rapport de Recherche No. 1945. Also in QUESTA, Vol. 17, No. I–I.

    Google Scholar 

  3. Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.

    MATH  Google Scholar 

  4. Brichet, F., Roberts, J., Simonian, A. and Veitch, D. (1995). Heavy traffic analysis of a storage model with long-range dependent on/off sources. Preprint.

    Google Scholar 

  5. Cox, D.R. (1983). Long-range dependence: a review. In: Statistics: An Appraisal, Proc. 50th Anniversary Conference, Iowa State Statistical Laboratory.

    Google Scholar 

  6. Duffield, N.G. and O’Connell, N. (1993). Large deviations and overflow probabilities for the general single-server queue, with applications. To appear in Proc. Cambridge Phil. Soc.

    Google Scholar 

  7. Harrison, J.M. and Reiman, M.I. (1981). Reflected Brownian motion on an orthant. Ann. Prob., 9, 302–308.

    Article  MathSciNet  MATH  Google Scholar 

  8. Konstantopoulos, T. and Lin, S.J. (1995). Approximating fractional Brownian motions. Techn. Rep. ECE, V.T. Austin.

    Google Scholar 

  9. Konstantopoulos, T., Zazanis, M. and de Veciana, G. (1995). Conservation laws and reflection mappings with an application to multiclass mean value analysis for stochastic fluid queues. To appear in: Stoch. Proc. Applic.

    Google Scholar 

  10. Kurtz, T. (1995). Talk delivered in the Royal Statistical Society Work-shop on Stochastic Networks, Heriot-Watt University, Edinburgh.

    Google Scholar 

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

    Article  Google Scholar 

  12. Likhanov, N., Tsybakov, B. and Georganas, N.D. (1995). Analysis of an ATM buffer with self-similar (“fractal”) input traffic. Proc. 14th IEEE Infocom, 985–992.

    Google Scholar 

  13. Loynes, R. (1962). The stability of a queue with non-independent interarrival and service times. Proc. Cambridge Phil. Soc., 58, 497–520.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Reiman, M.I. (1984). Open queueing networks in heavy traffic. Math. O.R., 9, 441–458.

    Article  MathSciNet  MATH  Google Scholar 

  16. Samorodnitsky, G. and Taqqu, M. (1994). Stable Non-Gaussian Random Processes. Chapman & Hall, New York.

    MATH  Google Scholar 

  17. Shanthikumar, J.G. and Yao, D.D. (1989). Stochastic monotonicity in general queueing networks. J. Appl. Prob., 26, 413–417.

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  19. Willinger, W., Taqqu, M.S., Sherman, R. and Wilson, D.V. (1995). Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. Proc. ACM/Sigcomm ‘95.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Konstantopoulos, T., Lin, SJ. (1996). Fractional Brownian Approximations of Queueing Networks. In: Glasserman, P., Sigman, K., Yao, D.D. (eds) Stochastic Networks. Lecture Notes in Statistics, vol 117. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4062-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4062-4_13

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-94828-7

  • Online ISBN: 978-1-4612-4062-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics