Analysis of stochastic models of computer systems and networks in transient behaviour

• Autorzy: Matałycki M. , Gomanczuk S.
• Języki publikacji: EN

Abstrakty

EN

This paper provides an approximate numerical method of calculating of the time-dependent state probabilities of Markovian queueing networks, which can be used as models of various kinds of computer systems and networks. We consider queueing networks with multi channel devices and multi-type messages. The specified method is based on successive approximations idea for the set of difference-differential Kolmogorov equations, the state probabilities satisfy, combined with numeric series analyzing methods. We examined the successive approximations features and, as an example, we applied ibis method for calculating the state probabilities for two types of queueing networks: priority-service discipline network and the network with limited waiting time in queues.

Słowa kluczowe

EN

computer systems and networks; queueing networks; state-dependent probabilities

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2002
• Tom: R. 2, nr 2
• Strony: 9--20
• Opis fizyczny: Bibliogr. 10 poz., 2 rys.

Twórcy

autor

Matałycki M.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa Dąbrowskiego 73, 42.200 Częstochowa

autor

Gomanczuk S.

• Institute of Mathematics and Computer Science, Technical University of Częstochowa Dąbrowskiego 73, 42.200 Częstochowa

Bibliografia

• [1] Basharin G., Tolmatchev A., The theory of QN and it's applies for analyzing CSN, The result of science and technics. T. 21. VINITI, Moscow 1983, 3-119 (in Russian).
• [2] Sigalov G.G., Lupersolsky A.M., The method of the approximate calculation of transient processes in network queuing models, Automation and Computer Engineering 1990, 3, 40-43 (in Russian).
• [3] Nykowska M., Model tandemowego systemu obsługi, Przegląd Statystyczny 1984, 29, 3, 531-540.
• [4] Harisson J.M., Lemoine A.J., A note on networks of infinite-server queues, Journal of Applied Proobability1981, 18, 2, 561-567.
• [5] Massey W., An operator-analytic approach to the Jackson network, Journal of Applied Probability 1984, 21, 2, 379-393.
• [6] Massey W., Calculating exit times for series Jackson network, Journal of Applied Probability 987, 24, 1, 226-234.
• [7] Harisson P.G., Transient behavior of queuing networks, Journal of Applied Probability 1981, 18, 2, 482-490.
• [8] Matalytski M., Finding probabilities of Markov queuing network states at transient regime, Automation Control and Computer Sciences 28, 3, 9-12.
• [9] Matalytsky M., Queuing networks in stationary and transient regimes, GrSU, Grodno 2001, 211 (in Russian) .
• [10] Malinkovski Y.V., Notes about different equations, appeared in one problem of queue theory, Papers of AS BSSR 1979, 23, 1, 22-25 (in Russian).