CN114268579B - Method, device and computer storage medium for fast rerouting tunnel - Google Patents
Method, device and computer storage medium for fast rerouting tunnel Download PDFInfo
- Publication number
- CN114268579B CN114268579B CN202111585939.5A CN202111585939A CN114268579B CN 114268579 B CN114268579 B CN 114268579B CN 202111585939 A CN202111585939 A CN 202111585939A CN 114268579 B CN114268579 B CN 114268579B
- Authority
- CN
- China
- Prior art keywords
- tunnels
- lsp
- rerouting
- path
- tunnel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to a method, a device and a computer storage medium for fast rerouting a tunnel, wherein the method comprises the following steps: recording and caching mapping relations between tunnels and links passed by the tunnels, wherein the mapping relations are used for acquiring all the links passed by the tunnels through the tunnels and acquiring all the tunnels passed by the links through the links; after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache; grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels; and generating a rerouting LSP according to the routing result and the fault LSP. The efficiency of network management rerouting can be improved, and the network interruption time can be shortened.
Description
Technical Field
The present invention relates to the field of communications transmission networks, and in particular, to a method, an apparatus, and a computer storage medium for fast rerouting a tunnel.
Background
With the gradual expansion of the dependence of services on communication networks, the high availability and self-healing capability of the networks increasingly become key targets for constructing the networks. At present, according to different business configuration requirements, a static tunnel and a dynamic tunnel can be configured on a network manager. When network links and device nodes fail, if configured as a dynamic tunnel, the failure can be automatically detected, routes can be recalculated, routes can be converged again, and network traffic can be restored. If the static tunnel is configured, the routing and forwarding label is designated by the network manager, and if the network change cannot be sensed, the self-healing capability is not provided.
A network management system rerouting is a method for static tunnel fault recovery, when LSP (label switching path, which includes source, destination node and whole path formed by passed nodes) is interrupted, the first node calculates an optimum path for service recovery, then establishes a new LSP through signaling, and transmits service by the new LSP. For the unreflected service, after a new LSP is established, deleting the original LSP; for the recoverable service, the original LSP cannot be deleted after rerouting, and if the original LSP link fault is cleared, the service is automatically migrated back to the original LSP and the LSP obtained by rerouting is deleted.
Therefore, after a network failure, the recovery of the static tunnel and the service depends on the rerouting performance, and how to improve the efficiency of network management rerouting and shorten the network interruption time is a problem to be further solved.
Disclosure of Invention
The embodiment of the invention provides a method and a device for rapidly rerouting a tunnel and a computer storage medium, which are used for improving the efficiency of network management rerouting and shortening the network interruption time.
In a first aspect, an embodiment of the present invention provides a method for performing fast rerouting on a tunnel, where the method includes:
recording and caching mapping relations between tunnels and links passed by the tunnels, wherein the mapping relations are used for acquiring all the links passed by the tunnels through the tunnels and acquiring all the tunnels passed by the links through the links;
after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache;
grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
and generating a rerouting LSP according to the routing result and the fault LSP.
In some embodiments, further comprising the step of:
and after the link alarm occurs, modifying the on-off state of the alarm link so as to avoid the alarm link during route searching.
In some embodiments, performing a way finding on the grouped tunnel includes:
the tunnels in the same group share one path searching, and paths are searched concurrently among different groups.
In some embodiments, the routing comprises the steps of:
respectively performing exhaustive search at a starting point and an end point until a common intermediate node is searched;
and splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
In some embodiments, performing an exhaustive search at the starting point and the ending point, respectively, until a common intermediate node is searched, comprises the steps of:
searching available links corresponding to the starting point and the end point and adjacent to the starting point and the end point by different threads and generating corresponding alternative paths;
and if the alternative path corresponding to the starting point and the alternative path corresponding to the end point have cross nodes, taking the cross nodes as common intermediate nodes, otherwise, continuously searching for the next segment of adjacent available links by using the tail nodes of the corresponding alternative paths and updating the corresponding alternative paths by using each thread until the cross nodes are taken as the common intermediate nodes when the alternative paths of the starting point and the alternative paths of the end point have the cross nodes.
In some embodiments, generating a rerouted LSP from the routing result and the failed LSP includes the steps of:
acquiring a copy LSP by copying the fault LSP;
updating the routing data in the copy LSP according to the routing result, and taking the copy LSP after updating the routing data as the rerouting LSP;
the routing data comprises MPLS label switching data.
In a second aspect, an embodiment of the present invention further provides an apparatus for fast rerouting a tunnel, where the apparatus includes:
the data caching module is used for recording and caching mapping relations between the tunnels and the links passed by the tunnels, wherein the mapping relations are used for acquiring all the links passed by the tunnels through the tunnels and acquiring all the tunnels passed by the links through the links;
a tunnel way finding module for:
after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache;
grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
and the rerouting generation module is used for generating a rerouting LSP according to the routing result and the fault LSP.
In some embodiments, the tunnel routing module is further configured to:
after the link alarm occurs, the on-off state of the alarm link is modified so as to avoid the alarm link during route searching;
when the grouped tunnels are searched, the tunnels in the same group share one path searching, and the paths are searched concurrently among different groups.
In some embodiments, the tunnel routing module is further configured to:
respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched;
and splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
In some embodiments, the rerouting module is further configured to:
acquiring a copy LSP by copying the fault LSP;
updating the routing data in the copy LSP according to the routing result, and taking the copy LSP after updating the routing data as the rerouting LSP;
the routing data comprises MPLS label switching data.
In a third aspect, an embodiment of the present invention further provides a computer storage medium, where at least one instruction is stored, and the instruction is loaded and executed by a processor to implement the method according to any one of claims 1 to 6.
The technical scheme provided by the invention has the beneficial effects that: the embodiment of the invention further caches the mapping relation between the links and the tunnels, so that all the links passing along the tunnels are directly obtained in the rerouting process, all the tunnels passing through the links are obtained according to the links, the tunnels needing rerouting or switching after rerouting is possible are quickly positioned, other alarms such as tunnel switching and the like derived from link alarms are not relied on, the types and the number of the alarms needing to be processed in the rerouting process can be further reduced, and the processing speed is improved. Meanwhile, the tunnels needing rerouting are grouped in advance, and the grouped tunnels are subjected to path finding, so that path finding is facilitated according to grouping conditions, and the path finding efficiency can be further improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flowchart of a method for fast rerouting a tunnel according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a communication transmission network according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a device for performing fast rerouting on a tunnel according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
As shown in fig. 1, an embodiment of the present invention provides a method for performing fast rerouting on a tunnel, which is characterized by including the steps of:
s100, recording and caching the mapping relation between the tunnel and the link passed by the tunnel, wherein the mapping relation is used for acquiring all the links passed by the tunnel through the tunnel and acquiring all the tunnels passed by the link through the link;
s200, after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSPs in the tunnels according to the mapping relation recorded in the cache;
s300, grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
s400, generating a rerouting LSP according to the routing result and the fault LSP.
It should be noted that, in step S100, the corresponding link includes a physical link and a FlexE virtual link; the link alarm comprises a link LoS alarm (a link signal loss alarm), and because the network management system receives various alarm messages reported by the equipment, the network management system sorts and processes the alarm messages uniformly by the alarm modules and distributes the messages to modules needing alarm messages, such as affected circuits, alarm level calculation, interface module display and the like, the alarm messages processed by the alarm modules have more types and large calculation data amount, and certain delay can be caused in the modules. Meanwhile, because the sources (such as single disks of links and node rows, etc. which generate alarms) and types of alarms are many, the types and the number of alarms which need to be processed in the rerouting process can be increased when other alarms such as tunnel on-off and the like derived from the link alarms are relied on, thereby reducing the rerouting efficiency. The relevant re-routing alarms (such as link signal loss alarms) can be received by setting a special channel, so that the re-routing process can independently subscribe the link signal loss alarms relevant to re-routing without multiplexing a network management alarm module.
The embodiment of the invention further caches the mapping relation between the links and the tunnels, so that all the links passing along the tunnels are directly obtained in the rerouting process, all the tunnels passing through the links are obtained according to the links, the tunnels needing rerouting or switching after rerouting is possible are quickly positioned, other alarms such as tunnel switching and the like derived from link alarms are not relied on, the types and the number of the alarms needing to be processed in the rerouting process can be further reduced, and the processing speed is improved. Meanwhile, the tunnels needing rerouting are grouped in advance, and the grouped tunnels are routed, so that routing can be conveniently carried out according to grouping conditions, and the routing efficiency can be further improved.
In some embodiments, S200 includes modifying the on-off state of the alert link to avoid the alert link when seeking a route. In S300, when performing path finding on the grouped tunnels, the tunnels in the same group share one path finding, and path finding is performed concurrently between different groups.
When the rerouting tunnel is used for routing, the tunnel with the same starting point and the end point of routing shares one-time routing, so that the routing result can be multiplexed, and the routing times are greatly reduced.
In some embodiments, the path finding in S300 includes the steps of:
s310, respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched;
and S320, splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
It should be noted that, the exhaustive search in the way finding may use Dijkstra algorithm, and traverse the search from the starting point until the end point is found.
In the embodiment, in a single path searching, a conventional method for exhaustively searching from a starting point to an end point is changed into a method for splicing paths at a common intermediate node after the starting point and the end point are exhaustively searched at the same time, so that parallel searching can be performed, the depth of exhaustively searching iteration can be reduced, and the path searching speed can be further increased.
Preferably, S310 includes:
s311, searching the available links corresponding to the starting point and the end point and adjacent to each other by different threads and generating corresponding alternative paths;
s312, if the alternative path corresponding to the starting point and the alternative path corresponding to the end point have cross nodes, the cross nodes are taken as common intermediate nodes, otherwise, each thread continues to search for the next segment of adjacent available links and update the corresponding alternative paths by the end nodes of the corresponding alternative paths until the cross nodes are taken as the common intermediate nodes when the alternative paths of the starting point and the alternative paths of the end point have the cross nodes.
The embodiment further describes a specific search mode included in exhaustive search, when a rerouting is performed for one time, two threads are opened, exhaustive search is performed at both the starting point and the end point, when both the two threads search for a certain intermediate node, the rerouting is considered to be successful, search results of the two threads are spliced, namely, a path from the starting point to the intermediate node and a path from the intermediate node to the end point are spliced to serve as a rerouting result, and because parallel search and search iteration depth are reduced, performance can be further improved on the basis of a Dijkstra rerouting algorithm.
In some embodiments, S400 comprises the steps of:
s410, acquiring a copy LSP by copying the fault LSP;
s420, updating the routing data in the copied LSP according to the routing searching result, and taking the copied LSP after updating the routing data as the rerouting LSP;
it should be noted that, when generating an LSP in a network management system, different data of the LSP needs to be set by sequentially calling various interfaces, such as a service name, a protection attribute, a failure detection attribute, qoS, a label stack, and the like.
It is understood that the present embodiment splits the data of the LSP into two types, one is LSP regular data, such as tunnel name, protection attribute, failure detection attribute, qoS, etc., and the other is routing data (which is used to decide the path of the tunneling information), including MPLS label switching data. In order to quickly generate the rerouting LSP, when the rerouting data is generated, firstly, the failed LSP is copied, a copy LSP is quickly cloned through a high-speed memory copy mode to inherit the conventional data of the original failed LSP, and then the routing data in the copy LSP is updated in batch according to a routing result.
In this embodiment, by using the method of updating the routing data in batch after acquiring the conventional data by using the copy failure LSP, for the case that the rerouting of the multiple tunnels in the same group is consistent, only the routing data needs to be replaced in batch, and the generation of the rerouting LSP can be further accelerated.
In a specific embodiment, as shown in fig. 2, the communication transport network is composed of five nodes NE1 to NE5 and links between the nodes. The communication transport network configures two tunnels a and b with the same path from NE1 to NE3, the working LSP is LSP1 and LSP2 respectively, the passing route is NE1-L15-NE5-L53-NE3, the protection LSP is LSP3 and LSP4 respectively, and the passing route is NE1-L14-NE4-L43-NE3; a tunnel c is configured from NE1 to NE4, and the route traversed by working LSP5 is NE1-L14-NE4.
When the network management configures the tunnel supporting fast rerouting, the bidirectional mapping relationship between the tunnel and the link is recorded and cached, and the bidirectional mapping relationship is used for obtaining all link IDs passed by the tunnel through the tunnel ID, or otherwise, all tunnel IDs passed by the link are obtained through the link ID. In this embodiment, the mapping relationship recorded in the tunnel a is as follows: LSP1: l15, L53; LSP3: l14, L43; the mapping relation recorded in the tunnel b is as follows: LSP2: l15, L53; LSP4: l14, L43; the mapping relation recorded in the tunnel c is as follows: LSP5: l14; the mapping relation recorded on the link is as follows: l15: LSP1, LSP2; l53: LSP1, LSP2; l14: LSP3, LSP4, LSP5; l43: LSP3, LSP4.
When the network management system receives a batch of alarm reports, the network management system takes the alarm related links, modifies the on-off state of the network links, sets the links generated by the alarms into an interruption state for avoiding the fault links when rerouting and routing, and quickly positions the part of tunnels influenced by the link alarms in a plurality of tunnels according to the cached mapping relation. In this embodiment, after receiving the LoS alarm of the L14, the network management system firstly sets the state of the L14 as an interrupt, and secondly locates that the tunnel a (LSP 3), the tunnel b (LSP 4), and the tunnel c (LSP 5) are affected by the mapping relationship of the cache, and needs to reroute.
In order to solve the problem of slow rerouting and routing speed, firstly, all tunnels needing rerouting are grouped according to whether a source/sink network element (namely a starting point and an end point of routing) is the same, the tunnels with the same starting point and the same key point are divided into the same group, and all the tunnels in the same group share the result of once rerouting and routing, so that each tunnel does not need to be routed independently; different packets can adopt concurrent routing between different packets to improve the performance due to different starting points and end points.
In this embodiment, when rerouting and routing are performed once, two threads are started, exhaustive search is performed at both the start point and the end point, and when both the two threads search for a certain intermediate node, the routing is considered to be successful, and the search results of the two threads are spliced (that is, a path from the start point to the intermediate node and a path from the intermediate node to the end point are spliced together to serve as a routing result). In this embodiment, the starting point and the end point of the tunnel a and the tunnel b are both the node NE1 and the node NE3, the tunnel a and the tunnel b are classified into the rerouting group 1, and the routing results from the NE1 to the NE3 are shared; tunnel c serves as reroute group 2. In the routing service of the network management system, a process 1 and a process 2 run concurrently, the process 1 performs routing from the NE1 to the NE3, and the process 2 performs routing from the NE1 to the NE4.
When process 1, which seeks from NE1 to NE3 from reroute group 1, is executed, thread 1 and thread 2 execute concurrently:
the thread 1 takes all adjacent links of the NE1 as L14, L15 and L12, wherein the L14 is interrupted and not adopted, and alternative paths NE1-L12-NE2 and NE1-L15-NE5 are generated;
the thread 2 takes all adjacent links of the NE3 as L43, L53 and L23, and generates alternative paths NE3-L43-NE4, NE3-L53-NE5 and NE3-L23-NE2;
after the threads 1 and 2 are executed, cross nodes NE2 and NE5 in alternative paths are calculated;
the routing result 1 obtained according to the intersection NE2 is NE1-L12-NE2-L23-NE3, the same as the protection LSP3, LSP4 route of tunnel a, b in the rerouting group 1, in order to make the route of the working rerouting LSP and protection LSP not completely identical, so abandon this result; and continuously calculating the result 2 of the cross point NE5 to be NE1-L15-NE5-L53-NE3, and taking the result 2 as a path searching result.
When executing process 2, which seeks from the reroute group 2 from NE1 to NE4, thread 3 and thread 4 execute concurrently:
the thread 3 takes all adjacent links of the NE1 as L14, L15 and L12, wherein the L14 is interrupted and not adopted, and generates alternative paths NE1-L12-NE2 and NE1-L15-NE5;
taking all adjacent links of the NE4 as L43 by the thread 4, and generating an alternative path NE4-L43-NE3;
after the threads 3 and 4 are executed, no cross node exists in the alternative path;
then, the thread 3 takes all adjacent links of the end node NE2 of the alternative path NE1-L12-NE2 as L23, and updates the alternative path NE1-L12-NE2-L23-NE3; taking all adjacent links of the end node NE5 of the alternative path NE1-L15-NE5 as L53, and updating the alternative path as NE1-L15-NE5-L53-NE3;
meanwhile, the thread 4 takes all adjacent links of the end node NE3 of the alternative path NE4-L43-NE3 as L23 and L53, and updates the alternative paths as NE4-L43-NE3-L23-NE2 and NE4-L43-NE3-L53-NE5;
after the threads 3 and 4 are executed, cross nodes NE2& NE3 and NE5& NE3 are calculated in the alternative paths, and path finding results NE1-L12-NE2-L23-NE3-L43-NE4 are obtained according to the cross nodes NE2& NE 3.
Finally, when the network management rerouting LSP data is generated according to the routing result, firstly, whether the routing process grouping is a group or not is confirmed, if yes, the routing of the rerouting LSP of a plurality of tunnels in the same group is indicated to be consistent, and the characteristics can be used for batch generation when the rerouting LSP data is generated; and if a plurality of different groups exist at the same time, the multithread parallel processing is started according to the idea of concurrent batch processing among circuit groups of different routes.
When multiple tunnels in the same group are rerouted consistently, in order to generate the reroute LSP quickly, the reroute LSP may be generated in batch when rerouting data is generated, specifically:
the data of the LSP is divided into two types, wherein one type is LSP conventional data such as name, qoS and the like; the other is routing data, and determines the path of the tunnel transmission information, mainly MPLS label switching data. Firstly, according to an original fault LSP, a rerouting LSP is quickly cloned through a memory copy mode with a higher speed for inheriting conventional data of the original LSP, and then routing data which are updated in batches in the rerouting LSP are generated in batches, so that the rerouting LSP is generated.
In the specific implementation of this embodiment, firstly, LSP3, LSP4, and LSP5 that need to be rerouted are copied and generated as reroute LSP6, LSP7, and LSP8, then thread 5 and thread 6 run concurrently in process 3 that generates the reroute LSP service, thread 5 updates relevant routing data of reroute group 1 route finding result NE1-L12-NE2-L23-NE3-L43-NE4 for LSP6 and LSP7, and thread 6 updates relevant routing data of reroute group 2 route finding result NE1-L12-NE2-L23-NE3-L43-NE4 for LSP 8.
And downloading the reroute LSP6, LSP7 and LSP8 generated by the network management system to the equipment, and directly updating the related data of LSP3, LSP4 and LSP5 on the equipment into LSP6, LSP7 and LSP8 when downloading the reroute LSP data to the equipment in batches, so as to accelerate the data processing and returning of the equipment.
As shown in fig. 3, an embodiment of the present invention further provides a device for fast rerouting a tunnel, where the device includes:
the data caching module is used for recording and caching the mapping relation between the tunnel and the link passed by the tunnel in the network management system, wherein the mapping relation is used for acquiring all the links passed by the tunnel through the tunnel and acquiring all the tunnels passed by the link through the link;
a tunnel way finding module for:
after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache;
grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
and the rerouting generation module is used for generating a rerouting LSP according to the routing result and the fault LSP.
In some embodiments, the tunnel routing module is further configured to:
after the link alarm occurs, the on-off state of the alarm link is modified so as to avoid the alarm link during route searching;
when the grouped tunnels are searched, the tunnels in the same group share one path searching, and the paths are searched concurrently among different groups.
In some embodiments, the tunnel routing module is further configured to:
respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched;
and splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
Furthermore, when the tunnel path searching module searches for paths, available links corresponding to the starting point and the end point and adjacent to the available links are searched for different threads, and corresponding alternative paths are generated; and if the alternative path corresponding to the starting point and the alternative path corresponding to the end point have cross nodes, taking the cross nodes as common intermediate nodes, otherwise, the thread continues to search for the next segment of adjacent available links and update the corresponding alternative paths by using the end nodes corresponding to the alternative paths until the cross nodes are taken as the common intermediate nodes when the alternative paths of the starting point and the alternative paths of the end point have the cross nodes.
In some embodiments, the rerouting module is further configured to:
acquiring a copy LSP by copying the fault LSP;
updating the routing data in the copy LSP according to the routing result, and taking the copy LSP after updating the routing data as the rerouting LSP;
the routing data comprises MPLS label switching data.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, functional blocks in the devices disclosed above may be implemented as software, firmware, hardware, or suitable combinations thereof. In a hardware implementation, the division between functional modules referred to in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable storage media, which may include computer readable storage media (or non-transitory media) and communication media (or transitory media).
Embodiments of the present invention further provide a computer storage medium, which can be used in a network management system, and when instructions stored in the computer storage medium are loaded and executed by a processor, the computer storage medium is used to implement the rerouting method and effect according to any of the foregoing method embodiments.
The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer.
In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
The above embodiments are only specific embodiments of the present invention, but the scope of the embodiments of the present invention is not limited thereto, and any person skilled in the art can easily think of various equivalent modifications or substitutions within the technical scope of the embodiments of the present invention, and these modifications or substitutions should be covered by the scope of the embodiments of the present invention.
Claims (9)
1. A method for fast rerouting a tunnel, comprising the steps of:
recording and caching mapping relations between tunnels and links passed by the tunnels, wherein the mapping relations are used for acquiring all the links passed by the tunnels through the tunnels and acquiring all the tunnels passed by the links through the links;
after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache;
grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
generating a rerouting LSP according to the routing result and the fault LSP;
the path finding comprises the following steps:
respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched;
and splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
2. A method for fast rerouting a tunnel according to claim 1, further comprising the steps of:
and after the link alarm occurs, modifying the on-off state of the alarm link so as to avoid the alarm link during route searching.
3. A method for fast reroute of a tunnel according to claim 1,
the path searching is carried out on the grouped tunnel, and the method comprises the following steps:
the tunnels in the same group share one path searching, and paths are searched concurrently among different groups.
4. A method for fast reroute of a tunnel according to claim 1,
respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched, and the method comprises the following steps:
searching available links corresponding to the starting point and the end point and adjacent to the starting point and the end point by different threads and generating corresponding alternative paths;
and if the alternative path corresponding to the starting point and the alternative path corresponding to the end point have cross nodes, taking the cross nodes as common intermediate nodes, otherwise, continuously searching for the next segment of adjacent available links by using the tail nodes of the corresponding alternative paths and updating the corresponding alternative paths by using each thread until the cross nodes are taken as the common intermediate nodes when the alternative paths of the starting point and the alternative paths of the end point have the cross nodes.
5. The method according to claim 1, wherein the step of generating the rerouting LSP according to the routing result and the failed LSP comprises the steps of:
acquiring a copy LSP by copying the fault LSP;
updating the routing data in the copy LSP according to the routing result, and taking the copy LSP after updating the routing data as the rerouting LSP;
the routing data comprises MPLS label switching data.
6. An apparatus for fast rerouting tunnels, comprising:
the data caching module is used for recording and caching mapping relations between tunnels and links passed by the tunnels, wherein the mapping relations are used for acquiring all the links passed by the tunnels through the tunnels and acquiring all the tunnels passed by the links through the links;
a tunnel way finding module for:
after the link alarm occurs, acquiring tunnels with mapping relation with the alarm link and fault LSP in the tunnels according to the mapping relation recorded in the cache;
grouping the tunnels which have the mapping relation with the alarm link so as to divide the tunnels with the same starting point and the same end point into a group, and searching the grouped tunnels;
the rerouting generation module is used for generating a rerouting LSP according to a routing result and the fault LSP;
the tunnel path finding module is further configured to:
respectively carrying out exhaustive search at a starting point and an end point until a common intermediate node is searched;
and splicing the path from the starting point to the intermediate node and the path from the end point to the intermediate node, and taking the path result obtained by splicing as the path searching result.
7. The apparatus for fast rerouting a tunnel according to claim 6, wherein the tunnel routing module is further configured to:
after the link alarm occurs, the on-off state of the alarm link is modified so as to avoid the alarm link during route searching;
when the grouped tunnels are subjected to path searching, the tunnels in the same group share one path searching, and the paths are searched concurrently among different groups.
8. The apparatus for fast rerouting a tunnel according to claim 6, wherein the rerouting generating module is further configured to:
acquiring a copy LSP by copying the fault LSP;
updating the routing data in the copy LSP according to the routing result, and taking the copy LSP after updating the routing data as the rerouting LSP;
the routing data comprises MPLS label switching data.
9. A computer storage medium having stored therein at least one instruction that is loaded and executed by a processor to implement the method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111585939.5A CN114268579B (en) | 2021-12-20 | 2021-12-20 | Method, device and computer storage medium for fast rerouting tunnel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111585939.5A CN114268579B (en) | 2021-12-20 | 2021-12-20 | Method, device and computer storage medium for fast rerouting tunnel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114268579A CN114268579A (en) | 2022-04-01 |
| CN114268579B true CN114268579B (en) | 2023-03-24 |
Family
ID=80829728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111585939.5A Active CN114268579B (en) | 2021-12-20 | 2021-12-20 | Method, device and computer storage medium for fast rerouting tunnel |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114268579B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158397A (en) * | 2011-02-17 | 2011-08-17 | 中兴通讯股份有限公司 | Re-route method and point local repair (PLR) node |
| US9246838B1 (en) * | 2011-05-27 | 2016-01-26 | Juniper Networks, Inc. | Label switched path setup using fast reroute bypass tunnel |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7230913B1 (en) * | 2002-06-11 | 2007-06-12 | Cisco Technology, Inc. | MPLS fast reroute without full mesh traffic engineering |
| US7343423B2 (en) * | 2003-10-07 | 2008-03-11 | Cisco Technology, Inc. | Enhanced switchover for MPLS fast reroute |
| CN107666437A (en) * | 2016-07-27 | 2018-02-06 | 中兴通讯股份有限公司 | A kind of static tunnel restoration method, apparatus and network node |
| CN112039764B (en) * | 2019-06-03 | 2022-12-09 | 中兴通讯股份有限公司 | A method and device for implementing rerouting |
-
2021
- 2021-12-20 CN CN202111585939.5A patent/CN114268579B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158397A (en) * | 2011-02-17 | 2011-08-17 | 中兴通讯股份有限公司 | Re-route method and point local repair (PLR) node |
| US9246838B1 (en) * | 2011-05-27 | 2016-01-26 | Juniper Networks, Inc. | Label switched path setup using fast reroute bypass tunnel |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114268579A (en) | 2022-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP4075755B1 (en) | Interior gateway protocol flood minimization | |
| US6765880B1 (en) | Method and apparatus for eliminating unprotectable paths from consideration during computation of a protectable shortest path tree | |
| US9602387B2 (en) | Network topology optimization | |
| US6928484B1 (en) | Method and apparatus for discovering edge-disjoint shortest path pairs during shortest path tree computation | |
| US7330440B1 (en) | Method and apparatus for constructing a transition route in a data communications network | |
| JP5596149B2 (en) | Method for improving service restoration speed and path calculation element in transmission network | |
| US20060250948A1 (en) | Dynamic path protection in an optical network | |
| EP3979574B1 (en) | Method and device for implementing rerouting | |
| JP4462442B2 (en) | Link attribute setting method, route calculation method, and system using them | |
| CN109361596B (en) | Route calculation method and device and electronic equipment | |
| CN108243102B (en) | Method for realizing fast rerouting and PE equipment | |
| US7835312B2 (en) | Method and apparatus for updating label-switched paths | |
| CN114268579B (en) | Method, device and computer storage medium for fast rerouting tunnel | |
| CN113453262B (en) | Bidirectional Forwarding Detection (BFD) method and device | |
| US7496644B2 (en) | Method and apparatus for managing a network component change | |
| CN111224870A (en) | Fault repairing method, equipment and storage medium in SR-MPLS Anycast scene | |
| WO2016101492A1 (en) | Setting method and device for service forwarding table | |
| CN117354155A (en) | Network management method and device, network element and computer readable medium | |
| US20200296032A1 (en) | Multi-layer lsp control method and apparatus | |
| US9143399B2 (en) | Minimizing the number of not-via addresses | |
| CN111107002B (en) | Method and device for acquiring routing information | |
| EP2896157B1 (en) | Method and apparatus for node realignment in a telecommunications network | |
| KR100596390B1 (en) | Bypass Setting Method for Dual Failure Recovery in Optical Transmission Network System | |
| CN109729006B (en) | Message processing method and device and computer readable storage medium | |
| Ho et al. | Dynamic protection in mobility over WDM optical networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |