Probability vectors

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the ACM Symposium on Applied Computing
Pages830-834
Number of pages5
Publication statusPublished - 2002
EventApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain
Duration: Mar 11 2002Mar 14 2002

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
CountrySpain
CityMadrid
Period3/11/023/14/02

Fingerprint

Routing algorithms
Fault tolerance

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Al-Sadi, J., Day, K., & Ould-Khaoua, M. (2002). Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes. In 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.

Proceedings of the ACM Symposium on Applied Computing. 2002. p. 830-834.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Al-Sadi, J, Day, K & Ould-Khaoua, M 2002, Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes. in 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.
Al-Sadi J, Day K, Ould-Khaoua M. Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes. In Proceedings of the ACM Symposium on Applied Computing. 2002. p. 830-834
Al-Sadi, Jehad ; Day, Khaled ; Ould-Khaoua, Mohamed. / Probability vectors : A new fault-tolerant routing algorithm for k-Ary n-cubes. Proceedings of the ACM Symposium on Applied Computing. 2002. pp. 830-834
@inproceedings{233b95d4c198456c9902a6637c081551,
title = "Probability vectors: A new fault-tolerant routing algorithm for k-Ary n-cubes",
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.",
keywords = "Fault-Tolerant routing, k-Ary n-Cubes, Multicomputers, Performance analysis, Probability",
author = "Jehad Al-Sadi and Khaled Day and Mohamed Ould-Khaoua",
year = "2002",
language = "English",
pages = "830--834",
booktitle = "Proceedings of the ACM Symposium on Applied Computing",

}

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 -