Journal
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
Volume 16, Issue 6, Pages 1086-1097Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2017.2726541
Keywords
Program processors; Computational modeling; Computer science; Fault diagnosis; Electronic mail; Hypercubes; Extra conditional fault-diagnosability; extra node-connectivity; fault diagnosis; PMC model; general regular graphs
Categories
Funding
- National Natural Science Foundation of China [61572010, U1405255, 61072080]
- Foundation of Cloud Computing and Big Data for Agriculture and Forestry [117-612014063]
- Research Fund for the Doctoral Program of Higher Education of China [20113219120019]
- Fujian Province University Industry Cooperation of Major Science and Technology Project [2017H6005]
- Fujian Normal University Innovative Research Team [IRTL1207]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available