Cybernetics And Systems Analysis logo
Editorial Board Announcements Abstracts Authors Archive
Cybernetics And Systems Analysis
International Theoretical Science Journal
-->

UDC 519.872
O.V. Koba1, S.V. Serebriakova2


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

ekoba2056@gmail.com

2 V.M. Glushkov Institute of Cybernetics,
National Academy of Sciences of Ukraine, Kyiv, Ukraine,
and National Aviation University, Kyiv, Ukraine

svitlaspv@gmail.com

GI/G/1 LAKATOS-TYPE QUEUEING SYSTEM WITH Т-RETRIALS

Abstract. Authors consider the Lakatosh-type GI/G/1 queueing system with T-retrials, i.e., the system with the FCFS service discipline and a constant cycle time T of the orbit. Here we construct the Markov chain for the system, prove its ergodicity condition, solve the system of equations for the stationary distribution of the system state probabilities, and derive formulas for the average number of requests and the average number of the orbit cycles at a specific ratio of service time and orbit time. Also, we develop an algorithm for statistical modeling of the considered system. Results of analytical and statistical modeling show consistency between them. Authors indicate an essential property of the Lakatos-type system, namely, that we can use it to evaluate a system in which the FCFS service order is not necessary.

Keywords: retrial queues, Lakatos-type queueung system, cyclic queueing systems, queueing system with T-retrials, orbit, orbit cycle, Markov chain, queueing system ergodicity.



FULL TEXT

REFERENCES

  1. Artalejo J. A classified bibliography of research in retrial queueing. Progress in 1990–1999. Top. 1999. N 7. P. 187–211.

  2. Artalejo J. A classified bibliography of research in retrial queueing. Progress in 2000–2009. Mathematical and Computer Modeling. 2010. Vol. 51. P. 1071–1081.

  3. Serebriakova S.V. Algorithm of the statistical modeling of retrial queuing system . Proc. Aviation in the XXI Century. October, 2018, Kyiv, Ukraine. P. 4.3.47–4.3.50.

  4. Kuznetsov D.Yu., Nazarov A.A. Adaptive random multiple access networks [in Russian]. Tomsk: Del'taplan, 2002. 254 p.

  5. Rogiest W., Laevens K., Fiems D., Bruneel H. A performance model for an asynchronous optical buffer. Performance Evaluation. 2005. Vol. 62. P. 313–330.

  6. Rhung-Duc T., Rogiest W., Takahashi Y., Bruneel H. Retrial queues with balanced call blending analysis of single-server and multiserver model. Annals of Operations Research. 2016. Vol. 239, Iss. 2. P. 429–449.

  7. Kovalenko I.N., Koba E.V. Three retrial queuing systems, reflecting some features of the aircraft landing process. Problemy upravleniya i informatiki. 2002. N 2. P. 78–82.

  8. What does a day of bad weather look like? (2014). URL: https://youtu.be/brX sub VhOU3qQ.

  9. Lakatos L. A probability model connected with landing of airplanes. Safery and Reliability. Vol. 1. Balkema A. (Ed.). Rotterdam: Brookfield, 1999. P. 151–154.

  10. Koba E.V., Pustova S.V. Lakatos queuing systems, their generalization and application. Kibernetika i sistemnyj analiz. 2012. N 3. P. 78–90.

  11. Koba E.V. Queuing systems with cyclical return times and dispatching. Kibernetika i sistemnyj analiz. 2019. Vol. 55, N 6. P. 54–61.

  12. Lakatos L., Szeidl L., Telek M. Introduction to queueing systems with telecommunication applications. Springer Science & Business Media, 2012. 388 p. https://doi.org/10.1007/978-3-030-15142-3 (2019).

  13. Koba E.V. Retrial queueing system M/M/1/0 with combined service discipline. Kibernetika i sistemnyj analiz. 2017. Vol. 53, N 3. P. 67–72.

  14. Bocharov P.P., Pechinkin A.A. Queuing theory [in Russian]. Moscow: RUDN Publishing House, 1995. 528 p.

  15. Korolyuk V.S., Borovskikh Yu.V. Analytical asymptotics of probability distributions [in Russian]. Kiev: Nauk. dumka, 1981. 348 p.

  16. Riply B.D. Thoughts on pseudorandom number generators. J. Comput. Appl. Math. 1990. Vol. 31. P. 153–163.




© 2021 Kibernetika.org. All rights reserved.