Fault-tolerant routing strategy using routing capability in hypercube multicomputers

This paper addresses fault-tolerant routing which is concerned with finding feasible minimum paths in a faulty hypercube. The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing function. The amount of information that is useful for message routing is increased with our scheme. The proposed algorithm routes a message in an attempt to minimize derouting. In particular, it makes use of the information embedded in routing capabilities to establish a path for a message for which an upper bound on its length may be determined at the source. We then propose the notion of directed routing capability which captures more useful information for shortest path routing in comparison with undirected counterpart. Routing in hypercubes with link failures is also addressed.