### Abstract

Many exiting studies have focused on the design of efficient fault-tolerant routing algorithms for common multicomputer networks, such as k-ary n-cubes. However, there has been comparatively little research activity on analysing and comparing these algorithms. In an effort towards filling this gap, this paper analyses the performance of two fault-tolerant routing algorithms, namely the unsafety vectors and probability vectors, recently proposed for k-ary n-cubes. In the unsafety vectors algorithm, each node calculates numeric unsafety vectors capturing information about faulty nodes in the network and uses them to achieve efficient fault-tolerant routing. In the probability vectors algorithm, a probabilistic approach is employed to achieve fault-tolerance. Each node calculates a probability vector, where the ith element represents the probability that a destination node at distance i cannot be reached through a minimal path due to a faulty node or link. The results presented below reveal that both algorithms exhibit good performance characteristics for practical number of faulty nodes in the network. However, the probability vectors algorithm is superior over the unsafety vectors in terms of the computation and communication overhead.

Original language | English |
---|---|

Pages (from-to) | 79-85 |

Number of pages | 7 |

Journal | Computer Systems Science and Engineering |

Volume | 18 |

Issue number | 2 |

Publication status | Published - Mar 2003 |

### Fingerprint

### Keywords

- Fault-tolerant routing
- Interconnection networks
- Multicomputers
- Performance evaluation
- Probability
- Simulation

### ASJC Scopus subject areas

- Hardware and Architecture
- Theoretical Computer Science
- Computational Theory and Mathematics

### Cite this

*Computer Systems Science and Engineering*,

*18*(2), 79-85.