A new probabilistic approach for fault-tolerant routing in k-ary n-cubes

Jehad Ai-Sadi, Khaled Day, M. Ould-Khaoua

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

Abstract

This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. 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 fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
PublisherIEEE Computer Society
Pages509-514
Number of pages6
Volume2002-January
ISBN (Print)0769517609
DOIs
Publication statusPublished - 2002
Event9th International Conference on Parallel and Distributed Systems, ICPADS 2002 - Taiwan, China
Duration: Dec 17 2002Dec 20 2002

Other

Other9th International Conference on Parallel and Distributed Systems, ICPADS 2002
CountryChina
CityTaiwan
Period12/17/0212/20/02

Fingerprint

Routing algorithms
Fault tolerance

Keywords

  • Algorithm design and analysis
  • Computational complexity
  • Computer science
  • Delay
  • Fault tolerance
  • Hypercubes
  • Multiprocessor interconnection networks
  • Performance analysis
  • Probability
  • Routing

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Ai-Sadi, J., Day, K., & Ould-Khaoua, M. (2002). A new probabilistic approach for fault-tolerant routing in k-ary n-cubes. In Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS (Vol. 2002-January, pp. 509-514). [1183449] IEEE Computer Society. https://doi.org/10.1109/ICPADS.2002.1183449

A new probabilistic approach for fault-tolerant routing in k-ary n-cubes. / Ai-Sadi, Jehad; Day, Khaled; Ould-Khaoua, M.

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. Vol. 2002-January IEEE Computer Society, 2002. p. 509-514 1183449.

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

Ai-Sadi, J, Day, K & Ould-Khaoua, M 2002, A new probabilistic approach for fault-tolerant routing in k-ary n-cubes. in Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. vol. 2002-January, 1183449, IEEE Computer Society, pp. 509-514, 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, China, 12/17/02. https://doi.org/10.1109/ICPADS.2002.1183449
Ai-Sadi J, Day K, Ould-Khaoua M. A new probabilistic approach for fault-tolerant routing in k-ary n-cubes. In Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. Vol. 2002-January. IEEE Computer Society. 2002. p. 509-514. 1183449 https://doi.org/10.1109/ICPADS.2002.1183449
Ai-Sadi, Jehad ; Day, Khaled ; Ould-Khaoua, M. / A new probabilistic approach for fault-tolerant routing in k-ary n-cubes. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. Vol. 2002-January IEEE Computer Society, 2002. pp. 509-514
@inproceedings{228b386597104e3597d7a3a9eef7763f,
title = "A new probabilistic approach for fault-tolerant routing in k-ary n-cubes",
abstract = "This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. 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 fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.",
keywords = "Algorithm design and analysis, Computational complexity, Computer science, Delay, Fault tolerance, Hypercubes, Multiprocessor interconnection networks, Performance analysis, Probability, Routing",
author = "Jehad Ai-Sadi and Khaled Day and M. Ould-Khaoua",
year = "2002",
doi = "10.1109/ICPADS.2002.1183449",
language = "English",
isbn = "0769517609",
volume = "2002-January",
pages = "509--514",
booktitle = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - A new probabilistic approach for fault-tolerant routing in k-ary n-cubes

AU - Ai-Sadi, Jehad

AU - Day, Khaled

AU - Ould-Khaoua, M.

PY - 2002

Y1 - 2002

N2 - This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. 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 fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.

AB - This paper describes the new fault-tolerant routing algorithm for k-ary n-cubes using the concept of «probability vectors» and conducts an extensive performance analysis for the new algorithm. 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 fault node or link. The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. The extensive performance analysis conducted in this study reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances.

KW - Algorithm design and analysis

KW - Computational complexity

KW - Computer science

KW - Delay

KW - Fault tolerance

KW - Hypercubes

KW - Multiprocessor interconnection networks

KW - Performance analysis

KW - Probability

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=84948753213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948753213&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.2002.1183449

DO - 10.1109/ICPADS.2002.1183449

M3 - Conference contribution

AN - SCOPUS:84948753213

SN - 0769517609

VL - 2002-January

SP - 509

EP - 514

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

PB - IEEE Computer Society

ER -