Construction Of Queueing Networks With Stationary Product Distributions

Abstract

In this article some new product theorems for opened and closed queuing networks with finite number of states have been proved. Each network is characterized by a graph with states in its nodes and positive transition intensities in its edges. For different graphs and systems of motion equations stationary product distributions of Markov processes, which describe queuing networks with different prohibited transitions, have been obtained. Calcu-lation algorithm of route matrices corresponding to modified systems of motion equations has been constructed.