The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2012 vol.61)
pp: 911-912
Y-Chuang Chen , Ming Hsin University of Science and Technology, Hsin Feng
ABSTRACT
Diagnosability of a system directly refers to the maximum number of faulty vertices that can be identified by the system. Somani et al. [CHECK END OF SENTENCE] 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.
INDEX TERMS
Diagnosability, Fault tolerance, Network problems, Star graphs.
CITATION
Y-Chuang Chen, "A Note on Diagnosability of Large Fault Sets on Star Graphs", IEEE Transactions on Computers, vol.61, no. 6, pp. 911-912, June 2012, doi:10.1109/TC.2010.234
REFERENCES
[1] S. Latifi and E. Saberinia, X. Wu, “Robustness of Star Graph Network under Link Failure,” Information Sciences, vol. 178, no. 3, pp. 802-806, 2008.
[2] A.K. Somani and O. Peleg, “On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems,” IEEE Trans. Computers, vol. 45, no. 8, pp. 892-903, Aug. 1996.
[3] D. Wang, “Diagnosability of Hypercubes and Enhanced HyperCubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1369-1374, Dec. 1999.
[4] J. Zheng, S. Latifi, E. Regentova, K. Luo, and X. Wu, “Diagnosability of Star Graphs under the Comparison Diagnosis Model,” Information Processing Letters, vol. 93, no. 1, pp. 29-36, 2005.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool