Development of diagnosis Algorithm for Computer Networks

点击翻译按钮获取中文摘要

A hierarchical non-adaptive diagnosis algorithm is presented for the testing of total N nodes of computer networks. Since general computer networks can be regarded as N-node complete graphs, for efficient testing, it is essential that the test process be parallelized to enable the simultaneous test of multiple nodes. In order to attain this objective, we proposed a noble test graph enabling us to test as many nodes as possible in a network due to the hierarchical architecture of the test processes. The amount of test times is evaluated as the diagnosis latency. Optimal diagnose-ability t is analyzed under clustered fault distribution. In order to reduce the amount of required test times, two revised approaches are discussed and evaluated. The performances with other distributed diagnosis algorithms are compared by both analytical and simulation approaches.