THE STATES’ FINAL PROBABILITIES ANALYTICAL DESCRIPTION IN AN INCOMPLETELY ACCESSIBLE QUEUING SYSTEM WITH REFUSALS

Authors

  • V. P. Gorodnov National Academy of National Guard of Ukraine, Kharkov, Ukraine, Ukraine
  • V. V. Ovcharenko Institute of National Guard of Ukraine, Kiev, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2022-2-4

Keywords:

Markov models, queuing systems, incomplete accessibility of queuing devices

Abstract

Context. There is a problem of forecasting the efficiency of real queuing systems with refusals in the case of incomplete accessibility of service devices for the input flow of requirements. The solution of problem is necessary to create the possibility of more accurate design and control of such systems operation in real time.

Objective. The aim of the research is to obtain an analytical description of the state’s final probabilities in a Markov queuing system with refusals and with incomplete accessibility of service devices for the input flow of requirements that is necessary to forecast the values of the queuing system performance indicators.

Method. The probabilities of queuing systems’ states with refusals in the case of incomplete accessibility of service devices for the input flow of requirements are described by Kolmogorov differential equations. In a stationary state, these equations are transformed into a linearly dependent homogeneous system of algebraic equations. The number of equations is determined by the setdegree and for modern queuing and communication systems can be in the thousands, millions and more. Therefore, an attempt to predict the efficiency of a system is faced with the need to write down and numerically solve a countable set of algebraic equations systems that is quite difficult.

The key idea of the proposed method for finding an analytical description of final probabilities for a given queuing system was the desire to move from the description of individual states (of 2n amount) to the description of groups of system states (of n+1 number) and to localize the influence of incomplete accessibility of service devices for the input flow of requirements in multiplicative functions of incomplete accessibility. Such functions allow obtaining the required analytical description and assessing the degree of the final probabilities transformation, in comparison with known systems, as well as assessing the forecasted values of the noted queuing system’s efficiency indicators when building a system and choosing the parameters for its controlling.

Results. For the first time analytical expressions are obtained for the final probabilities of the queuing system states with refusals and with incomplete accessibility of service devices for the input flow of requirements, which makes it possible to evaluate as well as forecast values of all known system efficiency indicators.

Conclusions. The resulting description turned out to be a general case for well-known type of Markov queuing systems with refusals. The results of the numerical experiment testify in favor of correctness the obtained analytical expressions for the final probabilities and in favor of possibility for their practical application in real queuing systems when solving problems of forecasting efficiency, as well as analyzing and synthesizing the parameters of real queuing systems.

Author Biographies

V. P. Gorodnov, National Academy of National Guard of Ukraine, Kharkov, Ukraine

Dr. Sc., Professor

V. V. Ovcharenko, Institute of National Guard of Ukraine, Kiev, Ukraine

Dr. Sc., Associate Professor, Deputy Head

References

Khinchin A. Ya. Pod red. B. V. Gnedenko. Raboty po matematicheskoy teorii massovogo obsluzhivaniya. – Moscow, Fizmatgiz, 1963, 236 p.

Lidskiy E.A. Zadachi trafika v setyakh svyazi, Uchebnoye posobiye. Yekaterinburg, UGTU – UPI GOU VPO, 2006, 202 p.

Gorodnov V. P. Vysshaya matematika (populyarno, s primerami), Uchebnik dlya stud. ekon. spets. vyssh. uch. zaved. Izd 3-ye. KH., Izd-vo AVV MVD Ukrainy, 2013, 380 p.

Erlang A.K. The Theory of Probabilities and Telephone Conversations, Nyt Tidsskrift for Mathematic Ser. B 20, 1909.

Ebadi M., Ahmadi-Javid A. Socio-economic design of control charts for monitoring service processes: a case study of a restaurant system, Journal Quality Technology & Quantitative Management, 2018. DOI: https://doi.org/10.1080/16843703.2018.1519880

Albey E., Bilge U., Uzsoy R.: Multi-dimensional clearing functions for aggregate capacity modeling in multi-stage production systems, International Journal of Production Research, 2017, Vol. 55, Issue 14, pp. 4164-4179, Publisher Taylor & Francis. https://doi.org/10.1080/00207543.2016.1257169.

Plotkin B. K., Delyukin L. A. Ekonomiko-matematicheskiye metody i modeli v kommercheskoy deyatel’nosti i logistike, Uchebnik, SPb., Izd-vo SPb, 2015, 345 p.

Kleynrok L. Vychislitel’nyye sistemy s ocheredyami. Moscow, Mir, 1979, 600 p.

Afanas’yeva L. G., Bulinskaya Ye. V. Matematicheskiye modeli transportnykh sistem, osnovannyye na teorii ocheredey, Trudy MFTI, 2010, Vol. 2, No. 4, pp. 6–10.

Karasev N. A., Kislukhina Ye. V., Vasil’yev V. A. Ispol’zovaniye teorii massovogo obsluzhivaniya v organizatsii lechebnogo protsessa na gospital’nom etape skoroy meditsinskoy pomoshchi. Vestnik mezhdunarodnoy akademii nauk (Russkaya sektsiya). 2006, pp. 65-68. http://simulation.su/uploads/files/default/2006-karasevkisluhina-vasiliev.pdf

Zhao Z. Q., Hao J. X., Li L. J. Study on combat effectiveness of air defense missile weapon system based on queuing theory, Proc. SPIE 10322, Seventh International Conference on Electronics and Information Engineering, 1032205 (23 January 2017) Nanjing. China. https://doi.org/10.1117/12.2266077

Downloads

Published

2022-06-17

How to Cite

Gorodnov, V. P., & Ovcharenko, V. V. (2022). THE STATES’ FINAL PROBABILITIES ANALYTICAL DESCRIPTION IN AN INCOMPLETELY ACCESSIBLE QUEUING SYSTEM WITH REFUSALS. Radio Electronics, Computer Science, Control, (2), 32. https://doi.org/10.15588/1607-3274-2022-2-4

Issue

No. 2 (2022): Radio Electronics, Computer Science, Control

Section

Mathematical and computer modelling

License

Copyright (c) 2022 V. P. Gorodnov, V. V. Ovcharenko

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.