Adaptive box-based efficient fault-tolerant routing in 3D torus

In this paper, we propose efficient fault-tolerant routing algorithms for 3D torus with possible large number of faulty nodes. There is no any 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 faulty 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 a probability higher than 90% in a 3D torus with the number of faulty nodes up to 30%.