Routing algorithm for a three-stage connection network in presence of fanout

In this paper, the problem of routing connections through a three-stage connection network in presence Of fanout is considered. The assignment problem is viewed as a mapping of the input terminal set onto the output terminal set. An algorithm is presented which employs mapping operations to resolve blocking conflicts systematically as they are encountered. Relationships between the parameters of a 3-stage asymmetrical connection network which will minimize the number of switches and still leave the network rearrangeable, are also presented. The results from randomly generated output full and maximal assignments show that the algorithm is optimal for carefully designed networks.