Recursive Computation of Steady-State Probabilities of Nonproduct Form Queueing Networks Associated with Computer Network Models

This paper deals with the exact computation of the equilibrium state probabilities of a class of nonproduct form queueing networks which is of interest for communication systems. It is shown that specific structure in the state transition lattice leads to a sequential method of solution. The method is sequential either in terms of individual states or in terms of subsets of states. In the former case, algebraic recursions for the probabilities of state can be developed. In both cases, substantia) computational savings are possible.