4.7 Article

A Fast f(r, k+1)/k-Diagnosis for Interconnection Networks Under MM* Model

Journal

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TPDS.2021.3122440

Keywords

Endogenous security; fault diagnosis; reliability; t/k-diagnosability; interconnection networks; MM* model

Funding

  1. National Natural Science Foundation of China [62102088, 62171132, U1905211, 61773415]
  2. Fok Ying Tung Education Foundation [171061]
  3. Natural Science Foundation of Fujian Province [2021J05228]
  4. Fujian University of Technology [GJ-YB-20-06]

Ask authors/readers for more resources

Cyberspace is not a vacuum space and it is normal for viruses and worms to exist in it. Security threats in cyberspace stem from endogenous security issues caused by the incomplete theoretical system and technology of the information field itself. Improving the self-immunity of networks is crucial, rather than aiming for a completely aseptic cyberspace.
Cyberspace is not a vacuum space, and it is normal that there are inevitable viruses and worms in cyberspace. Cyberspace security threats stem from the problem of endogenous security, which is caused by the incompleteness of theoretical system and technology of the information field itself. Thus it is impossible and unnecessary for us to build an aseptic cyberspace. On the contrast, we must focus on improving the self-immunity of network. Literally, endogenous security is an endogenous effect from its own structural factors rather than external ones. The t/k-diagnosis strategy plays a very important role in measuring endogenous network security without prior knowledge, which can significantly enhance the self-diagnosing capability of network. As far as we know, few research involves t/k-diagnosis algorithm and t/k-diagnosability of interconnection networks under MM* model. In this article, we propose a fast f(r, k + 1)/k-diagnosis algorithm of complexity O(Nr(2)), say GMISkDIAGMM*, for a general r-regular network G under MM* model by designing a 0-comparison subgraph M-0(G), where N is the size of G. We determine that the t/k-diagnosabifity (t(G)/ k)(M) of G under MM* model is f(r. k + 1) by GMISkDIAGMM* algorithm. Moreover, we establish the (t(G)/k)(M) of some interconnection networks under MM* model, including BC networks, (n, l)-star graph networks, and data center network DCells. Finally, we compare (t(G)/k)(M) with diagnosability, conditional diagnosability, pessimistic diagnosability, extra diagnosability, and goodneighbor diagnosability under MM* model. It can be seen that (t(G)/k)(M) is greater than other fault diagnosabilities in most cases.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available