Probability-based fault-tolerant routing in hypercubes

Jehad Al-Sadi; Khaled Day; Mohamed Ould-Khaoua

doi:10.1007/3-540-44520-x_131

Probability-based fault-tolerant routing in hypercubes

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings
Editors	Arndt Bode, Thomas Ludwig, Wolfgang Karl, Roland Wismüller
Publisher	Springer Verlag
Pages	935-938
Number of pages	4
ISBN (Electronic)	9783540679561
DOIs	https://doi.org/10.1007/3-540-44520-x_131
Publication status	Published - 2000
Event	6th International European Conference on Parallel Computing, Euro-Par 2000 - Munich, Germany Duration: Aug 29 2000 → Sept 1 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1900
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	6th International European Conference on Parallel Computing, Euro-Par 2000
Country/Territory	Germany
City	Munich
Period	8/29/00 → 9/1/00

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44520-x_131

Cite this

Al-Sadi, J., Day, K., & Ould-Khaoua, M. (2000). Probability-based fault-tolerant routing in hypercubes. In A. Bode, T. Ludwig, W. Karl, & R. Wismüller (Eds.), Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings (pp. 935-938). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1900). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_131

Probability-based fault-tolerant routing in hypercubes. / Al-Sadi, Jehad; Day, Khaled; Ould-Khaoua, Mohamed.
Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. ed. / Arndt Bode; Thomas Ludwig; Wolfgang Karl; Roland Wismüller. 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 proceeding › Conference contribution

Al-Sadi, J, Day, K & Ould-Khaoua, M 2000, Probability-based fault-tolerant routing in hypercubes. in A Bode, T Ludwig, W Karl & R Wismüller (eds), Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. 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. https://doi.org/10.1007/3-540-44520-x_131

Al-Sadi J, Day K, Ould-Khaoua M. Probability-based fault-tolerant routing in hypercubes. In Bode A, Ludwig T, Karl W, Wismüller R, editors, Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. Springer Verlag. 2000. p. 935-938. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44520-x_131

Al-Sadi, Jehad ; Day, Khaled ; Ould-Khaoua, Mohamed. / Probability-based fault-tolerant routing in hypercubes. Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings. editor / Arndt Bode ; Thomas Ludwig ; Wolfgang Karl ; Roland Wismüller. 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",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 6th International European Conference on Parallel Computing, Euro-Par 2000 ; Conference date: 29-08-2000 Through 01-09-2000",

year = "2000",

doi = "10.1007/3-540-44520-x_131",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "935--938",

editor = "Arndt Bode and Thomas Ludwig and Wolfgang Karl and Roland Wism{\"u}ller",

booktitle = "Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings",

}

TY - GEN

T1 - Probability-based fault-tolerant routing in hypercubes

AU - Al-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, Mohamed

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

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

U2 - 10.1007/3-540-44520-x_131

DO - 10.1007/3-540-44520-x_131

M3 - Conference contribution

AN - SCOPUS:84937438665

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

SP - 935

EP - 938

BT - Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings

A2 - Bode, Arndt

A2 - Ludwig, Thomas

A2 - Karl, Wolfgang

A2 - Wismüller, Roland

PB - Springer Verlag

T2 - 6th International European Conference on Parallel Computing, Euro-Par 2000

Y2 - 29 August 2000 through 1 September 2000

ER -

Probability-based fault-tolerant routing in hypercubes

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this