### 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 | China |

City | Taiwan |

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

### Fingerprint

### 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

### Cite this

*Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS*(Vol. 2002-January, pp. 509-514). [1183449] IEEE Computer Society. https://doi.org/10.1109/ICPADS.2002.1183449

**A new probabilistic approach for fault-tolerant routing in k-ary n-cubes.** / Ai-Sadi, Jehad; Day, Khaled; Ould-Khaoua, M.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS.*vol. 2002-January, 1183449, IEEE Computer Society, pp. 509-514, 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, China, 12/17/02. https://doi.org/10.1109/ICPADS.2002.1183449

}

TY - GEN

T1 - A new probabilistic approach for fault-tolerant routing in k-ary n-cubes

AU - Ai-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, M.

PY - 2002

Y1 - 2002

N2 - 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 lth 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.

AB - 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 lth 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.

KW - Algorithm design and analysis

KW - Computational complexity

KW - Computer science

KW - Delay

KW - Fault tolerance

KW - Hypercubes

KW - Multiprocessor interconnection networks

KW - Performance analysis

KW - Probability

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=84948753213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948753213&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.2002.1183449

DO - 10.1109/ICPADS.2002.1183449

M3 - Conference contribution

AN - SCOPUS:84948753213

SN - 0769517609

VL - 2002-January

SP - 509

EP - 514

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

PB - IEEE Computer Society

ER -