Method and system for solving complete risk link sharing group separation path pair

Abstract

The invention discloses a method and system for solving a complete risk link sharing group separation path pair. The method comprises the following steps: under the condition of meeting a trap in thenetwork of a risk sharing link group, acquiring a risk sharing link group side conflict set T by finding the information of a first work (main) path AP firstly, and providing an algorithm for divisionand rule as well as parallel processing of an original problem by utilizing the risk sharing link group side conflict set T. In the application field in which fault-tolerant protection needs to be carried out on the work route AP in software defining network controller layer route business, the operation time of the complete risk sharing link group separation path algorithm is far less than thatof other same type of algorithms, and the algorithmic speed-up ratio is 20 times higher, and the algorithm is far superior to other same type of algorithms in solving speed. The method can adapt to all fields of current complete risk sharing link group separation routes, and has broader application prospects compared with current complete risk sharing link group separation route algorithms.

Description

technical field [0001] The invention relates to application fields such as survivability protection for virtual network paths in software-defined networks, path protection for optical network link failures, and routing protection for specific paths in the context of centralized routing controllers. Method and system for risk sharing link group separation of path pairs. Background technique [0002] The emergence of new applications such as multimedia streaming and video conferencing requires the network to provide a reliable quality of service (QoS) guarantee, not only to meet the QoS requirements of the application, but also to ensure the uninterrupted operation of the business when the network fails. To meet these requirements, two separate paths are usually provided for a network connection, one of which is active and one is standby. When the main path fails, the service flow carried by it is switched to the backup path, so as to realize rapid service recovery. In addit...

AI Technical Summary

Problems solved by technology

However, this algorithm has two disadvantages: First, it is incomplete, that is, there may be suboptimal path pairs, but the algorithm cannot obtain the possible suboptimal path pairs

But unfortunately, the transformed edge shortest path algorithm is only applicable to the case of link separation / node separation (the original algorithm is only applicable to link separation, but it can be applied to the case of node separation only with a slight modification when performing the transformation), Not suitable for more abstract and complete SRLG separation requirements

In fact, precisely because the algorithm is the transformation sequential shortest path, if there are links with the same SRLG attribute in the index and the best two paths, the algorithm cannot be completely solved, because there may be two suboptimal paths at this time fulfil requirements

[0010] In summary, the existing algorithms are still unable to fully solve the calculation problem of SRLG separation path pairs

Images