### Abstract

This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probability that a destination node at distance k 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. A performance comparison with the recently proposed safety-vectors algorithm, through extensive simulation, shows that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

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

Pages (from-to) | 368-373 |

Number of pages | 6 |

Journal | Computer Journal |

Volume | 44 |

Issue number | 5 |

DOIs | |

Publication status | Published - 2001 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Information Systems
- Computer Graphics and Computer-Aided Design
- Software

### Cite this

*Computer Journal*,

*44*(5), 368-373. https://doi.org/10.1093/comjnl/44.5.368

**Probability-based fault-tolerant routing in hypercubes.** / Al-Sadi, J.; Day, K.; Ould-Khaoua, M.

Research output: Contribution to journal › Article

*Computer Journal*, vol. 44, no. 5, pp. 368-373. https://doi.org/10.1093/comjnl/44.5.368

}

TY - JOUR

T1 - Probability-based fault-tolerant routing in hypercubes

AU - Al-Sadi, J.

AU - Day, K.

AU - Ould-Khaoua, M.

PY - 2001

Y1 - 2001

N2 - This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probability that a destination node at distance k 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. A performance comparison with the recently proposed safety-vectors algorithm, through extensive simulation, shows that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

AB - This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probability that a destination node at distance k 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. A performance comparison with the recently proposed safety-vectors algorithm, through extensive simulation, shows that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

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

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

U2 - 10.1093/comjnl/44.5.368

DO - 10.1093/comjnl/44.5.368

M3 - Article

AN - SCOPUS:0035652911

VL - 44

SP - 368

EP - 373

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -