Reliable communication in faulty star networks

K. Day, A. E. Al-Ayyoub

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages260
Number of pages1
ISBN (Print)0769515738, 9780769515731
DOIs
Publication statusPublished - 2002
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: Apr 15 2002Apr 19 2002

Other

Other16th International Parallel and Distributed Processing Symposium, IPDPS 2002
CountryUnited States
CityFt. Lauderdale
Period4/15/024/19/02

Fingerprint

Stars
Star
Communication
Vertex of a graph
Routing algorithms
Repair
Fault-tolerant Routing
Star Graph
Longest Path
Disjoint Paths
Routing Algorithm
Minimum Distance
Hierarchical Structure
Connectivity
Routing
Path
Arbitrary

Keywords

  • distributed algorithm
  • Fault tolerance
  • node-disjoint paths
  • routing
  • star graph

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modelling and Simulation

Cite this

Day, K., & Al-Ayyoub, A. E. (2002). Reliable communication in faulty star networks. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002 (pp. 260). [1016687] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2002.1016687

Reliable communication in faulty star networks. / Day, K.; Al-Ayyoub, A. E.

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 260 1016687.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Day, K & Al-Ayyoub, AE 2002, Reliable communication in faulty star networks. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002., 1016687, Institute of Electrical and Electronics Engineers Inc., pp. 260, 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, Ft. Lauderdale, United States, 4/15/02. https://doi.org/10.1109/IPDPS.2002.1016687
Day K, Al-Ayyoub AE. Reliable communication in faulty star networks. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc. 2002. p. 260. 1016687 https://doi.org/10.1109/IPDPS.2002.1016687
Day, K. ; Al-Ayyoub, A. E. / Reliable communication in faulty star networks. Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 260
@inproceedings{7754871c529a4d1db34b6269f7a5214e,
title = "Reliable communication in faulty star networks",
abstract = "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.",
keywords = "distributed algorithm, Fault tolerance, node-disjoint paths, routing, star graph",
author = "K. Day and Al-Ayyoub, {A. E.}",
year = "2002",
doi = "10.1109/IPDPS.2002.1016687",
language = "English",
isbn = "0769515738",
pages = "260",
booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Reliable communication in faulty star networks

AU - Day, K.

AU - Al-Ayyoub, A. E.

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 - distributed algorithm

KW - Fault tolerance

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

SN - 0769515738

SN - 9780769515731

SP - 260

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

PB - Institute of Electrical and Electronics Engineers Inc.

ER -