## Abstract

This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which represents the set of all its neighbouring 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 analysis 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.

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

Pages (from-to) | 29-54 |

Number of pages | 26 |

Journal | International Journal of High Speed Computing |

Volume | 12 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jun 2004 |

## Keywords

- Faulttolerant routing
- Interconnection networks
- k-Ary n-Cube
- Multicomputer
- Performance evaluation

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics