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

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

Research output: Contribution to journalArticle

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

Fingerprint

K-ary N-cubes
Fault-tolerant Routing
Routing algorithms
Routing Algorithm
Vertex of a graph
Fault tolerance
Minimal Path
Reachability
Fault Tolerance
Performance Analysis
Percentage
Routing
Calculate

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

A new fault-tolerant routing algorithm for k-ary n-cube networks. / Al-Sadi, J.; Day, K.; Ould-Khaoua, M.

In: International Journal of High Speed Computing, Vol. 12, No. 1, 06.2004, p. 29-54.

Research output: Contribution to journalArticle

@article{f70b9f6723c54fc7bfceefbc8373583e,
title = "A new fault-tolerant routing algorithm for k-ary n-cube networks",
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.",
keywords = "Faulttolerant routing, Interconnection networks, k-Ary n-Cube, Multicomputer, Performance evaluation",
author = "J. Al-Sadi and K. Day and M. Ould-Khaoua",
year = "2004",
month = "6",
doi = "10.1142/S0129053304000220",
language = "English",
volume = "12",
pages = "29--54",
journal = "International Journal of High Speed Computing",
issn = "0129-0533",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

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

AU - Al-Sadi, J.

AU - Day, K.

AU - Ould-Khaoua, M.

PY - 2004/6

Y1 - 2004/6

N2 - 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.

AB - 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.

KW - Faulttolerant routing

KW - Interconnection networks

KW - k-Ary n-Cube

KW - Multicomputer

KW - Performance evaluation

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

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

U2 - 10.1142/S0129053304000220

DO - 10.1142/S0129053304000220

M3 - Article

VL - 12

SP - 29

EP - 54

JO - International Journal of High Speed Computing

JF - International Journal of High Speed Computing

SN - 0129-0533

IS - 1

ER -