Skip to main content
SpringerLink
Log in

On the Analysis of the Virtual Waiting Time in Open Queueing Networks

  • Published:
Acta Applicandae Mathematicae Aims and scope Submit manuscript

Abstract

The model of an open queueing network in heavy traffic has been developed. These models are mathematical models of computer networks in heavy traffic. A limit theorem has been presented for the virtual waiting time of a customer in heavy traffic in open queueing networks. Finally, we present an application of the theorem—a reliability model from computer network practice.

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

Access this article

Log in via an institution

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. Afanasjeva, L.: On periodic distribution of waiting-time process, Stability problems for stochastic models. In: Lecture Notes in Mathematics, vol. 1155, pp. 1–20. Springer, Berlin (1985)

    Google Scholar 

  2. Arsenishvili, G.: Diffusion approximation of virtual waiting time of the M/M/1 system (the martingale approach). Kibernetika 1, 90–93 (1991) (in Russian)

    MathSciNet  Google Scholar 

  3. Belousova, S.: The waiting time under heavy traffic for priority systems with semi-Markov servicing. Ukr. Mat. Zh. 37(4), 411–417 (1985) (in Russian)

    MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  5. Borovkov, A.: Stochastic Processes in Queueing Theory. Nauka, Moscow (1972) (in Russian)

    MATH  Google Scholar 

  6. Borovkov, A.: Asymptotic Methods in Theory of Queues. Nauka, Moscow (1980) (in Russian)

    Google Scholar 

  7. Boxma, O.: On a tandem queueing model with identical service times at both counters. I. Adv. Appl. Probab. 11(3), 616–643 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boxma, O.: On a tandem queueing model with identical service times at both counters. II. Adv. Appl. Probab. 11(3), 644–659 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bramson, M., Dai, J.G.: Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11(1), 49–90 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chen, H., Maldelbaum, A.: Stochastic discrete flow networks: diffusion approximations and bottlenecks. Ann. Appl. Probab. 19(4), 1463–1519 (1991)

    MATH  Google Scholar 

  11. Chen, H., Yao, D.D.: Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer, New York (2001)

    MATH  Google Scholar 

  12. Chen, H., Ye, H.Q.: Existence condition for the diffusion approximations of multiclass priority queueing networks. Queueing Syst. Theory Appl. 38, 435–470 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Chen, H., Zhang, H.: A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines. Queueing Syst. Theory Appl. 34(1–4), 237–268 (2000)

    Article  MATH  Google Scholar 

  14. Cohen, J.: Asymptotic relations in queueing theory. Stoch. Process. Appl. 1, 107–124 (1973)

    Article  MATH  Google Scholar 

  15. Csörgo, M., Deheuvels, P., Horváth, L.: An approximation of stopped sums with applications in queueing theory. Adv. Appl. Probab. 19(3), 674–690 (1987)

    Article  Google Scholar 

  16. Harrison, J.: Brownian Motion and Stochastic Flow Processes. Wiley, New York (1985)

    Google Scholar 

  17. Harrison, J.: A broader view of Brownian networks. Ann. Appl. Probab. 13(3), 1119–1150 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Harrison, J., Nquyen, V.: Brownian models of multiclass queueing networks: current status and open problems. Queueing Syst. Theory Appl. 13, 5–40 (1993)

    Article  MATH  Google Scholar 

  19. Hooke, J., Prabhu, N.: Priority queues in heavy traffic. Oper. Res. 8(5), 1–9 (1971)

    MathSciNet  Google Scholar 

  20. Iglehart, D.L.: Multiple channel queues in heavy traffic. IV. Law of the iterated logarithm. Z. Wahrscheinlichkeitstheor. Verw. Geb. 17, 168–180 (1971)

    Article  MathSciNet  Google Scholar 

  21. Iglehart, D.: Weak convergence in queueing theory. Adv. Appl. Probab. 5, 570–594 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  22. Iglehart, D., Whitt, W.: Multiple channel queues in heavy traffic. I. Adv. Appl. Probab. 2, 150–177 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  23. Iglehart, D., Whitt, W.: Multiple channel queues in heavy traffic. II: Sequences, networks and batches. Adv. Appl. Probab. 2, 355–369 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  24. Kang, W.N., Kelly, F.P., Lee, N.H., Williams, R.J.: State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Preprint (2007)

  25. Karpelevich, F., Kreinin, A.: Heavy Traffic Limits for Multiphase Queues. Am. Math. Soc., Providence (1994)

    MATH  Google Scholar 

  26. Kingman, J.: On queues in heavy traffic. J. R. Stat. Soc. 24, 383–392 (1962)

    MATH  MathSciNet  Google Scholar 

  27. Kingman, J.: The single server queue in heavy traffic. Proc. Camb. Philos. Soc. 57, 902–904 (1962)

    MathSciNet  Google Scholar 

  28. Kobyashi, H.: Application of the diffusion approximation to queueing networks. J. ACM 21, 316–328 (1974)

    Article  Google Scholar 

  29. Kyprianou, E.: On the quasi-stationary distribution of the virtual waiting time in queues with Poisson arrivals. J. Appl. Probab. 8, 494–507 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  30. Kyprianou, E.: The virtual waiting time of the GI/G/1 queue in heavy traffic. Adv. Appl. Probab. 3, 249–268 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  31. Kyprianou, E.: On the quasi-stationary distributions of GI/M/1 queue. J. Appl. Probab. 9, 117–128 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  32. Kyprianou, E.: The quasi-stationary distributions of queues in heavy traffic. J. Appl. Probab. 9, 821–831 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  33. Mandelbaum, A., Stolyar, A.L.: Scheduling flexible servers with convex delay costs: heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6), 836–855 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  34. Minkevičius, S.: Weak convergence in multiphase queues. Liet. Mat. Rink. 26, 717–722 (1986) (in Russian)

    Google Scholar 

  35. Minkevičius, S.: On the law of the iterated logarithm in multiphase queueing systems. II. Informatica 8(3), 367–376 (1997)

    MATH  MathSciNet  Google Scholar 

  36. Minkevičius, S.: Complex transient phenomenas in multiphase queuing systems. II. Liet. Mat. Rink. 39(3), 343–356 (1999) (in Russian)

    MathSciNet  Google Scholar 

  37. Morder, J.J., Elmaghraby, S.E. (eds.): Handbook of Operational Research Models and Applications. Van Nostrand, Reinhold, New York (1978)

    Google Scholar 

  38. Pečinkin, A., Aripov, H.: The limit distribution of the virtual waiting time in the system GI/M/1. Izv. Akad. Nauk UzSSR Ser. Fiz.-Mat. 1, 27–32 (1975) (in Russian)

    Google Scholar 

  39. Prohorov, Y.: Transient phenomena in queues. Liet. Mat. Rink. 3, 199–206 (1963) (in Russian)

    MathSciNet  Google Scholar 

  40. Puhalskii, A.: Moderate deviations for queues in critical loading. Queueing Syst. Theory Appl. 31(3–4), 359–392 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  41. Reiman, M.: Open queueing networks in heavy traffic. Math. Oper. Res. 9, 441–459 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  42. Sakalauskas, L., Minkevičius, S.: On the law of the iterated logarithm in open queueing networks. Eur. J. Oper. Res. 120, 632–640 (2000)

    Article  MATH  Google Scholar 

  43. Schassberger, R.: Warteschlangen. Springer, Vienna (1973)

    MATH  Google Scholar 

  44. Szczotka, W.: An invariance principle for queues in heavy traffic. Math. Oper. Stat. Ser. Optim. 8(4), 591–631 (1977)

    MATH  MathSciNet  Google Scholar 

  45. Szczotka, W., Topolski, K.: Conditioned limit theorem for the pair of waiting time and queue line processes. Queueing Syst. Theory Appl. 5(4), 393–400 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  46. Teunis, O.: Some more results for the stable M/G/1 queue in heavy traffic. J. Appl. Probab. 16(1), 187–197 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  47. Whitt, W.: Heavy traffic limit theorems for queues: a survey. In: Lecture Notes in Economics and Mathematical Systems, vol. 98, pp. 307–350. Springer, Berlin (1974)

    Google Scholar 

  48. Whitt, W.: An interpolation approximation for the mean workload in a GI/G/1 queue. Oper. Res. 37(6), 936–952 (1989)

    MATH  MathSciNet  Google Scholar 

  49. Ye, H.Q., David Yao, D.: Heavy traffic optimality of stochastic networks under utility-maximizing resource control. Oper. Res. (2008, to appear)

  50. Qin, Z.H., Hui, X.G.: Strong approximations for the open queueing network in heavy traffic. Sci. China Ser. A 35(5), 521–535 (1992)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Akademijos 4, 08663, Vilnius, Lithuania

    S. Minkevičius

Authors
  1. S. Minkevičius
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Minkevičius.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minkevičius, S. On the Analysis of the Virtual Waiting Time in Open Queueing Networks. Acta Appl Math 104, 271–285 (2008). https://doi.org/10.1007/s10440-008-9256-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10440-008-9256-9

Keywords

Search

Navigation