TY - JOUR
T1 - The Relationship between g-Restricted Connectivity and g-Good-Neighbor Fault Diagnosability of General Regular Networks
AU - Lin, Limei
AU - Hsieh, Sun Yuan
AU - Chen, Riqing
AU - Xu, Li
AU - Lee, Chia Wei
N1 - Funding Information:
Manuscript received January 10, 2017; revised May 23, 2017 and August 22, 2017; accepted October 2, 2017. Date of publication January 23, 2018; date of current version March 1, 2018. This work was supported in part by the National Natural Science Foundation of China under Grant U1405255, Grant 61572010, Grant 61702100, Grant 61702103, and Grant 61771140, the China Postdoctoral Science Foundation (2017M612107), the Foundation of Cloud Computing and Big Data for Agriculture and Forestry (117-612014063), Research Fund for the Doctoral Program of Higher Education of China under Grant 20113219120019, the Natural Science Foundation of Fujian Province (2013J01221 and 2013J01222), and Fujian Normal University Innovative Research Team under Grant IRTL1207. Associate Editor: R. Kang. (Corresponding author: Riqing Chen.) L. Lin and R. Chen are with the Faculty of Computer Science and Information Technology, College of Life Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China (e-mail: [email protected]; riqing.chen@ fafu.edu.cn).
Publisher Copyright:
© 2018 IEEE.
PY - 2018/3
Y1 - 2018/3
N2 - The g-restricted connectivity (g-RC) is the minimum vertex-set size of a network, whose deletion disconnects the network such that each remaining vertex has at least g neighbors in its respective component. The g-RC is a deterministic indicator of tolerability of a network with failing processors. The g-good-neighbor fault diagnosability (g-GNFD) is the largest set size of correctly identified faulty vertices in a network such that any good vertex has no fewer g good neighbors. This paper establishes the relationship between g-RC and g-GNFD of general regular networks, first under the PMC model and second under the MM∗ model. Moreover, this paper directly gives the g-GNFD of some well-known special networks by their g-RC and our proposed relationship.
AB - The g-restricted connectivity (g-RC) is the minimum vertex-set size of a network, whose deletion disconnects the network such that each remaining vertex has at least g neighbors in its respective component. The g-RC is a deterministic indicator of tolerability of a network with failing processors. The g-good-neighbor fault diagnosability (g-GNFD) is the largest set size of correctly identified faulty vertices in a network such that any good vertex has no fewer g good neighbors. This paper establishes the relationship between g-RC and g-GNFD of general regular networks, first under the PMC model and second under the MM∗ model. Moreover, this paper directly gives the g-GNFD of some well-known special networks by their g-RC and our proposed relationship.
UR - http://www.scopus.com/inward/record.url?scp=85041013490&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85041013490&partnerID=8YFLogxK
U2 - 10.1109/TR.2017.2760905
DO - 10.1109/TR.2017.2760905
M3 - Article
AN - SCOPUS:85041013490
SN - 0018-9529
VL - 67
SP - 285
EP - 296
JO - IEEE Transactions on Reliability
JF - IEEE Transactions on Reliability
IS - 1
ER -