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

A technology for sharing links and link groups, which is applied in transmission systems, digital transmission systems, electromagnetic wave transmission systems, etc. It can solve problems such as incompleteness, inability to solve the algorithm completely, and inapplicability of SRLG separation requirements, etc., to achieve wide application prospects, The effect of narrowing the search space and reducing complexity

Active Publication Date: 2018-02-13
HUNAN UNIV
View PDF5 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for solving complete risk link sharing group separation path pair
  • Method and system for solving complete risk link sharing group separation path pair
  • Method and system for solving complete risk link sharing group separation path pair

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030]The concrete realization process of the present invention is as follows:

[0031] Step 1: Use the Dijkstra algorithm to calculate the first path AP in the original graph topology G;

[0032] Step 2: In the topology G of the original graph, remove the edges of the first path AP obtained and the edges that share risks with its edges, and obtain the pruned graph G o ;

[0033] Step 3: Delete graph G o Find the second path BP through Dijkstra's algorithm. Return True if BP is found;

[0034] Step 4: If BP is not found, construct a traffic graph G in the original graph topology G through the first path AP * , in flow graph G * Find the set of conflicting links in the risky link group. The original problem is divided into mutually incompatible sub-problems by using the conflicting link set of the risk link group, and each sub-problem is executed in parallel to obtain the optimal solution of each sub-problem to obtain the optimal solution of the original problem.

[0035...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/709H04B10/032H04L45/243
CPCH04B10/032H04L45/24
Inventor 陶恒谢鲲文吉刚
Owner HUNAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap