Analysis of Queueing Networks with Batch Movements of Customers and Control of Flows Among Clusters

摘要

The paper proposes two methods for calculating the stationary distribution of the queueing networks with batch movements of customers and control of flows among clusters. The methods differ in their computing efficiency. The constraints related to practical use of the first method are determined mostly by the dependence of the required amount of computation on the cardinality of the set of states of networks under study. The second method is approximate and analyzes queueing networks lying in the subclass of almost completely decomposable networks. The second method is based on the decomposition of set of states of the queueing network under study into subsets and proves much more computationally efficient compared to the first method.