Research On Multiple Failure Localization Algorithm Based On Active Probing In Communication Networks

The combination of computer technology and communication technology makes the advantages of communication networks in data transmission,information exchange and resource sharing more and more prominent.With the continuous high-speed network development,fault management has become an important means to ensure network reliability.In the communication network,the failure of equipment or communication link will reduce the Quality of Service(Qo S)of the network.When failures occur,if fault identification and recovery are not performed in time,the negative impact of failures may require high economic costs to compensate.As the basis of network fault recovery,the goal of fault localization is to detect and identify the exact location of failures.Existing failure localization schemes mainly rely on passive or active methods to identify failures in the network,and have defects in network scale,number of failures,and localization efficiency.Due to the limited endurance of devices or links in the network,the occurrence of multiple failures puts forward higher requirements for network fault localization.In order to improve the efficiency of multiple failure localization,it is necessary to design a reasonable and effective failure localization algorithm.In order to solve the above problems,the contents of this paper are as follows:(1)We make a detailed summary of the types of failures in the communication network and the development of failure localization technology,and analyze the basic ideas and applicable environment of the current failure localization solutions.In addition,we also explain the advantages of active probing technology to solve the problem of fault localization.(2)We study efficient multi-node failure localization schemes in communication networks,and propose a multi-node failure localization algorithm based on active probing that is suitable for large-scale networks.First,we analyze the basic ideas and existing problems of existing node failure localization algorithms,and describe the problem of multi-node failure localization as two sub-problems of probing station placement and probing path selection.Aiming at the problem of probing station placement,we propose an algorithm that can place probing stations based on the benefits of nodes.In order to solve the problem of probing path selection,the greedy path selection method is used in the fault detection process to select probing paths to cover all nodes,and the tabu link search method is used in the fault localization process to select probing paths to achieve accurate identification of the failed nodes.We conduct a lot of experiments on randomly generated network topologies and real network topologies.The experimental results show that,compared with the existing node failure localization algorithms,the algorithm proposed in this paper has great advantages in improving the successful localization ratio and reducing the probing cost.(3)Aiming at the problem of multi-link failure localization in communication networks,we give a multi-link failure localization algorithm that adaptively selects probing paths.First,we analyze the existing link failure localization algorithm based on non-adaptive probing and use adaptive probing technology to study the problem of multi-link failure localization.Then we propose a multi-link failure localization algorithm based on end-to-end measurement between two probing stations.The algorithm generates a suitable probing path for each link to perform end-to-end measurement using probes,identifies each link based on the probing result,and regenerates probing paths for unidentified links.The experimental results on randomly generated network topologies and real network topologies show that compared with the existing algorithm,the multi-link failure localization algorithm proposed in this paper has higher successful localization ratio,lower probing cost and higher probing speed.