IEEE Transactions on Dependable and Secure Computing · 2017 · 99 citations · 32 references
EngineeringComputer EngineeringComputer NetworksFault-tolerant ComputingFault-tolerant SystemsDiagnosisDiagnosticsFault DetectionFault DiagnosisNetwork ConnectivityNetwork Fault ToleranceConditional DiagnosabilityDiagnosabilityExtra ConnectivityFault-tolerant NetworksNode Connectivity
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.
32
Complex networks: Structure and dynamics
Stefano Boccaletti, Vito Latora, Yamir Moreno et al. · Physics Reports · 2006 · 11K citations
Algebraic connectivity of graphs
Miroslav Fiedler · Czechoslovak Mathematical Journal · 1973 · 4K citations · Full text
On the extraconnectivity of graphs
J. Fàbrega, M.A. Fiol · Discrete Mathematics · 1996 · 401 citations
Conditional diagnosability measures for large multiprocessor systems
Pao-Lien Lai, J. Tan, Chien-Ping Chang et al. · IEEE Transactions on Computers · 2005 · 400 citations