#### DMCA

## A NON-ADAPTIVE DISTRIBUTED SYSTEM-LEVEL DIAGNOSIS METHOD FOR COMPUTER NETWORKS

### Citations

152 |
On the Connection Assignment Problem of Diagnosable Systems
- Preparata, Gernot, et al.
- 1967
(Show Context)
Citation Context ...ave been significant theoretical researches in the area of system-level diagnosis by which every node receives diagnosis. This system-level diagnosis approach was introduced first by Preparata et al. =-=[1]-=- where t - diagnosability was introduced. The t -diagnosability is the ability to diagnose a fault situation with t or fewer faults given in the network. This means that every node must be tested by m... |

48 |
Characterization of the connection assignment of diagnosable systems
- Hakimi, Amin
- 1974
(Show Context)
Citation Context ...trary. Classical system-level Hiroshi MASUYAMA and Tsutomu MIYOSHI Information and Knowledge Engineering, Tottori University Koyama-cho Minami 4-101, Tottori, 680-8552 Japan diagnosis approaches [1], =-=[6]-=- have a central observer by which all test results are gathered to make a syndrome of the network. In the most of these approaches, a distributed model is assumed where each node performs independentl... |

24 |
Implementation of On-Line Distributed System-Level Diagnosis Theory
- Bianchini, Buskens
- 1992
(Show Context)
Citation Context ...rable presented schemes on the condition that the maximum number of faulty nodes distributed in a network is bounded by a predefined limit, and they have been improved to reduce the diagnosis latency =-=[7]-=-, [8]. However, since test graphs for general computer networks contains many vertices, these adaptive diagnosis techniques require significant overhead, that is complex analysis of the test results. ... |

23 |
A hierarchical adaptive distributed system-level diagnosis algorithm
- Nanya
- 1998
(Show Context)
Citation Context ... presented schemes on the condition that the maximum number of faulty nodes distributed in a network is bounded by a predefined limit, and they have been improved to reduce the diagnosis latency [7], =-=[8]-=-. However, since test graphs for general computer networks contains many vertices, these adaptive diagnosis techniques require significant overhead, that is complex analysis of the test results. In th... |

14 | Fault-tolerant message routing for multiprocessors
- Zakrevski, Karpovsky
- 1998
(Show Context)
Citation Context ...niques based on this self-testing [9] have proposed, and achieved a successful diagnosis of a large number of faults. Though most of drawbacks of self-testing are to require many self-testing, papers =-=[10]-=-, and [11] made the drawbacks light by preparing the limited number of monitors, as shown in our approach. However, their target networks are multiprocessor networks consisting of homogeneous nodes co... |

8 |
Adaptive system-level diagnosis for hypercube multiprocessors
- Feng, Bhuyan, et al.
- 1996
(Show Context)
Citation Context ...studied by using testing networks which is reduced to some test graphs, whose vertices denote the nodes and whose an edge or test link p i , p j from node p i to node p j indicates that p i tests p j =-=[2]-=- ~ [5]. Since a general graph contains many vertices, one by one test approach requires significant test time. The fault model of the network characterizes the outcome of test results. The first model... |

8 |
Dynamic testing strategy for distributed systems
- Meyer, Pradhan
- 1989
(Show Context)
Citation Context ...tor, and then the host can locate all faults in the network. Optimal diagnosability t is analyzed under clustered fault distribution. Recently, several diagnosis techniques based on this self-testing =-=[9]-=- have proposed, and achieved a successful diagnosis of a large number of faults. Though most of drawbacks of self-testing are to require many self-testing, papers [10], and [11] made the drawbacks lig... |

7 |
Safe system level diagnosis
- Vaidya, Pradhan
- 1994
(Show Context)
Citation Context ...d by using testing networks which is reduced to some test graphs, whose vertices denote the nodes and whose an edge or test link p i , p j from node p i to node p j indicates that p i tests p j [2] ~ =-=[5]-=-. Since a general graph contains many vertices, one by one test approach requires significant test time. The fault model of the network characterizes the outcome of test results. The first model of sy... |

1 |
Diagnosis Method of Computer Networks.” 2001 Proceedings of IASTED Parallel and Distributed Computing and Systems
- Masuyama, Miyoshi
- 2001
(Show Context)
Citation Context ...ed on this self-testing [9] have proposed, and achieved a successful diagnosis of a large number of faults. Though most of drawbacks of self-testing are to require many self-testing, papers [10], and =-=[11]-=- made the drawbacks light by preparing the limited number of monitors, as shown in our approach. However, their target networks are multiprocessor networks consisting of homogeneous nodes connected by... |