CN105681119A - Method and apparatus for detecting routing loop - Google Patents
Method and apparatus for detecting routing loop Download PDFInfo
- Publication number
- CN105681119A CN105681119A CN201410662765.1A CN201410662765A CN105681119A CN 105681119 A CN105681119 A CN 105681119A CN 201410662765 A CN201410662765 A CN 201410662765A CN 105681119 A CN105681119 A CN 105681119A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- subtree
- routing tree
- detection
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
Abstract
The invention discloses a method and an apparatus for detecting a routing loop, and relates to the technical field of data network communication. The method comprises the steps of: setting a next routing hop as a root node of a detection routing tree, and setting the next hop of the root node as the root node of a sub-tree of the detection routing tree; detecting the sub-tree of the detection routing tree; and if detecting repeated nodes in the sub-tree, determining a loop in the forwarding routing corresponding to the sub-tree, and deleting the forwarding routing in a forwarding information table. The method disclosed by the invention can be used for detecting the routing loop in the scenes of forwarding surface public network FRR nesting and public network non-direct connection next hop LDP tunnel, and deleting the ineffective routing in the forwarding information table to guarantee the communication smoothness and avoid the waste of network resources.
Description
Technical field
The present invention relates to data network communications technical field, particularly to a kind of method detecting route loop and relevant device.
Background technology
Router is at transmission control protocol/internet protocol (TransmissionControlProtocol/InternetProtocol, TCP/IP) after third layer forms loop, packet has just entered an endless loop until life span (time-to-live, TTL) is dropped after being kept to 0. Its result is the profligacy of communication disruption and Internet resources, and the router of all composition route loops flogs a dead horse all there and load is very big.
Routing information protocol (RoutingInformationProtocol, RIP), ospf (OpenShortestPathFirst, OSPF), Border Gateway Protocol (BorderGatewayProtocol, etc. BGP) agreement has the loop detection algorithm of oneself to avoid above-mentioned situation, but can't resolve public network and route quick heavy-route (FastReRoute, FRR) the nested and indirectly connected down hop of public network walks the route cyclization problem under tag distribution protocol (LabelDistributionProtocol, LDP) tunnel scene.
Routeing in FRR nesting networking at public network as shown in Figure 1, edge device (ProviderEdge, PE) 1-PE2, PE1-PE3 form FRR, wherein the FRR of PE1-PE2 nesting again PE1-nucleus equipment (Provider, P) 1, PE1-P2. Two-way converting in order to carry out outer layer FRR detects (BidirectionalForwardingDetection, BFD), agreement passes to the forwarding information (FowardingInformationBase of forwarding, FIB) table is the original down hop in opposite end, it not actual outgoing interface, cannot ensure to route not cyclization yet. By configuring static routing or Internal BGP (InternalBorderGatewayProtocol, IBGP) route on such as PE1, form FRR. Wherein primary link is 100.1.1.0/24 down hop is 2.2.2.2 (wherein this route of 2.2.2.2/32 forms again FRR, forms FRR nested), and standby link is 100.1.1.0/24 down hop is 3.3.3.3. When the route of PE1 to 2.2.2.2 exists loop, agreement will be unable to detect that route has formed loop.
Walk in the networking in LDP tunnel in the indirectly connected down hop route of public network as shown in Figure 2, Border Gateway Protocol (BorderGatewayProtocol is set up by Loopback interface between PE1 and PE2, BGP) neighbours, the bgp neighbor that is routed through of 100.1.1.0/24 is advertised to PE1 by PE2, LDP tunnel is played between PE1 and PE2, require that on PE1, the route of 100.1.1.0/242.2.2.2 can walk LDP tunnel, but P1 does not have this route of 100.1.1.0/24.What learn due to BGP is loopback (Loopback) address of opposite end PE2, is not the direct down hop to P1, it is impossible to ensure to be absent from loop.
Summary of the invention
It is an object of the invention to provide one detection and route looped method and device, the public network nested looped test problems of route walking under LDP tunnel scene with the indirectly connected down hop of public network of route FRR can be solved better.
According to an aspect of the invention, it is provided a kind of detection route looped method, including:
The route next jump root node as detection routing tree is set, and the root node of the subtree that down hop is described detection routing tree of described detection routing tree root node is set;
Detect the subtree of described detection routing tree;
If detecting that subtree exists duplicate node, it is determined that forwarding route corresponding to described subtree exists loop, and delete from forwarding information table and described forward route.
Preferably, described subtree is set up by following steps:
Route using the root node of described subtree as prefix node is carried out route iteration process, finds the next-hop node of described prefix node;
Described next-hop node is added to described detection routing tree, and to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process;
Process and route judgement processes if it is not, then repeat route iteration with described next-hop node for prefix node, until finding next-hop node is the route of the direct-connected outgoing interface of opposite equip..
Preferably, the described step that the subtree of described detection routing tree is detected includes:
When adding described next-hop node to described detection routing tree, on the path of the root node of detection routing tree, detect whether there is described node at described node;
If detecting there is described node at described node on the path of the root node of detection routing tree, it is determined that described subtree exists duplicate node.
Preferably, also include:
If the subtree of described detection routing tree all exists duplicate node, then from described forwarding information table, delete the root node of described detection routing tree.
Preferably, also include:
If finding a subtree being absent from duplicate node in the subtree of described detection routing tree, then forward route as the route being used for forwarding packet corresponding for described subtree, and stop route cyclization detection.
According to a further aspect in the invention, it is provided that a kind of detection route looped device, including:
Achievement module, for arranging the root node that route next jump is detection routing tree, and arranges the root node of the subtree that down hop is described detection routing tree of described detection routing tree root node;
Detection module, for detecting the subtree of described detection routing tree;
, during for there is duplicate node in processing module, it is determined that forwarding route corresponding to described subtree exists loop in subtree being detected, and described forwards route deleting from forwarding information table.
Preferably, the route being prefix node with the root node of described subtree is carried out route iteration process by described achievement module, find the next-hop node of described prefix node, described next-hop node is added to described detection routing tree, to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process, if not, then repeat route iteration with described next-hop node for prefix node to process and route judgement processes, until finding next-hop node is the route of the direct-connected outgoing interface of opposite equip..
Preferably, described detection module is when adding described next-hop node to described detection routing tree, on the path of the root node of detection routing tree, detect whether there is described node at described node, if detecting there is described node at described node on the path of the root node of detection routing tree, it is determined that described subtree exists duplicate node.
Preferably, if described detection module detects in the subtree of described detection routing tree all there is duplicate node, then described processing module deletes the root node of described detection routing tree from described forwarding information table.
Preferably, if described detection module finds a subtree being absent from duplicate node in the subtree of described detection routing tree, then corresponding for described subtree is forwarded route as the route being used for forwarding packet by described processing module, and stops route cyclization detection.
Compared with prior art, the beneficial effects of the present invention is:
The present invention can forward in the face of public network route FRR is nested and the indirectly connected down hop of public network is walked the route under LDP tunnel scene and carried out cyclization detection, and deletes invalid route in forwarding information table, thus ensureing that communication is smooth and easy, and avoids the waste of Internet resources.
Accompanying drawing explanation
Fig. 1 is the public network route FRR nesting networking diagram that prior art provides;
Fig. 2 is that the indirectly connected down hop route of public network that prior art provides walks LDP tunnel networking diagram;
Fig. 3 is that the detection that the embodiment of the present invention provides route looped Method And Principle figure;
Fig. 4 is that the detection that the embodiment of the present invention provides route looped device block diagram;
Fig. 5 is the route cyclization detection algorithm schematic diagram that the embodiment of the present invention provides;
Fig. 6 be the embodiment of the present invention provide cyclization detection for public network route FRR nesting networking diagram;
Fig. 7 is the once concrete fib table route cyclization detection process schematic for networking diagram shown in Fig. 6.
Detailed description of the invention
Below in conjunction with accompanying drawing to a preferred embodiment of the present invention will be described in detail, it will be appreciated that preferred embodiment described below is merely to illustrate and explains the present invention, is not intended to limit the present invention.
Fig. 3 is that the detection that the embodiment of the present invention provides route looped Method And Principle figure, as it is shown on figure 3, step includes:
Step S101: the root node that route next jump is detection routing tree the root node of the subtree that the down hop arranging detection routing tree root node is detection routing tree are set.
Wherein, the route being prefix node with the root node of subtree is carried out route iteration process, finds the next-hop node of prefix node; Next-hop node is added to detection routing tree, and to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process; Process and route judgement processes if it is not, then repeat route iteration with next-hop node for prefix node, until finding next-hop node is the route of the direct-connected outgoing interface of opposite equip..
Iteration is a kind of pathfinding mode, is used for carrying out routing addressing, for instance, using prefix node address as destination address, search the route arriving destination address.
Step S201: detect the subtree of described detection routing tree.
Specifically, when next-hop node being added to detection routing tree, on the path of the root node of detection routing tree, detect whether there is this node at this node, if detecting and there is this node, it is determined that subtree exists duplicate node.
Step S301: if detecting and there is duplicate node in subtree, it is determined that forwarding route corresponding to this subtree exists loop, and delete from forwarding information table and forward route.
Further, the subtree of detection routing tree can be sequentially carried out detection by the present embodiment, if finding a subtree being absent from duplicate node in the subtree of detection routing tree, then forward route as the route being used for forwarding packet corresponding for subtree, and stop route cyclization detection.If the subtree of detection routing tree all exists duplicate node, then from forwarding information table, delete the root node of detection routing tree.
Fig. 4 is that the detection that the embodiment of the present invention provides route looped device block diagram, as shown in Figure 4, including achievement module 11, detection module 21 and processing module 31.
Achievement module 11 is for arranging the route next jump root node as detection routing tree, and arranges the down hop root node as the subtree of detection routing tree of detection routing tree root node. Wherein, the route route iteration being prefix node with the root node of subtree is processed by achievement module, find the next-hop node of prefix node, next-hop node is added to detection routing tree, to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process, process and route judgement processes if it is not, then repeat route iteration with next-hop node for prefix node, until finding next-hop node is the route of the direct-connected outgoing interface of opposite equip..
Detection module 21 is for detecting the subtree of detection routing tree. Specifically, detection module when adding detection routing tree to by next-hop node, on the path of the root node of detection routing tree, detect whether to exist node at node, if detecting there is node at node on the path of the root node of detection routing tree, it is determined that subtree exists duplicate node.
When for there is duplicate node in subtree being detected in processing module 31, it is determined that forwarding route corresponding to subtree exists loop, and forwards route deleting from forwarding information table. Further, if detection module 21 detects in the subtree detecting routing tree all there is duplicate node, then processing module 31 deletes the root node of detection routing tree from forwarding information table. If detection module 21 finds a subtree being absent from duplicate node in the subtree of detection routing tree, then corresponding for subtree is forwarded route as the route being used for forwarding packet by processing module 31, and stops route cyclization detection.
Fig. 5 is the route cyclization detection algorithm schematic diagram that the embodiment of the present invention provides, as it is shown in figure 5, the route that the present embodiment walks LDP tunnel in forwarding in the face of public network route FRR nesting and the indirectly connected down hop of public network carries out cyclization detection, its concrete algorithm is as follows:
Create one tree with the down hop of route to be detected for root, be iterated, until finding down hop is the route of the direct-connected outgoing interface of end-to-end router. So the node in tree is probably prefix " prefix ", it is also possible to down hop " nexthop ", leaf node must be " nexthop ". Wherein, P=Prefix, the N=Nexthop in Fig. 5.
When adding leaf node in tree, being required for checking whether there is this node with this leaf node on the path of tree root, if existed, claiming this leaf node is illegal leaf node (there is loop), it is necessary to it is carried out cutting every time. A P node in Iterative path is likely to comprise multiple N node, as long as having a N node is illegal node, then nearest with N in this subtree P node is also illegal. Concrete reduction is as follows:
Illegal N node: P node nearest with N node in the subtree at N node place is also illegal, turns illegal P node and processes.
Illegal P node: the father node N of this P node attempts looking for other legal P node, namely the action of vice-minister's coupling occurs only at N root node, all the time according to the longest coupling in Iterative path.
Wherein, the longest coupling action is to exist a plurality of when mating down hop in a network, adopts a route of mask the longest (the most accurate) as occurrence and to be defined as down hop.Similarly, vice-minister mates action is be defined as down hop by one that adopts mask vice-minister.
During iteration, each legal N node only allows to iterate to a legal P node, but each legal P node can comprise multiple legal N node. So, when iterating to Px node, when its direct-connected down hop Nw...Nv node comprised is all legal, N1 node is no longer attempt to search other P node, and return is told that P1 node iteration completes by N1 node. P1 node continue N2...Nx node iteration, be disposed and all confirm legal after, P1 node return tells NH that node is legal, NH node thinks that iteration completes, and no longer searches other node, such as P2 ... Pn node. Only when P1 node is illegal, just attempt searching other node P2, the like.
So, when NH thinks that iteration completes, just have found a forward-path not havinging loop. If the iteration result of NH is the illegal route, this NH node is thought looped, is set to invalid route and deletes from fib table.
Routeing FRR below in conjunction with public network, nested the invention will be further described with cyclization detection algorithm, Fig. 6 be the cyclization detection that provides of the embodiment of the present invention for public network route FRR nesting networking diagram, as shown in Figure 6.
The BGPFRR that PE1 exists to 100.1.1.0 route, and down hop is 2.2.2.2 and 3.3.3.3 respectively. There is the OSPFFRR route 2.2.2.2 to PE2, down hop is 4.4.4.4 and 5.5.5.5 respectively simultaneously.
The static routing 4.4.4.0/24 down hop 40.0.0.2 of configuration, 4.4.4.4/32 down hop 6.6.6.6,5.5.5.5/32 down hop 50.0.0.2,6.6.6.6/32 down hop 4.4.4.4 and 40.0.0.2 before having on PE1. Wherein 40.0.0.2 and 50.0.0.2 is the interface IP address of P1, P2 respectively.
Fig. 7 is the once concrete fib table route cyclization detection process schematic for networking diagram shown in Fig. 6, as it is shown in fig. 7, comprises following steps:
1, the down hop 2.2.2.2 of BGP route is taken as tree root NH.
2, iteration route of address for the purpose of 2.2.2.2.
The longest coupling finds 2.2.2.2/32 down hop to be 4.4.4.4 and 5.5.5.5 two route, is that prefix P1, P2 add in tree 4.4.4.4 and 5.5.5.5. It is to say, from PE1 side, the down hop of PE2 is 4.4.4.4 and 5.5.5.5.
4.4.4.4 having vice-minister to mate route 4.4.4.0/24 down hop is 40.0.0.2, and 4.4.4.0 is added in tree as prefix P3.
3, the route down hop 6.6.6.6 of 4.4.4.4,5.5.5.5,4.4.4.0,50.0.0.2,40.0.0.2 are added in tree as down hop NH1, NH2, NH3, now, find that 50.0.0.2 and 40.0.0.2 is the direct-connected interface IP address in opposite end, P2, P3 finishing iteration.
4,6.6.6.6 being set to P4, iteration is the route of address for the purpose of 6.6.6.6, and the down hop finding 6.6.6.6/32 is 4.4.4.4 and 40.0.0.2 two. 4.4.4.4 and 40.0.0.2 being added in tree as NH4, NH5, now finds that node 4.4.4.4 is in tree on the path of tree root, therefore NH4 is illegal node.
5, by the processing mode of illegal N node, also it is illegal node with the illegal node NH4 P node P4 being joined directly together.
6, by the processing mode of illegal P node, the father node NH1 of P4 is not root node, therefore can not carry out suboptimum coupling what time to find other P, and therefore, NH1 is illegal node.
7, repeat the processing mode of illegal N and P node, it has been found that P1 is after illegal node, and NH root node carries out suboptimum coupling, find legal P3 node.
Now, there is BGPFRR route nested for FRR will not cyclization, it is possible to instructs and forwards. If being absent from this route of 4.4.4.0/24 on PE1, NH suboptimum coupling can not find other P node, and this routing forwarding will form loop, it is necessary to abandons.
In sum, the present invention route FRR nesting at public network and walks under LDP tunnel scene with the indirectly connected next-hop node of public network, if the iteration result of the next-hop node of route to be detected is legal path, then can find a forward-path being absent from loop, otherwise this node is looped, this node is set to invalid route, and deletes from fib table.
Although above the present invention being described in detail, but the invention is not restricted to this, those skilled in the art of the present technique can carry out various amendment according to principles of the invention. Therefore, all amendments made according to the principle of the invention, all should be understood to fall into protection scope of the present invention.
Claims (10)
1. a detection route looped method, it is characterised in that including:
The root node that route next jump is detection routing tree is set, and the root node of the subtree that down hop is described detection routing tree of described detection routing tree root node is set;
Detect the subtree of described detection routing tree;
If detecting that subtree exists duplicate node, it is determined that forwarding route corresponding to described subtree exists loop, and delete from forwarding information table and described forward route.
2. method according to claim 1, it is characterised in that set up described subtree by following steps:
The route being prefix node with the root node of described subtree is carried out route iteration process, finds the next-hop node of described prefix node;
Described next-hop node is added to described detection routing tree, and to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process;
Process and route judgement processes if it is not, then repeat route iteration with described next-hop node for prefix node, until finding next-hop node is the route of the direct-connected outgoing interface of opposite equip..
3. method according to claim 2, it is characterised in that the described step that the subtree of described detection routing tree is detected includes:
When adding described next-hop node to described detection routing tree, on the path of the root node of detection routing tree, detect whether there is described node at described node;
If detecting there is described node at described node on the path of the root node of detection routing tree, it is determined that described subtree exists duplicate node.
4. the method according to claims 1 to 3 any one, it is characterised in that also include:
If the subtree of described detection routing tree all exists duplicate node, then from described forwarding information table, delete the root node of described detection routing tree.
5. the method according to claims 1 to 3 any one, it is characterised in that also include:
If finding a subtree being absent from duplicate node in the subtree of described detection routing tree, then forward route as the route being used for forwarding packet corresponding for described subtree, and stop route cyclization detection.
6. a detection route looped device, it is characterised in that including:
Achievement module, for arranging the root node that route next jump is detection routing tree, and arranges the root node of the subtree that down hop is described detection routing tree of described detection routing tree root node;
Detection module, for detecting the subtree of described detection routing tree;
, during for there is duplicate node in processing module, it is determined that forwarding route corresponding to described subtree exists loop in subtree being detected, and described forwards route deleting from forwarding information table.
7. device according to claim 6, it is characterized in that, the route being prefix node with the root node of described subtree is carried out route iteration process by described achievement module, find the next-hop node of described prefix node, described next-hop node is added to described detection routing tree, to whether the next-hop node found is that the direct-connected outgoing interface of opposite equip. carries out route judgement process, if not, then repeat route iteration with described next-hop node for prefix node to process and route judgement process, until the route of the next-hop node the found direct-connected outgoing interface that is opposite equip..
8. device according to claim 6, it is characterized in that, described detection module is when adding described next-hop node to described detection routing tree, on the path of the root node of detection routing tree, detect whether there is described node at described node, if detecting there is described node at described node on the path of the root node of detection routing tree, it is determined that described subtree exists duplicate node.
9. the device according to claim 6 to 8 any one, it is characterized in that, if described detection module detects in the subtree of described detection routing tree all there is duplicate node, then described processing module deletes the root node of described detection routing tree from described forwarding information table.
10. the device according to claim 6 to 8 any one, it is characterized in that, if described detection module finds a subtree being absent from duplicate node in the subtree of described detection routing tree, then corresponding for described subtree is forwarded route as the route being used for forwarding packet by described processing module, and stops route cyclization detection.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410662765.1A CN105681119A (en) | 2014-11-19 | 2014-11-19 | Method and apparatus for detecting routing loop |
| PCT/CN2015/072686 WO2016078240A1 (en) | 2014-11-19 | 2015-02-10 | Method and device for detecting routing ring formation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410662765.1A CN105681119A (en) | 2014-11-19 | 2014-11-19 | Method and apparatus for detecting routing loop |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105681119A true CN105681119A (en) | 2016-06-15 |
Family
ID=56013151
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410662765.1A Pending CN105681119A (en) | 2014-11-19 | 2014-11-19 | Method and apparatus for detecting routing loop |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105681119A (en) |
| WO (1) | WO2016078240A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108600096A (en) * | 2018-03-28 | 2018-09-28 | 山西大学 | A kind of domain energy-saving method for routing based on quick heavy-route |
| CN111107006A (en) * | 2019-12-23 | 2020-05-05 | 锐捷网络股份有限公司 | Route management method and device |
| CN111953606A (en) * | 2020-07-14 | 2020-11-17 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615216B (en) * | 2022-03-11 | 2023-07-21 | 深圳市风云实业有限公司 | Routing table dynamic adjustment method based on switching chip |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459569A (en) * | 2008-12-12 | 2009-06-17 | 华为技术有限公司 | Method, apparatus for establishing route index tree and method, apparatus for searching route index tree |
| CN102420761A (en) * | 2011-12-05 | 2012-04-18 | 瑞斯康达科技发展股份有限公司 | Route iteration method |
| CN102594657A (en) * | 2011-12-20 | 2012-07-18 | 杭州华三通信技术有限公司 | Routing iteration method and routing exchange equipment |
| CN102752205A (en) * | 2012-07-04 | 2012-10-24 | 杭州华三通信技术有限公司 | Route iteration method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7453818B2 (en) * | 2006-05-01 | 2008-11-18 | Cisco Technology, Inc. | Detection of potential forwarding loops in bridged networks |
| CN101252479A (en) * | 2008-04-01 | 2008-08-27 | 杭州华三通信技术有限公司 | Loop detection method and switch |
| CN102164055A (en) * | 2011-02-23 | 2011-08-24 | 华为技术有限公司 | Detection processing method and device for signaling connection control part (SCCP) loop |
-
2014
- 2014-11-19 CN CN201410662765.1A patent/CN105681119A/en active Pending
-
2015
- 2015-02-10 WO PCT/CN2015/072686 patent/WO2016078240A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459569A (en) * | 2008-12-12 | 2009-06-17 | 华为技术有限公司 | Method, apparatus for establishing route index tree and method, apparatus for searching route index tree |
| CN102420761A (en) * | 2011-12-05 | 2012-04-18 | 瑞斯康达科技发展股份有限公司 | Route iteration method |
| CN102594657A (en) * | 2011-12-20 | 2012-07-18 | 杭州华三通信技术有限公司 | Routing iteration method and routing exchange equipment |
| CN102752205A (en) * | 2012-07-04 | 2012-10-24 | 杭州华三通信技术有限公司 | Route iteration method and device |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108600096A (en) * | 2018-03-28 | 2018-09-28 | 山西大学 | A kind of domain energy-saving method for routing based on quick heavy-route |
| CN108600096B (en) * | 2018-03-28 | 2020-08-04 | 山西大学 | Intra-domain energy-saving routing method based on fast rerouting |
| CN111107006A (en) * | 2019-12-23 | 2020-05-05 | 锐捷网络股份有限公司 | Route management method and device |
| CN111107006B (en) * | 2019-12-23 | 2022-05-20 | 锐捷网络股份有限公司 | Routing management method and device |
| CN111953606A (en) * | 2020-07-14 | 2020-11-17 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
| CN111953606B (en) * | 2020-07-14 | 2022-06-21 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016078240A1 (en) | 2016-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pei et al. | BGP-RCN: Improving BGP convergence through root cause notification | |
| US9794167B2 (en) | Bicasting using non-congruent paths in a loop-free routing topology having routing arcs | |
| US7558218B1 (en) | Method and system for finding shared risk diverse paths | |
| US9246794B2 (en) | Label distribution and route installation in a loop-free routing topology using routing arcs | |
| CN101455030B (en) | Dynamic shared risk node group (srng) membership discovery | |
| Rakheja et al. | Performance analysis of RIP, OSPF, IGRP and EIGRP routing protocols in a network | |
| CN104283789B (en) | Route convergent method and system | |
| CN104065576B (en) | Label switching method in dynamic MPLS satellite network | |
| US7965642B2 (en) | Computing path information to a destination node in a data communication network | |
| JP2012529198A (en) | Method and apparatus at multiple rendezvous points for co-processing multicast traffic from mobile multicast sources | |
| CN103004144B (en) | switch | |
| CN102075419B (en) | Method for generating and transmitting three-layer virtual special network equative routing and edge router | |
| CN105681119A (en) | Method and apparatus for detecting routing loop | |
| CN110752997B (en) | Named data network forwarding method for data packet active path finding | |
| Yang et al. | Fast rerouting against multi-link failures without topology constraint | |
| CN105917617A (en) | Single hop overlay architecture for line rate performance in campus networks | |
| Papan et al. | The new multicast repair (M‐REP) IP fast reroute mechanism | |
| CN104243303B (en) | The method and apparatus for updating message are sent in a kind of autonomous system loop networking | |
| CN104937878A (en) | Method to setup protocol independent multicast trees in the presence of unidirectional tunnels | |
| WO2019212678A1 (en) | Explicit backups and fast re-route mechanisms for preferred path routes in a network | |
| CN103634218A (en) | Fast routing convergence method and fast routing convergence device | |
| Somasundaram et al. | Path optimization and trusted routing in manet: An interplay between ordered semirings | |
| CN102710522A (en) | Method and device for configuring reversing path forwarding (RPF) rule in transparent interconnection of lots of link (TRILL) network | |
| US20220123994A1 (en) | System and Method for Abstracting an IGP Zone | |
| CN101621468B (en) | Method for establishing protective tunnel router |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160615 |