{"title":"Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model","authors":"Guanqin Lian;Shuming Zhou;Eddie Cheng;Jiafei Liu;Gaolin Chen","doi":"10.1093/comjnl/bxaa065","DOIUrl":null,"url":null,"abstract":"Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let \n<tex>$S$</tex>\n be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph \n<tex>$G\\setminus S$</tex>\n persists \n<tex>$\\delta (G\\setminus S)$</tex>\n under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a \n<tex>$t$</tex>\n-regular and \n<tex>$t$</tex>\n-connected triangle-free network \n<tex>$G$</tex>\n subject to \n<tex>$|S|\\leq t-1$</tex>\n and \n<tex>$|V(G)|\\geq 3t-2$</tex>\n (\n<tex>$t\\geq 3$</tex>\n). Furthermore, we determine the diagnosability of \n<tex>$G\\setminus S$</tex>\n for some kinds of extensively explored \n<tex>$t$</tex>\n-regular networks with triangles subject to \n<tex>$|S|\\leq t-1$</tex>\n (\n<tex>$t\\geq 3$</tex>\n).","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":"64 9","pages":"1401-1411"},"PeriodicalIF":1.5000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/comjnl/bxaa065","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/9579110/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 1
Abstract
Diagnosability is an important metric to fault tolerance and reliability for multiprocessor systems. However, plenty of research on fault diagnosability focuses on node failure. In practical scenario, not only node failures take place but also link malfunctions may arise. In this work, we investigate the diagnosability of general regular networks with failing nodes as well as missing malfunctional links. Let
$S$
be a set of the missing links and broken-down nodes. We first prove that the diagnosability of the survival graph
$G\setminus S$
persists
$\delta (G\setminus S)$
under the PMC model (Preparata, F.P., Metze, G. and Chien, R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput., EC-16, 848–854) for a
$t$
-regular and
$t$
-connected triangle-free network
$G$
subject to
$|S|\leq t-1$
and
$|V(G)|\geq 3t-2$
(
$t\geq 3$
). Furthermore, we determine the diagnosability of
$G\setminus S$
for some kinds of extensively explored
$t$
-regular networks with triangles subject to
$|S|\leq t-1$
(
$t\geq 3$
).
期刊介绍:
The Computer Journal is one of the longest-established journals serving all branches of the academic computer science community. It is currently published in four sections.