Science news and articles on health, environment, global warming, stem cells, bird flu, autism, nanotechnology, dinosaurs, evolution -- the latest discoveries in astronomy, anthropology, biology, chemistry, climate & bioengineering, computers, engineering ; medicine, math, physics, psychology, technology, and more from the world's leading research centers universities.

The 1-good-neighbor diagnosability of alternating group graph networks

0

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. For these systems, the study of topological properties of its interconnection network is important. In 2012, Peng et al. proposed a new measure for fault diagnosis of the system, namely, the -good-neighbor diagnosability (which is also called the -good-neighbor conditional diagnosability), which requires that every fault-free node contains at least fault-free neighbors. Since the probability that all the neighbors of a fault vertex fail and create faults is more to the probability that all the neighbors of a fault-free vertex fail and create faults

In the system, we consider the situation that no faulty set can contain all the neighbors of any fault-free vertex in the system. In particular, 1-good-neighbor diagnosability of the system is no faulty set containing all the neighbors of any fault-free vertex in the system, which is also called the nature diagnosability of the system. The -dimensional alternating group graph network has been proved to be an important viable candidate for interconnecting a multiprocessor system. The feature of includes low degree of node, small diameter, symmetry, and high degree of fault-tolerance. In this paper, we prove that the 1-good-neighbor diagnosability of is for under the PMC model and MM* model, the 1-good-neighbor diagnosability of 4-dimensional alternating group graph network under the PMC is 4 and the 1-good-neighbor diagnosability of under the MM* model is 3. In this paper, we investigate the problem of 1-good-neighbor diagnosability of under the PMC model and MM* model. It is proved that the 1-good-neighbor diagnosability of under the PMC model and MM* model is when . The above results show that the 1-good-neighbor diagnosability is several times larger than the classical diagnosability of depending on the condition: 1-good-neighbors. The work will help engineers to develop more different measures of 1-good-neighbor diagnosability based on application environment, network topology, network reliability, and statistics related to fault patterns.

###

For more information about the article, please visit http://www.eurekaselect.com/148189

Reference: Jirimutu J et al (2017). The 1-Good-Neighbor Diagnosability of Alternating Group Graph Networks Under the PMC Model and MM* Model , Recent Patents on Computer Science, DOI: 10.2174/2213275910666161207162427

Media Contact

Faizan ul Haq
[email protected]
@BenthamScienceP

http://benthamscience.com/

http://dx.doi.org/10.2174/2213275910666161207162427

Leave A Reply

Your email address will not be published.