### Abstract

This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using 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. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

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

Title of host publication | Proceedings of the ACM Symposium on Applied Computing |

Pages | 830-834 |

Number of pages | 5 |

Publication status | Published - 2002 |

Event | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain Duration: Mar 11 2002 → Mar 14 2002 |

### Other

Other | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing |
---|---|

Country | Spain |

City | Madrid |

Period | 3/11/02 → 3/14/02 |

### Fingerprint

### Keywords

- Fault-Tolerant routing
- k-Ary n-Cubes
- Multicomputers
- Performance analysis
- Probability

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the ACM Symposium on Applied Computing*(pp. 830-834)

**Probability vectors : A new fault-tolerant routing algorithm for k-Ary n-cubes.** / Al-Sadi, Jehad; Day, Khaled; Ould-Khaoua, Mohamed.

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

*Proceedings of the ACM Symposium on Applied Computing.*pp. 830-834, Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 3/11/02.

}

TY - GEN

T1 - Probability vectors

T2 - A new fault-tolerant routing algorithm for k-Ary n-cubes

AU - Al-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, Mohamed

PY - 2002

Y1 - 2002

N2 - This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using 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. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

AB - This paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using 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. Results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

KW - Fault-Tolerant routing

KW - k-Ary n-Cubes

KW - Multicomputers

KW - Performance analysis

KW - Probability

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

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

M3 - Conference contribution

SP - 830

EP - 834

BT - Proceedings of the ACM Symposium on Applied Computing

ER -