A closed queueing structure is considered in the paper; the number of single-type messages is not constant and depends on time. The route of messages is given by an arbitrary stochastic matrix of transition probabilities. An asymptotic analysis of this structure in case of large number of service requests is conducted. The service parameters of each queueing system of this structure, as well as the probability of messages transition between systems, depend on time. A system of ordinary differential equations to calculate the average relative number of messages in each queueing system, depending on the time, was obtained.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
A queueing network of any structure with single-type messages is considered in the paper. An asymptotic analysis of the network in case of large number of service requests conducted. It is suggested that the service parameters of each queueing system of the network, as well as the probability of messages transition between systems, depend on time. A system of ordinary differential equations to calculate the average relative number of messages in each queueing system, depending on the time, was obtained. There is one calculated example in the article.
Investigation of incomes in Markov network with central system, which could be a model of incomes changing in banking network, bas been dane. Systems incomes erom passages between network' s states depend on time. Set of equations for incomes bas being solved by numerical method. Also asymptotic analysis of incomes on large time period bas being dane.
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ć.