A probabilistic model for the performance analysis of multistage interconnection networks

A recursive equation performing the computation of the probabilistic characteristics of message flow in a quite general class of communication networks is presented. This formulation leads to the evaluation of average transit time through the network. The important point of the proposed model consists in the introduction of a second probability (that a message progresses from one stage to the next) joined with the probability of occupation of one buffer in then network. The overall amount of computations is reasonable, and the use of the recursion is almost as simple as the use of an analytic formula.<
>