×

Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions. (English) Zbl 1460.60103

Summary: 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 \(\rho \geq 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 \(\rho > 1\) and its absolute value for the case \(\rho = 1\).

MSC:

60K25 Queueing theory (aspects of probability theory)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Afanaseva, LG, Queueing systems with cyclic control processes, Cybern Syst Anal, 41, 1, 43-55 (2005) · Zbl 1080.90022 · doi:10.1007/s10559-005-0040-9
[2] Afanaseva, LG; Bashtova, EE, Coupling method for asymptotic analysis of queues with regenerative input and unreliable server, Queueing Syst, 76, 2, 125-147 (2014) · Zbl 1307.60122 · doi:10.1007/s11134-013-9370-x
[3] Afanasyeva, L.; Bashtova, E.; Bulinskaya, E., Limit theorems for Semi-Markov queues and their applications, Comput Stat Part B: Simul Comput, 41, 6, 688-709 (2012) · Zbl 1261.60083 · doi:10.1080/03610918.2012.625255
[4] Afanaseva, L.; Grishunina, S., Queueing systems with different service disciplines, Lobachevskii J Math, 38, 5, 864-869 (2017) · Zbl 1403.90229 · doi:10.1134/S199508021705002X
[5] Anisimov, V., Diffusion approximation in overloaded switching queueing models, Queueing Syst, 40, 141-180 (2002) · Zbl 1040.60075 · doi:10.1023/A:1014371517599
[6] Anisimov, V., Switching processes in queueing models (2008), London: Wiley, ISTE, London · Zbl 1156.60002
[7] 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
[8] Asmussen, S., Ladder heights and the Markov-modulated m|g|1 queue, Stochastic Process Appl, 37, 313-326 (1991) · Zbl 0734.60091 · doi:10.1016/0304-4149(91)90050-M
[9] Borovkov, A., Asymptotic methods in queueing theory (1984), Chichester: Wiley, Chichester · Zbl 0544.60085
[10] Borovkov A (1976) Stochastic processes in queueing theory. Springer · Zbl 0319.60057
[11] Eschenfeldt P, Gamarnik D (2015) Join the shortest queue with many servers. The heavy traffic asymptotics. arXiv:1502.00999 · Zbl 1433.60087
[12] Foley, RD; McDonald, DR, Join the shortest queue: stability and exact asymptotics, Ann Appl Probab, 11, 569-607 (2001) · Zbl 1016.60078
[13] Grandell J (1976) Double stochastic poisson processes. In: Lecture notes in mathematics. Springer, Berlin · Zbl 0339.60053
[14] Iglehart, DL; Whitt, W., The equivalence of functional central limit theorems for counting processes and associated partial sums, Ann Math Stat, 42, 4, 1372-1378 (1971) · Zbl 0226.60028 · doi:10.1214/aoms/1177693249
[15] Liu, Y.; Whitt, W.; Yu, Y., Approximations for heavily loaded g/GI/n + GI queues, Nav Res Logist, 63, 3, 187-217 (2016) · Zbl 1411.90097 · doi:10.1002/nav.21688
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.