CN104486214B - The method and apparatus for realizing the quick heavy-routes of RIP - Google Patents
The method and apparatus for realizing the quick heavy-routes of RIP Download PDFInfo
- Publication number
- CN104486214B CN104486214B CN201410831210.5A CN201410831210A CN104486214B CN 104486214 B CN104486214 B CN 104486214B CN 201410831210 A CN201410831210 A CN 201410831210A CN 104486214 B CN104486214 B CN 104486214B
- Authority
- CN
- China
- Prior art keywords
- hypo
- route
- optimal route
- optimal
- rip
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of method and apparatus for realizing the quick heavy-routes of RIP, applies on the router in running routing information protocol RIP networks, wherein method includes：RIP routing tables are updated；Optimal route in the RIP routing tables and the hypo-optimal route comprising backup mark are issued as quick heavy-route FRR.By technical scheme, dependence of the route stand-by to optimal route can be avoided, improves the reliability of the quick heavy-routes of RIP.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of method and apparatus for realizing the quick heavy-routes of RIP.
Background technology
RIP (Routing Information Protocol, routing information protocol) is that one kind is based on DV (Distance-
Vector, distance vector) algorithm agreement, it pass through UDP (User Datagram Protocol, User Datagram Protocol) report
Text carries out the exchange of routing iinformation.
BFD (Bidirectional Forwarding Detection, two-way converting detection) is a general, standard
Quick fault testing mechanism change, that medium is unrelated and agreement is unrelated, for detecting the connection situation of IP network link, ensure
Communication failure can be quickly detected between equipment, so as to take measures in time, ensures business continuous service.
RIP FRR (Fast ReRoute, quick heavy-route) carry out link detecting by technologies such as BFD, if detected
Primary link is broken down, and data traffic is switched on backup link, without waiting new topological network routing convergence to finish
Go to switch flow again afterwards.
But the backup link in RIP FRR comes from the manual configuration in routing policy at present.Therefore, starting
Before FRR functions, it is necessary to configure backup outgoing interface and backup next-hop in routing policy in advance according to network topology, then
RIP goes to quote this routing policy again.And when network topology changes, backup link can not adaptive network change
Change, may so cause the unreachable caused data traffic of backup link to interrupt.
The content of the invention
In view of this, the present invention provides a kind of method and apparatus for realizing the quick heavy-routes of RIP, can avoid route stand-by
Dependence to optimal route, improve the reliability of the quick heavy-routes of RIP.
Specifically, methods described is applied on the router in running RIP networks, including：
RIP routing tables are updated；
Using the optimal route in the RIP routing tables and the hypo-optimal route comprising backup mark as quick heavy-route FRR
Issued.
Described device is the router in operation RIP networks, including：
First processing module, for being updated to RIP routing tables；
Second processing module, for by the optimal route in the RIP routing tables and include backup mark hypo-optimal route
Issued as quick heavy-route FRR.
From above technical scheme, the present invention by the non-optimal route in RIP routing tables by being stored as hypo-optimal route
And hypo-optimal route is carried out preferably, increase backup mark for preferable hypo-optimal route, route and include what backup marked by optimal
Hypo-optimal route is issued as FRR, the manual configuration of route stand-by and the dependence to optimal route is avoided, so as to avoid
The data traffic caused by route stand-by is unreachable is interrupted, and improves RIP FRR reliability.
Brief description of the drawings
Fig. 1 is the flow chart for the method that the quick heavy-routes of RIP are realized in one embodiment of the present invention；
Fig. 2 is the building-block of logic for the device that the quick heavy-routes of RIP are realized in one embodiment of the present invention.
Embodiment
In actual applications, if the router in network newly acquires a route, RIP routes will be carried out preferably, if
Optimal route after it is preferred that forms equal-cost route, then issues equal-cost route；If the optimal route after it is preferred that does not form equivalence
Route, then need to check the route stand-by that whether has been the routing configuration in routing policy, if it is, will preferably after optimal road
Issued by forming FRR with the route stand-by configured in routing policy, if it is not, then the optimal route after only will be preferred is as common
Route sending-down.Wherein, optimal route refers to the route that router arrives at location expense minimum；Equal-cost route refers to router arrival
Destination address uses one routing cost of any of which；Route stand-by refers to what the backup when optimal route is unreachable used
Route；FRR refers to combination route, including optimal route and route stand-by；Common route refers to wall scroll route, only comprising optimal route.
Local routing table is periodically sent to adjacent router by RIP, and only can be by optimal route sending-down to FIB
(Forward Information Base, forwarding information storehouse) or driving go to instruct flow to forward, and to non-optimal route meeting
It is considered as valueless at all and is simply discarded.So the route stand-by in FRR comes from the manual configuration in routing policy, and such as
Fruit network topology changes, route stand-by can not adaptive network change, be likely to result in that route stand-by is unreachable to be drawn
The data traffic risen is interrupted.
Route stand-by in FRR routes depends on optimal route completely.When RIP FRR carry out link detecting by BFD,
BFD can perceive link failure prior to RIP, so flow will be quickly switched into backup after BFD detects primary link failure
On link, and after RIP perceives link failure later, optimal route can be deleted.Due to route stand-by place one's entire reliance upon it is optimal
Route, when optimal route is deleted, route stand-by can also be deleted, it is possible that the interruption again of data traffic can be caused.
The present invention is by releasing the predicament that relies on to solve at present face of the route stand-by to optimal route.It refer to Fig. 1,
The invention provides a kind of method for realizing the quick heavy-routes of RIP, applies the route in routing information protocol RIP networks are run
On device, in one embodiment of the invention, methods described comprises the following steps：
Step 101, RIP routing tables are updated.
Step 102, using the optimal route in the RIP routing tables and the hypo-optimal route comprising backup mark as quick weight
Route FRR is issued.
The present invention the method for realizing the quick heavy-routes of RIP in, RIP retain it is optimal route and non-optimal route, by it is non-most
Excellent route is stored as hypo-optimal route, and hypo-optimal route is carried out preferably, and conduct is marked for the hypo-optimal route addition backup after preferably
Route stand-by, the work of optimal route is taken over when optimal route is unreachable, is led so as to relieve the manual configuration of route stand-by
Cause dependence of the ground to optimal route.
Wherein, RIP routing tables are updated including：
When study is to new route, judge the metric of the new route with being used as optimal route in the RIP routing tables
The first via by metric relation；
If the metric of the new route be more than the RIP routing tables in as optimal route the first via by measurement
Value, then judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, the new route is stored as
Hypo-optimal route simultaneously adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by described in
New route is stored as hypo-optimal route.
Judge the metric of the new route with the RIP routing tables as optimal route the first via by measurement
After the relation of value, in addition to：
If the metric of the new route be less than the RIP routing tables in as optimal route the first via by measurement
Value, then the new route is stored as optimal route；
Judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, by the first via by being stored as
Hypo-optimal route simultaneously adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by described the
One route is stored as hypo-optimal route.
Instantiation will be enumerated to being updated according to the new route learnt to RIP routing tables below.
Table 1
Assuming that two 10.0.0.0/8 as shown in table 1 route in RIP routing tables be present, the route that metric is 3 is
Optimal route, metric be 5 route be hypo-optimal route, metric be 5 hypo-optimal route in increase backup mark, and by this
Two routes are combined into FRR and issued.
Table 2
If as shown in table 2, router has been acquired the 10.0.0.0/8 that a metric is 2 from network and newly route, then
The metric 2 of the new route is less than the minimum degree value 3 in RIP routing tables, then the new route is stored as optimal route, but this is new
No equal-cost route is route, in addition, the hypo-optimal route that the metric comprising backup mark is 5 be present, in order to ensure network
Stability, only change optimal route, i.e., by new route that metric is 2 and the suboptimum that metric comprising backup mark is 5
Route forms new FRR and issued, and the former optimal route of metric 3 is stored as into hypo-optimal route.
Table 3
If as shown in table 3, router has been acquired the 10.0.0.0/8 that a metric is 4 from network and newly route, then
The metric 4 of the new route is more than the minimum degree value 3 in RIP routing tables, then the new route is not optimal route；Although measurement
It is worth the new route for 4 better than the hypo-optimal route that metric is 5, but because is not optimal route, in order to ensure the stabilization of network
Property, now It is not necessary to be that the new route increase backup that metric is 4 is marked to replace the metric of included backup mark
For 5 hypo-optimal route, and preserved newly routeing as hypo-optimal route.
It can thus be seen that if hypo-optimal route has contained backup mark, then, just will always as long as the route is reachable
Marked comprising backup, untill route is unreachable, can so avoid unnecessary network concussion.
In embodiments of the present invention, need to be updated RIP routing tables except learning new route, RIP also be present
The situation of already present routing update in routing table, it will illustrate respectively below.
RIP routing tables are updated, including：
When the hypo-optimal route comprising backup mark is unreachable, judge to whether there is other suboptimums in the RIP routing tables
Route；
Then it is the minimum hypo-optimal route addition backup mark of metric if there is other hypo-optimal routes；If there is no
Other hypo-optimal routes, then issued optimal route as common route.
RIP routing tables are updated, including：
When the measurement value changes of the hypo-optimal route comprising backup mark, the new of the hypo-optimal route comprising backup mark is judged
Metric with as optimal route the first via by metric relation；
If comprising backup mark hypo-optimal route new metric be less than as optimal route the first via by measurement
Value, then remove the backup mark of the hypo-optimal route, the hypo-optimal route is changed into new optimal route, and be the first via
New hypo-optimal route is changed to by adding backup mark；If the new metric of the hypo-optimal route comprising backup mark is equal to as most
The first via of excellent route by metric, then remove the hypo-optimal route backup mark, by the hypo-optimal route and the first via
By being stored as equal-cost route.
RIP routing tables are updated, including：
When perceiving primary link and breaking down, whether the metric for judging the hypo-optimal route comprising backup mark is described
Minimum degree value in RIP routing tables；
If the metric of the hypo-optimal route comprising backup mark is the minimum degree value in the RIP routing tables, clearly
Except the backup of the hypo-optimal route marks, and the hypo-optimal route is stored as new optimal route；
Judge whether include other hypo-optimal routes in the RIP routing tables；
It is if there is other hypo-optimal routes, then standby for the minimum hypo-optimal route addition of other described hypo-optimal route moderate values
Part mark, and delete failure route.
Present invention also offers a kind of device for realizing the quick heavy-routes of RIP, the device is applied to operate in routing iinformation
Router in agreement RIP networks, as the operation carrier of the logic device, the device for realizing the quick heavy-routes of RIP
Hardware environment typically at least all includes CPU, internal memory and nonvolatile memory.Fig. 2 is refer to, a kind of in the present invention implements
In mode, described device also includes：
First processing module, for being updated to RIP routing tables.
Second processing module, for by the optimal route in the RIP routing tables and include backup mark hypo-optimal route
Issued as quick heavy-route FRR.
Wherein, first processing module, it is specifically used for：When study is to new route, judge the new route metric and
In the RIP routing tables as optimal route the first via by metric relation；
If the metric of the new route be more than the RIP routing tables in as optimal route the first via by measurement
Value, then judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, the new route is stored as
Hypo-optimal route simultaneously adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by described in
New route is stored as hypo-optimal route.
Judge the metric of the new route with the RIP routing tables as optimal route the first via by measurement
After the relation of value, in addition to：
If the metric of the new route be less than the RIP routing tables in as optimal route the first via by measurement
Value, then the new route is stored as optimal route；
Judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, by the first via by being stored as
Hypo-optimal route simultaneously adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by described the
One route is stored as hypo-optimal route.
First processing module, it is specifically used for：When the hypo-optimal route comprising backup mark is unreachable, the RIP roads are judged
By whether there is other hypo-optimal routes in table；Then it is the minimum hypo-optimal route addition of metric if there is other hypo-optimal routes
Backup mark；If there is no other hypo-optimal routes, then issued optimal route as common route.
First processing module, it is specifically used for：When the measurement value changes of the hypo-optimal route comprising backup mark, judge to include
Back up mark hypo-optimal route new metric with as optimal route the first via by metric relation；If comprising standby
Part mark hypo-optimal route new metric be less than as optimal route the first via by metric, then remove the suboptimum road
By backup mark, the hypo-optimal route is changed to new optimal route, and mark change is backed up by addition for the first via
For new hypo-optimal route；If comprising backup mark hypo-optimal route new metric be equal to as optimal route the first via by
Metric, then the backup mark of the hypo-optimal route is removed, by the hypo-optimal route and the first via by being stored as equal-cost route.
First processing module, it is specifically used for：When perceiving primary link and breaking down, judge to include the suboptimum of backup mark
Whether the metric of route is minimum degree value in the RIP routing tables；If the degree of the hypo-optimal route comprising backup mark
Value is the minimum degree value in the RIP routing tables, then removes the backup mark of the hypo-optimal route, and by the suboptimum road
By being stored as new optimal route；Judge whether include other hypo-optimal routes in the RIP routing tables；If there is other suboptimum roads
By being then the minimum hypo-optimal route addition backup mark of other described hypo-optimal route moderate values, and delete failure route.
By above description as can be seen that the method and apparatus that the present invention realizes the quick heavy-routes of RIP, by by RIP roads
Hypo-optimal route is stored as by the non-optimal route in table and hypo-optimal route is carried out preferably, for the increase backup of preferable hypo-optimal route
Mark, the optimal route in RIP routing tables and the hypo-optimal route comprising backup mark are issued as FRR, avoided standby
The manual configuration of part route and the dependence to optimal route, so as to avoid the data traffic caused by route stand-by is unreachable
Interrupt, improve the reliability of the quick heavy-routes of RIP.
If broken down in addition, RIP perceives primary link, failure is deleted again after being chosen again according to RIP routing tables
Route, so as to avoid due to the interruption again of data traffic caused by main/slave link while deletion, it is quick further to improve RIP
The reliability of heavy-route.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
God any modification, equivalent substitution and improvements done etc., should be included within the scope of protection of the invention with principle.
Claims (10)
1. a kind of method for realizing the quick heavy-routes of RIP, apply on the router in running routing information protocol RIP networks,
It is characterised in that it includes：
RIP routing tables are updated；Specially：When study is to new route, judge the metric of the new route with it is described
In RIP routing tables as optimal route the first via by metric relation；If the metric of the new route is more than institute
State in RIP routing tables as optimal route the first via by metric, then judge in the RIP routing tables whether there is comprising
Back up the hypo-optimal route of mark；, will be described new if the hypo-optimal route for including backup mark is not present in the RIP routing tables
Route is stored as hypo-optimal route and adds backup mark；If the suboptimum road for including backup mark in the RIP routing tables be present
By the new route then is stored as into hypo-optimal route；
Optimal route in the RIP routing tables and the hypo-optimal route comprising backup mark are carried out as quick heavy-route FRR
Issue.
2. according to the method for claim 1, it is characterised in that judging the metric of the new route and the RIP roads
By in table as optimal route the first via by metric relation after, in addition to：
If the metric of the new route be less than the RIP routing tables in as optimal route the first via by metric,
The new route is then stored as optimal route；
Judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, by the first via by being stored as suboptimum
It route and adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by the first via
By being stored as hypo-optimal route.
3. according to the method for claim 1, it is characterised in that it is described RIP routing tables are updated including：
When the hypo-optimal route comprising backup mark is unreachable, judge to whether there is other hypo-optimal routes in the RIP routing tables；
Then it is the minimum hypo-optimal route addition backup mark of metric if there is other hypo-optimal routes；If there is no other
Hypo-optimal route, then issued optimal route as common route.
4. according to the method for claim 1, it is characterised in that it is described RIP routing tables are updated including：
When the measurement value changes of the hypo-optimal route comprising backup mark, the new measurement of the hypo-optimal route comprising backup mark is judged
Value with as optimal route the first via by metric relation；
If comprising backup mark hypo-optimal route new metric be less than as optimal route the first via by metric,
The backup mark of the hypo-optimal route is removed, the hypo-optimal route is changed to new optimal route, and is the first via by adding
Backup mark is added to be changed to new hypo-optimal route；If the new metric of the hypo-optimal route comprising backup mark, which is equal to, is used as optimal road
By the first via by metric, then remove the hypo-optimal route backup mark, by the hypo-optimal route and the first via by depositing
Store up as equal-cost route.
5. according to the method for claim 1, it is characterised in that it is described RIP routing tables are updated including：
When perceiving primary link and breaking down, whether the metric for judging the hypo-optimal route comprising backup mark is the RIP
Minimum degree value in routing table；
If the metric of the hypo-optimal route comprising backup mark is the minimum degree value in the RIP routing tables, institute is removed
The backup mark of hypo-optimal route is stated, and the hypo-optimal route is stored as new optimal route；
Judge whether include other hypo-optimal routes in the RIP routing tables；
Then it is the minimum hypo-optimal route addition backup mark of other described hypo-optimal route moderate values if there is other hypo-optimal routes
Note, and delete failure route.
A kind of 6. device for realizing the quick heavy-routes of RIP, applied to the router operated in RIP networks, it is characterised in that bag
Include：
First processing module, for being updated to RIP routing tables；Specially：When study is to new route, the new road is judged
By metric and the RIP routing tables in as optimal route the first via by metric relation；If the new road
By metric be more than in the RIP routing tables as optimal route the first via by metric, then judge that the RIP is route
It whether there is the hypo-optimal route for including backup mark in table；If time for including backup mark is not present in the RIP routing tables
Excellent route, then the new route is stored as hypo-optimal route and adds backup mark；If in the RIP routing tables exist comprising
The hypo-optimal route of mark is backed up, then the new route is stored as hypo-optimal route；
Second processing module, for using the optimal route in the RIP routing tables and comprising backup mark hypo-optimal route as
Quick heavy-route FRR is issued.
7. device according to claim 6, it is characterised in that the first processing module is judging the degree of the new route
In value and the RIP routing tables as optimal route the first via by metric relation after, in addition to：
If the metric of the new route be less than the RIP routing tables in as optimal route the first via by metric,
The new route is then stored as optimal route；
Judge to whether there is the hypo-optimal route for including backup mark in the RIP routing tables；
If the hypo-optimal route for including backup mark is not present in the RIP routing tables, by the first via by being stored as suboptimum
It route and adds backup mark；If the hypo-optimal route for including backup mark in the RIP routing tables be present, by the first via
By being stored as hypo-optimal route.
8. device according to claim 6, it is characterised in that the first processing module, be specifically used for：
When the hypo-optimal route comprising backup mark is unreachable, judge to whether there is other hypo-optimal routes in the RIP routing tables；
Then it is the minimum hypo-optimal route addition backup mark of metric if there is other hypo-optimal routes；If there is no other
Hypo-optimal route, then issued optimal route as common route.
9. device according to claim 6, it is characterised in that the first processing module, be specifically used for：
When the measurement value changes of the hypo-optimal route comprising backup mark, the new measurement of the hypo-optimal route comprising backup mark is judged
Value with as optimal route the first via by metric relation；
If comprising backup mark hypo-optimal route new metric be less than as optimal route the first via by metric,
The backup mark of the hypo-optimal route is removed, the hypo-optimal route is changed to new optimal route, and is the first via by adding
Backup mark is added to be changed to new hypo-optimal route；If the new metric of the hypo-optimal route comprising backup mark, which is equal to, is used as optimal road
By the first via by metric, then remove the hypo-optimal route backup mark, by the hypo-optimal route and the first via by depositing
Store up as equal-cost route.
10. device according to claim 6, it is characterised in that the first processing module, be specifically used for：
When perceiving primary link and breaking down, whether the metric for judging the hypo-optimal route comprising backup mark is the RIP
Minimum degree value in routing table；
If the metric of the hypo-optimal route comprising backup mark is the minimum degree value in the RIP routing tables, institute is removed
The backup mark of hypo-optimal route is stated, and the hypo-optimal route is stored as new optimal route；
Judge whether include other hypo-optimal routes in the RIP routing tables；
Then it is the minimum hypo-optimal route addition backup mark of other described hypo-optimal route moderate values if there is other hypo-optimal routes
Note, and delete failure 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 CN104486214A (en) | 2015-04-01 |
| CN104486214B true 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) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN106453091B (en) * | 2016-10-28 | 2019-04-30 | 烽火通信科技股份有限公司 | The equivalent route management method and device of router Forwarding plane |
| CN106878166B (en) * | 2017-01-22 | 2020-04-03 | 新华三技术有限公司 | Route notification method and device |
| CN113315699B (en) * | 2021-05-17 | 2022-05-17 | 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 |
|---|
| 《基于距离矢量路由协议的网络故障快速恢复方法》;王滨等;《北京邮电大学学报》;20100831;第33卷(第4期);第1-2节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104486214A (en) | 2015-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104486214B (en) | The method and apparatus for realizing the quick heavy-routes of RIP | |
| US10171263B2 (en) | Capability aware routing | |
| CN102598599B (en) | RSVP-TE graceful restart under fast re-route conditions | |
| US9049131B2 (en) | Network system and load balancing method | |
| US9401858B2 (en) | Loop avoidance during network convergence in switched networks | |
| US9077561B2 (en) | OAM label switched path for fast reroute of protected label switched paths | |
| EP2737671B1 (en) | Method and apparatus for resilient routing of control traffic in a split-architecture system | |
| CN102664788B (en) | CE dual-homed link protection method in MPLS L3VPN and system thereof | |
| US8456982B2 (en) | System and method for fast network restoration | |
| US9853854B1 (en) | Node-protection and path attribute collection with remote loop free alternates | |
| EP3148137A1 (en) | Method for packet forwarding based on equal-cost multi-path and network device | |
| Filsfils et al. | Segment routing use cases | |
| CN102316041B (en) | Router switching method and device | |
| US20160050142A1 (en) | Transmission path switching | |
| US20100085972A1 (en) | Method and routing device for advertising routing information | |
| WO2007016834A1 (en) | A fast convergence method of point to point services and the provider edge device thereof | |
| CN101217457A (en) | A method to realize fast reroute and router | |
| US20140016643A1 (en) | Diverse path forwarding through trial and error | |
| US10015085B2 (en) | Packet forwarding method, controller, forwarding device, and network system | |
| KR20150051107A (en) | Method for fast flow path setup and failure recovery | |
| US20190280965A1 (en) | Locally Protecting Service in a Label Switched Path Network | |
| EP2685674A2 (en) | Route update method and router | |
| CN110430131B (en) | Message forwarding method and device | |
| CN107770061B (en) | Method and equipment for forwarding message | |
| WO2018076908A1 (en) | Method and device for detecting backup path |
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 |