Adaptive routing in generalized hypercube architectures

The authors study generalized hypercube (GHC) interconnection networks. This network provides a rich interconnection topology, is symmetric, and potentially forms the basis of a very reliable architecture. They propose a general taxonomy for adaptive routing protocols, and identify three classes of protocols for generalized hypercubes in particular. These protocols are fully distributed, resilient to link failures or bottlenecks, and require comparatively little additional routing overhead over current fixed path routing protocols. The performance of the three protocols is evaluated for a 64 node circuit switched GHC. The authors propose metrics in addition to the commonly used metrics of latency and path length, to capture the unique behavior of such adaptive protocols