Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In this paper, we propose a novel and efficientfault tolerant routing algorithm for mesh networksbased on the concept of k-submesh without virtualchannels and not sacrifice non-faulty nodes. Ouralgorithm is distributed and local information based.Due to the fact that our algorithm is designed basedon k-submesh structure, we apply probabilistic analysison the fault tolerance of our routing algorithm.Suppose that each node has an independent failureprobability, we derive the probability that our routingalgorithm successfully returns a fault-free routingpath. For example, we formally prove that aslong as the node failure probability is bounded by0.35%, our routing algorithm succeeds in finding afault-free routing path with high probability of 99%on mesh networks with 250000 nodes. Our algorithmruns in liner time and simulation results showthat the length of the routing path constructed by ouralgorithm are very close to the optimal length.