A probabilistic approach to fault-tolerant routing algorithm on mesh networks

In this paper, we propose a novel and efficient fault tolerant routing algorithm for mesh networks based on the concept of k-submesh without virtual channels and not sacrifice non-faulty nodes. Our algorithm is distributed and local information based. Due to the fact that our algorithm is designed based on k-submesh structure, we apply probabilistic analysis on the fault tolerance of our routing algorithm. Suppose that each node has an independent failure probability, we derive the probability that our routing algorithm successfully returns a fault-free routing path. For example, we formally prove that as long as the node failure probability is bounded by 0.35%, our routing algorithm succeeds in finding a fault-free routing path with high probability of 99% on mesh networks with 250000 nodes. Our algorithm runs in liner time and simulation results show that the length of the routing path constructed by our algorithm are very close to the optimal length.