A communication structure for supporting fault-tolerant and adaptive wormhole routing in a binary n-cube

A communication structure for a binary n-cube is proposed, which consists of hierarchically ordered virtual networks corresponding to the cube. It is shown that the structure is deadlock-free and can support adaptive and fault-tolerant routing strategies. The software as well as the hardware support required for implementing wormhole routing are discussed. The applicability of the method for networks like k-ary n-cubes is also considered.<
>