Protection path finding method and device for avoiding same routing, equipment and storage medium

Abstract

The invention discloses a protection path finding method, device and equipment for avoiding same routing and a computer readable storage medium, and the method comprises the steps: generating an avoiding strategy condition table according to an obtained main-standby separation strategy; judging whether a target node of a first to-be-searched path in a preset to-be-searched path set is a destination node or not; if it is determined that the target node of the first to-be-searched path is a destination node, storing the first to-be-searched path to an alternative path set as an alternative path; and when it is determined that the preset to-be-searched path set is empty, sorting a plurality of alternative paths in the alternative path set according to the avoidance strategy condition table, and searching an optimal protection path, thereby solving the problems of complex topology of engineering services, inconvenience in manual operation, high error rate, high efficiency and the like in related technologies. By the method, the technical problem that an optimal protection path cannot be found is solved, man-made interference is reduced, an optimal path of different main and standby routes is quickly found, and the main and standby routes are preferentially eliminated.

Description

Technical Field

[0001] The present application relates to the field of communication network technology, and in particular to a protection path finding method, device, equipment and computer-readable storage medium for avoiding the same route. Background Art

[0002] With the rapid development of telecommunications services, the scale of transmission networks continues to expand, and network topologies are becoming more and more complex. There are special requirements for the protection path in the primary and backup protection paths to avoid the same route in the working path, such as passing through the same disk, the same network element, the same optical cable or the same fiber. Because once the same route segment is interrupted, the primary and backup routes cannot work normally, resulting in protection failure.

[0003] like Figure 2 In the same routing path-finding deployment single chain scenario diagram shown, you cannot check "Avoid the same port" or "Avoid the same NE" when configuring a protection tunnel. If you need to create a protection tunnel from NE 1 to NE 4, if you do not check any policy, the path-finding working path is 1-2-3-4, and the active and standby protection paths are 1-2-3-4. Since the last section is a single chain, the working and protection paths share the same fiber.

[0004] If "Separate active and standby paths in parallel" is selected, the protection path will try to avoid the link between NE 1 and NE 2 that may share the same optical cable. The protection path search result is shown as the orange path. It will pass through NE 2 according to the principle of the shortest path and be the same NE as the working path.

[0005] For users, the ideal protection path is 1-5-6-7-8-3-4. To achieve this result, it is necessary to add a constraint condition to avoid "network element 2" in the protection path. For complex topology of engineering services, manual operation is inconvenient and prone to errors, and it is impossible to find an optimal path.

[0006] Therefore, a protection path finding technology that avoids the same route is urgently needed to meet the increasingly urgent needs of existing network projects. Summary of the invention

[0007] The present application provides a protection path finding method, device, equipment and computer-readable storage medium for avoiding the same route, which can solve the technical problems existing in the prior art of complex topology of engineering business, inconvenient manual operation, easy to make mistakes, and unable to find an optimal protection path.

[0008] In a first aspect, an embodiment of the present application provides a method for finding a protection path to avoid the same route, characterized in that the method for finding a protection path to avoid the same route includes:

[0009] Generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types;

[0010] Determine whether the target node of the first path to be found in the preset set of paths to be found is the destination node;

[0011] If it is determined that the target node of the first path to be found is the destination node, storing the first path to be found in the candidate path set as a candidate path;

[0012] When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find an optimal protection path.

[0013] In combination with the first aspect, in one implementation, sorting the multiple candidate paths in the candidate path set according to the avoidance strategy condition table to find the optimal protection path includes:

[0014] sorting the plurality of candidate paths according to a first priority of the avoidance type;

[0015] Determine whether the first sorted candidate path is unique;

[0016] If it is determined that the first-ranked candidate path is unique, the first-ranked candidate path is used as the optimal protection path.

[0017] In combination with the first aspect, in one implementation, after determining whether the first sorted candidate path is unique, the method further includes:

[0018] If it is determined that the candidate paths in the first sort are not unique, obtaining the number of times the candidate paths in the first sort have the same route;

[0019] Determining whether the same-route times of the candidate paths in the first sorting are the same;

[0020] If the same-route times of the candidate paths in the first order are different, the candidate path in the first order with the least same-route times is obtained as the optimal protection path.

[0021] In combination with the first aspect, in an implementation manner, after determining whether the same-route times of the candidate paths in the first sorting are the same, the method further includes:

[0022] If the same route times of the candidate paths in the first order are the same, obtaining the cost values ​​of the candidate paths in the first order;

[0023] Determine whether the Cost values ​​of the candidate paths in the first sorting are the same;

[0024] If it is determined that the Cost values ​​of the candidate paths in the first order are different, the candidate path in the first order with the smallest Cost value is obtained as the optimal protection path.

[0025] In combination with the first aspect, in an implementation manner, after determining whether the Cost values ​​of the candidate paths in the first sorting are the same, the method further includes:

[0026] If the cost values ​​of the candidate paths in the first order are the same, sorting the candidate paths in the first order according to the second priority of the avoidance type;

[0027] A target candidate path is determined from the sorted candidate paths of the first sort, and the target candidate path is used as an optimal protection path.

[0028] In combination with the first aspect, in an implementation manner, after determining whether the Cost values ​​of the candidate paths in the first sorting are the same, the method further includes:

[0029] If the cost values ​​of the candidate paths in the first sort are the same, obtaining the weighted cost values ​​of the candidate paths in the first sort;

[0030] According to the weighted Cost values ​​of the candidate paths in the first sorting, the candidate path with the smallest weighted Cost value is determined as the optimal protection path.

[0031] In combination with the first aspect, in one implementation, after determining whether the target node of the first path to be found in the preset set of paths to be found is the destination node, the method further includes:

[0032] If it is determined that the target node of the first path to be found is not the destination node, searching for the next node of the target node;

[0033] Determining whether the next node is a node in the first path to be found;

[0034] If it is determined that the next node is not a node in the first path to be found, the next node is used as a node after the target node in the first path to be found, and a new path to be found is generated to determine whether the target node in the new path to be found is the destination node;

[0035] If it is determined that the target node of the new path to be found is the destination node, the new path to be found is stored in the candidate path set as an alternative path

[0036] When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find an optimal protection path.

[0037] In a second aspect, an embodiment of the present application provides a protection path finding device for avoiding the same route, and the protection path finding device for avoiding the same route includes:

[0038] A generating module, configured to generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types;

[0039] A judging module, used for judging whether a target node of a first path to be found in the preset set of paths to be found is a destination node;

[0040] A storage module, configured to store the first to-be-searched path in a set of candidate paths as a candidate path if it is determined that the target node of the first to-be-searched path is a destination node;

[0041] The sorting and routing module is used to sort the multiple candidate paths in the candidate path set according to the avoidance strategy condition table and find the optimal protection path.

[0042] In the third aspect, an embodiment of the present application provides a protection path finding device for avoiding the same routing, wherein the protection path finding device for avoiding the same routing comprises a processor, a memory, and a protection path finding program for avoiding the same routing stored in the memory and executable by the processor, wherein when the protection path finding program for avoiding the same routing is executed by the processor, the steps of the protection path finding method for avoiding the same routing as described above are implemented.

[0043] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a protection path finding program for avoiding the same routing is stored. When the protection path finding program for avoiding the same routing is executed by a processor, the steps of the protection path finding method for avoiding the same routing as described above are implemented.

[0044] The beneficial effects brought by the technical solution provided by the embodiments of the present application include:

[0045] By generating an avoidance strategy condition table according to the acquired primary-standby separation strategy, wherein the primary-standby separation strategy is a primary-standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types and the priority level of the avoidance types; judging whether the target node of the first path to be found in the preset set of paths to be found is the destination node; if it is determined that the target node of the first path to be found is the destination node, storing the first path to be found in the alternative path set as an alternative path; when it is determined that the preset set of paths to be found is empty, sorting the multiple alternative paths in the alternative path set according to the avoidance strategy condition table, and finding the optimal protection path, the technical problems in the related technology that the engineering business has a complex topology, the manual operation is inconvenient and prone to errors, and an optimal protection path cannot be found, and human interference is reduced to quickly find an optimal path with different primary and standby routes, thereby preferentially eliminating the primary and standby same routes. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 A single-chain scenario diagram for deploying the same routing path in the prior art of this application;

[0047] Figure 2 A flowchart of a first embodiment of a protection path finding method for avoiding the same route in the present application;

[0048] Figure 3 A flowchart of a second embodiment of a protection path finding method for avoiding the same route in the present application;

[0049] Figure 4 A schematic diagram of functional modules of an embodiment of a protection path finding device for avoiding the same route in the present application;

[0050] Figure 5 This is a schematic diagram of the hardware structure of a protection path finding device for avoiding the same route involved in the embodiment of the present application. DETAILED DESCRIPTION

[0051] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0052] First, some technical terms in the present application are explained to facilitate those skilled in the art to understand the present application.

[0053] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be further described in detail below with reference to the accompanying drawings.

[0054] In a first aspect, an embodiment of the present application provides a protection path finding method for avoiding the same route.

[0055] In one embodiment, referring to Figure 2 , Figure 2 This is a flow chart of the first embodiment of the protection path finding method for avoiding the same route in this application. Figure 2 As shown, the protection path finding method to avoid the same route includes:

[0056] Step S10: Generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types;

[0057] Exemplarily, a user-defined active / standby separation strategy is obtained, and the active / standby separation strategy is a strategy for avoiding active / standby separation with the same route, and the active / standby separation strategy for avoiding active / standby separation with the same route includes avoidance types, and avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port. By selecting different avoidance types, an avoidance strategy condition table is generated. For example, if you choose to avoid the same single disk 2, and the number to avoid is 4, then the priority is 3; if you choose to avoid the same single disk, avoid the same network element, avoid the same fiber connection, and avoid the same port, and the number to avoid is 0, then the priority is 0, and 0 is the highest priority. The avoidance strategy condition table is as follows:

[0058] Avoid Types Number of types Priority Same single disk, same network element, same fiber and same port 0 0 Same fiber 1 1 Same network element 1 2 Same single disk 1 3 Same port 1 4

[0059] Among them, different avoidance types are accumulated according to the avoidance quantity to obtain the corresponding priority. For example, the avoidance types include avoiding the same connected fiber and avoiding the same network element. The number of avoiding the same connected fiber is 1, and the number of avoiding the same network element is 2. Then the priority of avoiding the same connected fiber and avoiding the same network element is 5.

[0060] Step S20: determining whether the target node of the first path to be found in the preset path to be found set is the destination node;

[0061] Exemplarily, a preset set of paths to be found is obtained, and the preset set of paths to be found includes multiple different paths to be found, for example, a first path to be found, a second path to be found, a third path to be found, and a fourth path to be found. The preset set of paths to be found is to obtain a working path and a network topology map of a service, determine the first network element in the working path, obtain all next-hop network elements of the first network element in the network topology map based on the network topology map and the first network element, and use the generated path as the path to be found in the preset set of paths to be found. Obtain the first path to be found in the preset set of paths to be found, and determine whether the second node in the first path to be found is the destination node.

[0062] Step S30: if it is determined that the target node of the first path to be found is the destination node, the first path to be found is stored in a candidate path set as a candidate path;

[0063] Exemplarily, if it is determined that the target node of the first path to be found is the destination node, the first path to be found is stored in the candidate path set as a candidate path. The candidate paths include not only the first path to be found, but also the paths in the preset path set whose target nodes are not the destination nodes.

[0064] Step S40: When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find the optimal protection path.

[0065] Exemplarily, it is determined whether the preset path set to be found is empty. If it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find the optimal protection path.

[0066] Sort multiple candidate paths according to the first priority of the avoidance type; determine whether the first-ranked candidate path is unique; if it is determined that the first-ranked candidate path is unique, then use the first-ranked candidate path as the optimal protection path. If it is determined that the first-ranked candidate path is not unique, obtain the number of same routes for each first-ranked candidate path; determine whether the number of same routes for each first-ranked candidate path is the same.

[0067] If the number of times the first-ranked candidate paths have the same route is different, then the first-ranked candidate path with the least number of times the first-ranked candidate paths have the best protection path. If the number of times the first-ranked candidate paths have the same route is the same, then the cost value of each first-ranked candidate path is obtained; determine whether the cost values ​​of each first-ranked candidate path are the same; if it is determined that the cost values ​​of each first-ranked candidate path are different, then the first-ranked candidate path with the smallest cost value is obtained as the best protection path.

[0068] If the Cost values ​​of the first-ranked candidate paths are the same, the first-ranked candidate paths are ranked according to the second priority of the avoidance type; a target candidate path is determined from the ranked first-ranked candidate paths, and the target candidate path is used as the optimal protection path.

[0069] If the cost values ​​of the first-ranked candidate paths are the same, the weighted cost values ​​of the first-ranked candidate paths are obtained; and according to the weighted cost values ​​of the first-ranked candidate paths, the candidate path with the smallest weighted cost value is determined as the optimal protection path.

[0070] In this embodiment, an avoidance strategy condition table is generated according to the acquired primary-standby separation strategy, wherein the primary-standby separation strategy is a primary-standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types and the priority level of the avoidance types; it is determined whether the target node of the first path to be found in the preset set of paths to be found is the destination node; if it is determined that the target node of the first path to be found is the destination node, the first path to be found is stored in the alternative path set as an alternative path; when it is determined that the preset set of paths to be found is empty, the multiple alternative paths in the alternative path set are sorted according to the avoidance strategy condition table to find the optimal protection path, which solves the technical problems in the related technology that the engineering business has a complex topology, manual operation is inconvenient and prone to errors, and an optimal protection path cannot be found, reduces human interference and quickly finds an optimal path with different primary and standby routes, thereby preferentially eliminating the primary and standby same routes.

[0071] In one embodiment, referring to Figure 3 , Figure 3 This is a flow chart of the second embodiment of the protection path finding method for avoiding the same route in this application. Figure 3 As shown, the protection path finding method to avoid the same route includes:

[0072] Step S11: Generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types;

[0073] Exemplarily, a user-defined active / standby separation strategy is obtained, and the active / standby separation strategy is a strategy for avoiding active / standby separation with the same route, and the active / standby separation strategy for avoiding active / standby separation with the same route includes avoidance types, and avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port. By selecting different avoidance types, an avoidance strategy condition table is generated. For example, if you choose to avoid the same single disk 2, and the number to avoid is 4, then the priority is 3; if you choose to avoid the same single disk, avoid the same network element, avoid the same fiber connection, and avoid the same port, and the number to avoid is 0, then the priority is 0, and 0 is the highest priority. The avoidance strategy condition table is as follows:

[0074] Avoid Types Number of types Priority Same single disk, same network element, same fiber and same port 0 0 Same fiber 1 1 Same network element 1 2 Same single disk 1 3 Same port 1 4

[0075] Among them, different avoidance types are accumulated according to the avoidance quantity to obtain the corresponding priority. For example, the avoidance types include avoiding the same connected fiber and avoiding the same network element. The number of avoiding the same connected fiber is 1, and the number of avoiding the same network element is 2. Then the priority of avoiding the same connected fiber and avoiding the same network element is 5.

[0076] Step S12: determining whether the target node of the first path to be found in the preset set of paths to be found is the destination node;

[0077] Exemplarily, a preset set of paths to be found is obtained, and the preset set of paths to be found includes multiple different paths to be found, for example, a first path to be found, a second path to be found, a third path to be found, and a fourth path to be found. The preset set of paths to be found is to obtain a working path and a network topology map of a service, determine the first network element in the working path, obtain all next-hop network elements of the first network element in the network topology map based on the network topology map and the first network element, and use the generated path as the path to be found in the preset set of paths to be found. Obtain the first path to be found in the preset set of paths to be found, and determine whether the second node in the first path to be found is the destination node.

[0078] Step S13: if it is determined that the target node of the first path to be found is not the destination node, then searching for the next node of the target node;

[0079] Exemplarily, if it is determined that the target node of the first path to be found is not the destination node, then the next node of the target node is found, for example, all next-hop nodes are traversed and the next-hop node is used as the next node of the target node.

[0080] Step S14: Determine whether the next node is a node in the first path to be found;

[0081] Step S15: If it is determined that the next node is not a node in the first path to be found, the next node is used as the node after the target node in the first path to be found, and a new path to be found is generated to determine whether the target node in the new path to be found is the destination node.

[0082] Exemplarily, if it is determined that the next node is not a node in the first path to be found, the next node is used as the node after the target node in the first path to be found, a new path to be found is generated, and mapMaxCount<same route type, number of times> and mapMaxCost<same route type, Sumcost value> of the current node are calculated according to the new path to be found, and recorded. The new path to be found is placed in the preset path to be found set to determine whether the target node in the new path to be found is the destination node.

[0083] Step S16: If it is determined that the target node of the new path to be found is the destination node, the new path to be found is stored in the candidate path set as a candidate path;

[0084] Exemplarily, if it is determined that the target node of the new path to be found is the destination node, the new path to be found is stored in the candidate path set as a candidate path. The candidate path includes not only the first path to be found, but also the paths to be found whose target nodes of each path to be found in the preset path set are not the destination node.

[0085] Step S17: when it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find the optimal protection path.

[0086] It is determined whether the preset path set to be found is empty. If it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find the optimal protection path.

[0087] Sort multiple candidate paths according to the first priority of the avoidance type; determine whether the first-ranked candidate path is unique; if it is determined that the first-ranked candidate path is unique, then use the first-ranked candidate path as the optimal protection path. If it is determined that the first-ranked candidate path is not unique, obtain the number of times the first-ranked candidate paths have the same route; determine whether the number of times the first-ranked candidate paths have the same route is the same;

[0088] If the number of times the first-ranked candidate paths have the same route is different, then the first-ranked candidate path with the least number of times the first-ranked candidate paths have the best protection path. If the number of times the first-ranked candidate paths have the same route is the same, then the cost value of each first-ranked candidate path is obtained; determine whether the cost values ​​of each first-ranked candidate path are the same; if it is determined that the cost values ​​of each first-ranked candidate path are different, then the first-ranked candidate path with the smallest cost value is obtained as the best protection path.

[0089] If the Cost values ​​of the first-ranked candidate paths are the same, the first-ranked candidate paths are ranked according to the second priority of the avoidance type; a target candidate path is determined from the ranked first-ranked candidate paths, and the target candidate path is used as the optimal protection path.

[0090] If the cost values ​​of the first-ranked candidate paths are the same, the weighted cost values ​​of the first-ranked candidate paths are obtained; and according to the weighted cost values ​​of the first-ranked candidate paths, the candidate path with the smallest weighted cost value is determined as the optimal protection path.

[0091] In this embodiment, if it is determined that the target node of the first path to be found is not the destination node, the next node of the target node is searched; it is determined whether the next node is a node in the first path to be found; if it is determined that the next node is not a node in the first path to be found, the next node is used as the node after the target node in the first path to be found, and a new path to be found is generated to determine whether the target node in the new path to be found is the destination node. New paths to be found are generated and sorted by path finding, avoiding the difficulties caused by the need to deploy constraints in advance, so that poor planning may result in more complex paths, making path finding more flexible, and further improving the probability of eliminating the same routing of the primary and backup routes.

[0092] In a second aspect, an embodiment of the present application also provides a protection path finding device for avoiding the same route.

[0093] In one embodiment, referring to Figure 4 , Figure 4 This is a functional module diagram of an embodiment of a protection path finding device for avoiding the same route in the present application. Figure 4 As shown, the protection path finding device for avoiding the same route includes:

[0094] A generating module 10 is used to generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types;

[0095] A determination module 20, configured to determine whether a target node of a first path to be found in a preset set of paths to be found is a destination node;

[0096] The storage module 30 is configured to store the first to-be-searched path in a set of candidate paths as a candidate path if it is determined that the target node of the first to-be-searched path is a destination node;

[0097] The sorting and routing module 40 is used to sort the multiple candidate paths in the candidate path set according to the avoidance strategy condition table and find the optimal protection path.

[0098] Furthermore, in one embodiment, the sorting and routing module 40 is used to:

[0099] sorting the plurality of candidate paths according to a first priority of the avoidance type;

[0100] Determine whether the first sorted candidate path is unique;

[0101] If it is determined that the first-ranked candidate path is unique, the first-ranked candidate path is used as the optimal protection path.

[0102] Furthermore, in one embodiment, the protection path finding device for avoiding the same route also includes a new module for:

[0103] If it is determined that the candidate paths in the first sort are not unique, obtaining the number of times the candidate paths in the first sort have the same route;

[0104] Determining whether the same-route times of the candidate paths in the first sorting are the same;

[0105] If the same-route times of the candidate paths in the first order are different, the candidate path in the first order with the least same-route times is obtained as the optimal protection path.

[0106] Furthermore, in one embodiment, the protection path finding device for avoiding the same route also includes a new module for:

[0107] If the same route times of the candidate paths in the first order are the same, obtaining the cost values ​​of the candidate paths in the first order;

[0108] Determine whether the Cost values ​​of the candidate paths in the first sorting are the same;

[0109] If it is determined that the Cost values ​​of the candidate paths in the first order are different, the candidate path in the first order with the smallest Cost value is obtained as the optimal protection path.

[0110] Furthermore, in one embodiment, the protection path finding device for avoiding the same route also includes a new module for:

[0111] If the cost values ​​of the candidate paths in the first order are the same, sorting the candidate paths in the first order according to the second priority of the avoidance type;

[0112] A target candidate path is determined from the sorted candidate paths of the first sort, and the target candidate path is used as an optimal protection path.

[0113] Furthermore, in one embodiment, the protection path finding device for avoiding the same route also includes a new module for:

[0114] If the cost values ​​of the candidate paths in the first sort are the same, obtaining the weighted cost values ​​of the candidate paths in the first sort;

[0115] According to the weighted Cost values ​​of the candidate paths in the first sorting, the candidate path with the smallest weighted Cost value is determined as the optimal protection path.

[0116] Furthermore, in one embodiment, the protection path finding device for avoiding the same route also includes a new module for:

[0117] If it is determined that the target node of the first path to be found is not the destination node, searching for the next node of the target node;

[0118] Determining whether the next node is a node in the first path to be found;

[0119] If it is determined that the next node is not a node in the first path to be found, the next node is used as a node after the target node in the first path to be found, and a new path to be found is generated to determine whether the target node in the new path to be found is the destination node;

[0120] If it is determined that the target node of the new path to be found is the destination node, the new path to be found is stored in the candidate path set as an alternative path

[0121] When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find an optimal protection path.

[0122] Among them, the functional implementation of each module in the above-mentioned protection path finding device for avoiding the same route corresponds to the steps in the above-mentioned protection path finding method embodiment for avoiding the same route, and its functions and implementation processes are no longer repeated here one by one.

[0123] In a third aspect, an embodiment of the present application provides a protection path finding device for avoiding the same route. The protection path finding device for avoiding the same route can be a personal computer (PC), a laptop computer, a server, or other device with data processing capabilities.

[0124] Reference Figure 5 , Figure 5 The hardware structure diagram of the protection path finding device for avoiding the same route involved in the embodiment of the present application is shown in FIG. In the embodiment of the present application, the protection path finding device for avoiding the same route may include a processor, a memory, a communication interface, and a communication bus.

[0125] The communication bus may be of any type and is used to interconnect the processor, the memory, and the communication interface.

[0126] The communication interface includes an input / output (I / O) interface, a physical interface, and a logical interface, which are used to interconnect the devices inside the protection path finding device for avoiding the same route, and an interface for interconnecting the protection path finding device for avoiding the same route with other devices (such as other computing devices or user devices). The physical interface can be an Ethernet interface, an optical fiber interface, an ATM interface, etc.; the user device can be a display, a keyboard, etc.

[0127] The memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.

[0128] The processor may be a general-purpose processor, and the general-purpose processor may call the protection path finding program for avoiding the same route stored in the memory, and execute the protection path finding method for avoiding the same route provided in the embodiment of the present application. For example, the general-purpose processor may be a central processing unit (CPU). The method executed when the protection path finding program for avoiding the same route is called may refer to the various embodiments of the protection path finding method for avoiding the same route of the present application, and will not be repeated here.

[0129] Those skilled in the art will understand that Figure 5The hardware structure shown in the figure does not constitute a limitation on the present application, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0130] In a fourth aspect, an embodiment of the present application also provides a computer-readable storage medium.

[0131] The computer-readable storage medium of the present application stores a protection path finding program for avoiding the same route, wherein when the protection path finding program for avoiding the same route is executed by a processor, the steps of the protection path finding method for avoiding the same route as described above are implemented.

[0132] Among them, the method implemented when the protection path finding program for avoiding the same route is executed can refer to the various embodiments of the protection path finding method for avoiding the same route in this application, and will not be repeated here.

[0133] It should be noted that the serial numbers of the above-mentioned embodiments of the present application are only for description and do not represent the advantages or disadvantages of the embodiments.

[0134] The terms "including" and "having" and any variations thereof in the specification and claims of the present application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. The terms "first", "second" and "third" are used to distinguish different objects, etc., and do not represent a sequence, nor do they limit "first", "second" and "third" to different types.

[0135] In the description of the embodiments of the present application, "exemplary", "for example" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary", "for example" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary", "for example" or "for example" is intended to present related concepts in a specific way.

[0136] In the description of the embodiments of the present application, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; the “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two.

[0137] In some processes described in the embodiments of the present application, multiple operations or steps that appear in a specific order are included, but it should be understood that these operations or steps may not be executed in the order in which they appear in the embodiments of the present application or in parallel, and the sequence number of the operation is only used to distinguish the different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed in sequence or in parallel, and these operations or steps may be combined.

[0138] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD) as described above, and includes a number of instructions for a terminal device to execute the methods described in each embodiment of the present application.

[0139] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A protection path finding method for avoiding the same route, characterized in that: The protection path finding method for avoiding the same route includes: Generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types; Determine whether the target node of the first path to be found in the preset set of paths to be found is the destination node; If it is determined that the target node of the first path to be found is the destination node, storing the first path to be found in the candidate path set as a candidate path; When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find an optimal protection path.

2. The protection path finding method for avoiding the same route as claimed in claim 1, characterized in that: The step of sorting the multiple candidate paths in the candidate path set according to the avoidance strategy condition table to find the optimal protection path includes: sorting the plurality of candidate paths according to a first priority of the avoidance type; Determine whether the first sorted candidate path is unique; If it is determined that the first-ranked candidate path is unique, the first-ranked candidate path is used as the optimal protection path.

3. The protection path finding method for avoiding the same route as claimed in claim 2, characterized in that: After determining whether the first sorted candidate path is unique, the method further includes: If it is determined that the candidate paths in the first sort are not unique, obtaining the number of times the candidate paths in the first sort have the same route; Determining whether the same-route times of the candidate paths in the first sorting are the same; If the same-route times of the candidate paths in the first order are different, the candidate path in the first order with the least same-route times is obtained as the optimal protection path.

4. The protection path finding method for avoiding the same route as claimed in claim 3, characterized in that: After determining whether the number of same-route times of the candidate paths in the first sorting is the same, the method further includes: If the same route times of the candidate paths in the first order are the same, obtaining the cost values ​​of the candidate paths in the first order; Determine whether the Cost values ​​of the candidate paths in the first sorting are the same; If it is determined that the Cost values ​​of the candidate paths in the first order are different, the candidate path in the first order with the smallest Cost value is obtained as the optimal protection path.

5. The protection path finding method for avoiding the same route as claimed in claim 4, characterized in that: After determining whether the cost values ​​of the candidate paths in the first sorting are the same, the method further includes: If the cost values ​​of the candidate paths in the first order are the same, sorting the candidate paths in the first order according to the second priority of the avoidance type; A target candidate path is determined from the sorted candidate paths of the first sort, and the target candidate path is used as an optimal protection path.

6. The protection path finding method for avoiding the same route as claimed in claim 4, characterized in that: After determining whether the cost values ​​of the candidate paths in the first sorting are the same, the method further includes: If the cost values ​​of the candidate paths in the first sort are the same, obtaining the weighted cost values ​​of the candidate paths in the first sort; According to the weighted Cost values ​​of the candidate paths in the first sorting, the candidate path with the smallest weighted Cost value is determined as the optimal protection path.

7. The protection path finding method for avoiding the same route as claimed in claim 1, characterized in that: After determining whether the target node of the first path to be found in the preset set of paths to be found is the destination node, the method further includes: If it is determined that the target node of the first path to be found is not the destination node, searching for the next node of the target node; Determining whether the next node is a node in the first path to be found; If it is determined that the next node is not a node in the first path to be found, the next node is used as a node after the target node in the first path to be found, and a new path to be found is generated to determine whether the target node in the new path to be found is the destination node; If it is determined that the target node of the new path to be found is the destination node, the new path to be found is stored in the candidate path set as a candidate path; When it is determined that the preset path set to be found is empty, multiple candidate paths in the candidate path set are sorted according to the avoidance strategy condition table to find an optimal protection path.

8. A protection path finding device for avoiding the same route, characterized in that: The protection path finding device for avoiding the same route includes: A generating module, configured to generate an avoidance strategy condition table according to the acquired active / standby separation strategy, wherein the active / standby separation strategy is an active / standby separation strategy for avoiding the same route and includes avoidance types, wherein the avoidance types include avoiding the same single disk, avoiding the same network element, avoiding the same fiber connection, and avoiding the same port, and the avoidance strategy condition table includes avoidance types, the number of avoidance types, and the priority level of the avoidance types; A judging module, used for judging whether a target node of a first path to be found in the preset set of paths to be found is a destination node; A storage module, configured to store the first to-be-searched path in a set of candidate paths as a candidate path if it is determined that the target node of the first to-be-searched path is a destination node; The sorting and routing module is used to sort the multiple candidate paths in the candidate path set according to the avoidance strategy condition table and find the optimal protection path.

9. A protection path finding device for avoiding the same route, characterized in that: The protection path finding device for avoiding the same routing includes a processor, a memory, and a protection path finding program for avoiding the same routing stored in the memory and executable by the processor, wherein when the protection path finding program for avoiding the same routing is executed by the processor, the steps of the protection path finding method for avoiding the same routing as described in any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a protection path finding program for avoiding the same routing, wherein when the protection path finding program for avoiding the same routing is executed by a processor, the steps of the protection path finding method for avoiding the same routing as claimed in any one of claims 1 to 7 are implemented.

Images