стационарное распределение

Markov Chain States Classification in a Tandem Model with a Cyclic Service Algorithm with Prolongation

Authors: Kocheganov V. M.

There is a limited list of papers about crossroads tandems. Usually the following service algorithms are under consideration: a cyclic algorithm with fixed duration, a cyclic algorithm with a loop a cyclic algorithm with regime changes etc. To construct a formal mathematical model of queuing systems nets and crossroads tandems in particular a descriptive approach is usually used. Using this approach input flows and service algorithms are set at the level of content, service duration distribution is known and set via a particular customer service distribution function.

About closed queuing networks with variable number of queues

Authors: Tananko I. E.

Consider a closed queueing network with the possibility of breakdowns at each server. When a breakdown occurs at one server, all customers there are transferred in queue with operational server immediately, and the server is then sent for repair. Steady- state probability of the queue sizes is obtained, and is shown to have a product form solution.

Dynamic load allocation in closed queueing networks with batch movements

Authors: Mitrophanov Y. I., Rogachko E. S., Stankevich E. P.

A method of load allocation control in closed queueing networks with batch movements is proposed. When this method is used in queueing networks of considered type, close to given customer allocation among queueing systems is provided. The control is realized by use of different routing matrices during fixed time intervals in process of network operation. Models of evolution and an approximate method of computing a stationary distribution and other stationary characteristics of considered type queueing networks are presented.