Title :
A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in m-ary n-cube Networks
Author_Institution :
Three Gorges Univ., Yichang
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.
Keywords :
fault tolerance; hypercube networks; probability; search problems; telecommunication network reliability; telecommunication network routing; depth-first search; fault-tolerant routing; m-ary n-cube networks; obstructed node; optimal path; routing messages probability; source node; Educational institutions; Fault tolerance; Hamming distance; History; Hypercubes; Optimal control; Partial response channels; Performance analysis; Routing; Telecommunication network reliability;
Conference_Titel :
Networking, Sensing and Control, 2007 IEEE International Conference on
Conference_Location :
London
Print_ISBN :
1-4244-1076-2
Electronic_ISBN :
1-4244-1076-2
DOI :
10.1109/ICNSC.2007.372850
