A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in m-ary n-cube Networks

Abstract

In this paper a new algorithm for fault-tolerant routing based on depth-first search Is developed. Its performance is analyzed for m-ary n-cube networks in presence of an arbitrary number of components being damaged. We derive an exact expression for the probability of routing messages via optimal paths from the source node to obstructed node. The probability of routing messages via an optimal path between any two nodes is a special case of our results, and can be obtained by replacing the obstructed node with the destination node. It is also showed that in the presence of component failures the new algorithm can route messages via an optimal path to its destination with a very high probability.