DocumentCode :
1405143
Title :
A Note on Diagnosability of Large Fault Sets on Star Graphs
Author :
Chen, Y-Chuang ; Liu, Shun-Fu
Author_Institution :
Dept. of Inf. Manage., Ming Hsin Univ. of Sci. & Technol., Hsinchu, Taiwan
Volume :
61
Issue :
6
fYear :
2012
fDate :
6/1/2012 12:00:00 AM
Firstpage :
911
Lastpage :
912
Abstract :
Diagnosability of a system directly refers to the maximum number of faulty vertices that can be identified by the system. Somani et al. [2] proposed a generalized measure to increase the degree of diagnosability of the hypercubes and star graphs. This paper provides counterexamples for the results of diagnosability of star graphs.
Keywords :
fault trees; network theory (graphs); set theory; faulty vertices; hypercubes diagnosability; large fault set diagnosability; star graphs; Computational modeling; Computers; Fault diagnosis; Fault tolerant systems; Hypercubes; Multiprocessing systems; Diagnosability; Fault tolerance; Network problems; Star graphs.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2010.234
Filename :
5669256
Link To Document :
بازگشت