Journal
IEEE TRANSACTIONS ON COMPUTERS
Volume 54, Issue 2, Pages 165-175Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TC.2005.19
Keywords
PMC model; diagnosability; t-diagnosable; strongly t-diagnosable; conditional faulty set; conditional diagnosability
Ask authors/readers for more resources
Diagnosability has played an important role in the reliability of an interconnection network. The classical problem of fault diagnosis is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we introduce a new measure of diagnosability, called conditional diagnosability, by restricting that any faulty set cannot contain all the neighbors of any vertex in the graph. Based on this requirement, the conditional diagnosability of the n-dimensional hypercube is shown to be 4(n - 2) + 1, which is about four times as large as the classical diagnosability. Besides, we propose some useful conditions for verifying if a system is t-diagnosable and introduce a new concept, called a strongly t-diagnosable system, under the PMC model. Applying these concepts and conditions, we investigate some t-diagnosable networks which are also strongly t-diagnosable.
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