CN102316029B - Fast rerouting method and routing equipment - Google Patents
Fast rerouting method and routing equipment Download PDFInfo
- Publication number
- CN102316029B CN102316029B CN201110256621.2A CN201110256621A CN102316029B CN 102316029 B CN102316029 B CN 102316029B CN 201110256621 A CN201110256621 A CN 201110256621A CN 102316029 B CN102316029 B CN 102316029B
- Authority
- CN
- China
- Prior art keywords
- route
- node
- route stand
- beeline
- stand
- 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
Abstract
The invention discloses a fast rerouting method and routing equipment. The method and the equipment can be used in a fast rerouting process so that a network loop can not be generated and stability of the network can be raised. The fast rerouting method comprises the following steps that: a source node, based on a backup route of the source node itself, determines whether the backup route is safe when a network topology change event is generated in usage time of the backup route; if the backup route is safe, the source node maintains a route forwarding table itself and uses continuously the backup route to forward data till the usage time of the backup route is over; if the backup route is not safe, the source node recounts the route.
Description
Technical field
The present invention relates to technical field of the computer network, relate in particular to a kind of fast rerouting method and routing device.
Background technology
OSPF version 2 (OSPFv2, Open Shortest Path First version 2) be Internet Engineering task groups (IETF, The Internet Engineering Task Force) of the organization development Interior Gateway Protocol based on Link State, have wide accommodation, convergence rapidly, loop free, be convenient to the features such as level network design, therefore in IPv4 network, be applied widely.OSPF version 3 (OSPFv3, Open Shortest Path First version 3) be applied in IPv6 network, it has retained the advantage of OSPFv2 agreement, and for the feature of IPv6 network, carried out the revision of part, OSPFv3 is the Routing Protocol of main flow in IPv6 network.For convenience of description, OSPFv2 and OSPFv3 are referred to as to OSPF.In ospf protocol, network topological information is described by link database, the network topological information such as link address and link metric that comprises this routing node in the LSA (Router LSA) of the corresponding OSPF type of each routing node, these network topological informations are bases that OSPF calculates route.
At present, fast reroute techniques mainly contains the quick heavy-route of Internet protocol (IP FRR, IP FastReroute) technology, IP FRR refers to by precomputation route stand-by, and route stand-by is set to data surface in advance, detecting after main routing failure, can not rely on Interior Gateway Protocol (IGP, InteriorGateway Protocols) convergence again, and directly need to main road by the flow switch that forwards to the route stand-by having set, forward, thereby convergence speedup speed.The quick heavy-route of ospf (OSPF FRR, Open Shortest Path First Fast Reroute) technology is the part of IP FRR technology, in order to precomputation dynamic backup route in IP FRR technology, but need to ensure that the forwarding of route stand-by can not cause network loop.For convenience of description, below adopt S to represent source node, represent destination node with D, the main road that represents source node S with E by next-hop node, represent the next-hop node of the route stand-by of source node S with N.
Webisode as shown in Figure 1, for source node S, it arrives node D and has 3 routes, is respectively SE, SN, SM, supposes the quick heavy-route of node M not enabled, and its route that arrives node D is by link MS; Physical connection between two nodes is called a link, every link has link metric, the link metric that for example link SE is corresponding is 1, the link metric of link ND is 10 etc., path SED is called the shortest path tree of source node S arrival destination node D, source node S, node E and node D are that source node arrives the node on the shortest path tree of destination node D; And the link metric sum of link SE and link ED is the beeline that source node arrives destination node.
Under stable state, the main road calculating according to OSPF is by being SE, and route stand-by is SN.In the time that link SE lost efficacy, node S is arrived the flow switch of node D to SN link, now, S need to recalculate route according to OSPF, suppose to calculate main road by being SM, route stand-by is still SN, node S upgrades the route forwarding table of self, simultaneously, S notices SE failure event to M, inform that M recalculates route according to OSPF, but, each node recalculates route and upgrades route forwarding table is not synchronous, if first node S has calculated, by through self flow switch to SM, but now, M node does not complete route and calculates, still be forwarded to the flow of node D by node S, like this, to cause network loop.
In order to address the above problem, prior art has proposed following solution: set in advance the service time of route stand-by, within this service time, can ensure that all nodes recalculate route and renewal route forwarding table completes, after exceeding the time limit in use, stop the use of route stand-by.But, within the service time of route stand-by, in the time that other topology in network changes (except main road is by the network topology change SE), will immediately stop the use of route stand-by, source node S recalculates route and upgrades route forwarding table, if in the time that route stand-by SN is terminated, node M does not complete route and calculates, now, if the flow switch that node S is above forwarded is on node M, still can cause network loop, reduce the stability of network.
Summary of the invention
The embodiment of the present invention provides a kind of fast rerouting method and routing device, in order in the process of quick heavy-route, avoids producing network loop, improves the stability of network.
The embodiment of the present invention provides a kind of fast rerouting method, comprising:
Source node is for the route stand-by of self, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by;
Judged result is when being, and the route forwarding table that described source node maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by; When judged result is no, described source node recalculates route.
The embodiment of the present invention provides a kind of routing device, comprising:
The first judging unit, for the route stand-by for this equipment, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by;
The first processing unit, in the judged result of the first judging unit when being, the route forwarding table that maintains this equipment is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
The second processing unit, when being no in the judged result of the first judging unit, recalculating route, and upgrades the route forwarding table of self.
The fast rerouting method that the embodiment of the present invention provides and routing device, when source node is using route stand-by forwarding data, and there is network topology change event within the service time of this route stand-by time, first determine whether safety of this route stand-by, if safety, the route forwarding table that maintains self is constant, continue to use this route stand-by forwarding data, if determine route stand-by when dangerous, just recalculate route, like this, can avoid in the time not affecting the network topology change event generation of route stand-by safe handling, immediately recalculate route, and the main road obtaining by next-hop node do not complete route calculate time produce network loop, thereby improve the stability of network.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, or understand by implementing the present invention.Object of the present invention and other advantages can be realized and be obtained by specifically noted structure in write specification, claims and accompanying drawing.
Brief description of the drawings
Fig. 1 is in prior art, the topological structure schematic diagram of a certain Webisode;
Fig. 2 is in the embodiment of the present invention, fast rerouting method implementing procedure schematic diagram;
Fig. 3 is in the embodiment of the present invention, for a certain Webisode, and the implementing procedure schematic diagram of fast rerouting method;
Fig. 4 is in the embodiment of the present invention, the structural representation of routing device.
Embodiment
For in the process of quick heavy-route, avoid producing network loop, improve the stability of network, the embodiment of the present invention provides a kind of fast rerouting method and routing device.
Below in conjunction with Figure of description, the preferred embodiments of the present invention are described, be to be understood that, preferred embodiment described herein is only for description and interpretation the present invention, be not intended to limit the present invention, and in the situation that not conflicting, the feature in embodiment and embodiment in the present invention can combine mutually.
The embodiment of the present invention is applicable to OSPFv2 and OSPFv3 link-state routing protocol, also be applicable to other link-state routing protocols simultaneously, in the quick heavy-route calculating of Intermediate System-to-Intermediate System (ISIS, IntermediateSystem-Intermediate System).OSPFv2 and OSPFv3 are referred to as OSPF, and for convenience of description, the embodiment of the present invention describes as an example of OSPF example.
In the repeating process of data, when source node detects that current main road is when breaking down, the data retransmission that needs are forwarded is to the next-hop node of the route stand-by calculating according to OSPF, complete data retransmission, but, within the service time of route stand-by, when occur with main road by have nothing to do network topology change event time, source node will stop using route stand-by forwarding data immediately, and recalculate route, data exchange through self is forwarded from above to the main road calculating, but, the asynchronism(-nization) of calculating route and renewal route forwarding table due to the node in network walks, thereby, may cause network loop, reduce network performance.
For fear of the problems referred to above, can solve by the following two kinds of programs:
1, ensure to recalculate main routing safety time, source node by through self data exchange to recalculating the main road obtaining by upper forwarding;
2, after determining that route stand-by is dangerous, just re-start route and calculate and upgrade routing forwarding table handling, obtain new effective forward-path with this, ensure the fail safe of data retransmission.
For above-mentioned the first scheme, because the route of different nodes is calculated and to upgrade the speed of route forwarding table inconsistent, and arrange without the standard time, so, this point conventionally by user according to the actual deployment situation of network, choose rational route stand-by service time, after this route stand-by exceeds the time limit service time, can ensure in network that all nodes calculate routes and upgrade route forwarding table completes, can be safely by data exchange to the main road recalculating by upper forwarding.
For above-mentioned first scheme, for judging whether safety of route stand-by, even if there is network topology change event, as long as this network topology change event does not affect the fail safe of route stand-by, still continue to use route stand-by, to ensure the stability of network.OSPF regulation, network topology change event is noticed by Link State Advertisement (LSA, Link-State Advertisement), below taking source node as example, while providing several network topology change event, the corresponding LSA that source node receives:
Node failure: source node receives the LSA ageing information that this node is corresponding and notices;
Node is newly-increased: source node receives the LSA that newly-increased node is corresponding and notices;
Link failure: the new LSA that source node is received notices compared with old LSA notice, has lacked the relevant information of this link;
Link is newly-increased: compared with the new LSA that source node is received notices and notices with old LSA, and many relevant informations of this link;
Link metric reduces: during the new LSA that source node is received notices, the link metric of this link is less than the link metric of this link in old LSA notice;
Link metric increases: during the new LSA that source node is received notices, the link metric of this link is greater than the link metric of this link in old LSA notice.
Based on this, the embodiment of the present invention provides a kind of fast rerouting method and routing device.
As shown in Figure 2, the implementing procedure schematic diagram of the fast rerouting method providing for the embodiment of the present invention, comprises the following steps:
S201, source node be for the route stand-by of self, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by, if so, and execution step S202, if not, execution step S203;
It should be noted that, source node is after the main route break of self, and when enabling route stand-by and carrying out data retransmission, within the service time of route stand-by, the network topology change event of generation refers to main road by the network topology change event haveing nothing to do.
The route forwarding table that S202, source node maintain self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
S203, source node recalculate route.
In the embodiment of the present invention, for convenience of description, the processing mode in step S203 is called to processing mode 1, the processing mode in step S202 is called to processing mode 2.
In concrete enforcement, in step S201, in order to ensure the safety of route stand-by, only need to ensure that shortest path tree that the next-hop node of route stand-by arrives destination node is without source node, in the time meeting the following conditions, source node is determined the route stand-by safety of self: the next-hop node that the beeline of the next-hop node arrival destination node of the route stand-by of self is less than the route stand-by of self arrives the beeline of self and the beeline sum of self arrival destination node.If adopt S to represent source node, represent destination node with D, represent the next-hop node of the route stand-by calculating with N, with Distance_opt (A, B) represent that node A arrives the beeline of Node B, can be expressed as: Distance_opt (N, D) < Distance_opt (N, S)+Distance_opt (S, D).For example, in the time that on the shortest path tree of node N arrival node D, arbitrary link metric reduces, Distance_opt (N is described, D) reduce, this network topology change event can not affect source node S and continue to use route stand-by SN to carry out the fail safe of data retransmission, therefore, source node S can continue to carry out forwarding data with route stand-by SN; Similarly, if arbitrary link metric increases on the shortest path tree of source node S arrival destination node D, Distance opt (S is described, D) can increase, that is to say that this network topology change event does not affect the fail safe of source node S continuation use route stand-by SN forwarding data, thereby source node S can continue to use route stand-by SN to carry out data retransmission.
In concrete enforcement, in the time meeting following at least one condition, source node determines that the route stand-by of self is dangerous: 1, the next-hop node of this route stand-by arrives the beeline increase of destination node; 2, the beeline of the next-hop node of this route stand-by arrival self reduces; 3, self arriving the beeline of destination node reduces.
Preferably, in the time there is following arbitrary network topology change event, source node determines that the beeline that the next-hop node of this route stand-by arrives destination node increases: arbitrary node failure on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or newly-increased node on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or arbitrary link failure on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or newly-increased link on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or on the shortest path tree of the next-hop node of this route stand-by arrival destination node, arbitrary link metric increases.For example, in the time that node N arrives on the shortest path tree of node D arbitrary node failure, Distance_opt (N is described, D) become large, this network topology change events affecting source node S continues to use route stand-by SN to carry out the fail safe of data retransmission, therefore, source node S need to recalculate route.
Preferably, in the time there is following network topology change event, source node determines that the beeline of the next-hop node arrival self of this route stand-by reduces: on the shortest path tree of the next-hop node arrival of this route stand-by self, arbitrary link metric reduces.
Preferably, when occurring when following network topology change event, source node determines that the beeline that self arrives destination node reduces: the arbitrary link metric self arriving on the shortest path tree of destination node reduces.
As shown in table 1, be that the network topology change time occurs, cause Distance_opt (N, D), Distance_opt (N, S), Distance_opt (S, D) any while changing, the processing mode that source node is corresponding:
Table 1
| Network topology change event | Distance_opt(N，D) | Distance_opt(N，S) | Distance_opt(S，D) | Other | |
| Node | Processing mode | 1 | Processing mode 2 | Processing mode 2 | Processing mode 2 |
| Node is newly-increased | |
Processing mode 2 | Processing mode 2 | Processing mode 2 | |
| Link | Processing mode | 1 | Processing mode 2 | Processing mode 2 | Processing mode 2 |
| Link is newly-increased | |
Processing mode 2 | Processing mode 2 | Processing mode 2 | |
| Link metric reduces | Processing mode 2 | |
|
Processing mode 2 | |
| Link metric increases | |
Processing mode 2 | Processing mode 2 | Processing mode 2 |
Especially, if network topology structure many places change, cause Distance_opt (N, D), Distance_opt (N, S), Distance_opt (S, D), while variation, make the existing processing mode 1 of processing mode, while having processing mode 2 again simultaneously, can continue to adopt processing mode 2 to process, to ensure to calculate the accuracy of route results, thereby avoid causing network loop, improve the stability of network.
In concrete enforcement, source node is after recalculating route, and fast rerouting method, can also comprise:
Judge whether the beeline of the next-hop node arrival destination node of this route stand-by is less than the beeline of next-hop node arrival source node and the beeline sum of source node arrival destination node of this route stand-by;
In judged result, when being, the route forwarding table that source node maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by; In judged result while being no, source node is according to recalculating obtaining result and upgrading the route forwarding table of self of route, and stops using this route stand-by forwarding data.
That is to say, when in the time making a difference the network topology change event of route stand-by fail safe, if in the time that the next-hop node of judging this route stand-by arrives next-hop node that the beeline of destination node is less than this route stand-by and arrives the beeline of source node and the beeline sum of source node arrival destination node, source node S is used route stand-by SN to remain safe, for example, node N increases to the beeline of node D, but source node is recalculating after route, determine still and meet: Distance_opt (N, D) < Distance_opt (N, S)+Distance_opt (S, D), the route forwarding table that maintains self is constant, still can use route stand-by SN forwarding data, if source node is recalculating after route, determine and cannot meet: Distance_opt (N, D) < Distance_opt (N, S)+Distance_opt (S, D), need to upgrade the route forwarding table of self, and stop using current route stand-by forwarding data.
For the ease of understand, below taking the network configuration fragment shown in Fig. 1 as example, the specific implementation process of the embodiment of the present invention is described.
As shown in Figure 3, in the embodiment of the present invention, for a certain Webisode, the implementing procedure schematic diagram of fast rerouting method, can comprise the following steps:
S301, source node are determined the main route break of self, enable route stand-by forwarding data;
Concrete, taking the network topology fragment shown in Fig. 1 as example, under stable state: the route that node S arrives node D comprises: SE, SM and SN, according to OSPF FRR algorithm, calculating route obtains the main road of node S by being SE, route stand-by is SN, M not enabled through street by, it arrives route of D and forwards by link MS.After the main road of source node S arrival destination node D was lost efficacy by SE, the data exchange that source node S need to forward it forwards to route stand-by SN.
S302, judge whether occur with main road by the network topology change event haveing nothing to do, if so, execution step S303, if not, execution step S306;
Concrete, if occur with main road by have nothing to do network topology change event time, two kinds of processing modes that provide according to the embodiment of the present invention are processed; If while occurring with main road by relevant network topology change event, it is constant that source node maintains current route forwarding table, continues this route stand-by forwarding data of use.
S303, judge whether safety of route stand-by, if so, execution step S306, if not, execution step S304;
Concrete, can provide according to table 1, when occur with main road by the network topology change event haveing nothing to do, cause Distance_opt (N, D), Distance_opt (N, S), Distance_opt (S, D), when any changes, corresponding processing mode is processed.
Concrete, when the link metric that link ND occurs reduces, the link metric of link SM increases, or when the network topology change event such as link ED disconnections, source node continues the current route stand-by forwarding data of use.
S304, source node recalculate route;
S305, judgement are recalculated after route, whether safety of current route stand-by, if so, execution step S306, if not, execution step S308;
The route forwarding table that S306, source node maintain self is constant, continues to use this route stand-by forwarding data;
Concrete, if link ND tolerance is increased to 11, link MD tolerance reduces etc., need to re-start OSPF FRR calculates, if recalculated after route, determine still safety of current route stand-by, above-mentioned network topology change event does not affect the fail safe of route stand-by, so the route forwarding table that source node maintains self is constant.
S307, judge whether exceed the time limit the service time of current route stand-by, if so, execution step S308, otherwise execution step S306;
Taking service time of route stand-by as 10s is as example, whether equal 10s the service time that judges route stand-by.
S308, source node, according to recalculating the result obtaining after route, upgrade the route forwarding table of self.
If link ND disconnects, and source node S re-starts after OSPF FRR calculates to be determined, node N arrives the flow of node D through source node S, to between source node S and node N, there is loop in this, so stop using route stand-by SN to carry out traffic forwarding as route stand-by, and according to recalculating the result obtaining after route, upgrade the route forwarding table of self.
Based on same inventive concept, a kind of routing device is also provided in the embodiment of the present invention, because the principle that this routing device is dealt with problems is similar to above-mentioned fast rerouting method, therefore the enforcement of this routing device can be referring to the enforcement of above-mentioned fast rerouting method, repeats part and repeat no more.
As shown in Figure 4, the structural representation of the routing device providing for the embodiment of the present invention, comprising:
The first judging unit 401, for the route stand-by for this equipment, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by;
The first processing unit 402, in the judged result of the first judging unit 401 when being, the route forwarding table that maintains this equipment is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
The second processing unit 403, when being no in the judged result of the first judging unit 401, recalculates route.
In concrete enforcement, the first judging unit 401, can be in the time meeting the following conditions, determine the route stand-by safety of this equipment: the next-hop node that the beeline of the next-hop node arrival destination node of this route stand-by is less than this route stand-by arrives the beeline of this equipment and the beeline sum of this equipment arrival destination node.
In concrete enforcement, the first judging unit 401, can, in the time meeting following at least one condition, determine that the route stand-by of this equipment is dangerous: the beeline increase of the next-hop node arrival destination node of this route stand-by; The beeline that the next-hop node of this route stand-by arrives this equipment reduces; The beeline that this equipment arrives destination node reduces.
Preferably, the first judging unit 401, can be in the time there is following arbitrary network topology change event, the beeline that the next-hop node of determining this route stand-by arrives destination node increases: arbitrary node failure on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or newly-increased node on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or arbitrary link failure on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or newly-increased link on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or on the shortest path tree of the next-hop node of this route stand-by arrival destination node, arbitrary link metric increases.
Preferably, the first judging unit 401, can be for when occurring when following network topology change event, the beeline that the next-hop node of determining this route stand-by arrives this equipment reduces: the next-hop node of this route stand-by arrives arbitrary link metric on the shortest path tree of this equipment and reduces.
Preferably, the first judging unit 401, can, in the time there is following network topology change event, determine that the beeline between this equipment and destination node reduces: the arbitrary link metric on the shortest path tree of this equipment arrival destination node reduces.
In concrete enforcement, the routing device that the embodiment of the present invention provides, can also comprise:
The second judging unit, for after the second processing unit 403 recalculates route, the next-hop node whether beeline that the next-hop node that judges this route stand-by arrives destination node is less than this route stand-by arrives the beeline of this equipment and the beeline sum of this equipment arrival destination node;
The 3rd processing unit, in the judged result of the second judging unit when being, the route forwarding table that maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
Fourth processing unit, when being no in the judged result of the second judging unit, recalculating according to the second processing unit 403 result that route obtains and upgrades the route forwarding table of self, and stop using this route stand-by forwarding data.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, completely implement software example or the form in conjunction with the embodiment of software and hardware aspect.And the present invention can adopt the form at one or more upper computer programs of implementing of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present invention, equipment (system) and computer program.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, the instruction that makes to carry out by the processor of computer or other programmable data processing device produces the device for realizing the function of specifying at flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame on computer or other programmable devices.
Although described the preferred embodiments of the present invention, once those skilled in the art obtain the basic creative concept of cicada, can make other change and amendment to these embodiment.So claims are intended to be interpreted as comprising preferred embodiment and fall into all changes and the amendment of the scope of the invention.
The fast rerouting method that the embodiment of the present invention provides and routing device, when source node is using route stand-by forwarding data, and there is network topology change event within the service time of this route stand-by time, first determine whether safety of this route stand-by, if safety, the route forwarding table that maintains self is constant, continue to use this route stand-by forwarding data, if determine route stand-by when dangerous, just recalculate route, like this, avoid in the time not affecting the network topology change event generation of route stand-by safe handling, recalculate main road that route obtains by next-hop node do not complete the network loop producing when route is calculated, thereby, improve the stability of network.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the present invention the present invention.Like this, if these amendments of the present invention and within modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.
Claims (12)
1. a fast rerouting method, is characterized in that, comprising:
Source node is for the route stand-by of self, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by;
Judged result is when being, and the route forwarding table that described source node maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by; When judged result is no, described source node recalculates route;
Wherein, source node, after recalculating route, also comprises:
Judge whether the beeline of the next-hop node arrival destination node of this route stand-by is less than the beeline of next-hop node arrival source node and the beeline sum of source node arrival destination node of this route stand-by;
In judged result, when being, the route forwarding table that described source node maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by; In judged result while being no, described source node upgrades the route forwarding table of self according to recalculating the result that route obtains, and stops using this route stand-by forwarding data.
2. the method for claim 1, is characterized in that, below meeting, when at least one condition, described source node determines that the route stand-by of self is dangerous:
The beeline that the next-hop node of this route stand-by arrives destination node increases;
The beeline that the next-hop node of this route stand-by arrives self reduces;
The beeline that self arrives destination node reduces.
3. method as claimed in claim 2, is characterized in that, in the time there is following arbitrary network topology change event, described source node determines that the next-hop node of this route stand-by arrives the beeline increase of destination node:
Arbitrary node failure on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or
Newly-increased node on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or
Arbitrary link failure on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or
Newly-increased link on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or
On the shortest path tree of the next-hop node arrival destination node of this route stand-by, arbitrary link metric increases.
4. method as claimed in claim 2, is characterized in that, in the time there is following network topology change event, described source node determines that the beeline of the next-hop node arrival self of this route stand-by reduces:
On the shortest path tree of the next-hop node arrival of this route stand-by self, arbitrary link metric reduces.
5. method as claimed in claim 2, is characterized in that, in the time there is following network topology change event, described source node determines that the beeline that self arrives destination node reduces:
The arbitrary link metric self arriving on the shortest path tree of destination node reduces.
6. the method for claim 1, is characterized in that, in the time meeting the following conditions, described source node is determined the route stand-by safety of self:
The next-hop node that the beeline of the next-hop node arrival destination node of this route stand-by is less than this route stand-by arrives the beeline of self and the beeline sum of self arrival destination node.
7. a routing device, is characterized in that, comprising:
The first judging unit, for the route stand-by for this equipment, while there is network topology change event, judges whether safety of this route stand-by within the service time of this route stand-by;
The first processing unit, in the judged result of the first judging unit when being, the route forwarding table that maintains this equipment is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
The second processing unit, when being no in the judged result of the first judging unit, recalculates route;
The second judging unit, for after the second processing unit recalculates route, the next-hop node whether beeline that the next-hop node that judges this route stand-by arrives destination node is less than this route stand-by arrives the beeline of this equipment and the beeline sum of this equipment arrival destination node;
The 3rd processing unit, in the judged result of described the second judging unit when being, the route forwarding table that maintains self is constant, continues to use this route stand-by forwarding data, until exceed the time limit the service time of this route stand-by;
Fourth processing unit, when being no in the judged result of described the second judging unit, recalculating according to described the second processing unit the result that route obtains and upgrades the route forwarding table of self, and stop using this route stand-by forwarding data.
8. routing device as claimed in claim 7, is characterized in that,
Described the first judging unit, during specifically at least one condition below meeting, determines that the route stand-by of this equipment is dangerous: the beeline that the next-hop node of this route stand-by arrives destination node increases; The beeline that the next-hop node of this route stand-by arrives this equipment reduces; The beeline that this equipment arrives destination node reduces.
9. routing device as claimed in claim 8, is characterized in that,
Described the first judging unit, during specifically for arbitrary network topology change event below occurring, determine that the next-hop node of this route stand-by arrives the beeline increase of destination node: arbitrary node failure on the shortest path tree of the next-hop node arrival destination node of this route stand-by; Or newly-increased node on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or arbitrary link failure on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or newly-increased link on the shortest path tree of the next-hop node of this route stand-by arrival destination node; Or on the shortest path tree of the next-hop node of this route stand-by arrival destination node, arbitrary link metric increases.
10. routing device as claimed in claim 8, is characterized in that,
Described the first judging unit, specifically for when occurring when following network topology change event, the beeline that the next-hop node of determining this route stand-by arrives this equipment reduces: the next-hop node of this route stand-by arrives arbitrary link metric on the shortest path tree of this equipment and reduces.
11. routing devices as claimed in claim 10, is characterized in that,
Described the first judging unit, specifically in the time there is following network topology change event, determines that the beeline between this equipment and destination node reduces: the arbitrary link metric on the shortest path tree of this equipment arrival destination node reduces.
12. routing devices as claimed in claim 7, is characterized in that,
Described the first judging unit, specifically in the time meeting the following conditions, determine the route stand-by safety of this equipment: the next-hop node that the beeline of the next-hop node arrival destination node of this route stand-by is less than this route stand-by arrives the beeline of this equipment and the beeline sum of this equipment arrival destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110256621.2A CN102316029B (en) | 2011-09-01 | 2011-09-01 | Fast rerouting method and routing equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110256621.2A CN102316029B (en) | 2011-09-01 | 2011-09-01 | Fast rerouting method and routing equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102316029A CN102316029A (en) | 2012-01-11 |
| CN102316029B true CN102316029B (en) | 2014-06-04 |
Family
ID=45428861
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110256621.2A Active CN102316029B (en) | 2011-09-01 | 2011-09-01 | Fast rerouting method and routing equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102316029B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103650441B (en) * | 2013-06-28 | 2016-12-28 | 华为技术有限公司 | Time-based method for processing business and device |
| CN108702321B (en) * | 2016-02-27 | 2021-05-07 | 华为技术有限公司 | System, method and apparatus for implementing fast reroute (FRR) |
| CN109165141A (en) * | 2018-08-10 | 2019-01-08 | 武汉优品楚鼎科技有限公司 | A kind of computer system O&M method for visually monitoring, system and device |
| CN108965141B (en) * | 2018-09-18 | 2021-03-30 | 深圳市风云实业有限公司 | Method and device for calculating multipath routing tree |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101026562A (en) * | 2007-01-31 | 2007-08-29 | 华为技术有限公司 | Method and device for selecting reserve LPS |
| CN101227313A (en) * | 2007-01-19 | 2008-07-23 | 华为技术有限公司 | Business path regulation method and communication system as well as route computing unit |
| CN101599898A (en) * | 2009-07-01 | 2009-12-09 | 北京邮电大学 | The multilink fault environment adopts the method for the avoiding loop for routers of LFA mode down |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7986640B2 (en) * | 2006-07-05 | 2011-07-26 | Cisco Technology, Inc. | Technique for efficiently determining acceptable link-based loop free alternates in a computer network |
-
2011
- 2011-09-01 CN CN201110256621.2A patent/CN102316029B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227313A (en) * | 2007-01-19 | 2008-07-23 | 华为技术有限公司 | Business path regulation method and communication system as well as route computing unit |
| CN101026562A (en) * | 2007-01-31 | 2007-08-29 | 华为技术有限公司 | Method and device for selecting reserve LPS |
| CN101599898A (en) * | 2009-07-01 | 2009-12-09 | 北京邮电大学 | The multilink fault environment adopts the method for the avoiding loop for routers of LFA mode down |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102316029A (en) | 2012-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5095823B2 (en) | Transport control server, network system, and transport control method | |
| CN110535763B (en) | Route backup method, device, server and readable storage medium | |
| CN101986622B (en) | A kind of automatic identifying method of PCE status attribute and system | |
| CN109361596B (en) | Route calculation method and device and electronic equipment | |
| CN102347885B (en) | A kind of method and apparatus of route handoff | |
| JP6508051B2 (en) | Communication control apparatus, communication control system, communication control method and communication control program | |
| CN102316029B (en) | Fast rerouting method and routing equipment | |
| WO2015117412A1 (en) | Isis-based flooding method and device | |
| CN103001865B (en) | The method and apparatus released news in a kind of LSP fragment message | |
| CN110233801B (en) | Route updating method and device | |
| CN112615785B (en) | Routing method and device of network data packet | |
| CN113615132A (en) | Fast flooding topology protection | |
| CN103179032B (en) | A kind of route backup method and device | |
| CN103746828A (en) | Method and device for network node management | |
| EP3059913B1 (en) | Lsp data packet generating method and device | |
| CN111447091B (en) | Network loop detection method, device, equipment and storage medium | |
| CN108075981B (en) | Transmission method of link state data packet and routing node | |
| CN105634964A (en) | Mobile self-organizing network and multicast routing method thereof | |
| WO2017140238A1 (en) | Message transmission method and device | |
| CN102055662A (en) | Method and device for determining preset routing | |
| WO2016184022A1 (en) | Ip accessibility information announcement method and routing determining method and device | |
| CN107147576B (en) | Route calculation method and device | |
| CN111385195B (en) | Information processing method, device and storage medium | |
| CN102710499B (en) | Many issue sources external routes is for down hop system of selection and equipment thereof | |
| CN111107002B (en) | Method and device for acquiring routing information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park building 19# Patentee after: RUIJIE NETWORKS CO., LTD. Address before: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park building 19# Patentee before: Fujian Xingwangruijie Network Co., Ltd. |