A new fault-tolerant routing algorithm for k-ary n-cube networks

J. Al-Sadi*, K. Day, M. Ould-Khaoua

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)29-54
Number of pages26
JournalInternational Journal of High Speed Computing
Volume12
Issue number1
DOIs
Publication statusPublished - Jun 2004

Keywords

  • Faulttolerant routing
  • Interconnection networks
  • k-Ary n-Cube
  • Multicomputer
  • Performance evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A new fault-tolerant routing algorithm for k-ary n-cube networks'. Together they form a unique fingerprint.

Cite this