CN104486214A - Method and device for realizing RIP rapid rerouting - Google Patents
Method and device for realizing RIP rapid rerouting Download PDFInfo
- Publication number
- CN104486214A CN104486214A CN201410831210.5A CN201410831210A CN104486214A CN 104486214 A CN104486214 A CN 104486214A CN 201410831210 A CN201410831210 A CN 201410831210A CN 104486214 A CN104486214 A CN 104486214A
- Authority
- CN
- China
- Prior art keywords
- route
- hypo
- optimal
- metric
- routing table
- 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method and a device for realizing RIP rapid rerouting. The device is applied to a router in operation routing information protocol RIP network. The method comprises the following steps: updating an RIP routing table; dispatching an optimal route and a secondary route including backup marks in the RIP routing table, wherein the optimal route and the secondary route are used as rapid rerouting FRR. According to the technical scheme, the dependence on the optimal route by the backup route can be avoided, and the reliability of RIP rapid rerouting is improved.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of method and apparatus realizing RIP Quickly regroup.
Background technology
RIP (Routing Information Protocol, routing information protocol) be a kind of based on DV (Distance-Vector, distance vector) agreement of algorithm, it carries out the exchange of routing iinformation by UDP (User DatagramProtocol, User Datagram Protocol) message.
BFD (Bidirectional Forwarding Detection, two-way converting detects) be that general, standardized a, medium has nothing to do and the quick fault testing mechanism of protocol-independent, for detecting the connection situation of IP network link, between guarantee equipment can fast detecting to communication failure, can take measures in time, ensure business continuous service.
RIP FRR (Fast ReRoute, Quickly regroup) carry out link detecting by technology such as BFD, if detect that primary link breaks down, data traffic is switched on backup link, and goes again to switch flow after waiting for new topological network routing convergence.
But the backup link in current RIP FRR is the manual configuration come from routing policy.Therefore, before startup FRR function, must configure backup outgoing interface and backup down hop in advance according to network topology in routing policy, then RIP goes to quote this routing policy again.And when network topology changes, backup link can not the change of adaptive network, the unreachable data traffic caused of backup link so may be caused to interrupt.
Summary of the invention
In view of this, the invention provides a kind of method and apparatus realizing RIP Quickly regroup, route stand-by can be avoided the dependence of optimum route, improve the reliability of RIP Quickly regroup.
Particularly, described method is applied on the router in operation RIP network, comprising:
RIP routing table is upgraded;
Optimum route in described RIP routing table and the hypo-optimal route comprising backup mark are issued as Quickly regroup FRR.
Described device is run the router in RIP network, comprising:
First processing module, for upgrading RIP routing table;
Second processing module, for issuing the optimum route in described RIP routing table and the hypo-optimal route comprising backup mark as Quickly regroup FRR.
From above technical scheme, the present invention is by being stored as hypo-optimal route by the non-optimal route in RIP routing table and carrying out hypo-optimal route preferably, for preferred hypo-optimal route increases backup mark, optimum route and the hypo-optimal route comprising backup mark are issued as FRR, avoid the manual configuration of route stand-by and the dependence to optimum route, thus avoid the data traffic interruption caused because route stand-by is unreachable, improve the reliability of RIP FRR.
Accompanying drawing explanation
Fig. 1 is the flow chart of the method realizing RIP Quickly regroup in one embodiment of the present invention;
Fig. 2 is the building-block of logic of the device realizing RIP Quickly regroup in one embodiment of the present invention.
Embodiment
In actual applications, if the router in network newly acquires a route, RIP route will be carried out preferably, if the optimum route preferably forms equal-cost route, then issue equal-cost route; If the optimum route preferably does not form equal-cost route, then need to check whether in routing policy be this routing configuration route stand-by, if, then the route stand-by composition FRR configured in the optimum route after preferably and routing policy is issued, if not, then only using the optimum route after preferably as common route sending-down.Wherein, optimum route refers to that router arrives the minimum route of destination address expense; Equal-cost route refers to that router arrives destination address and uses wherein any routing cost all the same; Route stand-by refers to the route that backup uses when optimum route is unreachable; FRR refers to combine route, comprises optimum route and route stand-by; Common route refers to wall scroll route, only comprises optimum route.
Local routing table is periodically sent to adjacent router by RIP, and only can by optimum route sending-down to FIB (Forward Information Base, forwarding information base) or drive and go to instruct traffic forwarding, and can be considered to valueless at all to non-optimal route and be simply discarded.So the route stand-by in FRR comes from the manual configuration in routing policy, and if network topology changes, route stand-by can not the change of adaptive network, and the unreachable data traffic caused of route stand-by may be caused to interrupt.
Route stand-by in FRR route depends on optimum route completely.When RIP FRR carries out link detecting by BFD, BFD can perceive link failure prior to RIP, so flow will be switched on backup link fast after BFD detects primary link failure, and after RIP perceives link failure after a while, optimum route can be deleted.Because route stand-by places one's entire reliance upon optimum route, when optimum route is deleted, route stand-by also can be deleted, so may cause the interruption again of data traffic.
The present invention solves by removing the dependence of route stand-by to optimum route the predicament faced at present.Please refer to Fig. 1, the invention provides a kind of method realizing RIP Quickly regroup, be applied on the router in operation routing information protocol RIP network, in one embodiment of the invention, described method comprises the steps:
Step 101, upgrades RIP routing table.
Step 102, issues the optimum route in described RIP routing table and the hypo-optimal route comprising backup mark as Quickly regroup FRR.
Of the present inventionly realize in the method for RIP Quickly regroup, RIP retains optimum route and non-optimal route, non-optimal route is stored as hypo-optimal route, and carry out preferably to hypo-optimal route, for the hypo-optimal route preferably adds backup mark as route stand-by, take over the work of optimum route when optimum route is unreachable, thus the manual configuration relieving route stand-by cause the dependence to optimum route.
Wherein, carry out renewal to RIP routing table to comprise:
When learning new route, judge in the metric of described new route and described RIP routing table as the first via of optimum route by the relation of metric;
If the metric of described new route be greater than in described RIP routing table as the first via of optimum route by metric, then judge whether to exist in described RIP routing table comprise backup mark hypo-optimal route;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, then described new route be stored as hypo-optimal route and add backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, then described new route is stored as hypo-optimal route.
In the metric judging described new route and described RIP routing table as the first via of optimum route by metric relation after, also comprise:
If the metric of described new route be less than in described RIP routing table as the first via of optimum route by metric, then described new route is stored as optimum route;
Judge whether to exist in described RIP routing table the hypo-optimal route comprising backup mark;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route and adding backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route.
Instantiation is enumerated below by carrying out renewal according to the new route learnt to RIP routing table.
Table 1
Suppose the route that there are two 10.0.0.0/8 as shown in table 1 in RIP routing table, metric be 3 route be optimum route, metric be 5 route be hypo-optimal route, be in the hypo-optimal route of 5, increase backup mark at metric, and this two group of routes synthesis FRR issued.
Table 2
If as shown in table 2, router has acquired the new route of 10.0.0.0/8 that a metric is 2 from network, then the metric 2 of this new route is less than the minimum degree value 3 in RIP routing table, then this new route is stored as optimum route, but this new route does not have equal-cost route, in addition, now having there is the metric comprising backup mark is the hypo-optimal route of 5, in order to ensure the stability of network, only revise optimum route, by metric be 2 new route and the metric that comprises backup mark be 5 hypo-optimal route form new FRR and issue, the former optimum route of metric 3 is stored as hypo-optimal route.
Table 3
If as shown in table 3, router has acquired the new route of 10.0.0.0/8 that a metric is 4 from network, then the metric 4 of this new route is greater than the minimum degree value 3 in RIP routing table, then this new route is not optimum route; Although the new route that metric is 4 is better than the hypo-optimal route that metric is 5, but because be not optimum route, in order to ensure the stability of network, now there is no need as new route that metric is 4 increases backup mark that to replace the metric comprising backup mark be the hypo-optimal route of 5, and new route is preserved as hypo-optimal route.
Therefore can find out, if hypo-optimal route has contained backup mark, as long as so this route can reach, just will comprise backup mark always, until route is unreachable, unnecessary network concussion can be avoided like this.
In embodiments of the present invention, needing to upgrade RIP routing table except learning new route, also there is the situation of already present routing update in RIP routing table, being described respectively below.
RIP routing table is upgraded, comprising:
When the hypo-optimal route comprising backup mark is unreachable, judge whether there are other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of metric adds backup mark; If there is no other hypo-optimal routes, then issue optimum route as common route.
RIP routing table is upgraded, comprising:
When comprising the metric change of hypo-optimal route of backup mark, judge the new metric of the hypo-optimal route comprising backup mark with as optimum route the first via by the relation of metric;
If the new metric of hypo-optimal route comprising backup mark be less than as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, described hypo-optimal route is changed to new optimum route, and is that the described first via changes to new hypo-optimal route by adding backup mark; If the new metric of hypo-optimal route comprising backup mark equal as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, by described hypo-optimal route and the first via by being stored as equal-cost route.
RIP routing table is upgraded, comprising:
When perceiving primary link and breaking down, judge that whether the metric of the hypo-optimal route comprising backup mark is the minimum degree value in described RIP routing table;
If the metric comprising the hypo-optimal route of backup mark is the minimum degree value in described RIP routing table, then removes the backup mark of described hypo-optimal route, and described hypo-optimal route is stored as new optimum route;
Judge whether comprise other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of other hypo-optimal route moderate values described adds backup mark, and delete fault route.
Present invention also offers a kind of device realizing RIP Quickly regroup, this application of installation is in operating in the router in routing information protocol RIP network, as the operation carrier of this logic device, the hardware environment of the device of the described RIP of realization Quickly regroup at least all comprises CPU, internal memory and nonvolatile memory usually.Please refer to Fig. 2, in one embodiment of the invention, described device also comprises:
First processing module, for upgrading RIP routing table.
Second processing module, for issuing the optimum route in described RIP routing table and the hypo-optimal route comprising backup mark as Quickly regroup FRR.
Wherein, the first processing module, specifically for: when learning new route, judge in the metric of described new route and described RIP routing table as the first via of optimum route by the relation of metric;
If the metric of described new route be greater than in described RIP routing table as the first via of optimum route by metric, then judge whether to exist in described RIP routing table comprise backup mark hypo-optimal route;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, then described new route be stored as hypo-optimal route and add backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, then described new route is stored as hypo-optimal route.
In the metric judging described new route and described RIP routing table as the first via of optimum route by metric relation after, also comprise:
If the metric of described new route be less than in described RIP routing table as the first via of optimum route by metric, then described new route is stored as optimum route;
Judge whether to exist in described RIP routing table the hypo-optimal route comprising backup mark;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route and adding backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route.
First processing module, specifically for: when the hypo-optimal route comprising backup mark is unreachable, judge whether there are other hypo-optimal routes in described RIP routing table; If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of metric adds backup mark; If there is no other hypo-optimal routes, then issue optimum route as common route.
First processing module, specifically for: when comprising the metric change of hypo-optimal route of backup mark, judge the new metric of the hypo-optimal route comprising backup mark with as optimum route the first via by the relation of metric; If the new metric of hypo-optimal route comprising backup mark be less than as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, described hypo-optimal route is changed to new optimum route, and is that the described first via changes to new hypo-optimal route by adding backup mark; If the new metric of hypo-optimal route comprising backup mark equal as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, by described hypo-optimal route and the first via by being stored as equal-cost route.
First processing module, specifically for: when perceiving primary link and breaking down, judge that whether the metric of the hypo-optimal route comprising backup mark is the minimum degree value in described RIP routing table; If the metric comprising the hypo-optimal route of backup mark is the minimum degree value in described RIP routing table, then removes the backup mark of described hypo-optimal route, and described hypo-optimal route is stored as new optimum route; Judge whether comprise other hypo-optimal routes in described RIP routing table; If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of other hypo-optimal route moderate values described adds backup mark, and delete fault route.
By describing above and can finding out, the present invention realizes the method and apparatus of RIP Quickly regroup, by the non-optimal route in RIP routing table being stored as hypo-optimal route and carrying out hypo-optimal route preferably, for preferred hypo-optimal route increases backup mark, optimum route in RIP routing table and the hypo-optimal route comprising backup mark are issued as FRR, avoid the manual configuration of route stand-by and the dependence to optimum route, thus avoid the data traffic interruption caused because route stand-by is unreachable, improve the reliability of RIP Quickly regroup.
In addition, if RIP perceives primary link and breaks down, delete fault route again after then again choosing according to RIP routing table, thus avoid because main/slave link deletes the interruption again of the data traffic caused simultaneously, improve the reliability of RIP Quickly regroup further.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within the scope of protection of the invention.
Claims (12)
1. realize a method for RIP Quickly regroup, be applied on the router in operation routing information protocol RIP network, it is characterized in that, comprising:
RIP routing table is upgraded;
Optimum route in described RIP routing table and the hypo-optimal route comprising backup mark are issued as Quickly regroup FRR.
2. method according to claim 1, is characterized in that, describedly carries out renewal to RIP routing table and comprises:
When learning new route, judge in the metric of described new route and described RIP routing table as the first via of optimum route by the relation of metric;
If the metric of described new route be greater than in described RIP routing table as the first via of optimum route by metric, then judge whether to exist in described RIP routing table comprise backup mark hypo-optimal route;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, then described new route be stored as hypo-optimal route and add backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, then described new route is stored as hypo-optimal route.
3. method according to claim 2, is characterized in that, in the metric judging described new route and described RIP routing table as the first via of optimum route by metric relation after, also comprise:
If the metric of described new route be less than in described RIP routing table as the first via of optimum route by metric, then described new route is stored as optimum route;
Judge whether to exist in described RIP routing table the hypo-optimal route comprising backup mark;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route and adding backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route.
4. method according to claim 1, is characterized in that, describedly carries out renewal to RIP routing table and comprises:
When the hypo-optimal route comprising backup mark is unreachable, judge whether there are other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of metric adds backup mark; If there is no other hypo-optimal routes, then issue optimum route as common route.
5. method according to claim 1, is characterized in that, describedly carries out renewal to RIP routing table and comprises:
When comprising the metric change of hypo-optimal route of backup mark, judge the new metric of the hypo-optimal route comprising backup mark with as optimum route the first via by the relation of metric;
If the new metric of hypo-optimal route comprising backup mark be less than as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, described hypo-optimal route is changed to new optimum route, and is that the described first via changes to new hypo-optimal route by adding backup mark; If the new metric of hypo-optimal route comprising backup mark equal as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, by described hypo-optimal route and the first via by being stored as equal-cost route.
6. method according to claim 1, is characterized in that, describedly carries out renewal to RIP routing table and comprises:
When perceiving primary link and breaking down, judge that whether the metric of the hypo-optimal route comprising backup mark is the minimum degree value in described RIP routing table;
If the metric comprising the hypo-optimal route of backup mark is the minimum degree value in described RIP routing table, then removes the backup mark of described hypo-optimal route, and described hypo-optimal route is stored as new optimum route;
Judge whether comprise other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of other hypo-optimal route moderate values described adds backup mark, and delete fault route.
7. realize a device for RIP Quickly regroup, be applied to the router operated in RIP network, it is characterized in that, comprising:
First processing module, for upgrading RIP routing table;
Second processing module, for issuing the optimum route in described RIP routing table and the hypo-optimal route comprising backup mark as Quickly regroup FRR.
8. device according to claim 7, is characterized in that, described first processing module, specifically for:
When learning new route, judge in the metric of described new route and described RIP routing table as the first via of optimum route by the relation of metric;
If the metric of described new route be greater than in described RIP routing table as the first via of optimum route by metric, then judge whether to exist in described RIP routing table comprise backup mark hypo-optimal route;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, then described new route be stored as hypo-optimal route and add backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, then described new route is stored as hypo-optimal route.
9. device according to claim 8, is characterized in that, described first processing module in the metric judging described new route and described RIP routing table as the first via of optimum route by metric relation after, also comprise:
If the metric of described new route be less than in described RIP routing table as the first via of optimum route by metric, then described new route is stored as optimum route;
Judge whether to exist in described RIP routing table the hypo-optimal route comprising backup mark;
If there is not the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route and adding backup mark; If there is the hypo-optimal route comprising backup mark in described RIP routing table, by the described first via by being stored as hypo-optimal route.
10. device according to claim 7, is characterized in that, described first processing module, specifically for:
When the hypo-optimal route comprising backup mark is unreachable, judge whether there are other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of metric adds backup mark; If there is no other hypo-optimal routes, then issue optimum route as common route.
11. devices according to claim 7, is characterized in that, described first processing module, specifically for:
When comprising the metric change of hypo-optimal route of backup mark, judge the new metric of the hypo-optimal route comprising backup mark with as optimum route the first via by the relation of metric;
If the new metric of hypo-optimal route comprising backup mark be less than as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, described hypo-optimal route is changed to new optimum route, and is that the described first via changes to new hypo-optimal route by adding backup mark; If the new metric of hypo-optimal route comprising backup mark equal as optimum route the first via by metric, then remove the backup mark of described hypo-optimal route, by described hypo-optimal route and the first via by being stored as equal-cost route.
12. devices according to claim 7, is characterized in that, described first processing module, specifically for:
When perceiving primary link and breaking down, judge that whether the metric of the hypo-optimal route comprising backup mark is the minimum degree value in described RIP routing table;
If the metric comprising the hypo-optimal route of backup mark is the minimum degree value in described RIP routing table, then removes the backup mark of described hypo-optimal route, and described hypo-optimal route is stored as new optimum route;
Judge whether comprise other hypo-optimal routes in described RIP routing table;
If there is other hypo-optimal routes, be then that the minimum hypo-optimal route of other hypo-optimal route moderate values described adds backup mark, and delete fault route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410831210.5A CN104486214B (en) | 2014-12-26 | 2014-12-26 | The method and apparatus for realizing the quick heavy-routes of RIP |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410831210.5A CN104486214B (en) | 2014-12-26 | 2014-12-26 | The method and apparatus for realizing the quick heavy-routes of RIP |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104486214A true CN104486214A (en) | 2015-04-01 |
| CN104486214B CN104486214B (en) | 2018-01-09 |
Family
ID=52760720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410831210.5A Active CN104486214B (en) | 2014-12-26 | 2014-12-26 | The method and apparatus for realizing the quick heavy-routes of RIP |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104486214B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104767680A (en) * | 2015-04-15 | 2015-07-08 | 杭州华三通信技术有限公司 | Rapid route switch method and device |
| CN106453091A (en) * | 2016-10-28 | 2017-02-22 | 武汉烽火网络有限责任公司 | Equivalent routing management method and device of router forwarding plane |
| CN106878166A (en) * | 2017-01-22 | 2017-06-20 | 新华三技术有限公司 | Route advertising method and device |
| RU2633191C1 (en) * | 2016-03-24 | 2017-10-11 | Константин Евгеньевич Легков | Quasi-static method for controlling flow of requirements in special-purpose information-communication system |
| CN113315699A (en) * | 2021-05-17 | 2021-08-27 | Ut斯达康通讯有限公司 | Multi-master multi-standby fast rerouting system and method for distinguishing priority |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102281200A (en) * | 2011-08-24 | 2011-12-14 | 华为技术有限公司 | Method for selecting current backup route and router |
| CN102347885A (en) * | 2010-07-29 | 2012-02-08 | 杭州华三通信技术有限公司 | Route switching method and device |
| CN103428085A (en) * | 2013-08-12 | 2013-12-04 | 杭州华三通信技术有限公司 | Method and device for rapidly switching RIP (routing information protocol) routings |
-
2014
- 2014-12-26 CN CN201410831210.5A patent/CN104486214B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102347885A (en) * | 2010-07-29 | 2012-02-08 | 杭州华三通信技术有限公司 | Route switching method and device |
| CN102281200A (en) * | 2011-08-24 | 2011-12-14 | 华为技术有限公司 | Method for selecting current backup route and router |
| CN103428085A (en) * | 2013-08-12 | 2013-12-04 | 杭州华三通信技术有限公司 | Method and device for rapidly switching RIP (routing information protocol) routings |
Non-Patent Citations (1)
| Title |
|---|
| 王滨等: "《基于距离矢量路由协议的网络故障快速恢复方法》", 《北京邮电大学学报》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104767680A (en) * | 2015-04-15 | 2015-07-08 | 杭州华三通信技术有限公司 | Rapid route switch method and device |
| CN104767680B (en) * | 2015-04-15 | 2018-05-25 | 新华三技术有限公司 | It route the method and apparatus being switched fast |
| RU2633191C1 (en) * | 2016-03-24 | 2017-10-11 | Константин Евгеньевич Легков | Quasi-static method for controlling flow of requirements in special-purpose information-communication system |
| CN106453091A (en) * | 2016-10-28 | 2017-02-22 | 武汉烽火网络有限责任公司 | Equivalent routing management method and device of router forwarding plane |
| CN106453091B (en) * | 2016-10-28 | 2019-04-30 | 烽火通信科技股份有限公司 | The equivalent route management method and device of router Forwarding plane |
| CN106878166A (en) * | 2017-01-22 | 2017-06-20 | 新华三技术有限公司 | Route advertising method and device |
| CN106878166B (en) * | 2017-01-22 | 2020-04-03 | 新华三技术有限公司 | Route notification method and device |
| CN113315699A (en) * | 2021-05-17 | 2021-08-27 | Ut斯达康通讯有限公司 | Multi-master multi-standby fast rerouting system and method for distinguishing priority |
| CN113315699B (en) * | 2021-05-17 | 2022-05-17 | Ut斯达康通讯有限公司 | Multi-master multi-standby fast rerouting system and method for distinguishing priority |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104486214B (en) | 2018-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10637686B2 (en) | Capability aware routing | |
| JP7327876B2 (en) | Method and system for determining packet forwarding paths and network nodes | |
| CN102598599B (en) | RSVP-TE graceful restart under fast re-route conditions | |
| US7508772B1 (en) | Partial graceful restart for border gateway protocol (BGP) | |
| CN104486214A (en) | Method and device for realizing RIP rapid rerouting | |
| US9049131B2 (en) | Network system and load balancing method | |
| US8004964B2 (en) | Restoring multi-segment pseudowires following failure of a switching PE device | |
| US8456982B2 (en) | System and method for fast network restoration | |
| EP1821453A1 (en) | A method for quickly rerouting | |
| KR20150051107A (en) | Method for fast flow path setup and failure recovery | |
| CN102088415B (en) | Method and device for MAC (media access control) address withdrawal | |
| CN104954288A (en) | Information transmission method and device, and communication system | |
| CN102316041A (en) | Router switching method and device | |
| US7860027B2 (en) | Extending an IP everywhere network over a plurality of flooding domains | |
| JP5965335B2 (en) | COMMUNICATION SYSTEM AND ROUTE CONTROL METHOD | |
| US8750286B2 (en) | Network communication system, communication device, network linkage method and program thereof | |
| CN112929261B (en) | Fiber breakage prevention method and device for segmented routing tunnel, entry node and storage medium | |
| CN107770061B (en) | Method and equipment for forwarding message | |
| CN103139040B (en) | The VPN FRR implementation method of a kind of extension and equipment | |
| CN109039916B (en) | Message forwarding method, device and storage medium | |
| CN111464440A (en) | Communication method and device | |
| JP6042838B2 (en) | Management system, management server, and management method | |
| US7869351B2 (en) | Communication techniques and generic layer 3 automatic switching protection | |
| CN107409132B (en) | Method and network node for dynamically configuring flow segmentation by software defined network control signaling | |
| CN102201987A (en) | Layer 3 interface connected route backup method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: Xinhua three Technology Co., Ltd. Address before: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant before: Huasan Communication Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |