Number of mutual connections in neighborhoods and its application to self-diagnosable systems

Authors:
Kiyoaki Yoshida;Yasumasa Sujaku;Tohru Kohda
Affiliations:
Department of Information and Network Engineering, Kurume Institute of Technology, 2228 Kamitsu-machi, Kurume, Fukuoka 830-0052, Japan;Department of Information and Network Engineering, Kurume Institute of Technology, 2228 Kamitsu-machi, Kurume, Fukuoka 830-0052, Japan;Department of Computer Science and Communication Engineering, Kyushu University, 6-10-1, Higashi, Fukuoka 812-8581, Japan
Venue:
Information Processing Letters
Year:
2003

Citing 3
Cited 0

A New Measure for Hybrid Fault Diagnosability

IEEE Transactions on Computers
Evaluation of a Diagnosis Algorithm for Regular Structures

IEEE Transactions on Computers
Self-Organizing Systems with Self-Diagnosability

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper gives a set of discriminators (sufficient conditions) to identify the possibility of embedding optimal, highly structured systems on regular graphs for the purpose of self-diagnosis. The discrimination process is only a set of straightforward matrix computations; however, the discriminator is powerful and leads to the result that most of the typical graphs representing interconnection networks such as Cayley graphs can be embedded by the highly structured systems. The highly structured system has an O(|E|) fault-identification algorithm that can diagnose each of the units independently, locally and in any order, where |E| means the cardinality of the set of edges.