Probability-based fault-tolerant routing in hypercubes

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

3 Citations (Scopus)

Abstract

This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. Each node calculates a probability vector whose kth element represents the probability that a destination node at distance k cannot be minimally reached due to a faulty node or link. 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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages935-938
Number of pages4
Volume1900
ISBN (Print)9783540679561
Publication statusPublished - 2000
Event6th International European Conference on Parallel Computing, Euro-Par 2000 - Munich, Germany
Duration: Aug 29 2000Sep 1 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1900
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International European Conference on Parallel Computing, Euro-Par 2000
CountryGermany
CityMunich
Period8/29/009/1/00

Fingerprint

Fault-tolerant Routing
Hypercube
Vertex of a graph
Performance Comparison
Routing algorithms
Routing Algorithm
Reachability
Percentage
Routing
Safety
Calculate
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Al-Sadi, J., Day, K., & Ould-Khaoua, M. (2000). Probability-based fault-tolerant routing in hypercubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 935-938). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1900). Springer Verlag.

Probability-based fault-tolerant routing in hypercubes. / Al-Sadi, Jehad; Day, Khaled; Ould-Khaoua, Mohamed.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900 Springer Verlag, 2000. p. 935-938 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1900).

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

Al-Sadi, J, Day, K & Ould-Khaoua, M 2000, Probability-based fault-tolerant routing in hypercubes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1900, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1900, Springer Verlag, pp. 935-938, 6th International European Conference on Parallel Computing, Euro-Par 2000, Munich, Germany, 8/29/00.
Al-Sadi J, Day K, Ould-Khaoua M. Probability-based fault-tolerant routing in hypercubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900. Springer Verlag. 2000. p. 935-938. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Al-Sadi, Jehad ; Day, Khaled ; Ould-Khaoua, Mohamed. / Probability-based fault-tolerant routing in hypercubes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1900 Springer Verlag, 2000. pp. 935-938 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{19ebf0c6bfc14913a376b5aad37aac66,
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. Each node calculates a probability vector whose kth element represents the probability that a destination node at distance k cannot be minimally reached due to a faulty node or link. 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 = "Jehad Al-Sadi and Khaled Day and Mohamed Ould-Khaoua",
year = "2000",
language = "English",
isbn = "9783540679561",
volume = "1900",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "935--938",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Probability-based fault-tolerant routing in hypercubes

AU - Al-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, Mohamed

PY - 2000

Y1 - 2000

N2 - This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. Each node calculates a probability vector whose kth element represents the probability that a destination node at distance k cannot be minimally reached due to a faulty node or link. 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. Each node calculates a probability vector whose kth element represents the probability that a destination node at distance k cannot be minimally reached due to a faulty node or link. 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=84937438665&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:84937438665

SN - 9783540679561

VL - 1900

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 935

EP - 938

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -