Journal
THEORETICAL COMPUTER SCIENCE
Volume 548, Issue -, Pages 98-116Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2014.07.006
Keywords
Fault diagnosis; PMC model; Conditional diagnosability; Torus network; Minimum neighborhood; r-Super-connectivity
Categories
Funding
- National Research Foundation of Korea (NRF) - Ministry of Education [2012R1A1A2005511]
- National Research Foundation of Korea [2012R1A1A2005511] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
A general technique is proposed for determining the conditional diagnosability of interconnection networks under the PMC model. Several graph invariants are involved in the approach, such as the length of the shortest cycle, the minimum number of neighbors, gamma(p) (resp. gamma(p)'), over all p-vertex subsets (resp. cycles), and a variant of connectivity, called the r-super-connectivity. An n-dimensional torus network is defined as a Cartesian product of n cycles, Ck(1) x ... x C-kn, where C-kj is a cycle of length k(j) for 1 <= j <= n. The proposed technique is applied to the two or higher-dimensional torus networks, and their conditional diagnosabilities are established completely: the conditional diagnosability of every torus network G is equal to gamma(4)'(G) + 1, excluding the three small ones C-3 x C-3, C-3 x C-4, and C-4 x C-4. In addition, gamma(p)(G) as well as gamma(4)'(G) is derived for 2 <= p <= 4 and the r-superconnectivity is also derived for 1 <= r <= 3. (C) 2014 Elsevier B.V. All rights reserved.
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