Online Adaptive Fault-Tolerant Routing in 2D Torus

In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty nodes. The proposed algorithms find a fault-free path between any two nonfaulty nodes with high probability in linear time by using only the local routing information of the network. The results of our empirical analysis through simulations show that the algorithms can find a fault-free path between any two nonfaulty nodes with high probability. For example, in a torus of size up to 128×128, where, the number of faulty nodes up to 15%, the heuristucsquare routing algorithm finds a fault-free path with a probability of 90% or higher. The experimental results are impressive for 2D torus with only four links per node.

• Type: Conference
• Year: 2005
• Where: ISPA
• Authors: Yamin Li, Shietung Peng, Wanming Chu
• Keywords: Fault-free Path, Faulty Nodes, ISPA 2005, Nonfaulty Nodes