Efficient distributed routing algorithms for a synchronous circuit-switched hypercube

Abstract

The authors discuss the development and performance of a series of distributed routing algorithms for a synchronous circuit-switched hypercube and enhanced hypercube. Several centralized routing algorithms were developed. All the routing algorithms developed were derived from a single high-level concept of how routing can be accomplished in a circuit-switched hypercube. The routing algorithms were derived from the corresponding packet switching routing algorithm. The routing algorithms have different strengths and weaknesses when compared with one another, and these are considered. It is shown that the highest performing algorithm has an extremely low probability of blocking for the enhanced hypercube and the standard hypercube.<>