Development of diagnosis Algorithm for Computer Networks

本文提出了一种分层非自适应诊断算法，用于计算机网络总N个节点的测试。由于一般的计算机网络可以被视为N节点完全图，为了有效的测试，测试过程必须并行化，以实现多个节点的同时测试。为了实现这一目标，我们提出了一个高贵的测试图，使我们能够测试尽可能多的节点在网络中，由于层次结构的测试过程。测试时间的量被评估为诊断延迟。分析了故障分布成簇情况下的最优诊断能力t。为了减少所需的测试时间，两个修订的方法进行了讨论和评估。通过分析和仿真两种方法，与其他分布式诊断算法的性能进行了比较。

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.