A new probabilistic approach for fault-tolerant routing in k-ary n-cubes

This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors" and conducts an extensive performance analysis for the new algorithm. To compute these vectors, a node determines first its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty links. Each node then calculates a probability vector, where the l/sup th/ element represents the probability that a destination node at distance l cannot be reached through a minimal path due to a fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.