PMC 模型下网络故障的节点可诊断研究.

Most of traditional fault diagnosis research ignored characteristics of local structure. For that problem under PMC model, this paper introduced the definition of node diagnosis. And through the study by nodes diagnosis, it obtained the sufficient condition of the node diagnosiability and got a newt-diagnosis algorithm called STFDA. Finally, it performed an analysis from the angle of node diagnosis of n-dimensional hypercube network and n-dimensional star network in order to test the validity of the sufficient conditions. This algorithm performed a fault diagnosis to the two kinds of network at last. Indeed, the implementation of the sufficient condition and algorithm got the help of a new structure called ST. And the algorithm's time complexity was proved to be 0 ( N δ ), with δ equal to the maximum degree of node in network, which was significantly reduced compared with others algorithm. [ABSTRACT FROM AUTHOR]