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.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.