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 publicationEuro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings
EditorsArndt Bode, Thomas Ludwig, Wolfgang Karl, Roland Wismüller
PublisherSpringer Verlag
Pages935-938
Number of pages4
ISBN (Electronic)9783540679561
DOIs
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)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Probability-based fault-tolerant routing in hypercubes'. Together they form a unique fingerprint.

Cite this