Routing protection method based on minimum path crossover degree

Abstract

The invention discloses a routing protection method based on the minimum path crossing degree, and belongs to the technical field of the Internet. In order to solve the problem that a network device and a protocol stack need to be modified and reset in an existing method, a path with the minimum crossing degree with an optimal path is selected as a backup path, so that when the optimal path breaks down, a node can select the backup path to quickly recover network communication, and the effect that communication is not affected is achieved. The method provided by the invention has a relatively high fault protection rate and a relatively low path stretching degree, the network availability can be greatly improved, and the message loss rate caused by network faults is reduced. Therefore, the invention provides an effective scheme for an internet service provider to solve the problem of routing availability.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of Internet, and particularly relates to a route protection method based on minimum path intersection degree. BACKGROUND

[0002] In today's digital age, the Internet has become the infrastructure of social operation, and its stability and availability are directly related to the normal operation of many fields such as economy, medicine and education. However, network failures are difficult to completely avoid, and once a failure occurs, it may lead to data loss, so improving the resilience of the network when facing failures and ensuring the continuity of services have become a topic in the field of network research. In order to solve these problems, many solutions have been proposed, such as LFA and ECMP, LFA is favored by the industry for its simple implementation and support for incremental deployment, although it improves the reliability of the network to a certain extent, but also has many limitations. In order to solve the problem, researchers have also proposed a large number of solutions, such as the MARA algorithm, which uses a directed acyclic graph (DAG) to convert the network topology into a DAG, such conversion affects the possibility of calculating the backup next hop; the FCP algorithm uses the header of the message to mark the failure information, and according to these failure information, the FCP algorithm can dynamically update the network topology structure to reflect the actual situation of the current network. However, one of the obvious defects of the FCP method is that it requires modification of the current routing protocol, which may increase the complexity of the actual deployment process, as the network equipment and protocol stack need to be modified and reconfigured. SUMMARY

[0003] In view of the problem that the existing method needs to modify and reconfigure the network equipment and protocol stack, the present application provides a route protection method based on minimum path intersection degree. By minimizing the intersection degree of the backup path and the best path, the network interaction can be quickly restored when a failure occurs.

[0004] In order to achieve the above purpose, the present application adopts the following technical scheme:

[0005] For the convenience of description, we first define some marks, which are applicable to the whole application. Since the calculation process for each destination node is the same, the network topology structure is defined as wherein, represents a set of network nodes, represents a set of edges between nodes, represents the weight on the edge. It is assumed that node is the destination node, node is the source node, and the present application uses Dijkstra (Dijkstra) algorithm, i.e. shortest path algorithm, to calculate the path, which is represented by the symbol shortest path and is abbreviated as According to the shortest path algorithm, Indicates from Node to The optimal path with the minimum cost to a node, where The path is A sequence of any two nodes and There are edges between them. Indicates from Node to Possible backup paths for the node, path yes sequence. It is expressed as the intersection degree of the optimal path and the backup path. Represented as the final backup path for the node pair.

[0006] A routing protection method based on minimum path intersection degree, the method comprising the following steps:

[0007] Step 1: Define and initialize the network topology. All node pairs in , using Dijkstra algorithm to calculate from the source node To the destination node The best path ;

[0008] Step 2: Each node The best path Initialize the value assigned to its possible backup path ;

[0009] Step 3: Calculate node pairs Degree of intersection between backup path and optimal path ;

[0010] Step 4: Delete the intersection set Path in

[0011] Step 5: Recalculate the node pairs using Dijkstra algorithm Backup path ;

[0012] Step 6: Determine the backup path If it exists, the path will be backed up. Assign to the final backup path ;

[0013] Step 7: When a node has a backup path If it does not exist, delete the intersection set The node closest to the source node But not a broken link, get backup path ;

[0014] Step 8: Recalculate backup path ;

[0015] Step 9: Determine whether the backup path Exist, when not exist, determine whether the deleted link is the closest link to the destination node, if not, repeat step 7-step 8;

[0016] Step 10: When the deleted link is the closest link to the destination node, then do not delete the link, recalculate the backup path , Assign to the final backup path ;

[0017] Step 11: When the backup path Exist, jump to step 3 to continue execution;

[0018] Step 12: Until all node pairs find the final backup path , The algorithm ends.

[0019] The specific operation of step 7 is:

[0020] Step I: First, determine whether the backup path Empty;

[0021] Step II: When the backup path is empty, then calculate through the loop algorithm;

[0022] Step III: Delete the link closest to the source node in the intersection set ;

[0023] Step IV: In the new network topology , Recalculate the backup path ;

[0024] Step V: Recalculate the intersection , Determine whether the intersection set Empty, not empty then jump to step III to continue loop algorithm; Empty then end loop.

[0025] The specific operation of step 10 is:

[0026] Step I: First, determine whether the backup path Empty;

[0027] Step II: When the backup path is empty, then calculate through the loop algorithm;

[0028] Step III: By removing the intersection set The link closest to the source node;

[0029] Step IV: Get the new network topology Recalculate the backup path ;

[0030] Step V: Recalculate the crossover degree , determine the intersection set Is it empty? If not, jump to step III and continue the loop algorithm; if it is empty, end the loop.

[0031] Compared with the prior art, the present invention has the following advantages:

[0032] The present invention calculates and configures backup paths in advance to achieve rapid response to failures, thereby minimizing the duration and impact of data transmission interruptions. This method selects a path with minimal intersection with the optimal path as the backup path. Ideally, the backup path should not share any common nodes or links with the optimal path. This allows nodes to quickly restore network communications using the backup path if the optimal path fails, ensuring uninterrupted communication. Therefore, the present invention provides an effective solution for internet service providers to address routing availability issues. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 This is a flow chart of a routing protection method based on minimum path intersection according to the present invention;

[0034] Figure 2 This is the network topology of the embodiment of the present invention Schematic diagram, the two nodes connected by dotted lines in the figure represent the actual network The nodes in the middle are neighbor nodes. DETAILED DESCRIPTION

[0035] To gain a deeper understanding of the present invention, we will provide a comprehensive and detailed description thereof. However, the present invention has various implementations and is not limited to the specific examples listed herein. These examples are presented to enhance a comprehensive understanding of the present disclosure.

[0036] Step 1: Calculate the best backup path from node b to node k using the Dijkstra algorithm .

[0037] Step 2: Assign it to the initialized backup path .

[0038] Step 3: Find the crossover degree, that is .

[0039] Step 4: Delete the intersection set Path in .

[0040] Step 5: After deleting the path, I found that the backup path could not be found .

[0041] Step 6: According to the above rules, delete the intersection set Other links .

[0042] Step 7: Recalculate the backup path .

[0043] Step 8: Go back to step 3 and recalculate the crossover .

[0044] Step 9: Execute step 4 and delete the links in set K.

[0045] Step 10: After deleting the paths in set K, recalculate the shortest path from b to node k and find that no backup path can be found. .

[0046] Step 11: According to the above rules, delete Links in .

[0047] Step 12: Recalculate the backup path , found that the backup path could not be found .

[0048] Step 13: Link It is not the link closest to the destination node k, so continue to delete Links in .

[0049] Step 14: Recalculate the backup path .

[0050] Step 15: Go back to step 3 and recalculate the crossover .

[0051] Step 16: Delete the links in set K .

[0052] Step 17: Recalculate , found that it could not be found .

[0053] Step 18: Due to the link It is the link closest to the destination node in the set, so this link is not deleted and recalculated. ,Will assigned to .

[0054] Step 19: Final backup path is , algorithm ends.

[0055] The content not described in detail in the specification of the present application belongs to the prior art known to the person skilled in the art. Although the above describes the specific embodiments of the present application in a demonstrative manner, so as to facilitate the understanding of the present application by the person skilled in the art, it should be clear that the present application is not limited to the scope of the specific embodiments, and for the person skilled in the art, as long as various changes are within the spirit and scope of the present application defined and determined by the appended claims, all the inventions and creations utilizing the concept of the present application are within the scope of protection.

Claims

1. A routing protection method based on minimum path intersection, characterized in that: The method comprises the following steps: Step 1: Define and initialize the network topology. All node pairs in , using Dijkstra algorithm to calculate from the source node To the destination node The best path ; Step 2: Each node The best path Initialize the value assigned to its possible backup path ; Step 3: Calculate node pairs Degree of intersection between backup path and optimal path ; Step 4: Delete the intersection set Path in Step 5: Recalculate the node pairs using Dijkstra algorithm Backup path ; Step 6: Determine the backup path If it exists, the path will be backed up. Assign to the final backup path ; Step 7: When a node has a backup path If it does not exist, delete the intersection set Close to the source node But there will be no broken link, and the backup path will be obtained ; Step 8: Recalculate the backup path ; Step 9: Determine the backup path If it does not exist, determine whether the deleted link is the link closest to the destination node. If not, repeat steps 7-8; Step 10: If the deleted link is the link closest to the destination node, do not delete this link and recalculate the backup path. , assigned to the final backup path ; Step 11: Back up the path If it exists, jump to step 3 to continue execution; Step 12: Final backup path until all node pairs If all are found, the algorithm ends.

2. The routing protection method based on minimum path intersection according to claim 1, characterized in that: Step 7: When a node has a backup path If it does not exist, delete the intersection set Close to the source node But there will be no broken link, and the backup path will be obtained The specific operations are: Step I: First, back up the Determine whether it is empty; Step II: When the backup path is empty, the calculation is performed through the loop algorithm; Step III: By removing the intersection set The link closest to the source node; Step IV: Get the new network topology Recalculate the backup path ; Step V: Recalculate the crossover degree , determine the intersection set Is it empty? If not, jump to step III and continue the loop algorithm; if it is empty, end the loop.

3. The routing protection method based on minimum path intersection according to claim 2, characterized in that: Step 10: If the deleted link is the link closest to the destination node, then the link is not deleted and the backup path is recalculated. , assigned to the final backup path The specific operations are: Step I: First, back up the Determine whether it is empty; Step II: When the backup path is empty, the calculation is performed through the loop algorithm; Step III: By removing the intersection set The link closest to the source node; Step IV: Get the new network topology Recalculate the backup path ; Step V: Recalculate the crossover degree , determine the intersection set Is it empty? If not, jump to step III and continue the loop algorithm; if it is empty, end the loop.

Images