Recursive computation of steady-state probabilities of nonproduct form queueing networks associated with computer network models

Abstract

Consideration is given to the exact computation of the equilibrium state probabilities of a class of non-product-form queueing networks that is of interest for communication systems. It is shown that a 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 state probabilities can be developed. In both cases, substantial computational savings are possible. >