网络中多节点故障定位的探测路径选择算法

针对现有故障定位技术不能满足多节点故障定位的要求，尤其当网络中存在大量故障节点时，提出了一种基于主动探测的探测路径选择算法。该算法主要包括用于故障检测的贪婪路径选择算法和用于故障定位的禁忌链路搜索算法。在故障检测阶段，使用贪婪路径选择算法迭代地选择具有最小权重的探测路径覆盖网络中的节点。在故障定位阶段，使用禁忌链路搜索算法多次生成候选路径集以选择最合适的探测路径来解决多节点故障定位问题。在随机网络拓扑和真实网络拓扑上的仿真结果表明，与现有的节点故障定位算法相比，探测路径选择算法具有更高的成功定位率和更低的探测成本。

Probing path selection algorithm for multi-node failure localization in networks

A probing path selection algorithm based on active probing is proposed to solve the problem of existing fault localization algorithms’ inability to meet the requirements of multi-node failure localization, especially when a large number of failed nodes are present in the network. The algorithm mainly includes the greedy path selection algorithm for fault detection, which is used to iteratively select the probing path with the minimum weight to cover the nodes in the network, and the tabu link search algorithm for fault localization, which is used to generate the candidate path set multiple times to select the most suitable probing paths and thus solve the problem of multi-node failure localization. Simulation results on random network topologies and real network topologies show that the probing path selection algorithm has a higher successful localization ratio and lower probing cost than the existing node failure localization algorithms.