阅读说明：本技术 一种路由备份方法、装置、服务器及可读存储介质 (A kind of route backup method, apparatus, server and readable storage medium storing program for executing ) 是由 晁军显 许赛群 张涛 严思韵 于 2019-07-10 设计创作，主要内容包括：本发明实施例涉及通信技术领域,公开了一种路由备份方法、装置、服务器及可读存储介质。本申请的部分实施例中,获取保护链路的第一链路信息库；第一链路信息库中包括除保护链路以外的其他链路的信息；根据第一链路信息库,确定保护链路对应的源节点至目标节点的备份路径；生成备份路径的路径信息；将备份路径的路径信息保存至转发表。该实现中,能够在存在备份路径的情况下,找到备份路径。(The present embodiments relate to field of communication technology, a kind of route backup method, apparatus, server and readable storage medium storing program for executing are disclosed.In the section Example of the application, the first link information library of protection link is obtained；It include the information of other links in addition to protecting link in first link information library；According to the first link information library, the backup path of the corresponding source node of protection link to destination node is determined；Generate the routing information of backup path；The routing information of backup path is saved to forwarding table.In the realization, backup path can be found there are backup path.)

1. a kind of route backup method characterized by comprising

Obtain the first link information library of protection link；It include that the protection link is removed in network in first link information library The information of other links in addition；

According to first link information library, the backup path of the corresponding source node of the protection link to destination node is determined；

Generate the routing information of the backup path；

The routing information of the backup path is saved to forwarding table.

2. route backup method according to claim 1, which is characterized in that it is described according to first link information library, Determine that the corresponding source node of the protection link to the backup path of destination node, specifically includes:

According to first link information library, the first shortest path for determining the source node to the destination node is calculated；

According to first shortest path, the backup path is determined.

3. route backup method according to claim 2, which is characterized in that it is described according to first shortest path, really The fixed backup path, specifically includes:

Obtain the second shortest path；Wherein, second shortest path are as follows: described in being calculated based on the second link information library Source node includes the information of all links in second link information library to the shortest path of the destination node；

First shortest path and second shortest path are compared, determine the backup path.

4. route backup method according to claim 3, which is characterized in that described by first shortest path and second Shortest path comparison, determines the backup path, specifically includes:

It is most short to described first along the destination node to the path direction of the source node according to second shortest path Node on path is filtered operation；Wherein, during the filter operation of i-th, judge on first shortest path Whether i-th of node on the node and second shortest path farthest apart from the source node from the destination node number For same node point；If it is not to stop filter operation that judging result, which is, if the determination result is YES, then it is most short to remove described first The farthest node of source node described in distance on path, the filtering for carrying out i+1 time to the node on first shortest path are grasped Make, until the farthest node of source node described in distance is the source node on first shortest path, or, described second is most short I-th of node on path from the destination node number is the source node；

Using the path obtained after filter operation as the backup path.

5. route backup method according to claim 1, which is characterized in that the path letter for generating the backup path Breath, specifically includes:

Based on Segment routing technology, the label stack of the backup path is determined, alternatively, the address the IPV6 sequence of the backup path Column.

6. route backup method according to any one of claim 1 to 5, which is characterized in that described to obtain the protection First link information library of link, specifically includes:

The information that the protection link is deleted from the second link information library, obtains first link information library；Wherein, described It include the information of all links in second link information library.

7. route backup method according to any one of claim 1 to 5, which is characterized in that also protected in the forwarding table There is the forward-path information of the source node to the destination node；

The routing information by the backup path is saved to forwarding table, the route backup method further include:

In response to the failure indication information of the protection link, the routing information of the backup path is replaced into the source node extremely The forward-path information of the destination node.

8. a kind of route backup device characterized by comprising obtain module, determining module, generation module and preserving module；

The first link information library for obtaining module and being used to obtain protection link；It include removing institute in first link information library State the information of other links other than protection link；

The determining module is used to determine the corresponding source node of the protection link to target according to first link information library The backup path of node；

The generation module is used to generate the routing information of the backup path；

The preserving module is for saving the routing information of the backup path to forwarding table.

9. a kind of server characterized by comprising at least one processor；And

The memory being connect at least one described processor communication；Wherein, be stored with can be by described at least one for the memory The instruction that a processor executes, described instruction is executed by least one described processor, so that at least one described processor energy Enough route backup methods executed as described in any one of claims 1 to 7.

10. a kind of computer readable storage medium, is stored with computer program, which is characterized in that the computer program is located Reason device realizes route backup method described in any one of claims 1 to 7 when executing.

Technical field

The present embodiments relate to field of communication technology, in particular to a kind of route backup method, apparatus, server and can Read storage medium.

Background technique

With the explosive growth of internet, the evolution of carrier network ALL IP, the core business of more and more industries Heavy dependence network is carried out.Information and communication technology (ICT) (Information and as network application cradle Communication Technology, ICT) industry needless to say, from network, almost tiny step is difficult now for security, financial industry Row, retail trade are even more to pass through network to have caused electric business revolution.Under internet spring tide, almost without which industry not by wave And set foot in network field into the selection for having to face.In this background, the high availability and self-healing ability of network, day Benefit becomes the common-denominator target of building network.It is lower to arrive large and medium-sized enterprise client up to operator, when constructing basic network, 59 (99.999%) network availability becomes inevitable choice, this was equivalent in 1 year, and network interruption caused by a variety of causes is total Meter is about 5.256 minutes.Equally, for network equipment vendor, perfect High Availabitity product and solution party can be provided Case is directly related to core competitiveness, and can be related to survive in the following keen competition.When network link or device node When breaking down, network flow can be interrupted before routing restrains again, with present most popular open shortest path Preferential (Open Shortest Path First, OSPF) agreement/classification link state routing protocols (ISIS) agreement of diameter is come Say, following five processes can be undergone: detect failure, generate more new information, be flooded to whole network, recalculate routing table with Forwarding table (Forwarding Info Base, FIB) is brushed under and.The rise of the real-times network service such as voice, video, to IP Network flow quickly switches that higher requirements are also raised, and new framework needs the finishing service within the time less than 50ms It switches.

However, it is found by the inventors that in the prior art the prior art has at least the following problems: in one network, there are in fact a certain The backup path of link is protected, but the backup path can not be calculated in existing route stand-by technology.Due to above-mentioned various Reason, balanced various aspects factor, in fact, most widely used route stand-by technology is IP FRR in existing net, other two standby Part route technology bring negative effect has been more than its bring advantage, is caused using less.

It should be noted that information is only used for reinforcing the reason to the background of the disclosure disclosed in above-mentioned background technology part Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.

Summary of the invention

Embodiment of the present invention is designed to provide a kind of route backup method, apparatus, server and readable storage medium Matter makes it possible to there are backup path, finds backup path and backs up, so that when protection link failure, it can To switch to backup path in time.

In order to solve the above technical problems, embodiments of the present invention provide a kind of route backup method, including following step It is rapid: to obtain the first link information library of protection link；It include its in network in addition to protecting link in first link information library The information of his link；According to the first link information library, the backup path of the corresponding source node of protection link to destination node is determined； Generate the routing information of backup path；The routing information of backup path is saved to forwarding table.

Embodiments of the present invention additionally provide a kind of route backup device, comprising: obtain module, determining module, generation Module and preserving module；Obtain the first link information library that module is used to obtain protection link；Include in first link information library The information of other links in addition to protecting link；Determining module is used to determine protection link pair according to the first link information library The source node answered to destination node backup path；Generation module is used to generate the routing information of backup path；Preserving module is used It saves in by the routing information of backup path to forwarding table.

Embodiments of the present invention additionally provide a kind of server, comprising: at least one processor；And at least one The memory of a processor communication connection；Wherein, memory is stored with the instruction that can be executed by least one processor, instructs quilt At least one processor executes, so that at least one processor is able to carry out the route backup side referred to such as above embodiment Method.

Embodiments of the present invention additionally provide a kind of computer readable storage medium, are stored with computer program, calculate The route backup method that above embodiment refers to is realized when machine program is executed by processor.

Embodiment of the present invention in terms of existing technologies, based on do not include protection link the first link information library, Backup path is calculated, makes it possible to that backup path is calculated, improves there are in the case where backup path in real network Obtain the probability of backup path.Server makes it possible to the information preservation of backup path to forwarding table in protection link failure When, backup path is switched in time, improves the stability of network.

In addition, the backup path of the corresponding source node of protection link to destination node is determined according to the first link information library, It specifically includes: according to the first link information library, calculating the first shortest path for determining source node to destination node；Most according to first Short path determines backup path.In the realization, mode of the server based on shortest path determines backup path, realizes backup The automatic calculating in path reduces the channel cost of backup path.

In addition, determining backup path according to the first shortest path, specifically include: obtaining the second shortest path；Wherein, Two shortest paths are as follows: shortest path of the source node being calculated based on the second link information library to destination node, the second link It include the information of all links in information bank；First shortest path and the second shortest path are compared, determine backup path.It should In realization,

In addition, the first shortest path and the second shortest path are compared, determines backup path, specifically include: according to second Shortest path is filtered operation to the node on the first shortest path along the path direction of destination node to source node；Its In, during the filter operation of i-th, judge node and the second shortest path farthest apart from source node on the first shortest path Whether i-th of node on diameter from destination node number is same node point；If it is not to stop filter operation that judging result, which is, If the determination result is YES, then node farthest apart from source node on the first shortest path is removed, to the section on the first shortest path Point carries out the filter operation of i+1 time, until node farthest apart from source node on the first shortest path is source node, or, the I-th of node on two shortest paths from destination node number is source node；Using the path obtained after filter operation as backup Path.In the realization, unnecessary adjacent sequence label in the second shortest path is rejected, the feelings of SR standard stack overflow are effectively prevent Condition.In addition to this, achieved the effect that be multiplexed shortest path forwarding.

In addition, generating the routing information of backup path, specifically include: based on Segment routing technology, determining backup path Label stack, alternatively, the IPV6 address sequence of backup path.In the realization, it is based on Segment routing technology, realizes specified backup road The purpose of diameter.

In addition, obtaining the first link information library of protection link, specifically include: deleting protection from the second link information library The information of link obtains the first link information library；It wherein, include the information of all links in the second link information library.

In addition, also saving the forward-path information of active node to destination node in forwarding table；By the path of backup path After information preservation to forwarding table, route backup method further include: in response to protecting the failure indication information of link, road will be backed up The routing information of diameter replaces the forward-path information of source node to destination node.In the realization, can when protecting link failure, Backup path is switched in time, improves the stability and reliability of network.

Detailed description of the invention

One or more embodiments are illustrated by the picture in corresponding attached drawing, these exemplary theorys The bright restriction not constituted to embodiment, the element in attached drawing with same reference numbers label are expressed as similar element, remove Non- to have special statement, composition does not limit the figure in attached drawing.

Fig. 1 is the flow chart of the route backup method of first embodiment of the invention；

Fig. 2 is the network topological diagram of the node composition of the router marked as 1~5 of first embodiment of the invention；

Fig. 3 is the schematic diagram of the second shortest path tree of first embodiment of the invention；

Fig. 4 is the network topological diagram after the rejecting protection link of first embodiment of the invention；

Fig. 5 is the schematic diagram of the first shortest path tree of first embodiment of the invention；

Fig. 6 is the label of the prefix section with node 5 of first embodiment of the invention and the adjacent segments of each link Label network topological diagram；

Fig. 7 is the IP FRR topology schematic diagram in first embodiment of the invention；

Fig. 8 is the IP FRR micro-loop topology schematic diagram in first embodiment of the invention；

Fig. 9 is the Remote LFA topology schematic diagram in first embodiment of the invention；

Figure 10 be in first embodiment of the invention there is no the network topology schematic diagrames of PQ node；

Figure 11 is the flow chart of the route backup method of second embodiment of the present invention；

Figure 12 is the structural schematic diagram of the route backup device of third embodiment of the present invention；

Figure 13 is the structural schematic diagram of the server of the 4th embodiment of the invention.

Specific embodiment

In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with attached drawing to the present invention Each embodiment be explained in detail.However, it will be understood by those skilled in the art that in each embodiment party of the present invention In formula, in order to make the reader understand this application better, many technical details are proposed.But even if without these technical details And various changes and modifications based on the following respective embodiments, the application technical solution claimed also may be implemented.

The first embodiment of the present invention is related to a kind of route backup methods, are applied to server.As shown in Figure 1, routing Backup method the following steps are included:

Step 101: obtaining the first link information library of protection link.

Specifically, including the information of other links in network in addition to protecting link in the first link information library.Clothes Device be engaged in backup path, confirmation protection link obtains protection link corresponding first link information library.

In one example, server determines that the process in the first link information library is as follows: server is from the second link information Protection link is deleted in library, obtains the first link information library.It wherein, include the letter of all links in the second link information library Breath.

In one example, the second link information library is true according to the link state database of each router in network It is fixed, it include all effective Link State Advertisement (Link-State in the link state database of router Advertisement, LSA).

Step 102: according to the first link information library, determining the corresponding source node of protection link to the backup road of destination node Diameter.

Specifically, in known network when the information of other links, server can be according to the information of other links Source node and destination node plan backup path.

In one example, the process of servers' layout backup path are as follows: according to the first link information library, calculate the source of determination First shortest path of node to destination node determines backup path and according to the first shortest path.

It is noted that mode of the server based on shortest path, determines backup path, backup path oneself is realized It is dynamic to calculate, reduce the channel cost of backup path.

In one example, server determines the process of the first shortest path are as follows: server determines source node and target section Point, using shortest-path first algorithm, calculates the first shortest path of source node and destination node using source node as root node.

It is noted that since the router of the link-state routing protocols such as all operation OSPF/ISIS of existing net props up Shortest-path first algorithm is held, the universality of method is improved.

Below to the first shortest path is based on, the mode for obtaining backup path is illustrated.

Mode 1: server is by the first shortest path, as backup path.

Mode 2: server obtains the second shortest path；First shortest path and the second shortest path are compared, determined standby Part path.Wherein, the second shortest path are as follows: the source node being calculated based on the second link information library to destination node it is most short Path includes the information of all links in the second link information library.

Specifically, server is according to the second shortest path, along the path direction of destination node to source node, most to first Node on short path is filtered operation, using the path obtained after filter operation as backup path.Wherein, in i-th During filter operation, judge on node and the second shortest path farthest apart from source node on the first shortest path from target section Whether i-th of the node counted is same node point；If it is not to stop filter operation that judging result, which is, if judging result is It is then to remove node farthest apart from source node on the first shortest path, i+1 time is carried out to the node on the first shortest path Filter operation, until the node farthest apart from source node is source node on the first shortest path, or, on the second shortest path from I-th of node that destination node number rises is source node.

Below in conjunction with actual scene, illustrate that pass-through mode 2 obtains the detailed process of backup path.

It is assumed that marked as the node of 1~5 router composition network topological diagram as shown in Fig. 2, each chain road number For the channel cost of each link, source node is the router place node (node 1) marked as 1, and destination node is marked as 5 Router where node (node 5), protection link is between node 1 and node 2 (node where the router marked as 2) Link.Routing Protocol of the server based on link state carries out SPF calculating, and the second shortest path tree (SPF-T2) of generation is such as Shown in Fig. 3.From the figure 3, it may be seen that second shortest path of the node 1 to node 5 are as follows: 1 → 2 → 5, the channel cost of link is 2+3= 5.For protection link, reject protection link after network topological diagram as shown in figure 4, in link state database deletion of node The information of link between 1 and node 2, carries out SPF calculating, and the first shortest path tree (SPF-T1) of generation is as shown in Figure 5.By Fig. 5 it is found that node 1 to node 5 the first shortest path are as follows: 1 → 3 → 4 → 2 → 5, the channel cost of link is 1+3+1+3= 8.From destination node to from left to right, the node on the first shortest path and the second shortest path is successively compared, by the first shortest path Diameter neutralizes the identical node of the second shortest path and all rejects, until encountering different nodes.Compare first shortest path 1- > 3- > 4- > 2- > 5 and second shortest path 1- > 2- > 5, the first shortest path is since node 5, successively to the left, compares the second shortest path Diameter, after rejecting same node point, generates path 1- > 3- > 4, regard path 1- > 3- > 4 as backup path.

It is noted that rejecting unnecessary adjacent sequence label in the second shortest path, it effectively prevent SR normal stack The case where spilling.In addition to this, achieved the effect that be multiplexed shortest path forwarding.

In one example, server will protect link weight after determining backup path of the source node to destination node It is newly added in the first link information library, obtains the second link information library.

It is noted that protection link is added to the first link information library again, avoid after deleting protection link pair Continuous basis routing function impacts, and ensure that the consistency of link state.

Step 103: generating the routing information of backup path.

Specifically, server generates backup path using Segment routing technology etc. based on the backup path being calculated Routing information.

In one example, server is based on Segment routing technology, determines the label stack of backup path, alternatively, backup road The IPV6 address sequence of diameter.The label stack of backup path is according to the link between the label and each node of the node on backup path Label determine that the IPV6 address sequence of backup path is determined according to the address IPV6 of the node on backup path.

For example, server is based on Segment routing technology, the adjacent segments label between the adjacent node of backup path is determined, with And the label of destination node, and the label of the adjacent segments label and destination node between the adjacent node based on backup path, Generate the label stack of backup path.

Below to the Segment routing technology based on label, and the label based on Segment routing technology generation backup path The process of stack is illustrated.

Segmented paths technology, also known as section route technology (Segment Routing, SR), provide a kind of software definition road By the method for forward-path.Wherein, section can be understood as label, and SR is realized to turning by defining a series of segments, i.e. sequence label Send out the definition in path.The prefix section of Segment Routing, adjacent segments and mixing section working principle are explained respectively below It states.

1, prefix section

Generally, prefix section can be understood as traditional routing prefix and be mapped directly into a digital label, and the mapping is logical It crosses Interior Gateway Protocol (Interior Gateway Protocol, IGP), IGP routing is done directly, and does not need label distribution Agreement (Label Distribution Protocol, LDP) interacts again.The instruction meaning of IGP prefix section is along the prefix IGP shortest path forwarding, support equal cost multipath (Equal-Cost Multipath Routing, ECMP).IGP prefix Section is global section, and label is noticed as index, divided by ISIS/OSPF by label=1600+ node index of prefix section Hair.

For example, network topological diagram as shown in Fig. 2, when be not present equative route when, by taking node 5 as an example, it is assumed that the IP of node 5 For 1.1.1.5/32, it is mapped as label 16005, after IGP routing publication, each node reaches the path of the destination address such as Under: when multiprotocol label switching (Multi-Protocol Label Switching, MPLS) forwards, label is 16005, in Between each node automatically select next-hop carry out label forwarding, until reach node 5, pop up label, complete forwarding.It is of equal value when existing When path, can based on the technologies such as load balancing, therefrom select wherein a paths be forwarded.By taking node 4 as an example, it is assumed that section The IP of point 4 is 1.1.1.4/32, and path: 1 → 2 → 4 and path: 1 → 3 → 4 be equative route, if path: 1 → 2 → 4 loads are big In path: 1 → 3 → 4, then select path: 1 → 3 → 4 are forwarded.

The forward-path and IGP routing forwarding Actual path of prefix section are different without what, only use label MPLS Forwarding, without using IP routing forwarding.

2, adjacent segments

Adjacent segments, it can be understood as a local segment of some link, for realizing under special scenes, user wants to allow Flow passes through the demand of certain section of particular link.Why it is referred to as adjacent segments, derives from its physical meaning, for chain between two nodes Road is specified.For example, network topological diagram is as shown in Fig. 2, can be adjacent segments label by the link definition between node 2 and 4 24024, the link definition adjacent segments label 24024 and 24025 between node 2 and 5.

Inventors have found that individual prefix section or adjacent segments, using than relatively limited, function is relatively simple.Therefore, inventor Prefix section and adjacent segments are combined, form section sequence, in other words sequence label, label stack, and MPLS label forwarding is natural Support label stack.For example, the flow that definition reaches node 5 needs to first pass through node 4, and by the chain between node 4 and 5 Road, then can be formed sequence label { 16004,24045,16005 } (note: the prefix section that node 5 is issued may more than 16005, herein It is illustrated with 16005).Node 1 when sending data, is forwarded, 16004 are according to the stack top label 16004 of label stack There are ECMP for node section label, carry out load balancing and are forwarded to node 4, the label issued due to 16004 for node 4, pop-up 16004, expose 24045 labels and pop up, node 4 is according to label 24045, by data by the link between node 4 and node 5 It forwards, after reaching node 5, handles 16005 labels, since 16005 labels are the label that node 5 is issued, pop up the label, Whole tag processes finish, and forwarding is completed.

By taking the example in step 102 as an example, for backup path is 1 → 3 → 4, if the prefix section of nodes 5 The label of the adjacent segments of label and each link is as shown in fig. 6, then form the route stand-by SR label for arriving equipment 5 for equipment 1 Stack sequence is { 24013,24034,24024,16005 }, and stack bottom is 16005.

To sum up, all prefix section label forwardings are forwarded according to IGP optimal path, while adjacent segments are forwarded according to definition, Path sequence is realized by being pressed into sequence label in source node.For example, in software defined network (Software Defined Network, SDN) under scene, SDN controller is collected into the label of the adjacent segments between the label and node of each node, base In above-mentioned label, flow forward-path is defined, forms section sequence, forwarding surface can be notified by southbound interface, formed and be based on source Routing, it can be achieved that extremely flexible forward-path is customized, it is only necessary to controller carries out unified calculation scheduling, and forwarding surface is only born Duty receives flow table, lower brush flow table.

It should be noted that the Segment routing technology based on IPV6 is similar to the Segment routing technology based on label, ability Field technique personnel can implement with reference to the Segment routing technology based on label, and details are not described herein again.

Step 104: the routing information of backup path is saved to forwarding table.

Specifically, routing information is saved into forwarding table after server obtains the routing information of backup path.Work as guarantor When protecting link generation link failure, routing forwarding is carried out using the routing information of preservation, completes backup path switching.

Inventor first studies the prior art in the route backup method that proposition present embodiment refers to, sends out Now current route backup technology is mainly that loop free routes alternative (Loop-Free Alternate, LFA) technology, is also known as interconnected The quick heavy-route in fidonetFido address (IP Fast Reroute, IP FRR) technology, long-range loop free route alternative (Remote Loop-Free Alternate, Remote LFA) technology, maximum redundancy tree-is quick to re-route (Maximally Redundant Trees-Fast Reroute, MRT-FRR) etc..Inventor is based on above-mentioned three kinds of route backup technical principles, hair Showed various route backup technologies there are the problem of, it is specific as follows:

1.IP FRR

IP FRR is based on Di Jiesitela (Dijkstra) algorithm and carries out shortest path calculating, calculates backup path, and In network node failure, flow is switched fast to backup path, without waiting for routing convergence.There are the topology of route stand-by, It is typically characterised by the presence of cyclic annular link.Quoting the summary of RFC 5286, the principle is as follows:

As shown in fig. 7, IP FRR topology is made of 4 device nodes, the number of chain road is the chain that router-level topology is selected Road metric parameter-path cost (cost), numerical value is smaller, and link-quality is more excellent.Wherein, S, E, D and N respectively represent equipment section Device node S is source node by point, and device node D is purpose node, according to shortest path first (Shortest Path Forwarding, SPF) algorithm, preferably left hand path (S- > E- > D) is as optimal path.As link failure between S and E or E When failure, S actively switch to can reserve link no cycle condition it is as follows:

Distance_opt(N,D)<Distance_opt(N,S)+Distance_opt(S,D)

Wherein, Distance_opt (N, D) indicates to back up next cost value for jumping to destination node, Distance_opt (N, S) indicates backup node to the cost value of origination node, Distance_opt (S, D) expression origination node to destination node Cost value.Wherein, Distance_opt (X, Y) refers to the shortest distance of X to Y, direct-connected not necessarily optimal.

The LFA that RFC 5286 is calculated is the neighbours being connected with S forever.LFA is based on SPF algorithm, all routings Device has the link-state information of the router of whole region, and router S calculates purpose router D's according to SPF algorithm Primary next is E, then using inequality above: Distance_opt (N, D) < Distance_opt (N, S)+ Distance_opt (S, D), discovery 3 < 8+9 inequality are set up, and select N for loop-free alternate, that is, under backup One jumps.

In view of the above process, there are the following problems by IP FRR:

1) must must meet inequality just can be used as LFA, can only guarantee that a part of node has LFA, cause to exist In the case of backup path, the problem of can not calculating route stand-by.

2) microcircuit micro loop will appear for annular networking.Or it is illustrated with RFC5286, IP FRR micro-loop topology Exemplary diagram is as shown in Figure 8.It is LFA each other to destination node D, start node S and node N after deploying LFA, but if Node E failure, node S are returned and are forwarded the traffic to node N, and node N is returned again forwards the traffic to S node, form micro loop Microcircuit.

2.Remote LFA

The backup next-hop that LFA is calculated is his directly-connected neighbor forever, and Remote LFA passes through transport protocol (tunnel), using the PQ node of distal end as backup next-hop, so that LFA has done good extension, can guarantee more to save Point has backup next-hop.Several concepts are illustrated below:

1) P node set (P-Space): the other equipment node set that source node can reach, P node set meet: Based on SPF algorithm, source node reaches the shortest path of these nodes without overprotection link.

2) Q node set (Q-Space): can reach the set of the other equipment node of destination node, and Q node set is full Foot: it is based on SPF algorithm, the shortest path of these nodes of destination node can be reached without overprotection link, that is, exclude equivalence Node of the path through overprotection link.

3) PQ node: the intersection of P-Space and Q-Space is exactly PQ node.When can not calculate PQ node, it is necessary to P node set (Extended P-space) is extended to further calculate.

4) Extended P-space: calculating P-Space as root node using the adjacent node of source node again, Extended P-space includes the P-Space of the adjacent node of source node, by Extended P-space and Q-Space Intersection is as PQ node, as RLFA.

By taking RFC7490 topology of page four as an example, Remote LFA topological diagram is as shown in figure 9, S, E, D, C, B and A are equipment Node, is equivalent cost between link, and source node is device node S, and destination node is device node E, S- > E be need it is to be protected Link.For device node S, node of the equative route through overprotection link S- > E is excluded, P-Space includes equipment section Point A and device node B, Q-Space include device node C and device node D.Since P-Space and Q-Space is without intersection, need Extended P-space is run to further calculate.It is to set by the calculated P-Space of root node of the neighbours A of S node Slave node B and device node C, then final Extended P-space is device node A, device node B and device node C.Since the intersection that Q-Space includes device node C and device node D, Extended P-space and Q-Space is C, C is The PQ point of the link of device node S to device node E, as RLFA.

The design philosophy of RLFA: it selects a PQ node as RLFA, tunnel, In is established between source node S and RLFA Under the premise of needing to protect link, source node S first will by belonging to P-Space or Extended P-space LSP Flow is transmitted to it, and then, tunnel decapsulation, is transmitted to destination node E for flow by belonging to Q-Space LSP, so out Since, RLFA is no longer limited to the harsh conditions of LFA, can guarantee that more nodes have RLFA, in addition, when needing to protect link It interrupts, the PQ of distal end can be forwarded the traffic to first rather than directly-connected neighbor, it can be to avoid the appearance of micro loop micro-loop.

The case where Remote LFA greatly improves route stand-by coverage rate, and there are route stand-bies on most theories, energy Enough generate route stand-by.There are still following larger problems by RLFA:

1) in some cases, PQ node is not present, and can not calculate route stand-by, and typical case is as shown in Figure 10, it is assumed that Link cost is 10 between device node S- device node A, P-Space and Extended P-space is not present at this time, causes The tunnel PQ egress can not be calculated, route stand-by can not be formed.

2) P-Space, Extended P-space and Q-Space are calculated based on a large amount of SPF calculating, need to convert Root node carries out multiple SPF calculating, and when topology is more complex, the calculation amount is extremely huge, the computing capability of remote super routing itself. In order to achieve the purpose that route stand-by, bring is being greatly reduced for routing convergence performance, is lost more than gain under certain scenes.

3.MRT-FRR

For the above problem existing for LFA and RLFA, Internet engineering task force (The Internet Engineering Task Force, IETF) related work group propose based on MRT (Maximally Redundant Trees route stand-by computing mechanism).Under the scene that theoretically there is route stand-by, MRT can generate route stand-by, thoroughly It solves the problems, such as under certain scenes without route stand-by.RFC 7811, RFC 7812 defines its frame principles.Core concept For routing device also requires it can be according to MRT-RED/MRT-BLUE other than it can be forwarded according to SPF shortest path Two maximum redundancy trees (Maximally Redundant Trees) are forwarded.MRT-RED/MRT-BLUE is respectively according to association Standard criterion is discussed using current device as root, the calculating of DFS (Depth First Search) algorithm is carried out according to both direction and gives birth to At.MRT-FRR has the following disadvantages:

1) very high to existing net equipment requirement, other than having traditional SPF shortest path transfer capability, it is also necessary to which additional is soft Part and hardware supported, now net equipment is not supported substantially at present, causes MRT-FRR only to have theoretical possible, not pratical and feasible Property.

2) calculating of MRT-RED/MRT-BLUE needs to carry out multiple DFS operation, is higher than routing to performance consumption and calculates Method SPF computational complexity covers to reach higher route stand-by, greatly sacrifices routing convergence performance, attend trifles and neglect essentials.

3) MRT-RED/MRT-BLUE carries out DFS operation, is not the uniqueness that Dependent Algorithm in Precision itself guarantees path, than Such as, under topological fixing situation, SPF algorithm can guarantee that the shortest path tree of the whole network all devices operation is consistent.And MRT is logical It crosses DFS algorithm and carries out operation, do not ensure that distribution tree is unique, but consistent rule is arranged by protocol specification and is guaranteed. Network equipment vendor is varied, has a manufacturer to realize wrong, whole route backup can be brought to identify, be affected.

Inventor is based on existing route stand-by technology, and it is as follows to summarize main problem of the existing technology:

1. theoretically there is the scene of route stand-by, the protection of 100% route stand-by cannot achieve, such as: IP FRR, Remote LFA technology；

2. the CPU for additionally having increased large amount of complex newly is calculated, even more than router-level topology in order to promote route stand-by coverage rate Calculation amount itself brings the decline of routing convergence performance, such as: Remote LFA, MRT-FRR；

3. compatibility issue, more demanding to whole network equipment, whole network equipment is needed all to support, otherwise will lead to backup road By failure, such as: MRT-FRR.

Based on the above issues, for inventor after making the creative labor, discovery first will can protect link from the second link It is deleted in information bank, recycling shortest path optimization algorithm or other algorithms, calculating source node to other paths of destination node, Based on calculated result, backup path is obtained.Backup path is determined using this method, as long as physical presence source node is to mesh in network Other paths of node are marked, the path can be necessarily calculated in shortest path optimization algorithm or other algorithms.Therefore, as long as net There is the backup path of protection link in network, the route backup method that present embodiment refers to is inevitable it can be found that the backup road Diameter, and will save to forwarding table, when to protect link failure, backup path is switched in time.

It should be noted that the above is only limit for example, not constituting to technical solution of the present invention.

Compared with prior art, the route backup method provided in present embodiment, based on not including the of protection link One link information library calculates backup path, makes it possible to be calculated standby in real network there are in the case where backup path Part path, improves the probability for obtaining backup path.Server makes it possible to the information preservation of backup path to forwarding table When protecting link failure, backup path is switched in time, improves the stability of network.

Second embodiment of the present invention is related to a kind of route backup method.Base of the present embodiment in first embodiment It is further illustrated on plinth, specifically illustrates place are as follows: when detecting failure, the process of backup path switching.

Specifically, as shown in figure 11, in the present embodiment, comprising step 201 to step 206, wherein step 201 Roughly the same to step 104 with the step 101 in first embodiment respectively to step 204, details are not described herein again.It is main below Introduce difference:

Step 201 is executed to step 204.

Step 205: receiving the failure indication information of protection link.

Specifically, server detects link failure, when detecting link failure, transmission link failure is reported Link fault event, so as to toggle path.

It should be noted that it will be understood by those skilled in the art that server can carry out chain using modes such as BFD detections Road fault detection, present embodiment do not limit the detection method of link failure.

Step 206: the routing information of backup path is replaced to the forward-path information of source node to destination node.

Specifically, the failure indication information in response to protecting link, triggers backup path handover operation.Due to backing up road It is that routing information is directly replaced the routing information of backup path original after link fault event reports by the information stored Flow forward-path information, the handover mechanism can directly be multiplexed the route stand-by mechanism of existing maturation.

It should be noted that the above is only limit for example, not constituting to technical solution of the present invention.

Compared with prior art, the route backup method provided in present embodiment, based on not including the of protection link One link information library, determines backup path, makes it possible to be calculated standby in real network there are in the case where backup path Part path, improves the probability for obtaining backup path.Server makes it possible to the information preservation of backup path to forwarding table When protecting link failure, backup path is switched in time, improves the stability of network.

The step of various methods divide above, be intended merely to describe it is clear, when realization can be merged into a step or Certain steps are split, multiple steps are decomposed into, as long as including identical logical relation, all in the protection scope of this patent It is interior；To adding inessential modification in algorithm or in process or introducing inessential design, but its algorithm is not changed Core design with process is all in the protection scope of the patent.

Third embodiment of the present invention is related to a kind of route backup device, as shown in figure 12, comprising: acquisition module 301, Determining module 302, generation module 303 and preserving module 304.Obtain the first link letter that module 301 is used to obtain protection link Cease library；It include the information of other links in addition to protecting link in first link information library.Determining module 302 is used for according to the One link information library determines the backup path of the corresponding source node of protection link to destination node.Generation module 303 is for generating The routing information of backup path.Preserving module 304 is for saving the routing information of backup path to forwarding table.

It is not difficult to find that present embodiment is system embodiment corresponding with first embodiment, present embodiment can be with First embodiment is worked in coordination implementation.The relevant technical details mentioned in first embodiment still have in the present embodiment Effect, in order to reduce repetition, which is not described herein again.Correspondingly, the relevant technical details mentioned in present embodiment are also applicable in In first embodiment.

It is noted that each module involved in present embodiment is logic module, and in practical applications, one A logic unit can be a physical unit, be also possible to a part of a physical unit, can also be with multiple physics lists The combination of member is realized.In addition, in order to protrude innovative part of the invention, it will not be with solution institute of the present invention in present embodiment The technical issues of proposition, the less close unit of relationship introduced, but this does not indicate that there is no other single in present embodiment Member.

4th embodiment of the invention is related to a kind of server, as shown in figure 13, comprising: at least one processor 401； And the memory 402 with the communication connection of at least one processor 401；Wherein, be stored with can be by least one for memory 402 The instruction that processor 401 executes, instruction is executed by least one processor 401, so that at least one processor 401 is able to carry out The route backup method that above embodiment refers to.

The server includes: one or more processors 401 and memory 402, is with a processor 401 in Figure 13 Example.Processor 401, memory 402 can be connected by bus or other modes, in Figure 13 for being connected by bus. Memory 402 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software program, non-volatile Property computer executable program and module, as the first link information library is stored in memory 402 in the application embodiment In.Non-volatile software program, instruction and the module that processor 401 is stored in memory 402 by operation, thereby executing The various function application and data processing of equipment realize above-mentioned route backup method.

Memory 402 may include storing program area and storage data area, wherein storing program area can store operation system Application program required for system, at least one function；It storage data area can the Save option list etc..In addition, memory 402 can be with It can also include nonvolatile memory, for example, at least disk memory, a flash memory including high-speed random access memory Device or other non-volatile solid state memory parts.In some embodiments, it includes relative to processing that memory 402 is optional The remotely located memory of device 401, these remote memories can pass through network connection to external equipment.The example of above-mentioned network Including but not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.

One or more module is stored in memory 402, when being executed by one or more processor 401, is held Route backup method in the above-mentioned any means embodiment of row.

The said goods can be performed the application embodiment provided by method, have the corresponding functional module of execution method and Beneficial effect, the not technical detail of detailed description in the present embodiment, reference can be made to method provided by the application embodiment.

5th embodiment of the invention is related to a kind of computer readable storage medium, is stored with computer program.It calculates Machine program realizes above method embodiment when being executed by processor.

That is, it will be understood by those skilled in the art that implement the method for the above embodiments be can be with Relevant hardware is instructed to complete by program, which is stored in a storage medium, including some instructions are to make It obtains an equipment (can be single-chip microcontroller, chip etc.) or processor (processor) executes side described in each embodiment of the application The all or part of the steps of method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey The medium of sequence code.

It will be understood by those skilled in the art that the respective embodiments described above are to realize specific embodiments of the present invention, And in practical applications, can to it, various changes can be made in the form and details, without departing from the spirit and scope of the present invention.