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

Jehad Al-Sadi*, Khaled Day, Mohamed Ould-Khaoua

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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
Pages830-834
Number of pages5
Publication statusPublished - 2002
Externally publishedYes
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
Country/TerritorySpain
CityMadrid
Period3/11/023/14/02

Keywords

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

ASJC Scopus subject areas

  • Software

Cite this