Minimal fault diameter for highly resilient product networks

Khaled Day, Abdel Elah Al-Ayyoub

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.

Original languageEnglish
Pages (from-to)926-930
Number of pages5
JournalIEEE Transactions on Parallel and Distributed Systems
Volume11
Issue number9
DOIs
Publication statusPublished - Sep 2000

Fingerprint

Containers
Fault
Fault tolerance
Cartesian product
Container
Disjoint Paths
Resilience
Vertex of a graph
Fault Tolerance
Connectivity
Regularity

ASJC Scopus subject areas

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

Cite this

Minimal fault diameter for highly resilient product networks. / Day, Khaled; Al-Ayyoub, Abdel Elah.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 9, 09.2000, p. 926-930.

Research output: Contribution to journalArticle

@article{0f8c38c718ac42f2ab38495411b15780,
title = "Minimal fault diameter for highly resilient product networks",
abstract = "We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.",
author = "Khaled Day and Al-Ayyoub, {Abdel Elah}",
year = "2000",
month = "9",
doi = "10.1109/71.879775",
language = "English",
volume = "11",
pages = "926--930",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "9",

}

TY - JOUR

T1 - Minimal fault diameter for highly resilient product networks

AU - Day, Khaled

AU - Al-Ayyoub, Abdel Elah

PY - 2000/9

Y1 - 2000/9

N2 - We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.

AB - We present a number of results related to the fault tolerance of Cartesian product networks. We start by presenting a method for building containers (i.e., sets of node-disjoint paths) between any two nodes of a product network based on given containers for the factor networks. Then, we show that the best achievable fault diameter (i.e., diameter under maximum fault conditions), under reasonable network regularity and connectivity conditions, is equal to the fault-free diameter plus one. The concept of high fault resilience is then defined. We then prove that if each factor network is highly resilient, then their Cartesian product has minimal fault diameter. We derive from these results that Cartesian products of several popular networks are highly resilient and have minimal fault diameter equal to diameter plus one. These results spare future efforts that would be needed to individually determine the fault diameter of such networks as has been the practice with previously studied networks.

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

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

U2 - 10.1109/71.879775

DO - 10.1109/71.879775

M3 - Article

VL - 11

SP - 926

EP - 930

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 9

ER -