Message routing in an injured hypercube

Abstract

A distributed fault-tolerant routing scheme for an injured hypercube multicomputer is described. The scheme is based on the topology of the hypercube, and it requires each node to possess only the information on the failure of its own links. A rigorous analysis of the scheme shows that it is not only capable of routing messages successfully in an injured Q(n) when the number of component failures is less than n, but can also choose a shortest path with a very high probability.