Wormhole routing algorithms for twisted cube networks
Paul Cull, Shawn M. Larson · 2002
The hypercube can be "improved" by "twisting" or rearranging edges to create new networks with smaller diameter and average distance. There are two criticisms of these twisted cube networks. First, these networks have not been shown to have deadlock-free routing algorithms. Second, while they can sometimes provide a better performance for a store-and-forward routing strategy, they have not been shown to be efficient when using a wormhole routing strategy. In this paper, we introduce a new network, the Bent Cube, and examine one recently published network, the Generalized Twisted Cube to address these issues.>