Hostname: page-component-7b7567c8c-2rsb6 Total loading time: 0 Render date: 2026-11-12T19:08:51.117Z Has data issue: false hasContentIssue false
  • English
  • Français

Fluid limits for the queue length of jobs in multiserver openqueueing networks

Published online by Cambridge University Press:  21 March 2014

Saulius Minkevičius
Saulius Minkevičius*
Affiliation:
Institute of Mathematics and Informatics of VU, Akademijos 4, 08663 Vilnius, Lithuania.. minkevicius.saulius@gmail.com

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The object of this research in the queueing theory is a theorem about theStrong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserveropen queueing network. SLLN is known as a fluid limit or fluid approximation. In thiswork, we prove that the long-term average rate of growth of the queue length process of amultiserver open queueing network under heavy traffic strongly converges to a particularvector of rates. SLLN is proved for the values of an important probabilisticcharacteristic of the multiserver open queueing network investigated as well as the queuelength of jobs.

Keywords

Mathematical models of information systemsperformance evaluationqueueing theorymultiserver open queueing networkheavy trafficlimit theoremqueue length of jobs

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 48 , Issue 3 , July 2014, pp. 349 - 363
Copyright
© EDP Sciences, ROADEF, SMAI, 2014

References

P. Billingsley, Convergence of Probability Measures. Wiley, New York (1968).
Borovkov, A.A., Weak convergence of functionals of random sequences and processes defined on the whole axis. Proc. Stecklov Math. Inst. 128 (1972) 41–65. Google Scholar
A.A. Borovkov, Stochastic Processes in Queueing Theory. Springer, Berlin (1976).
A.A. Borovkov, Asymptotic Methods in Queueing Theory. Wiley, New York (1984).
Borovkov, A.A., Limit theorems for queueing networks. Theory Prob. Appl. 31 (1986) 413–427. Google Scholar
Chen, H. and Mandelbaum, A., Stochastic discrete flow networks: Diffusion approximations and bottlenecks. The Annals of Probability 19 (1991) 1463–1519. Google Scholar
C. Flores, Diffusion approximations for computer communications networks. in Computer Communications, Proc. Syrup. Appl. Math., edited by B. Gopinath. American Mathematical Society (1985) 83–124.
P.W. Glynn, Diffusion approximations. in Handbooks in Operations Research and Management Science, edited by D.P. Heyman and M.J. Sobel, Vol. 2 of Stochastic Models. North-Holland (1990).
Glynn, P.W. and Whitt, W., A new view of the heavy-traffic limit theorems for infinite-server queues. Adv. Appl. Probab. 23 (1991) 188–209. Google Scholar
B. Grigelionis and R. Mikulevičius, Diffusion approximation in queueing theory. Fundamentals of Teletraffic Theory. Proc. Third Int. Seminar on Teletraffic Theory (1984) 147–158.
Harrison, J.M., The heavy traffic approximation for single server queues in series. Adv. Appl. Probab. 10 (1973) 613–629. Google Scholar
Harrison, J.M., The diffusion approximation for tandem queues in heavy traffic. Adv. Appl. Probab. 10 (1978) 886–905. Google Scholar
Harrison, J.M. and Lemoine, A.J., A note on networks of infinite-server queues. J. Appl. Probab. 18 (1981) 561–567. Google Scholar
Harrison, J.M. and Reiman, M.I., On the distribution of multidimensional reflected Brownian motion. SIAM J. Appl. Math. 41 (1981) 345–361. Google Scholar
Harrison, J.M. and Williams, R.J., Brownian models of open queueing networks with homogeneous customer populations. Stochastics 22 (1987) 77–115. Google Scholar
Iglehart, D.L., Multiple channel queues in heavy traffic. IV. Law of the iterated logarithm. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 17 (1971) 168–180. Google Scholar
Iglehart, D.L. and Whitt, W., Multiple channel queues in heavy traffic I. Adv. Appl. Probab. 2 (1970) 150–175. Google Scholar
Iglehart, D.L. and Whitt, W., Multiple channel queues in heavy traffic II: Sequences, networks and batches. Adv. Appl. Probab. 2 (1970) 355–364. Google Scholar
D.P. Johnson, Diffusion Approximations for Optimal Filtering of Jump Processes and for Queueing Networks. Ph.D. dissertation, University of Wisconsin (1983).
Karpelevitch, F.I. and Kreinin, A.Ya., Joint distributions in Poissonian tandem queues. Queueing Systems 12 (1992) 274–286. Google Scholar
F.P. Kelly, An asymptotic analysis of blocking. Modelling and Performance Evaluation Methodology. Springer, Berlin (1984) 3–20.
Klimov, G.P., Several solved and unsolved problems of the service by queues in series (in Russian). Izv. AN USSR, Ser. Tech. Kibern. 6 (1970) 88–92. Google Scholar
Krichagina, E.V., Liptzer, R.Sh. and Pukhalsky, A.A., The diffusion approximation for queues with input flow, depending on a queue state and general service. Theory Prob. Appl. 33 (1988) 124–135. Google Scholar
Kogan, Ya.A. and Pukhalsky, A.A., Tandem queues with finite intermediate waiting room and blocking in heavy traffic. Prob. Control Int. Theory 17 (1988) 3–13. Google Scholar
Lemoine, A.J., Network of queues – A survey of weak convergence results. Management Science 24 (1978) 1175–1193. Google Scholar
R.Sh. Liptzer and A.N. Shiryaev, Theory of Martingales. Kluwer, Boston (1989).
Minkevičius, S., On the global values of the queue length in open queueing networks, Int. J. Comput. Math. (2009) 1029–0265. Google Scholar
S. Minkevičius, On the law of the iterated logarithm in multiserver open queueing networks, Stochastics, 2013 (accepted).
Minkevičius, S. and Kulvietis, G., Application of the law of the iterated logarithm in open queueing networks. WSEAS Transactions on Systems 6 (2007) 643–651. Google Scholar
Prohorov, Yu.V., Convergence of random processes and limit theorems in probability theory. Theory Prob. Appl. 1 (1956) 157–214. Google Scholar
Reiman, M.I., Open queueing networks in heavy traffic. Math. Oper. Res. 9 (1984) 441–458. Google Scholar
Reiman, M.I., A multiclass feedback queue in heavy traffic. Adv. Appl. Probab. 20 (1988) 179–207. Google Scholar
Reiman, M.I. and Simon, B., A network of priority queues in heavy traffic: one bottleneck station. Queueing Systems 6 (1990) 33–58. Google Scholar
Sakalauskas, L. and Minkevičius, S., On the law of the iterated logarithm in open queueing networks. Eur. J. Oper. Res. 120 (2000) 632–640. Google Scholar
A.V. Skorohod, Studies in the Theory of Random Processes. Addison-Wesley, New York (1965).
Strassen, V., An invariance principle for the law of the iterated logarithm. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 3 (1964) 211–226. Google Scholar
Szczotka, W. and Kelly, F.P., Asymptotic stationarity of queues in series and the heavy traffic approximation. The Annals of Probability 18 (1990) 1232–1248. Google Scholar
Whitt, W., Weak convergence theorems for priority queues: preemptive resume discipline. J. Appl. Probab. 8 (1971) 79–94. Google Scholar
W. Whitt, Heavy traffic limit theorems for queues: a survey. in Lecture Notes in Economics and Mathematical Systems, Vol. 98. Springer-Verlag, Berlin, Heidelberg, New York (1971) 307–350.
Whitt, W., On the heavy-traffic limit theorem for GI/G/∞ queues. Adv. Appl. Probab. 14 (1982) 171–190. Google Scholar