A Fault-Tolerant Routing Algorithm for 3-D Torus Interconnection Networks
Jehad Al-Sadi1, Khaled Day 2, Mohamed Ould-Khaoua3
1Department of Computer Science, Zarka Private University, Jordan
2Department of Computer Science, Sultan Qaboos University, Sultanate of Oman
3Department of Computing Science, University of Glasgow, UK
Abstract: This paper describes a new fault-tolerant routing algorithm for 3-D tori using the concept of “probability vectors”. To compute these vectors, a node determines first its faulty set, which represents the set of all its neighboring nodes that are faulty or unreachable due to faulty links. Each node then calculates a probability vector, where the lth element represents the probability that a destination node at distance l cannot be reached through a minimal path due to a faulty node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. An extensive performance evaluation conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.
Keywords: Multicomputers, interconnection networks, 3-D tori, fault-tolerant routing, performance evaluation.
Received April 27, 2003; accepted May 12, 2003