Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes

Authors:
Jehad Al-Sadi;Khaled Day;Mohamed Ould-Khaoua
Affiliations:
University of Glasgow, Glasgow G12 8RZ, U.K.;Sultan Qaboos University, Muscat, Sultanate of Oman;University of Glasgow, Glasgow G12 8RZ, U.K.
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 10
Cited 1

The iPSC/2 direct-connect communications technology

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube message routing in the presence of faults

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks

IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

Performance Evaluation
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Adaptive routing protocols for hypercube interconnection networks

Computer
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems

Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using 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. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachablity and routing distances.