## Abstract

This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. 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 l^{th} element represents the probability that a destination node at distance l cannot be reached through a minimal path due to a fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.

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

Title of host publication | Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS |

Publisher | IEEE Computer Society |

Pages | 509-514 |

Number of pages | 6 |

Volume | 2002-January |

ISBN (Print) | 0769517609 |

DOIs | |

Publication status | Published - 2002 |

Event | 9th International Conference on Parallel and Distributed Systems, ICPADS 2002 - Taiwan, China Duration: Dec 17 2002 → Dec 20 2002 |

### Other

Other | 9th International Conference on Parallel and Distributed Systems, ICPADS 2002 |
---|---|

Country/Territory | China |

City | Taiwan |

Period | 12/17/02 → 12/20/02 |

## Keywords

- Algorithm design and analysis
- Computational complexity
- Computer science
- Delay
- Fault tolerance
- Hypercubes
- Multiprocessor interconnection networks
- Performance analysis
- Probability
- Routing

## ASJC Scopus subject areas

- Hardware and Architecture