网络拓扑结构中任意两结点间的最优测试
Optimum Cover Set between Two Arbitrary Nodes in Topological Network Structure
-
摘要: 为了迅速准确地测试网络拓扑结构中任意两结点问的通路故障,本文提出了通路树和最小覆盖树生长回归算法。运用该算法可以自动产生出最优覆盖集,从而为网络管理者诊断网络的通路故障提供了可靠依据。Abstract: in order to find out the path fault between two arbitrary nodes in topological network structure,this paper presents the path-tree and the minimal cover subtree growth-regression ajgorithm.which can be applied to span automatically the optimum cover set.thus provides for the network administrater the basis of diagnosesing path faults of the network.
下载: