Probability-based Fault-tolerant Routing in Hypercubes

Autor:	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua
Rok vydání:	2001
Předmět:	Static routing Dynamic Source Routing General Computer Science business.industry Path vector protocol Geographic routing Probability vector Link-state routing protocol Multipath routing Destination-Sequenced Distance Vector routing business Algorithm Mathematics Computer network
Zdroj:	The Computer Journal. 44:368-373
ISSN:	1460-2067 0010-4620
DOI:	10.1093/comjnl/44.5.368
Popis:	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. Received ; revised
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e8247f3fcc0b4913f0bb077794a0ddfc https://doi.org/10.1093/comjnl/44.5.368 Zobrazit plný text záznamu