Probability-based fault-tolerant routing in hypercubes

J. Al-Sadi, K. Day, M. Ould-Khaoua

Research output: Contribution to journalArticle

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)368-373
Number of pages6
JournalComputer Journal
Volume44
Issue number5
DOIs
Publication statusPublished - 2001

Fingerprint

Routing algorithms

ASJC Scopus subject areas

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

Cite this

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

In: Computer Journal, Vol. 44, No. 5, 2001, p. 368-373.

Research output: Contribution to journalArticle

@article{161f3f25e3844178b803d73bd183d937,
title = "Probability-based fault-tolerant routing in hypercubes",
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.",
author = "J. Al-Sadi and K. Day and M. Ould-Khaoua",
year = "2001",
doi = "10.1093/comjnl/44.5.368",
language = "English",
volume = "44",
pages = "368--373",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

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

VL - 44

SP - 368

EP - 373

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -