Path determination method, communication equipment and computer readable storage medium

Abstract

The invention discloses a path determination method, communication equipment and a computer readable storage medium, and belongs to the technical field of communication. The path determination method comprises the steps that link state notification information of all first links between a first routing node and a second routing node is acquired, the link state notification information of the first links comprises SRLG information of the first links, a second link is determined from all the first links according to the SRLG information of the first links, and the path of the second link is determined according to the SRLG information of the first links. And performing preset increase adjustment on the actual link costs of all the second links to obtain first target link costs corresponding to all the first links, and determining a rerouting recovery path from the first routing node to the second routing node according to the first target link costs corresponding to all the first links. When the remote SRLG link fails, the risk that the standby path and the working path share the optical layer link can be avoided, and the data transmission reliability is improved.

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a path determination method, a communication device, and a computer-readable storage medium. Background Art

[0002] With the development of technologies such as MPLS (Multi-Propocol Label Switching), SR (Segment Routing), and 5G, the scale of networks is getting larger and larger. Users want faster and more stable Internet services, and operators have also put forward higher requirements on the capabilities of bearer network equipment, especially in the protection switching scenarios of networking environments. In the field of communication technology, optical paths are widely used to transmit information. If an optical path fails, information transmission will be interrupted, causing significant losses. Therefore, the path protection mechanism was born. It ensures the reliability of optical path transmission services by creating two "physically separated" paths for each optical path, namely the working path (main path) and the protection path (backup path).

[0003] The IETF proposed the concept of SRLG (Shared Risk Link Group). The so-called SRLG is a group of links that share the same physical resources. When one of the member links fails, the other member links are also at risk of failure. Therefore, in the networking scenario that includes a risk-sharing link group, it is necessary to avoid the working path and the protection path being carried in the same group of SRLG.

[0004] At present, in the related art, it is impossible to determine whether the faulty link (ie, the working path) and the calculated protection link (ie, the backup path) belong to the same SRLG group, and thus it is impossible to provide stable and reliable protection for service transmission. Summary of the invention

[0005] The main purpose of this application is to provide a path determination method, a communication device and a computer-readable storage medium, aiming to solve the technical problem of how to minimize the risk of sharing an optical layer link between a backup path and a working path when facing a remote SRLG link failure.

[0006] To achieve the above object, the present application provides a path determination method, which is applied to a first routing node in an SR network, and the method includes:

[0007] Acquire link state notification information of all first links between the first routing node and the second routing node, where the link notification information of the first links includes risk sharing link group SRLG information of the first links;

[0008] Determine, according to the SRLG information of the first link, a second link from all the first links, where the second link is a link having the same SRLG information as the first routing node among all the first links;

[0009] Performing a preset increase adjustment on the actual link costs of all the second links to obtain first target link costs corresponding to all the first links;

[0010] A rerouting recovery path between the first routing node and the second routing node is determined according to the first target link costs corresponding to all the first links.

[0011] In addition, to achieve the above purpose, the present application also provides a path determination method, including:

[0012] Acquire link state notification information of all first links between the first routing node and the second routing node, where the link notification information of the first links includes risk sharing link group SRLG information of the first links;

[0013] Determine, according to the SRLG information of the first link, a second link from all the first links, where the second link is a link having the same SRLG information as the first routing node among all the first links;

[0014] Eliminate the second link from all the first links to obtain candidate links other than the second link in the first links;

[0015] A rerouting recovery path between the first routing node and the second routing node is determined according to actual link costs corresponding to all the candidate links.

[0016] In addition, to achieve the above-mentioned purpose, the present application also provides a communication device, which includes a processor and a memory, and the memory stores a program or instruction that can be run on the processor, and when the program or instruction is executed by the processor, it implements the path determination method as described in any one of the above items.

[0017] In addition, to achieve the above objectives, the present application also provides a computer-readable storage medium, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the path determination method as described in any one of the above items is implemented.

[0018] The present application provides a path determination method, a communication device and a computer-readable storage medium. The technical solution of the embodiment of the present application is to obtain link state notification information of all first links between a first routing node and a second routing node, wherein the link notification information of the first link includes the risk sharing link group SRLG information of the first link, and determine the second link from all the first links according to the SRLG information of the first link, wherein the second link is a link with the same SRLG information as the first routing node among all the first links, and then perform a preset increase adjustment on the actual link cost of all the second links to obtain the first target link cost corresponding to all the first links, and then determine the rerouting recovery path between the first routing node and the second routing node according to the first target link cost corresponding to all the first links, so that TI-LFA (Topology independent Loop-free Alternate, topology-independent loop backup) calculates the protection path based on the new link cost networking (that is, the network topology obtained after the actual link costs of all second links are adjusted by a preset increase), so as to facilitate the calculation of the link cost and the smallest global optimal path for switching, and then, when facing the failure of the remote SRLG link, it can avoid the risk of sharing the optical layer link between the backup path and the working path as much as possible, thereby improving the reliability of data transmission.

[0019] Compared with the method in the related art that when calculating the backup protection path, if the calculated backup path output interface and the main path output interface belong to the same group of risk-sharing link groups, the priority of the backup path is lowered, the embodiment of the present application can solve the problem that TI-LFA cannot effectively cover the remote SRLG link failure when calculating the backup protection path, that is, the embodiment of the present application not only covers the calculation and implementation of protection schemes for local failures in the current complex networking scenarios containing risk-sharing link groups, but also supports the calculation and implementation of protection schemes for remote failure scenarios, thereby achieving support for all fault scenarios in complex networking scenarios containing risk-sharing link groups, so that the protection path bypasses the links that contain the same link as the main path and belong to the same group of SRLG, thereby providing reliable protection for the data operation of the operator's services. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0021] In order to more clearly illustrate the technical solutions in this embodiment or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0022] Figure 1 This is a flow chart of the first embodiment of the path determination method of the present application;

[0023] Figure 2 This is a flow chart of the second embodiment of the path determination method of the present application;

[0024] Figure 3 The IP network topology diagram for the Layer 3 devices deployed with SRLG;

[0025] Figure 4 for Figure 3 Schematic diagram of the working path before the remote fault fast reroute function is enabled;

[0026] Figure 5 For Figure 3 The rerouting recovery path graph calculated based on the conventional TI-LFA algorithm;

[0027] Figure 6 For the embodiments of this application Figure 3 The network topology diagram formed based on the link cost adjustment;

[0028] Figure 7 For the embodiments of this application Figure 3 The rerouting recovery path diagram calculated after the remote fault fast rerouting function is enabled;

[0029] Figure 8 Schematic diagram of the device structure of the hardware operating environment involved in the communication device in this embodiment.

[0030] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0031] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work belong to the scope of protection of the present invention.

[0032] At present, the relevant solution is to reduce the priority of the backup path when calculating the backup protection path, if the calculated backup path outgoing interface belongs to the same risk-sharing link group as the main path outgoing interface, so as to avoid the failure of the main and backup paths at the same time and the failure of protection. However, this solution can only solve the local direct connection scenario, that is, the situation where the faulty link is directly connected to the protection calculation node. When the faulty link is not directly connected to the computing node, the computing node can sense the fault, but cannot determine whether the faulty link (i.e., the working path) and the calculated protection link (i.e., the backup path) belong to the same SRLG group, and thus cannot provide stable and reliable protection for service transmission.

[0033] Embodiment 1

[0034] Based on this, please refer to Figure 1 This embodiment provides a path determination method, the method comprising:

[0035] Step S100, obtaining link state advertisement information of all first links between a first routing node and a second routing node;

[0036] The link announcement information of the first link includes risk sharing link group SRLG information of the first link.

[0037] In this embodiment, each routing node (a routing node can be a router or a switch) in an IP (Internet Protocol) network can generate link state advertisement information (LSA, Link-State Advertisement). This LSA advertisement lists all the links or interfaces of the IP network, and indicates their status and outbound costs along each link direction, as well as all known OSPF (Open Shortest Path First) neighbors on the link. These LSA advertisements are often only flooded within the area where they originate. Among them, the IP network can include a common IP network and an SR (Segment Routing, segment routing) network.

[0038] It should be noted that the path determination method of the embodiment of the present application can be applied to any routing node in the IP network topology, wherein the routing node to which the path determination method is applied is the first routing node (i.e., the execution subject). Of course, the path determination method of the embodiment of the present application can also be applied to a central control device independent of each routing node in the IP network topology (the central control device stores a program for implementing the path determination method of the embodiment of the present application, and the central control device can also be called an upper-level control device or a host computer), in which case the central control device is the execution subject.

[0039] It is known that the risk-sharing link group SRLG information is flooding information announced from each routing node. In one embodiment, the path determination method of the embodiment of the present application is applied to the first routing node, then the SRLG information may be the flooding information announced by the second routing node, or the flooding information announced by the intermediate routing node between the first routing node and the second routing node. In another embodiment, the path determination method of the embodiment of the present application is applied to a central control device independent of each routing node in the IP network topology, then the SRLG information may be the flooding information announced by the first routing node, the flooding information announced by the second routing node, or the flooding information announced by the intermediate routing node between the first routing node and the second routing node.

[0040] Those skilled in the art will know that the risk sharing link group SRLG (Shared Risk Link Group) information refers to a group of links that share the same physical resources. When one of the member links fails, the other member links also have the risk of failure. Therefore, in a networking scenario that includes a risk sharing link group, it is necessary to avoid the working path and the protection path being carried in the same group of SRLG.

[0041] In this embodiment, the first routing node is a starting routing node or a source routing node, and the second routing node is a destination routing node or a tail routing node. The first routing node is an upstream routing node of the second routing node. And the first routing node to the second routing node also includes a preset number of intermediate routing nodes, that is, the path determination method of the embodiment of the present application is applied to a networking environment including SRLG in which the routing device hierarchy includes at least three layers, and can be deployed to protection scenarios such as IP FRR (Internet Protocol Fast Reroute) based on SRLG, TI-LFA (Topologyindependent Loop-free alternate, topology-independent loop-free backup), and LFA (Loop-freealternate, loop-free backup).

[0042] Exemplarily, the link advertisement information of the first link may further include an actual link cost of the first link.

[0043] After step S100, step S200 is performed to determine a second link from all the first links according to the SRLG information of the first links;

[0044] The second link is a link among all the first links having the same SRLG information as the first routing node.

[0045] Step S300, performing a preset increase adjustment on the actual link costs of all the second links to obtain first target link costs corresponding to all the first links;

[0046] Exemplarily, step S300, performing a preset increase adjustment on the actual link costs of all the second links to obtain the first target link costs corresponding to all the first links, includes:

[0047] Step A10, performing a preset increase adjustment on the actual link costs of all the second links to obtain the second target link costs corresponding to the preset increase adjustment on all the second links;

[0048] Step A20: Obtain first target link costs corresponding to all the first links according to the second target link costs of all the second links and the actual link costs of other links in the first links except the second link.

[0049] This embodiment makes a preset increase adjustment to the actual link costs of all second links, and then combines the link cost and the minimum as the optimization goal, so that the embodiment of the present application innovatively introduces the concept of punitive link cost bound to SRLG, so that TI-LFA (Topology independent Loop-free alternate) calculates the protection path based on the new link cost networking (that is, the network topology obtained after the actual link costs of all second links are adjusted by a preset increase) when calculating the path, thereby facilitating the calculation of the link cost and the minimum global optimal path for switching, thereby effectively improving network performance.

[0050] After step S300, step S400 is executed to determine a rerouting recovery path between the first routing node and the second routing node according to the first target link costs corresponding to all the first links.

[0051] In this embodiment, the link cost and the minimum reachable path from the first routing node to the second routing node (formed by connecting some of the first links in series) can be determined according to the first target link costs corresponding to all the first links as the optimal protection path, and then the rerouting recovery path between the first routing node and the second routing node is determined according to the optimal protection path selected based on the principle of minimum link cost. In this way, the risk of shared optical layer links between the working path and the backup path can be effectively avoided, thereby improving network performance, and providing a method for solving the failure of the topology-independent redundant alternative protection algorithm caused by the remote failure of the risk-sharing link group, so that the router node can be more accurate when performing topology-independent redundant alternative protection calculations, so that the protection path bypasses the links that contain the same links as the main path and belong to the same group of SRLG.

[0052] The present application provides a path determination method, a communication device and a computer-readable storage medium. The technical solution of the embodiment of the present application is to obtain link state notification information of all first links between a first routing node and a second routing node, wherein the link notification information of the first link includes the risk sharing link group SRLG information of the first link, and determine the second link from all the first links according to the SRLG information of the first link, wherein the second link is a link with the same SRLG information as the first routing node among all the first links, and then perform a preset increase adjustment on the actual link cost of all the second links to obtain the first target link cost corresponding to all the first links, and then determine the rerouting recovery path between the first routing node and the second routing node according to the first target link cost corresponding to all the first links, so that TI-LFA (Topology independent Loop-free Alternate, topology-independent loop backup) calculates the protection path based on the new link cost networking (that is, the network topology obtained after the actual link costs of all second links are adjusted by a preset increase), so as to facilitate the calculation of the link cost and the smallest global optimal path for switching, and then, when facing the failure of the remote SRLG link, it can avoid the risk of sharing the optical layer link between the backup path and the working path as much as possible, thereby improving the reliability of data transmission.

[0053] Compared with the method in the related art that when calculating the backup protection path, if the calculated backup path output interface and the main path output interface belong to the same group of risk-sharing link groups, the priority of the backup path is lowered, the embodiment of the present application can solve the problem that TI-LFA cannot effectively cover the remote SRLG link failure when calculating the backup protection path, that is, the embodiment of the present application not only covers the calculation and implementation of protection schemes for local failures in the current complex networking scenarios containing risk-sharing link groups, but also supports the calculation and implementation of protection schemes for remote failure scenarios, thereby achieving support for all fault scenarios in complex networking scenarios containing risk-sharing link groups, so that the protection path bypasses the links that contain the same link as the main path and belong to the same group of SRLG, thereby providing reliable protection for the data operation of the operator's services.

[0054] Exemplarily, before acquiring the link state advertisement information of all first links between the first routing node and the second routing node, the method further includes:

[0055] Step B10, enabling the remote fault fast rerouting function.

[0056] In this embodiment, a remote fault fast rerouting switch (fast-rerouteremote-SRLG-protection enable / disable) can be set to enable the remote fault fast rerouting function. For example, a remote SRLG fault fast rerouting switch is set on the first routing node (i.e., the source routing node) or the central control device to control whether the remote fault fast rerouting function is turned on, so as to facilitate the operator customers to turn it on and off as needed. It should be noted that the remote fault fast rerouting function means that when a fault is detected in the physical layer or the link layer, a backup link forwarding message can be immediately enabled. That is, when the first routing node (i.e., the source routing node) or the central control device detects that a fault occurs in the physical layer or the link layer, it will recalculate the route based on the path determination method (e.g., steps S100 to S300) of the embodiment of the present application to complete the routing convergence (i.e., calculate a rerouting recovery path).

[0057] The embodiment of the present application starts executing step S100 of the path determination method of the embodiment of the present application after detecting that the remote fault fast rerouting function is enabled: obtaining link status notification information of all first links between the first routing node and the second routing node, so that when the main link is available, by enabling the remote fault fast rerouting function, the backup path (i.e., the rerouting recovery path) can be calculated in advance, which can ensure that the IP network system can quickly respond to the link failure, directly enable the backup route for data forwarding, and restore the business to normal as soon as possible.

[0058] In a possible implementation manner, the step of performing a preset increase adjustment on the actual link costs of all the second links includes:

[0059] Step C10: increasing the actual link costs of all the second links by a preset link cost penalty value.

[0060] In this embodiment, the preset link cost penalty value can be set by those skilled in the art according to actual conditions, and this embodiment does not make specific limitations, so as to better avoid the risk of the backup path and the working path sharing the optical layer link. It is easy to understand that there are certain requirements for the setting of the preset link cost penalty value, and it cannot be too small, otherwise the protection path calculated by the device based on the new link cost protocol topology map (i.e., the IP network topology after the actual link cost of all second links is adjusted by a preset increase) may still pass through the link marked with the protection SRLG, resulting in the backup path and the working path still sharing the optical layer link risk, and the expected effect cannot be achieved.

[0061] This embodiment increases the actual link costs of all second links by a preset link cost penalty value, and then combines the link cost and the minimum as the optimization goal, so that the embodiment of the present application innovatively introduces the concept of punitive link cost bound to SRLG, allowing TI-LFA (Topology independent Loop-free alternate) to calculate the protection path based on the new link cost networking (i.e., the network topology obtained after the actual link costs of all second links are adjusted by a preset increase) when calculating the path, thereby facilitating the calculation of the link cost and the minimum global optimal path for switching, and further, when facing a remote SRLG link failure, it is possible to avoid the risk of sharing the optical layer link between the backup path and the working path, thereby providing a strong guarantee for the stable transmission of the services of communication operators.

[0062] In a possible implementation manner, the step of determining the rerouting recovery path between the first routing node and the second routing node according to the first target link costs corresponding to all the first links includes:

[0063] Step D10, determining a total link cost of each reachable path from the first routing node to the second routing node based on the first target link costs of all the first links, wherein the total link cost is the sum of the first target link costs corresponding to all the first links constituting the reachable path;

[0064] Step D20: determine the reachable path with the minimum total link cost as the rerouting recovery path between the first routing node and the second routing node.

[0065] In this embodiment, the reachable path is a link path formed by connecting part of the first link in series between the first routing node and the second routing node. The source routing node (or head node) of the reachable path is the first routing node, and the tail routing node (or tail node) of the reachable path is the second routing node.

[0066] It can be understood that each reachable path has its corresponding total link cost. For example, the total link cost corresponding to reachable path A is: the sum of the first target link costs corresponding to all first links constituting reachable path A. The total link cost corresponding to reachable path B is: the sum of the first target link costs corresponding to all first links constituting reachable path B.

[0067] This embodiment determines the total link cost of each reachable path between the first routing node and the second routing node based on the first target link cost of all first links, and determines the reachable path with the minimum total link cost as the rerouting recovery path between the first routing node and the second routing node, thereby selecting the reachable path with the minimum sum of link costs from each reachable path based on the adjusted network topology (i.e., the network topology obtained after the actual link costs of all second links are adjusted by a preset increase), as the rerouting recovery path, thereby effectively avoiding the risk of sharing optical layer links between the working path and the backup path, and thus improving the communication performance of the IP network system. In addition, the embodiment of the present application characterizes the cost of using each link by the link cost, takes the minimum cost as the optimization goal, overcomes the problem of blindly selecting a backup path without considering whether the path is the best path, so that the rerouting recovery path selected by this embodiment must be the global optimal path except the main path.

[0068] In a possible implementation manner, the step of determining the second link from all the first links according to the SRLG information of the first link includes:

[0069] Step E10: According to the SRLG information of the first link, matching a link having the same SRLG information as the first routing node from all the first links;

[0070] Step E20: determine the matched first link as the second link.

[0071] This embodiment matches the link with the same SRLG information as the first routing node from all the first links according to the SRLG information of the first link, and determines the matched first link as the second link, so as to accurately screen out the link that shares the optical layer link risk with the working path (i.e., the main link), so as to facilitate the subsequent preset increase adjustment of the actual link cost of the link that shares the optical layer link risk with the working path (i.e., the second link), so that when calculating the fault rerouting, the calculated protection path (i.e., the rerouting recovery path) can bypass the link that contains the same link as the main path and belongs to the same group of SRLG, thereby providing reliable protection for the data operation of the operator's business.

[0072] Furthermore, in order to help understand the technical principles of the embodiments of the present application, a specific embodiment is listed, including:

[0073] This specific embodiment is applied to a three-layer device, including but not limited to a three-layer bearer router or switch. The path determination method of this specific embodiment includes:

[0074] The first step is to set a preset link cost penalty value P for the risk sharing link group srlg1 (the link cost penalty value P has certain requirements and cannot be too small, otherwise the protection path calculated by the device based on the new link cost protocol topology map may still pass through the link marked with the protection srlg1, resulting in failure to achieve the expected effect), and set a remote srlg fault fast rerouting switch to enable the remote fault fast rerouting function;

[0075] In this specific embodiment, Figure 3 As shown, Figure 3 The IP network topology diagram for the three-layer devices deployed with SRLG. R1 is the first routing node, R6 is the second routing node, and R2, R3, R4, and R5 are intermediate routing nodes. R1 sets the preset link cost penalty value to 50 (SRLG 1admin-weight 50), and sets a remote SRLG fault fast rerouting switch (fast-reroute remote-SRLG-protection enable / disable) to control whether to enable the remote fault fast rerouting function, so that the operator customers can turn it on and off as needed.

[0076] Please refer to Figure 4 , Figure 4 for Figure 3 The working path diagram before the remote fault fast reroute function is enabled. Please refer to Figure 5 , Figure 5 For Figure 3 In the rerouting recovery path diagram calculated based on the conventional TI-LFA algorithm, the protection path obtained is R1—R2—R4—R5—R5, which does not bypass the link belonging to SRLG1. When facing the failure of the remote SRLG link, there is still a risk of the backup path and the working path sharing the optical layer link.

[0077] In the second step, after the SRLG network head node (i.e., the first routing node R1) is configured with a preset link cost penalty value and the remote fault fast rerouting function is enabled, each intermediate routing node floods the LSA (Link-State Advertisement) of the SRLG information (i.e., the SRLG information of the first link) and the link cost information (i.e., the actual link cost of the first link) to R1;

[0078] After R1 configures the preset link cost penalty value and turns on the remote failure fast reroute switch, the intermediate routing nodes R3, R4, and R5 configured with SRLG1 will flood the LSA carrying the legacy SRLG tlv SRLG information and link cost information to R1.

[0079] Step 3: After receiving the LSA message, R1 identifies the information in the LSA and matches it with the SRLG link cost penalty value configured by itself. Then, it adds the link cost value in the original LSA to the SRLG penalty value configured by itself to obtain a new cost value.

[0080] After receiving the LSA message describing the link R5-R6 carrying the legacy SRLG tlv (Tag Length Value), R1 recognizes that the SRLG information in the LSA is 1, which matches its own SRLG link cost penalty configuration SRLG 1admin-weight 50. It then adds the link cost 5 in the original LSA to its own SRLG penalty value 50 to obtain a new cost value representing the link cost of R5-R6, which is 55. The same applies to the links R1-R3 (cost 1), R3-R5 (cost 1), R4-R5 (cost 5), and R5-R6 (cost 5). Similarly, the corresponding link cost values ​​obtained by adding the self-configured SRLG penalty value 50 are: R1-R3 (cost 51), R3-R5 (cost 51), R4-R5 (cost 55), and R5-R6 (cost 55).

[0081] In the fourth step, the SRLG network head node R1 completes the topology-independent loop-free redundant alternative protection path calculation based on the topology graph composed of the new link cost values ​​to obtain a new protection path.

[0082] like Figure 6 As shown, the R1 device then completes the topology-independent loop-free redundant alternative protection path calculation based on the network topology diagram composed of the new link cost value. Figure 7 As shown, Figure 7 For the embodiments of this application Figure 3 The rerouting recovery path diagram calculated after enabling the remote fault fast rerouting function is R1-R2-R4-R6, which bypasses the link belonging to SRLG1. When facing a remote SRLG link failure, it effectively avoids the risk of the backup path and the working path sharing the optical layer link.

[0083] In addition, there is also an LFA protection path calculation scenario that includes SRLG. The protocols running between devices include but are not limited to OSPF (Open Shortest Path First)\ISIS (Intermediate System-to-Intermediate System) and so on.

[0084] This specific embodiment provides a method that can solve the failure of the topology-independent redundant alternative protection algorithm caused by the remote failure of the risk-sharing link group, so that the router node can be more accurate when performing topology-independent redundant alternative protection calculations, so that the protection path (i.e., the rerouting recovery path) bypasses the links that contain the same links as the main path and belong to the same group of SRLGs, providing reliable protection for the operator's services.

[0085] In addition, in addition to the method of introducing a punitive link cost bound to the link configured with the srlg parameter to solve the problem of srlg remote failure TI-LFA protection failure, removing the link configured with the same srlg parameter from the networking protocol topology is also a method that can solve the above problem. For details, please refer to the subsequent Example 2, which will not be repeated here.

[0086] It should be noted that the many details described in this specific embodiment are only helpful for understanding the technical concept of the present application and do not constitute a limitation of the present application. More simple transformations based on the technical concept of the present application should all be within the scope of protection of the present application.

[0087] Embodiment 2

[0088] Based on the first embodiment of the present application, in another embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can be referred to the above introduction, and will not be repeated in the following. Figure 2 This embodiment also provides a path determination method, the method comprising:

[0089] Step S500, obtaining link state notification information of all first links between a first routing node and a second routing node;

[0090] The link announcement information of the first link includes risk sharing link group SRLG information of the first link.

[0091] In this embodiment, each routing node (a routing node can be a router or a switch) in an IP (Internet Protocol) network can generate a link state advertisement (LSA, Link-State Advertisement). This LSA advertisement lists all the links or interfaces of the router, and indicates their status and the outbound cost along each link direction, as well as all known OSPF (Open Shortest Path First) neighbors on the link. These LSA advertisements are often only flooded within the area where they originate. Among them, the IP network can include a common IP network and an SR (Segment Routing, segment routing) network.

[0092] It should be noted that the path determination method of the embodiment of the present application can be applied to any routing node in the IP network topology, wherein the routing node to which the path determination method is applied is the first routing node (i.e., the execution subject). Of course, the path determination method of the embodiment of the present application can also be applied to a central control device independent of each routing node in the IP network topology (the central control device stores a program for implementing the path determination method of the embodiment of the present application, and the central control device can also be called an upper-level control device or a host computer), in which case the central control device is the execution subject.

[0093] It is known that the risk-sharing link group SRLG information is flooding information announced from each routing node. In one embodiment, the path determination method of the embodiment of the present application is applied to the first routing node, then the SRLG information may be the flooding information announced by the second routing node, or the flooding information announced by the intermediate routing node between the first routing node and the second routing node. In another embodiment, the path determination method of the embodiment of the present application is applied to a central control device independent of each routing node in the IP network topology, then the SRLG information may be the flooding information announced by the first routing node, the flooding information announced by the second routing node, or the flooding information announced by the intermediate routing node between the first routing node and the second routing node.

[0094] Those skilled in the art will know that the risk sharing link group SRLG (Shared Risk Link Group) information refers to a group of links that share the same physical resources. When one of the member links fails, the other member links also have the risk of failure. Therefore, in a networking scenario that includes a risk sharing link group, it is necessary to avoid the working path and the protection path being carried in the same group of SRLG.

[0095] In this embodiment, the first routing node is a starting routing node or a source routing node, and the second routing node is a destination routing node or a tail routing node. The first routing node is an upstream routing node of the second routing node. And the first routing node to the second routing node also includes a preset number of intermediate routing nodes, that is, the path determination method of the embodiment of the present application is applied to a networking environment including SRLG in which the routing device level includes at least three layers, and can be deployed to protection scenarios such as IP FRR, TI-LFA, and LFA based on SRLG.

[0096] Exemplarily, the link advertisement information of the first link may further include an actual link cost of the first link.

[0097] After step S500, step S600 is performed to determine a second link from all the first links according to the SRLG information of the first links;

[0098] The second link is a link among all the first links having the same SRLG information as the first routing node.

[0099] Step S700: Eliminate the second link from all the first links to obtain candidate links among the first links except the second link;

[0100] The candidate link refers to other first links among all the first links except the second link.

[0101] This embodiment creatively removes the links configured with the same SRLG parameters from the networking protocol topology by removing the second link from all the first links, that is, by performing a pruning operation on the network topology of the IP network, a new network topology is obtained after removing the second link (in the new network topology, only the candidate link remains from the first routing node to the second routing node), so that TI-LFA (Topology independent Loop-free alternate) calculates the protection path based on the new link cost networking (that is, the network topology obtained after removing the second link) when calculating the path, thereby facilitating the calculation of the link cost and the minimum global optimal path for switching, thereby effectively improving network performance.

[0102] Step S800: determining a rerouting recovery path between the first routing node and the second routing node according to actual link costs corresponding to all the candidate links.

[0103] The present application provides a path determination method, a communication device and a computer-readable storage medium. The technical solution of the embodiment of the present application is to obtain link state notification information of all first links between a first routing node and a second routing node, wherein the link notification information of the first link includes risk sharing link group SRLG information of the first link, and determine a second link from all first links according to the SRLG information of the first link, wherein the second link is a link with the same SRLG information as the first routing node among all first links, and then remove the second link from all first links to obtain candidate links other than the second link in the first link, and then determine a rerouting recovery path between the first routing node and the second routing node according to the actual link costs corresponding to all candidate links, so that TI-LFA (Topology independent Loop-free alternate) calculates the protection path based on the new link cost networking (i.e., the network topology obtained after removing the second link) when calculating the path, thereby facilitating the calculation of the link cost and the minimum global optimal path for switching, and then being able to avoid the risk of sharing the optical layer link between the backup path and the working path as much as possible when facing a remote SRLG link failure, thereby improving the reliability of data transmission.

[0104] Compared with the method in the related art that when calculating the backup protection path, if the calculated backup path output interface and the main path output interface belong to the same group of risk-sharing link groups, the priority of the backup path is lowered, the embodiment of the present application can solve the problem that TI-LFA cannot effectively cover the remote SRLG link failure when calculating the backup protection path, that is, the embodiment of the present application not only covers the calculation and implementation of protection schemes for local failures in the current complex networking scenarios containing risk-sharing link groups, but also supports the calculation and implementation of protection schemes for remote failure scenarios, thereby achieving support for all fault scenarios in complex networking scenarios containing risk-sharing link groups, so that the protection path bypasses the links that contain the same link as the main path and belong to the same group of SRLG, thereby providing reliable protection for the data operation of the operator's services.

[0105] Exemplarily, before acquiring the link state advertisement information of all first links between the first routing node and the second routing node, the method further includes:

[0106] Step F10, enabling the remote fault fast rerouting function.

[0107] In this embodiment, a remote fault fast rerouting switch (fast-rerouteremote-SRLG-protection enable / disable) can be set to enable the remote fault fast rerouting function. For example, a remote SRLG fault fast rerouting switch is set on the first routing node (i.e., the source routing node) or the central control device to control whether the remote fault fast rerouting function is turned on, so as to facilitate the operator customers to turn it on and off as needed. It should be noted that the remote fault fast rerouting function means that when a fault is detected in the physical layer or the link layer, a backup link forwarding message can be immediately enabled. That is, when the first routing node (i.e., the source routing node) or the central control device detects that a fault occurs in the physical layer or the link layer, it will recalculate the route based on the path determination method (e.g., steps S100 to S300) of the embodiment of the present application to complete the routing convergence (i.e., calculate a rerouting recovery path).

[0108] The embodiment of the present application starts executing step S100 of the path determination method of the embodiment of the present application after detecting that the remote fault fast rerouting function is enabled: obtaining link status notification information of all first links between the first routing node and the second routing node, so that when the main link is available, by enabling the remote fault fast rerouting function, the backup path (i.e., the rerouting recovery path) can be calculated in advance, which can ensure that the IP network system can quickly respond to the link failure, directly enable the backup route for data forwarding, and restore the business to normal as soon as possible.

[0109] In a possible implementation, the step of determining the rerouting recovery path between the first routing node and the second routing node according to the actual link costs corresponding to all the candidate links includes:

[0110] Step H10, determining the total link cost of each reachable path between the first routing node and the second routing node according to the actual link costs corresponding to all the candidate links, wherein the total link cost is the sum of the actual link costs corresponding to all the candidate links constituting the reachable path;

[0111] Step H20: determine the reachable path with the minimum total link cost as the rerouting recovery path between the first routing node and the second routing node.

[0112] In this embodiment, the reachable path is a link path formed by connecting some candidate links in series from the first routing node to the second routing node. The source routing node (or head node) of the reachable path is the first routing node, and the tail routing node (or tail node) of the reachable path is the second routing node.

[0113] It can be understood that each reachable path has its corresponding total link cost. For example, the total link cost corresponding to reachable path A is: the sum of the actual link costs corresponding to all candidate links constituting reachable path A. The total link cost corresponding to reachable path B is: the sum of the actual link costs corresponding to all candidate links constituting reachable path B.

[0114] This embodiment determines the total link cost of each reachable path between the first routing node and the second routing node based on the actual link costs of all candidate links, and determines the reachable path with the minimum total link cost as the rerouting recovery path between the first routing node and the second routing node, thereby selecting the reachable path with the minimum sum of link costs from each reachable path based on the adjusted network topology (i.e., the network topology obtained after removing the second link), as the rerouting recovery path, thereby effectively avoiding the risk of sharing the optical layer link between the working path and the backup path, thereby improving the communication performance of the IP network system. In addition, the embodiment of the present application characterizes the cost of using each link by the link cost, takes the minimum cost as the optimization goal, overcomes the problem of blindly selecting a backup path without considering whether the path is the best path, so that the rerouting recovery path selected by this embodiment must be the global optimal path except the main path.

[0115] In a possible implementation manner, the step of determining the second link from all the first links according to the SRLG information of the first link includes:

[0116] Step I10: matching a link having the same SRLG information as the first routing node from all the first links according to the SRLG information of the first link;

[0117] Step I20: determine the matched first link as the second link.

[0118] This embodiment matches the link with the same SRLG information as the first routing node from all the first links according to the SRLG information of the first link, and determines the matched first link as the second link, so as to accurately screen out the link that shares the optical layer link risk with the working path (i.e., the main link), so as to facilitate the subsequent removal of the link that shares the optical layer link risk with the working path (i.e., the second link) from the first link, so that when calculating the fault rerouting, the calculated protection path (i.e., the rerouting recovery path) can bypass the link that contains the same link as the main path and belongs to the same group of SRLG, thereby providing reliable protection for the data operation of the operator's business.

[0119] Embodiment 3

[0120] An embodiment of the present invention provides a communication device, the communication device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the path determination method in the above-mentioned embodiment 1.

[0121] Reference below Figure 8 , which shows a schematic diagram of the structure of a communication device suitable for implementing the embodiments of the present disclosure. Figure 8 As shown, the communication device may include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM 1002) or a program loaded from a storage device into a random access memory (RAM 1004). In RAM 1004, various programs and data required for the operation of the communication device are also stored. The processing device 1001, ROM 1002, and RAM 1004 are connected to each other via a bus 1005. An input / output (I / O) interface is also connected to the bus 1005.

[0122] Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 can allow the communication device to communicate with other devices wirelessly or by wire to exchange data. Although the figure shows a communication device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have alternatively.

[0123] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0124] The communication device provided by the present invention adopts the path determination method in the above embodiment, which can solve the technical problem of how to avoid the risk of sharing the optical layer link between the backup path and the working path as much as possible when facing a remote SRLG link failure, so as to improve the reliability of data transmission. Compared with the prior art, the beneficial effects of the communication device provided by the embodiment of the present invention are the same as the beneficial effects of the path determination method provided by the above embodiment, and other technical features in the communication device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0125] It should be understood that the various parts of the present disclosure can be implemented with hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0126] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

[0127] Embodiment 4

[0128] An embodiment of the present invention provides a computer-readable storage medium having computer-readable program instructions stored thereon, and the computer-readable program instructions are used to execute the path determination method in the above embodiment.

[0129] The computer-readable storage medium provided in the embodiment of the present invention may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination thereof.

[0130] The computer-readable storage medium may be included in the communication device; or may exist independently without being installed in the communication device.

[0131] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the communication device, the communication device: obtains link state notification information of all first links between the first routing node and the second routing node, and the link notification information of the first link includes the risk sharing link group SRLG information of the first link; determines the second link from all the first links according to the SRLG information of the first link, and the second link is the link with the same SRLG information as the first routing node among all the first links; performs a preset increase adjustment on the actual link cost of all the second links to obtain the first target link cost corresponding to all the first links; and determines the rerouting recovery path between the first routing node and the second routing node according to the first target link cost corresponding to all the first links. Alternatively, link state announcement information of all first links between the first routing node and the second routing node is obtained, the link announcement information of the first link including risk sharing link group SRLG information of the first link; a second link is determined from all the first links according to the SRLG information of the first link, the second link being a link with the same SRLG information as the first routing node among all the first links; the second link is eliminated from all the first links to obtain candidate links in the first links except the second link; and a rerouting recovery path between the first routing node and the second routing node is determined according to actual link costs corresponding to all the candidate links.

[0132] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0133] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0134] The modules involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0135] The computer-readable storage medium provided by the present invention stores computer-readable program instructions for executing the above-mentioned path determination method, which can solve the technical problem of how to avoid the risk of the backup path and the working path sharing the optical layer link as much as possible when facing a remote SRLG link failure, so as to improve the reliability of data transmission. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the embodiment of the present invention are the same as the beneficial effects of the path determination method provided by the above-mentioned embodiment 1 or embodiment 2, and will not be repeated here.

[0136] Embodiment 5

[0137] An embodiment of the present invention further provides a computer program product, including a computer program, and when the computer program is executed by a processor, the steps of the path determination method as described above are implemented.

[0138] The computer program product provided by the present application can solve the technical problem of how to avoid the risk of sharing the optical layer link between the backup path and the working path when facing a remote SRLG link failure, so as to improve the reliability of data transmission. Compared with the prior art, the beneficial effects of the computer program product provided by the embodiment of the present invention are the same as the beneficial effects of the path determination method provided by the above-mentioned embodiment 1 or embodiment 2, and will not be repeated here.

[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 processing scope of the present application.

Claims

1. A path determination method, comprising: Acquire link state notification information of all first links between the first routing node and the second routing node, where the link notification information of the first links includes risk sharing link group SRLG information of the first links; Determine, according to the SRLG information of the first link, a second link from all the first links, where the second link is a link having the same SRLG information as the first routing node among all the first links; Performing a preset increase adjustment on the actual link costs of all the second links to obtain first target link costs corresponding to all the first links; A rerouting recovery path between the first routing node and the second routing node is determined according to the first target link costs corresponding to all the first links.

2. The path determination method according to claim 1, characterized in that: The step of performing a preset increase adjustment on the actual link costs of all the second links to obtain the first target link costs corresponding to all the first links includes: Performing a preset increase adjustment on the actual link costs of all the second links to obtain second target link costs corresponding to all the second links after the preset increase adjustment is performed; The first target link costs corresponding to all the first links are obtained according to the second target link costs of all the second links and the actual link costs of other links among the first links except the second link.

3. The path determination method according to claim 1, characterized in that: The step of performing a preset increase adjustment on the actual link costs of all the second links comprises: The actual link costs of all the second links are increased by a preset link cost penalty value respectively.

4. The path determination method according to claim 1, characterized in that: The step of determining the rerouting recovery path between the first routing node and the second routing node according to the first target link costs corresponding to all the first links includes: Determine, according to the first target link costs of all the first links, a total link cost of each reachable path from the first routing node to the second routing node, wherein the total link cost is the sum of the first target link costs corresponding to all the first links constituting the reachable path; The reachable path with the minimum total link cost is determined as the rerouting recovery path between the first routing node and the second routing node.

5. The path determination method according to claim 1, characterized in that: Before acquiring the link state notification information of all first links between the first routing node and the second routing node, the method further includes: Enable the remote fault fast reroute function.

6. The path determination method according to claim 1, characterized in that: The step of determining the second link from all the first links according to the SRLG information of the first link comprises: According to the SRLG information of the first link, matching a link having the same SRLG information as the first routing node from all the first links; The matched first link is determined as the second link.

7. The path determination method according to any one of claims 1 to 6, characterized in that: The link advertisement information of the first link also includes an actual link cost of the first link.

8. A path determination method, comprising: Acquire link state notification information of all first links between the first routing node and the second routing node, where the link notification information of the first links includes risk sharing link group SRLG information of the first links; Determine, according to the SRLG information of the first link, a second link from all the first links, where the second link is a link having the same SRLG information as the first routing node among all the first links; Eliminate the second link from all the first links to obtain candidate links other than the second link in the first links; A rerouting recovery path between the first routing node and the second routing node is determined according to actual link costs corresponding to all the candidate links.

9. A communication device, characterized in that: The communication device includes a processor and a memory, wherein the memory stores a program or instruction that can be run on the processor, and when the program or instruction is executed by the processor, the path determination method according to any one of claims 1 to 8 is implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program or an instruction, and when the program or the instruction is executed by a processor, the path determination method according to any one of claims 1 to 8 is implemented.

Images