TY - JOUR
T1 - A new fault-tolerant routing algorithm for k-ary n-cube networks
AU - Al-Sadi, J.
AU - Day, K.
AU - Ould-Khaoua, M.
PY - 2004/6
Y1 - 2004/6
N2 - This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty links. Each node then calculates a probability vector, where the lth element represents the probability that a destination node at distance l 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. An extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.
AB - This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes using the concept of "probability vectors". To compute these vectors, a node determines first its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty links. Each node then calculates a probability vector, where the lth element represents the probability that a destination node at distance l 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. An extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.
KW - Faulttolerant routing
KW - Interconnection networks
KW - Multicomputer
KW - Performance evaluation
KW - k-Ary n-Cube
UR - http://www.scopus.com/inward/record.url?scp=4344594906&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4344594906&partnerID=8YFLogxK
U2 - 10.1142/S0129053304000220
DO - 10.1142/S0129053304000220
M3 - Article
AN - SCOPUS:4344594906
SN - 0129-0533
VL - 12
SP - 29
EP - 54
JO - International Journal of High Speed Computing
JF - International Journal of High Speed Computing
IS - 1
ER -