Cyclic-Retrial Queuing Systems with Dispatching
Cyclic-retrial queuing systems M / D /1 and GI / D / m are considered. Unlike Lakatos-type systems, dispatching of customers sent into orbit is introduced, and the FIFO service discipline is not considered. Embedded Markov chains are constructed for these systems, and sufficient conditions for their ergodicity are deduced.
Keywordsretrial queue Lakatos-type system orbit orbit cycle stability of queues ergodicity of queues embedded Markov chain dispatching
Unable to display preview. Download preview PDF.
- 4.L. Lakatos, “On a simple continuous cyclic-waiting problem,” Annals Univ. Sci. Budapest, Sect. Comp., Vol. 14, 105–113 (1994).Google Scholar
- 6.L. Lakatos, L. Szeidl, and M. Telek, Introduction to Queueing Systems with Telecommunication Applications, Springer (2013).Google Scholar
- 7.I. Kovalenko, “The FCFS-RQ system by Lakatos and its modifications,” RT&A, Vol. 13, No. 2 (49), 51–56 (2018).Google Scholar
- 10.D. Cox and V. Smith, Renewal Theory [Russian translation], Sov. Radio, Moscow (1967).Google Scholar