Abstract
In this paper a multi-server queueing system with regenerative input flow and independent service times with finite means is studied. We consider queueing systems with various disciplines of the service performance: systems with a common queue and systems with individual queues in front of the servers. In the second case an arrived customer chooses one of the servers in accordance with a certain rule and stays in the chosen queue up to the moment of its departure from the system. We define some classes of disciplines and analyze the asymptotical behavior of a multi-server queueing system in a heavy-traffic situation (traffic rate ρ ≥ 1). The main result of this work is limit theorems concerning the weak convergence of scaled processes of waiting time and queue length to the process of the Brownian motion for the case ρ > 1 and its absolute value for the case ρ = 1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afanaseva LG (2005) Queueing systems with cyclic control processes. Cybern Syst Anal 41(1):43–55
Afanaseva LG, Bashtova EE (2014) Coupling method for asymptotic analysis of queues with regenerative input and unreliable server. Queueing Syst 76(2):125–147
Afanasyeva L, Bashtova E, Bulinskaya E (2012) Limit theorems for Semi-Markov queues and their applications. Comput Stat Part B: Simul Comput 41(6):688–709
Afanaseva L, Grishunina S (2017) Queueing systems with different service disciplines. Lobachevskii J Math 38(5):864–869
Anisimov V (2002) Diffusion approximation in overloaded switching queueing models. Queueing Syst 40:141–180
Anisimov V (2008) Switching processes in queueing models. Wiley, ISTE, London
Anisimov V (2011) Switching queueing networks. In: Kouvatsos D (ed) Network performance engineering Lecture notes in computer sciences, vol 5233. Springer, Berlin, pp 258–283
Asmussen S (1991) Ladder heights and the Markov-modulated m|g|1 queue. Stochastic Process Appl 37:313–326
Borovkov A (1984) Asymptotic methods in queueing theory. Wiley, Chichester
Borovkov A (1976) Stochastic processes in queueing theory. Springer
Eschenfeldt P, Gamarnik D (2015) Join the shortest queue with many servers. The heavy traffic asymptotics. arXiv:1502.00999
Foley RD, McDonald DR (2001) Join the shortest queue: stability and exact asymptotics. Ann Appl Probab 11:569–607
Grandell J (1976) Double stochastic poisson processes. In: Lecture notes in mathematics. Springer, Berlin
Iglehart DL, Whitt W (1971) The equivalence of functional central limit theorems for counting processes and associated partial sums. Ann Math Stat 42(4):1372–1378
Liu Y, Whitt W, Yu Y (2016) Approximations for heavily loaded g/GI/n + GI queues. Nav Res Logist 63(3):187–217
Acknowledgments
The author would like to thank Afanasyeva L.G. under whose invaluable guidance this paper was written.
Work is partially supported by RFBR grant 17-01-00468.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grishunina, S.A. Limit Theorems for Queueing Systems with Various Service Disciplines in Heavy-Traffic Conditions. Methodol Comput Appl Probab 22, 1529–1538 (2020). https://doi.org/10.1007/s11009-018-9660-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-018-9660-1