The Relationship between Connectivity and Diagnosability on Regular Networks
نویسندگان
چکیده
The node connectivity is usually used to measure the fault tolerance of a multiprocessor system. On the other hand, the diagnosability is an important ability to provide a system level self-diagnosis for maintaining the reliability of a multiprocessor system. It is interesting to investigate the relationship between the connectivity and the diagnosability. Two diagnosis models: PMC model and comparison model are studied in this work. Herein, we consider that, under certain condition, a t-connected network is a t-diagnosable and is also a strongly t-diagnosable network. From our results, we can conclude that the diagnosability is enhanced as the connectivity improves for a multiprocessor system.
منابع مشابه
Fault diagnosability of data center networks
The data center networks Dn,k, proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network G is g-goodneighbor diagnosability which is denoted by tg(G). Let κ (G) be the R-connectivity. Lin et. al. in [IEEE Trans. on Reliability, 65 (3) (2016) 1248–1262] and Xu et. al in [Theor. Comput. Sci. 659 (2017) 53–63] gave the same ...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملA Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملOn deriving conditional diagnosability of interconnection networks
We provide general techniques to estimate an upper bound of the conditional diagnosability of a graph G, and to prove that such a bound is also tight when a certain connectivity result is available for G. As an example, we derive the exact value of the conditional diagnosability for the (n, k)-star graph.
متن کاملEqual relation between the extra connectivity and pessimistic diagnosability for some regular graphs
Article history: Received 7 February 2017 Received in revised form 28 April 2017 Accepted 30 May 2017 Available online 7 June 2017 Communicated by S.-Y. Hsieh
متن کامل