Fault diameter of k-ary n-cube networks

Khaled Day, Abdel Elah Al-Ayyoub

Research output: Contribution to journalArticle

101 Citations (Scopus)

Abstract

We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.

Original languageEnglish
Pages (from-to)903-907
Number of pages5
JournalIEEE Transactions on Parallel and Distributed Systems
Volume8
Issue number9
DOIs
Publication statusPublished - 1997

Fingerprint

K-ary N-cubes
Hamming distance
Fault
Path
Vertex of a graph
Disjoint Paths
Hamming Distance
Interconnection Networks
n-dimensional
Torus
Zero

Keywords

  • Fault diameter
  • Interconnection networks
  • K-ary n-cube
  • Node-disjoint paths
  • Torus

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Fault diameter of k-ary n-cube networks. / Day, Khaled; Al-Ayyoub, Abdel Elah.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 9, 1997, p. 903-907.

Research output: Contribution to journalArticle

Day, Khaled ; Al-Ayyoub, Abdel Elah. / Fault diameter of k-ary n-cube networks. In: IEEE Transactions on Parallel and Distributed Systems. 1997 ; Vol. 8, No. 9. pp. 903-907.
@article{73506b43f6b74c04bf8a7e5524a58de4,
title = "Fault diameter of k-ary n-cube networks",
abstract = "We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.",
keywords = "Fault diameter, Interconnection networks, K-ary n-cube, Node-disjoint paths, Torus",
author = "Khaled Day and Al-Ayyoub, {Abdel Elah}",
year = "1997",
doi = "10.1109/71.615436",
language = "English",
volume = "8",
pages = "903--907",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "9",

}

TY - JOUR

T1 - Fault diameter of k-ary n-cube networks

AU - Day, Khaled

AU - Al-Ayyoub, Abdel Elah

PY - 1997

Y1 - 1997

N2 - We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.

AB - We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be Δ + 1 where Δ is the fault free diameter.

KW - Fault diameter

KW - Interconnection networks

KW - K-ary n-cube

KW - Node-disjoint paths

KW - Torus

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

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

U2 - 10.1109/71.615436

DO - 10.1109/71.615436

M3 - Article

AN - SCOPUS:0031236740

VL - 8

SP - 903

EP - 907

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 9

ER -