Unsafety vectors: A new fault-tolerant routing for the binary n-cube

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

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

This paper presents a new fault-tolerant routing algorithm for the binary n-cube which overcomes the limitations of the recently-proposed safety vectors algorithm (IEEE Trans. Parallel Distribut. Syst. 9 (4) (1998) 321). The algorithm is based on the concept of "unsafety vectors". Each node A starts by computing a first level unsafety set, S1 A, composed of the set of unreachable neighbours. It then performs (m - 1) exchanges with its neighbours to determine the k-level unsafety set, Sk A, for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and n. Sk A represents the set of all nodes at Hamming distance k from node A which are faulty or unreachable from A due to faulty nodes (or links). Equipped with these unsafety sets, each node calculates unsafety vectors, which are then used to achieve an efficient fault-tolerant routing in the binary n-cube. The kth element of the unsafety vector of node A represents a measure of the routing unsafety at distance k from A. We present an analytical study proving some properties of the proposed algorithm. We also conduct a comparative analysis through extensive simulation experiments that reveal the superiority of the proposed algorithm over the safety vectors algorithm (IEEE Trans. Parallel Distribut. Syst. 9 (4) (1998) 321) in terms of different performance measures, e.g. routing distances and percentage of reachability.

Original languageEnglish
Pages (from-to)783-793
Number of pages11
JournalJournal of Systems Architecture
Volume47
Issue number9
DOIs
Publication statusPublished - Mar 2002

    Fingerprint

Keywords

  • Fault-tolerant routing
  • Hypercube
  • Interconnection networks
  • Multicomputers
  • Performance evaluation
  • Safety vectors

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this