Design of fault tolerant routing algorithm and probabilistic analysis on Torus networks
Jie Xiao · Computer Engineering and Applications Journal · 2009
In the paper,a simple fault-tolerant routing algorithm is presented based on the concept of k-subtorus.Under the assump- tion that each node has an independent failure probability,it is able to compute the probability of the fault-free routing path which found by the routing algorithm.For the Torus network which has more than hundreds of thousands nodes,it is at least 99% the probability that a fault-free routing path can be found by the routing algorithm presented in the paper,which runs in linear time.