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

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

Y2 - 29 August 2000 through 1 September 2000

ER -