Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks

Limei Lin, Li Xu, Riqing Chen, Sun Yuan Hsieh, Dajin Wang

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been proposed for a better, more realistic measure of networks' fault-tolerability. It is the maximal x such that G is h-extra conditionally x-fault-diagnosable. This paper will establish a relationship between the h-extra node-connectivity and h-extra conditional fault-diagnosability for a regular graph G, under the classic PMC diagnostic model. We will apply the newly found relationship to a variety of well-known regular networks, to directly obtain their h-extra conditional fault-diagnosability. The significance of the paper's work is that it relates the notions of h-extra node-connectivity and h-extra conditional fault-diagnosability, so that a regular network's h-extra conditional fault-diagnosability may be known once its h-extra node-connectivity is known.

Original languageEnglish
JournalIEEE Transactions on Dependable and Secure Computing
DOIs
StateAccepted/In press - 13 Jul 2017

Keywords

  • Computational modeling
  • Computer science
  • Electronic mail
  • Extra conditional fault-diagnosability
  • Extra node-connectivity
  • Fault diagnosis
  • Fault diagnosis
  • General regular graphs
  • Hypercubes
  • PMC model
  • Program processors

Cite this

@article{fb3236eef8c24e8da59722f058133abf,
title = "Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks",
abstract = "The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been proposed for a better, more realistic measure of networks' fault-tolerability. It is the maximal x such that G is h-extra conditionally x-fault-diagnosable. This paper will establish a relationship between the h-extra node-connectivity and h-extra conditional fault-diagnosability for a regular graph G, under the classic PMC diagnostic model. We will apply the newly found relationship to a variety of well-known regular networks, to directly obtain their h-extra conditional fault-diagnosability. The significance of the paper's work is that it relates the notions of h-extra node-connectivity and h-extra conditional fault-diagnosability, so that a regular network's h-extra conditional fault-diagnosability may be known once its h-extra node-connectivity is known.",
keywords = "Computational modeling, Computer science, Electronic mail, Extra conditional fault-diagnosability, Extra node-connectivity, Fault diagnosis, Fault diagnosis, General regular graphs, Hypercubes, PMC model, Program processors",
author = "Limei Lin and Li Xu and Riqing Chen and Hsieh, {Sun Yuan} and Dajin Wang",
year = "2017",
month = "7",
day = "13",
doi = "10.1109/TDSC.2017.2726541",
language = "English",
journal = "IEEE Transactions on Dependable and Secure Computing",
issn = "1545-5971",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks. / Lin, Limei; Xu, Li; Chen, Riqing; Hsieh, Sun Yuan; Wang, Dajin.

In: IEEE Transactions on Dependable and Secure Computing, 13.07.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks

AU - Lin, Limei

AU - Xu, Li

AU - Chen, Riqing

AU - Hsieh, Sun Yuan

AU - Wang, Dajin

PY - 2017/7/13

Y1 - 2017/7/13

N2 - The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been proposed for a better, more realistic measure of networks' fault-tolerability. It is the maximal x such that G is h-extra conditionally x-fault-diagnosable. This paper will establish a relationship between the h-extra node-connectivity and h-extra conditional fault-diagnosability for a regular graph G, under the classic PMC diagnostic model. We will apply the newly found relationship to a variety of well-known regular networks, to directly obtain their h-extra conditional fault-diagnosability. The significance of the paper's work is that it relates the notions of h-extra node-connectivity and h-extra conditional fault-diagnosability, so that a regular network's h-extra conditional fault-diagnosability may be known once its h-extra node-connectivity is known.

AB - The h-extra node-connectivity of a graph G is the size of a minimal node-set, whose removal will disconnect G, but each remaining component has no fewer h + 1 nodes. Based on h-extra node-connectivity, the h-extra conditional fault-diagnosability of networks has been proposed for a better, more realistic measure of networks' fault-tolerability. It is the maximal x such that G is h-extra conditionally x-fault-diagnosable. This paper will establish a relationship between the h-extra node-connectivity and h-extra conditional fault-diagnosability for a regular graph G, under the classic PMC diagnostic model. We will apply the newly found relationship to a variety of well-known regular networks, to directly obtain their h-extra conditional fault-diagnosability. The significance of the paper's work is that it relates the notions of h-extra node-connectivity and h-extra conditional fault-diagnosability, so that a regular network's h-extra conditional fault-diagnosability may be known once its h-extra node-connectivity is known.

KW - Computational modeling

KW - Computer science

KW - Electronic mail

KW - Extra conditional fault-diagnosability

KW - Extra node-connectivity

KW - Fault diagnosis

KW - Fault diagnosis

KW - General regular graphs

KW - Hypercubes

KW - PMC model

KW - Program processors

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

U2 - 10.1109/TDSC.2017.2726541

DO - 10.1109/TDSC.2017.2726541

M3 - Article

AN - SCOPUS:85028924777

JO - IEEE Transactions on Dependable and Secure Computing

JF - IEEE Transactions on Dependable and Secure Computing

SN - 1545-5971

ER -