A Fault-Tolerant Routing Algorithm in Hypercubes

Fault-tolerant communication mechanism for multicomputer systems is an important feature to reliability-critical applications. In this paper, we will present a fault-tolerant routing algorithm that has a better performance than a previous work in the sense that it requires less message overhead and the message header needs to be updated at fewer intermediate nodes. A comparison between the algorithms and a previous work is given.