Bridged Hypercube Networks

Abstract The problem of reducing the diameter of a hypercube-based structure by adding some redundant links to the standard hypercube is considered. A new architecture called Bridged Hypercube (BHC) is introduced. It is shown that the BHC diameter is approximately half the diameter of its hypercube counterpart. For this design, simple and efficient routing algorithms are devised and proved correct. The incremental cost of the proposed link redundancy vanishes as the dimensionality of the hypercube grows yielding an asymptotically overhead free design.