Abstract
In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets SkA for all 1 ≤ k ≤ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, SkA, of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.
Original language | English |
---|---|
Pages (from-to) | 1381-1399 |
Number of pages | 19 |
Journal | Parallel Computing |
Volume | 27 |
Issue number | 10 |
DOIs | |
Publication status | Published - Sept 2001 |
Keywords
- Fault-tolerant routing
- Interconnection networks
- Multicomputers
- Performance evaluation
- Probability
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computer Graphics and Computer-Aided Design
- Artificial Intelligence