Abstract
Queuing systems with cyclic waiting time are considered. The results of the Hungarian mathematician L . Lakatos are presented and generalized and possible application fields are specified.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Lakatos, “On a simple continuous cyclic-waiting problem,” Annales Univ. Sci., No. 14, 105–113 (1994).
E. V. Koba and I. N. Kovalenko, “Ergodicity condition for a system with queuing and servicing of objects with a complicated structure,” Cybern. Syst. Analysis, 43, No. 5, 625–628 (2007).
L. Lakatos, “A discrete cycle-waiting queueing problem,” Theoriya Veroyatn. i yeyo Primenen., 42, No. 2, 405–406 (1997).
L. Lakatos, “On a simple discrete cyclic-waiting queueing problem,” J. Math. Sci., 92, No. 4, 4031–4034 (1999).
L. Lakatos, “On a cyclic-waiting queueing system,” Theory of Stochastic Processes, 18, No. 2, 177–181 (1996).
L. Lakatos, “A probability model connected with landing of airplanes,” in: Safety and Reliability, Brookfield, Rotterdam (1999), pp. 151–154.
L. Lakatos, “Limit distribution for some cyclic-waiting systems,” in: Proc. Ukrainian Math. Congress, 2001, Kyiv (2002), pp. 102–106.
L. Lakatos, “A special cycling-waiting queueing system with refusals,” J. Math. Sci., 111, No. 3, 3541–3544 (2002).
E. V. Koba, “On a GI/G/1 retrial queuing system with FIFO service discipline,” Dop. NAN Ukrainy, No. 6, 101–103 (2000).
E. V. Koba, “On a GI/G/1 retrial queueing system with a FIFO queueing discipline,” Theory of Stochastic Processes, 24, No. 8, 201–207 (2002).
O. V. Koba, “Stationary characteristics of a GI/G/1 T-retrial queuing system with FIFO service discipline,” Visnyk NAU, No. 1, 122–125 (2003).
V. S. Korolyuk and Yu. V. Borovskikh, Analytic Asymptotics of Probability Distributions [in Russian], Naukova Dumka, Kyiv (1981).
E. V. Koba, “Ergodicity condition for a generalized Lakatos queuing model,” Dop. NAN Ukrainy, No. 11, 70–74 (2004).
A. A. Borovkov, Probabilistic Processes in Queuing Theory [in Russian], Nauka, Moscow (1972).
O. V. Koba and K. V. Mikhalevich, “Comparing Ì/Ì/1 systems with fast retrials for different service disciplines,” Syst. Doslidzh. Inform. Tekhnologii, No. 2, 59–68 (2003).
S. V. Pustova, “Investigation of call centers as retrial queuing systems,” Cybern. Syst. Analysis, 46, No. 3, 494–499 (2010).
S. V. Pustova, “Dependence of performance indices of a call center on the distribution of call’s sojourn time in the orbit,” Cybern. Syst. Analysis, 45, No. 2, 314–325 (2009).
S. Pustova, “Modeling call center operation with taking into account repeated attempts of subscribers,” Visnyk NAU, No. 3, 21–24 (2006).
O. V. Koba and S. V. Pustova, “Analytical model of call center operation,” Dop. NANU, No. 2, 17–25 (2007).
E. V. Koba and S. V. Pustova, “Call center as retrial queuing system,” J. Autom. Inform. Sci., Vol. 39, Issue 5, 37–47 (2007).
W. Rogiest, K. Laevens, D. Fiems, and H. Bruneel, “Analysis of a Lakatos-type queueing system with general service times,” in: Abstracts of the 20th Conf. on Quantitative Methods for Decision Making, ORBEL 20, Ghent (2006), pp. 95–97.
Compact optical buffer with ring resonators, IBM, 2006, http://domino.research.ibm.com/comm/research_projects.nsf/pages/photonics.ringbuffer.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2012, pp. 78–90.
Rights and permissions
About this article
Cite this article
Koba, E.V., Pustova, S.V. Lakatos queuing systems, their generalization and application. Cybern Syst Anal 48, 387–396 (2012). https://doi.org/10.1007/s10559-012-9418-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-012-9418-7