Recursive solution of a class of non-product form protocol models

Abstract

Two classes of non-product-form protocol models where the equilibrium probabilities of state may be computed recursively are described. An algorithm is presented for the computer generation of these recursions. The use of the algorithm is described for manufacturing nets, a class of Petri type networks. These are useful for modeling a linear process where one must wait for components to arrive before one can move to the next step of the process. Aside from the manufacturing context, they are useful for modeling certain communication processes such as multihop radio transmission and layered architecture communications.<>