Fault-tolerant routing in hypercubes using probability vectors

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets Sk A for all 1 ≤ k ≤ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, Sk A, of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

Original languageEnglish
Pages (from-to)1381-1399
Number of pages19
JournalParallel Computing
Volume27
Issue number10
DOIs
Publication statusPublished - Sep 2001

Fingerprint

Fault-tolerant Routing
Hypercube
Vertex of a graph
Level Set
Safety
Hamming distance
Hamming Distance
Performance Comparison
Routing algorithms
Routing Algorithm
Reachability
Numerics
Fault-tolerant
Simulation Experiment
Percentage
n-dimensional
Routing
Calculate
Experiments

Keywords

  • Fault-tolerant routing
  • Interconnection networks
  • Multicomputers
  • Performance evaluation
  • Probability

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Fault-tolerant routing in hypercubes using probability vectors. / Al-Sadi, J.; Day, K.; Ould-Khaoua, M.

In: Parallel Computing, Vol. 27, No. 10, 09.2001, p. 1381-1399.

Research output: Contribution to journalArticle

@article{a036466ef1334bd78c7dcacf909c1744,
title = "Fault-tolerant routing in hypercubes using probability vectors",
abstract = "In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets Sk A for all 1 ≤ k ≤ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, Sk A, of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.",
keywords = "Fault-tolerant routing, Interconnection networks, Multicomputers, Performance evaluation, Probability",
author = "J. Al-Sadi and K. Day and M. Ould-Khaoua",
year = "2001",
month = "9",
doi = "10.1016/S0167-8191(01)00091-6",
language = "English",
volume = "27",
pages = "1381--1399",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Fault-tolerant routing in hypercubes using probability vectors

AU - Al-Sadi, J.

AU - Day, K.

AU - Ould-Khaoua, M.

PY - 2001/9

Y1 - 2001/9

N2 - In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets Sk A for all 1 ≤ k ≤ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, Sk A, of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

AB - In this paper, we propose a new fault-tolerant routing algorithm for the hypercube, which overcomes the performance limitations of the recently proposed safety vectors algorithm [IEEE Trans. Parallel Distrib. Syst. 9 (4) (1998) 321]. We present first a method for evaluating the k-level unsafety sets Sk A for all 1 ≤ k ≤ n in an n-dimensional hypercube. The k-level unsafety set at node A represents the set, Sk A, of all nodes at Hamming distance k from A, which are faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric probability vectors and uses them to achieve efficient fault-tolerant routing. A probability-based analysis is conducted to prove some properties of the proposed fault-tolerant algorithm. A performance comparison against the safety vectors algorithm, through extensive simulation experiments, reveals that the new algorithm exhibits superior performance in terms of routing distances and percentage of reachability.

KW - Fault-tolerant routing

KW - Interconnection networks

KW - Multicomputers

KW - Performance evaluation

KW - Probability

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

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

U2 - 10.1016/S0167-8191(01)00091-6

DO - 10.1016/S0167-8191(01)00091-6

M3 - Article

AN - SCOPUS:0035452387

VL - 27

SP - 1381

EP - 1399

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 10

ER -