Skip to main content
SpringerLink
Log in

A Two-Cyclic Queuing System

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Lakatos, “On a simple continuous cyclic-waiting problem,” Annales Univ. Sci. Bud. Sect. Comp., 14, 105–113 (1994).

    MATH  MathSciNet  Google Scholar 

  2. L. Lakatos, “On a cyclic-waiting queueing system,” Theory of Stochastic Processes, 2, No. 18, 176–180 (1996).

    Google Scholar 

  3. 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).

    MathSciNet  Google Scholar 

  4. E. V. Koba, “Stability conditions for some typical retrial queues,” Cybern. Syst. Analysis, 41, No. 1, 100–103 (2005).

    Article  MATH  Google Scholar 

  5. 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).

    Article  MATH  MathSciNet  Google Scholar 

  6. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, Wiley (1968).

  7. A. A. Borovkov, Ergodicity and Stability of Random Processes [in Russian], Editorial URSS, Moscow (1999).

    Google Scholar 

  8. “What are the subsemigroups of (N, +)?” http://math.stackexchange.com/questions/164164/what-are-the-subsemigroupsof-mathbb-n.

  9. J. Shallit, “The Frobenius problem and its generalizations,” http://cs.uwaterloo.ca/~shallit/Talks/frob6.pdf.

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    I. N. Kovalenko

Authors
  1. I. N. Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. N. Kovalenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2015, pp. 59–64.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9696-y

Keywords

Search

Navigation