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

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

Fingerprint Dive into the research topics of 'A new probabilistic approach for fault-tolerant routing in k-ary n-cubes'. Together they form a unique fingerprint.

  • 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