Abstract
Laslo Lakatos [1, 2] introduced a queuing system in which waiting time V of a customer increases up to a W multiple of T. This problem statement is motivated by a problem occurred in aviation: T is aircraft go-around time when the runway is not clear. In the present paper, a queuing system is considered in which V increases up to T1x + T2 y, where T1 and T2 are given numbers (go-around times of two “circles”) and x and y are V-dependent integers (numbers of rounds). An ergodic theorem for a proper embedded Markov chain is proved. An algorithm is given to compute x and y given V.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
L. Lakatos, “On a simple continuous cyclic-waiting problem,” Annales Univ. Sci. Bud. Sect. Comp., 14, 105–113 (1994).
L. Lakatos, “On a cyclic-waiting queueing system,” Theory of Stochastic Processes, 2, No. 18, 176–180 (1996).
E. V. Koba, “On a GI G / /1retrial queueing system with a FIFO queueing discipline,” Theory of Stochastic Processes, 24, No. 8, 201–207 (2002).
E. V. Koba, “Stability conditions for some typical retrial queues,” Cybern. Syst. Analysis, 41, No. 1, 100–103 (2005).
R. L. Tweedie, “Sufficient conditions for ergodicity and recurrence of Markov chains on a general state space,” Stoch. Processes Appl., 3, No. 4, 385–403 (1975).
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, Wiley (1968).
A. A. Borovkov, Ergodicity and Stability of Random Processes [in Russian], Editorial URSS, Moscow (1999).
“What are the subsemigroups of (N, +)?” http://math.stackexchange.com/questions/164164/what-are-the-subsemigroupsof-mathbb-n.
J. Shallit, “The Frobenius problem and its generalizations,” http://cs.uwaterloo.ca/~shallit/Talks/frob6.pdf.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2015, pp. 59–64.
Rights and permissions
About this article
Cite this article
Kovalenko, I.N. A Two-Cyclic Queuing System. Cybern Syst Anal 51, 51–55 (2015). https://doi.org/10.1007/s10559-015-9696-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9696-y