NON-STATIONARY DISTRIBUTION OF THE PROBABILITY STATES OF THE MARKOV NETWORK WITH INFINITE-SERVER QUEUING SYSTEMS OPERATING AT HIGH LOAD
Abstract
The object of research is the Markov queuing network with infinite-server queues. The disciplines of the customer’s service in queuing systems (QS) are FIFO (first come – first served), service rates of customers are distributed exponentially with their own rates for each QS in each line of QS. The purpose of the research is to obtain sufficient conditions for representability of non-stationary state probabilities of such a network operating within the heavy-traffic regime in the multiplicative form. In the introduction, the field of applications of Markov networks with infinite-server queues has been described; the relevance of this work has also been indicated; a brief overview of the previous results on this subject has been given. In the main part, the network has been shown; the system of Kolmogorov’s difference-differential equations for the state probabilities of the network conditions has been derived. The main result of this article is as follows, i.e. the multiplicative form of the non-stationary state probabilities of the above-mentioned Markov network operating within the heavy-traffic regime is formulated and proved as a theorem. The obtained results can be used for modeling the behavior of information and computer systems and networks, transportation systems, insurance companies, banking networks and other facilities, the stochastic models which are the queuing networks.
About the Authors
D. J. KopatsBelarus
Postgraduate of the Department of Stochastic Analysis and Econometric Modeling, Faculty of Mathematics and Computer Science
M. A. Matalytski
Belarus
Professor, D. Sc. (Physics and Mathematics), Head of the Department of Stochastic Analysis and Econometric Modeling, Faculty of Mathematics and Computer Science
References
1. Vishnevskii V.M. Theoretical Bases of Designing Computer Networks. Moscow, Technosphere Publ., 2003. 506 p. (In Russian).
2. Matalytskii M.A., Tikhonenko O.M., Koluzaeva E.V. Systems and Queueing Network Analysis and Application. Grodno, Grodno State University, 2011. 817 p. (In Russian).
3. Matalytskii M.A., Rusilko T.V. Network Probabilistic Models of Processing Customer Requests in an Insurance Company. Berlin: LAP LAMBERT Academic Publ., 2012. 327 p. (In Russian).
4. Matalytskii M.A., Kiturko O.M. Mathematical Analysis of HM-networks and their Application in the Transport Logistics. Grodno, Grodno State University, 2015. 231 p. (In Russian).
5. Kelly F.P., Williams R.J. Stochastic Networks. The IMA Volumes in Mathematics and its Applications. N.Y., SpringerVerlag, 1995. 170 p.
6. Lebedev E.A., Chechelnitskii A.A. Diffusion Approximation of non-Markov Queueing Networks in the Transition Regime. Analiticheskie metody issledovaniya stokhasticheskikh sistem [Analytical Methods for Studying Stochastic Systems]. Kiev, Kiev State University, 1989, pp. 61–66. (In Russian).
7. Medvedev G.A. Closed queueing systems and their optimization. Izvestiya Akademii nauk SSSR. Tekhnicheskaya kibernetika [Proceedings of the USSR Academy of Sciences. Technical Cybernetics], 1978, vol. 6, pp. 199–203. (In Russian).
8. Gelenbe E. Probabilistic models of computer systems. Part II: Diffusion approximation waiting times and batch arrivals. Acta Informatica, 1979, vol. 12, no. 4, pp. 285–303. Doi: 10.1007/bf00268317
9. Kobayashi H. Application of the diffusion approximation to queueing networks I: Equilibrium queue distributions. Journal of ACM, 1974, vol. 21, no 2, pp. 316–328. Doi: 10.1145/321812.321827; Kobayashi H. Application of the diffusion approximation to queueing networks II: Nonequilibrium distributions and applications to computer modeling. Journal of ACM, 1974, vol. 21, no 3, pp. 456–469. Doi: 10.1145/321832.321844
10. Matalytskii M.A. Method for Obtaining the Unsteady State Probabilities in Markovian Queueing Networks. Problemy peredachi informatsii [Information Transmission Problems], 1994, vol. 30, no. 2, pp. 104–107. (In Russian).
11. Matalytskii M.A. Research Network with a multiline service systems and heterogeneous applications. Avtomatika i telemekhanika [Automation and Remote Control], 1996, no. 9, pp. 79–92. (In Russian).
12. Ivnitskii V.A. Theory of Queuing Networks. Moscow, FIZMATLIT, 2004. 772 p. (In Russian).
13. Matalytski M.A., Statkevich S.E. Stochastic Networks with Bounded Waiting Time of Customers and Unreliable Servicing Systems. Grodno, GrSU, 2014. 248 p. (In Russian).
14. Matalytskii M.A, Naumenko V.V. Stochastic Networks with Non-Standard Customers Movement. Grodno, Grodno State University, 2016. 346 p. (In Russian).