Minimization of path lengths in single stage connection networks
Jens Wirsching, Tomoji Kishi · International Conference on Distributed Computing Systems · 1982
The question is analyzed as to whether various connectivities within multiple-stage or single-stage connection networks are equivalent. Conditions under which the CN's are configured and exercised are precisely defined. Members of the universe of single-stage CN's are discovered to be non-equivalent and reasons for this are examined. Rules are developed for minimization of path lengths, and measurements are made for a number of different connectivities in both the static and dynamic states. Multiple-stage CN's are all found to be equivalent under random request loading and random arbitration. A comparison of the two types of CN's is attempted.