A new evaluation criterion for Clos- and Benes-type rearrangeable switching networks

An extended comparison and a classification of the control algorithms for rearrangeable switching networks is tried in this study. Besides of the failure probability P/sub f/ a new evaluation criterion is introduced, the mean number of rearranges R, the network performs in order to satisfy incoming calls. A simulation comparison for eight control algorithms concerning Clos-type networks and networks with 2/spl times/2 elements is attempted with very helpful results for the network design. Furthermore, some deadlock conditions discovered in one of these algorithms are completely recovered. The comparison is carried out for both evaluation criteria (R/sub m/ and P/sub f/) and it is shown that the new criterion leads to a deep insight of the systems, necessary for a successful network design.