TY - GEN
T1 - Reliable communication in faulty star networks
AU - Day, K.
AU - Al-Ayyoub, A. E.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in the network. A distributed fault-tolerant routing algorithm for the star network based on this construction method is then presented and evaluated. The proposed algorithm adapts the routing decisions in response to node failures. Node failure and repair conditions may arise dynamically (at any time) provided that the total number of faulty nodes at any given time is less than the node-connectivity n-1 of the n-star. We show that if the node failures occur 'reasonably' apart in time, then all messages will be routed on paths of length δ + ϵ where δ is the minimum distance between the source and the destination and ϵ is 0, 2, or 4. In the unlikely case where more failures occur in a 'short period', the algorithm still delivers all messages but via possibly longer paths.
AB - We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in the network. A distributed fault-tolerant routing algorithm for the star network based on this construction method is then presented and evaluated. The proposed algorithm adapts the routing decisions in response to node failures. Node failure and repair conditions may arise dynamically (at any time) provided that the total number of faulty nodes at any given time is less than the node-connectivity n-1 of the n-star. We show that if the node failures occur 'reasonably' apart in time, then all messages will be routed on paths of length δ + ϵ where δ is the minimum distance between the source and the destination and ϵ is 0, 2, or 4. In the unlikely case where more failures occur in a 'short period', the algorithm still delivers all messages but via possibly longer paths.
KW - Fault tolerance
KW - distributed algorithm
KW - node-disjoint paths
KW - routing
KW - star graph
UR - http://www.scopus.com/inward/record.url?scp=64749093538&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=64749093538&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2002.1016687
DO - 10.1109/IPDPS.2002.1016687
M3 - Conference contribution
AN - SCOPUS:64749093538
T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
SP - 260
BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th International Parallel and Distributed Processing Symposium, IPDPS 2002
Y2 - 15 April 2002 through 19 April 2002
ER -