CN102316005B - Method for updating OSPF (open shortest path first) route and OSPF router - Google Patents
Method for updating OSPF (open shortest path first) route and OSPF router Download PDFInfo
- Publication number
- CN102316005B CN102316005B CN201010218701.4A CN201010218701A CN102316005B CN 102316005 B CN102316005 B CN 102316005B CN 201010218701 A CN201010218701 A CN 201010218701A CN 102316005 B CN102316005 B CN 102316005B
- Authority
- CN
- China
- Prior art keywords
- route
- external
- ospf
- outside
- asbr
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for updating an OSPF (open shortest path first) route, and an OSPF router. When the OSPF route is updated, through finding out an external relevant route which changes and an external LSA (link state advertisement) corresponding to the external relevant route, an OSPF external route which is influenced is only calculated necessarily without executing the complete calculation of the OSPF external route when the OSPF external route is calculated; the workload of calculating the external route is reduced; the integral convergence speed of the OSPF route is quickened; and the calculation amount is reduced when the OSPF route is updated.
Description
Technical field
The present invention relates to that Open Shortest Path First (OSPF, Open Shortest Path First) routing protocol technology, espespecially a kind of method and ospf router that upgrades OSPF route.
Background technology
OSPF is a kind of with different levels Routing Protocol, and entity maximum in its level is autonomous system (AS, Autonomous System), follows a part of network entity under common routing policy management.In AS, network is divided into different regions.Region is that each group identifies with regional number from logic route being divided into different groups.Referring to Fig. 1, Fig. 1 is the schematic diagram that ospf area is divided.In OSPF, area 0 is key district.
Ospf router, according to the position in AS, is divided into following four kinds:
intra-Domain Router (Internal Router), the total interface of this router belongs to same ospf area;
In AS, each region maintains a unique topology diagram, route is calculated separately according to own topological diagram in each territory, and ABR is spreading between territory after the inside route summarization of regional simultaneously, ASBR by the external routes that arrives other AS territories by ABR in interregional diffusion.
In OSPF, to the description of link-state information, be to be all encapsulated in LSA (LSA, LinkState Advertisement) to release, the main LSA according to following several types of router in OSPF carries out route calculating:
Be commonly referred to first kind LSA, this LSA has described link or interface that router physical interface connects, has indicated the state of link, cost etc.Router in each ospf area all can generate first kind LSA, in the region generating, floods.
Be commonly referred to Equations of The Second Kind LSA, Designated Router (DR by radio network, Designated Router) produce, the Link State of this broadcast network segment all-router is described, in the region of starting at it, propagate, Network-LSAs carries two key messages, and the one, generate the IP network section of the radio network of this Network-LSAs, the IP prefix that directly can reach for notice this radio network in region; Another one is all nodes that this radio network connects, and represents, for describing network topology by Attached Router field.
Be commonly referred to the 3rd class LSA, by ABR, produced, describe the route of certain IP network section in region, and notice to other regions, for reaching IP prefix in interregional notice.
Be commonly referred to the 4th class LSA, by ABR, produced, be described to the route of ASBR, and notice to relevant range, for describing the network topology that arrives ASBR node.
Be commonly referred to the 5th class LSA, by ASBR, produced, be described to the route of AS outside, be communicated to all regions, for noticing reached at the IP prefix that is incorporated into OSPF from other agreements.
non-pure periphery (NSSA, Not-So-Stubby Area) external lsas
Be commonly referred to the 7th class LSA, by the ASBR in NSSA region, produced, be described to the route of AS outside, only in NSSA region, propagate.For notice reached at the IP prefix that is incorporated into OSPF from other agreements in NSSA region.
Every router in ospf network all can generate corresponding LSA and spread in network according to actual Link State situation, every router forms the LSD (LSDB, Link State Date Base) of oneself according to the LSA receiving.
Ospf router can carry out the calculating of two class routes, comprises the inner route of OSPF and OSPF external routes.The inner route of OSPF refers to the route of calculating according to ospf protocol in OSPF routed domain; OSPF external routes refers to according to introducing by other Routing Protocols the route calculating.
In region, all belong to the inner route of OSPF with interregional route.When carrying out intrAzone routing calculating, according to the LSDB of self, calculate the route of other routers in region; And be Stub and network segment route generation the 3rd class LSA and the 4th class LSA of one's respective area.Between zoning during route, according to the route of the 3rd class LSA receiving and the 4th class LSA and one's respective area, calculate the route of other region IP prefix and to the route of other regions ASBR.IP prefix route and ASBR route propagation other regions to route source region that Area 0 will learn for one's respective area.When calculating OSPF external routes, according to the 5th class of receiving and the route of the 7th class LSA and one's respective area, calculate external routes.In this article, if no special instructions, external routes all represents OSPF external routes.
Referring to Fig. 2, Fig. 2 is prior art OSPF routing update schematic diagram.Concrete condition is as follows:
In step 201, when link-state information changes, ospf router can, according to the situation of actual change, trigger whole route calculating, interregional three class incremental computations, interregional four class incremental computations or outside incremental computations.
When ospf router is received the 3rd class LSA, three class incremental computations between toggle area; While receiving the 4th class LSA, four class incremental computations between toggle area; Receive five/seven class LSA, trigger outside incremental computations; When receiving that the LSA of other types or the Link State of self change, will trigger whole routes and calculate.
In step 202, according to route in the Link State execution area after changing, calculate, obtain intrAzone routing, to ABR and the ASBR route in region.
In step 203, according to the intrAzone routing recalculating, between execution area, route is all calculated, and on corresponding this router, every the 3rd class LSA and the 4th class LSA recalculate route, then perform step 208.
In step 204, for three class incremental computations between the 3rd class LSA execution area of receiving.
In step 205, according to the result of calculation of interregional three class increments, judge whether to have affected the route that this router arrives forwarding address (FA, Forwarding Address), if so, carry out 208; Otherwise, finish current more new technological process.
Wherein, FA is that ospf protocol design is used for avoiding increasing when access AS external address unnecessary jumping figure.ASBR, when introducing external routes, fills out next hop address in the ForwardingAddress of LSA.Like this, router is being processed this LSA, first judge and self whether have to the path of this Forwarding Address, if had, from arriving the route of FA, inherit down hop, thereby when E-Packeting, only message need to be sent to Forwarding Address, needn't pass through again the forwarding of ASBR; If no, search and arrive this ASBR route, from the ASBR route finding, inherit down hop.
In step 206, to four class incremental computations between the 4th class LSA execution area of receiving.
In step 207, according to the result of calculation of interregional four class increments, judged whether to affect the route of this router arrival ASBR, if so, perform step 208; Otherwise, finish current more new technological process.
In step 205 and 207, judge whether result of calculation has had influence on the route of arrival FA or the route of arrival ASBR, be mainly whether judgement changes in the route of interregional three classes and four class incremental computations front and back arrival FA dependence route or arrival ASBR.
In step 208, every external lsas on corresponding this router, recalculates whole external routes, finishes current more new technological process.
In step 209, carry out external routes incremental computations, for the 5th class of receiving or the 7th class LSA, carry out external routes calculating, the current more new technological process of result.
Wherein, described incremental computations is for whole routes are calculated, and incremental computations represents only to changing LSA, to carry out route calculating, unchanged LSA is not carried out to route and calculate; And all routes are calculated and are referred to all relevant LSA entries are calculated, no matter whether corresponding LSA entry changes.
Known by existing renewal OSPF route flow process, as long as triggered whole calculating, and the route that has affected arrival FA between execution area after three class incremental computations, and between execution area, after four class incremental computations, affected while arriving the route of ASBR, all can trigger whole calculating of external routes.Because determining of external routes is only relevant to relied on FA route and ASBR route, therefore in these cases, FA route and ASBR route that some external routes rely on do not change, and not necessarily need to trigger whole calculating of external routes.
In actual application, intrAzone routing and intErzone routing negligible amounts, and the specification of external routes is larger, hundreds thousand of, 1,000,000 ranks even.Like this, when carrying out routing update, frequently external routes is all calculated, had a strong impact on OSPF route global convergence speed.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method and ospf router of the OSPF of renewal route, the amount of calculation in the time of can reducing OSPF routing update by method provided by the invention and ospf router.
For achieving the above object, technical scheme of the present invention is achieved in that
A method of upgrading OSPF route, the method comprises:
Preserve each outside associated route of OSPF route; And record external link-state advertisement LSA corresponding to each outside associated route;
After executing the inner route calculating of OSPF, before and after calculating according to the content judgement of described preservation, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, for the associated route in the outside changing, according to described record, find its corresponding external lsas, for the external lsas finding, calculate corresponding OSPF external routes.
An ospf router, this ospf router comprises processing unit and performance element;
Described processing unit, for preserving each outside associated route of OSPF route; And record external link-state advertisement LSA corresponding to each outside associated route;
Described performance element, for after executing the inner route calculating of OSPF, before and after calculating according to the preservation judgement of described processing unit, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, for the associated route in the outside changing, according to the record of described processing unit, find its corresponding external lsas, for the external lsas finding, calculate corresponding OSPF external routes.
A kind of method and ospf router that upgrades OSPF route provided by the present invention, by when upgrading OSPF route, find external lsas corresponding to the associated route of the associated route in outside and this outside changing, make when calculating external routes, only need calculate affected external routes, and not need to carry out whole calculating of external routes, reduce the workload that external routes calculates, accelerated OSPF route global convergence speed, the amount of calculation while having reduced OSPF routing update.
Accompanying drawing explanation
Fig. 1 is the schematic diagram that ospf area is divided;
Fig. 2 is prior art OSPF routing update flow chart;
Fig. 3 is OSPF routing update exemplary process diagram of the present invention;
Fig. 4 is the structure chart of ospf router of the present invention;
Fig. 5 is embodiment of the present invention OSPF routing update flow chart.
Embodiment
In the detailed description of this part, only, by implementing the example of the desired best mode of inventor of the present invention, illustrate and described preferred embodiment of the present invention.It will be appreciated that and can not deviate under prerequisite of the present invention, with regard to each apparent aspect, it is modified.Correspondingly, it is exemplary in itself that drawing and description should be regarded as, rather than restrictive.
In order to realize goal of the invention of the present invention, the invention provides a kind of method of the OSPF of renewal route.The exemplary process diagram of the method can be referring to Fig. 3.Concrete, in step 301, preserve each outside associated route of OSPF route; And record external link-state advertisement LSA corresponding to each outside associated route; In step 302, after executing the inner route calculating of OSPF, before and after calculating according to the content judgement of described preservation, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, execution step 303; In step 303, for the associated route in the outside changing, according to described record, find its corresponding external lsas, for the external lsas finding, calculate external routes.Wherein, recording external lsas corresponding to each outside associated route is exactly the corresponding relation recording between outside associated route and external lsas.
The present invention is when externally associated route changes, find external lsas corresponding to the associated route of the associated route in outside and this outside changing, make, when calculating external routes, only need carry out external routes calculating to the external lsas finding, implement the incremental computations of external routes.Like this, owing to not needing to carry out whole calculating of external routes, technical scheme of the present invention has reduced the workload that external routes calculates, and has accelerated OSPF route global convergence speed.
Here, described external lsas corresponding to each outside associated route that record is: record external prefixes corresponding to outside associated route, and external lsas corresponding to described external prefixes; Accordingly, the associated route in the described outside for changing, according to described record, find its corresponding external lsas to be: according to described record, for the associated route in the outside changing, to find its corresponding external prefixes, and find external lsas corresponding to this external prefixes.Wherein, can pass through the corresponding relation that binary tree, RBTree etc. build external prefixes and external lsas.
Wherein, the associated route in described outside, different in the situation that, comprises different contents.
Concrete, in the situation that triggering all calculating, the associated route in described outside comprises that each ASBR route of arrival and each FA rely on route.The inner route of OSPF is calculated as in region and intErzone routing calculates, now described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each ASBR route and each FA and rely on route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing and FA, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
Between toggle area three class incremental computations in the situation that, the associated route in described outside comprises that each FA relies on route.The inner route of OSPF is calculated as interregional three class incremental computations, now described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each FA and rely on route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the FA changing, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
Between toggle area four class incremental computations in the situation that, the associated route in described outside comprises and arrives each ASBR route.The inner route of OSPF is calculated as interregional four class incremental computations, now described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each ASBR route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing, according to described record, find its corresponding LSA, for the LSA finding, calculate external routes.
The present invention also provides a kind of ospf router, and this ospf router comprises processing unit and performance element.Can be referring to Fig. 4.It should be noted that, for clearer, concise and to the point description implementation of the present invention, in Fig. 4, omitted the original function module of ospf router, only shown functional module related to the present invention.
Concrete, described processing unit, for preserving each outside associated route of OSPF route; And record external lsas corresponding to each outside associated route; Described performance element, for after executing the inner route calculating of OSPF, before and after calculating according to the preservation judgement of described processing unit, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, for the associated route in the outside changing, according to the record of described processing unit, find its corresponding external lsas, for the external lsas finding, calculate corresponding OSPF external routes.
Wherein, described processing unit, for when recording external lsas corresponding to each outside associated route, records external prefixes corresponding to outside associated route, and external lsas corresponding to described external prefixes; Accordingly, described performance element, for the associated route in the outside for changing, while finding its corresponding external lsas according to described record, according to the record of described processing unit, for the associated route in the outside changing, find its corresponding external prefixes, and find external lsas corresponding to this external prefixes.
The associated route in outside that described processing unit is preserved comprises that arriving each ASBR route relies on route with each FA; Described performance element, for in executing region and after intErzone routing calculating, when before and after calculating according to the content judgement of preserving, whether each outside associated route changes, before and after calculating according to the content judgement of described preservation, whether each ASBR route of arrival and each FA dependence route change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing and FA, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
The associated route in outside that described processing unit is preserved comprises that each FA relies on route; Described performance element, for after executing interregional three class incremental computations, when before and after the described judgement of the content according to preservation calculating, whether each outside associated route changes, whether before and after calculating according to the content judgement of described preservation, arrive each FA dependence route changes, if all do not changed, finish current more new technological process; Otherwise, for the FA changing, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
The associated route in outside that described processing unit is preserved comprises each ASBR route of arrival; Described performance element, for after executing interregional four class incremental computations, when before and after the described judgement of the content according to preservation calculating, whether each outside associated route changes, whether before and after calculating according to the content judgement of described preservation, arrive each ASBR route changes, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing, according to described record, find its corresponding LSA, for the LSA finding, calculate external routes.
In order more clearly to understand technical scheme of the present invention, now enumerate embodiment technical scheme of the present invention is further described in detail.Specifically referring to Fig. 5.
Ospf router, when receiving external lsas, records asbr router and external lsas, and when there is FA, records the corresponding relation between FA and external lsas; And in carrying out region/intErzone routing is when calculate, and record arrives the route of ASBR and the dependence route that arrives FA.
Because different external lsas may corresponding identical external prefixes, therefore at the corresponding relation recording between ASBR and external lsas and FA and external lsas, can record the corresponding relation of the external prefixes of carrying in ASBR or FA and external lsas, then record the relation between external prefixes and external lsas.When arriving ASBR route or the variation of FA dependence route, first find ASBR or the FA of variation, then the external prefixes by ASBR or FA association finds associated external lsas, finally realizes part LSA and calculates.Wherein, in order to improve search efficiency, can by tree, build the incidence relation of external prefixes and external lsas, the node on tree points to one or more LSA.By external prefixes, find in the tree the external lsas recording on node, realize fast finding.The foundation of tree is when receiving external lsas, extracts the external prefixes in LSA, build tree node and with LSA corresponding relation.
In step 501, when link-state information changes, ospf router can trigger whole route calculating, interregional three class incremental computations, interregional four class incremental computations or outside incremental computations according to actual conditions, the dependence route of preserving self each ASBR route of current arrival simultaneously and arriving each FA.
Introduction in the visible step 201 of concrete triggering situation of ospf router, is not described in detail in this.Meanwhile, for simplified characterization, by self current to each ASBR route referred to as ASBR route, the dependence route that arrives each FA relies on route referred to as FA.
In step 502～503, in the situation that triggering all calculating, in execution area, route calculating and intErzone routing all calculate.
In step 504, according to the ASBR route before the calculating of current preservation and FA, rely on route, whether each FA dependence route and ASBR route that front and back are calculated in judgement change, if all do not changed, finish current more new technological process; If so, execution step 505.
In step 505, for the FA changing, rely on route and ASBR route, according to the ASBR route of record and the corresponding relation of external lsas, and the corresponding relation of FA dependence route and external lsas, find its corresponding external lsas, execution step 512.
In step 506, to three class incremental computations between the 3rd class LSA execution area of receiving.
In step 507, according to the FA between the calculating of preserving, rely on route, whether judgement calculating each FA of front and back relies on route and changes, and does not all change, and finishes current more new technological process; If changed, execution step 508.
In step 508, for the FA changing, rely on route, according to the FA of record, rely on the corresponding relation between route and external lsas, find its corresponding external lsas, execution step 512.
In step 509, to four class incremental computations between the 4th class LSA execution area of receiving.
In step 510, according to the ASBR route before the calculating of preserving, judgement is calculated each ASBR route of front and back whether variation has been occurred, if all do not occurred, finishes current more new technological process; If changed, execution step 511.
In step 511, for the ASBR route changing, according to the ASBR of record and the corresponding relation between external lsas, find its corresponding external lsas, execution step 512.
In step 512, for the external lsas finding, calculate external routes, implement the incremental computations of external routes.Finish current more new technological process.
In step 513, carry out external routes incremental computations, for the 5th class of receiving or the 7th class LSA, carry out external routes calculating, the current more new technological process of result.
The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (10)
1. a method for the OSPF route of upgrading that Open Shortest Path First, is characterized in that, the method comprises:
Preserve each outside associated route of OSPF route; And record external link-state advertisement LSA corresponding to each outside associated route; Wherein, the associated route in described outside comprises: arrive each Autonomous System Boundary Router, AS Boundary Router ASBR route and/or each forwarding address FA and rely on route;
After executing the inner route calculating of OSPF, before and after calculating according to the content judgement of described preservation, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, for the associated route in the outside changing, according to described record, find its corresponding external lsas, for the external lsas finding, calculate corresponding OSPF external routes.
2. method according to claim 1, is characterized in that, the method comprises:
Described external lsas corresponding to each outside associated route that record is: record external prefixes corresponding to outside associated route, and external lsas corresponding to described external prefixes;
The associated route in the described outside for changing, finds its corresponding external lsas to be according to described record: according to described record, for the associated route in the outside changing, to find its corresponding external prefixes, and find external lsas corresponding to this external prefixes.
3. method according to claim 1, is characterized in that,
The associated route in described outside comprises that arriving each ASBR route relies on route with each FA;
The inner route of described OSPF is calculated as in region and intErzone routing calculates; Accordingly, described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each ASBR route and each FA and rely on route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing and FA, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
4. method according to claim 1, is characterized in that,
The associated route in described outside comprises that each FA relies on route;
The inner route of described OSPF is calculated as interregional three class incremental computations; Accordingly, described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each FA and rely on route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the FA changing, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
5. method according to claim 1, is characterized in that,
The associated route in described outside comprises each ASBR route of arrival;
The inner route of described OSPF is calculated as interregional four class incremental computations; Accordingly, described according to the content judgement of preserving, calculate before and after each outside associated route whether change for: before and after calculating according to the content judgement of described preservation, arrive each ASBR route and whether change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing, according to described record, find its corresponding LSA, for the LSA finding, calculate external routes.
6. an Open Shortest Path First ospf router, is characterized in that, this ospf router comprises processing unit and performance element;
Described processing unit, for preserving each outside associated route of OSPF route; And record external link-state advertisement LSA corresponding to each outside associated route; Wherein, the associated route in described outside comprises: arrive each Autonomous System Boundary Router, AS Boundary Router ASBR route and/or each forwarding address FA and rely on route;
Described performance element, for after executing the inner route calculating of OSPF, before and after calculating according to the preservation judgement of described processing unit, whether each outside associated route changes, if all do not changed, finishes current more new technological process; If changed, for the associated route in the outside changing, according to the record of described processing unit, find its corresponding external lsas, for the external lsas finding, calculate corresponding OSPF external routes.
7. ospf router according to claim 6, is characterized in that,
Described processing unit, for when recording external lsas corresponding to each outside associated route, records external prefixes corresponding to outside associated route, and external lsas corresponding to described external prefixes;
Described performance element, for the associated route in the outside to changing, finds its corresponding external prefixes according to the record of described processing unit for the associated route in the outside changing, and finds external lsas corresponding to this external prefixes.
8. ospf router according to claim 6, is characterized in that,
The associated route in outside that described processing unit is preserved comprises that arriving each ASBR route relies on route with each FA;
Described performance element, for in the situation that triggering all calculating, in executing region and after intErzone routing calculating, when before and after calculating according to the content judgement of preserving, whether each outside associated route changes, before and after calculating according to the content judgement of described preservation, whether each ASBR route of arrival and each FA dependence route change, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing and FA, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
9. ospf router according to claim 6, is characterized in that,
The associated route in outside that described processing unit is preserved comprises that each FA relies on route;
Described performance element, for after executing interregional three class incremental computations, when before and after the described judgement of the content according to preservation calculating, whether each outside associated route changes, whether before and after calculating according to the content judgement of described preservation, arrive each FA dependence route changes, if all do not changed, finish current more new technological process; Otherwise, for the FA changing, rely on route, according to described record, find its corresponding external lsas, for the LSA finding, calculate external routes.
10. ospf router according to claim 6, is characterized in that,
The associated route in outside that described processing unit is preserved comprises each ASBR route of arrival;
Described performance element, for after executing interregional four class incremental computations, when before and after the described judgement of the content according to preservation calculating, whether each outside associated route changes, whether before and after calculating according to the content judgement of described preservation, arrive each ASBR route changes, if all do not changed, finish current more new technological process; Otherwise, for the ASBR route changing, according to described record, find its corresponding LSA, for the LSA finding, calculate external routes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010218701.4A CN102316005B (en) | 2010-07-05 | 2010-07-05 | Method for updating OSPF (open shortest path first) route and OSPF router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010218701.4A CN102316005B (en) | 2010-07-05 | 2010-07-05 | Method for updating OSPF (open shortest path first) route and OSPF router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102316005A CN102316005A (en) | 2012-01-11 |
| CN102316005B true CN102316005B (en) | 2014-03-19 |
Family
ID=45428838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010218701.4A Active CN102316005B (en) | 2010-07-05 | 2010-07-05 | Method for updating OSPF (open shortest path first) route and OSPF router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102316005B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102710499B (en) * | 2012-05-09 | 2015-12-02 | 杭州华三通信技术有限公司 | Many issue sources external routes is for down hop system of selection and equipment thereof |
| CN102761492B (en) * | 2012-07-25 | 2014-12-17 | 杭州华三通信技术有限公司 | Routing relearning method and device based on OSPF (Open Shortest Path First) protocol |
| CN103200097B (en) * | 2013-04-28 | 2016-06-08 | 杭州华三通信技术有限公司 | A kind of route computing method and the network equipment |
| CN104378294B (en) * | 2014-11-26 | 2018-02-13 | 上海斐讯数据通信技术有限公司 | A kind of method and system for reducing LSD size |
| CN105721320B (en) * | 2014-12-05 | 2020-01-07 | 中兴通讯股份有限公司 | Method, device and system for synchronously realizing link state notification information |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1469587A (en) * | 2002-07-16 | 2004-01-21 | 华为技术有限公司 | Routing calculation method based on opened shortest route priority routing protocol |
| CN1543160A (en) * | 2003-04-29 | 2004-11-03 | 华为技术有限公司 | A method for implementing external route calculation for router |
| CN1889520A (en) * | 2006-07-25 | 2007-01-03 | 华为技术有限公司 | Route information update method and network equipment based on OSPF |
| CN101272393A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Routing computing method and network node based on link condition routing protocol |
-
2010
- 2010-07-05 CN CN201010218701.4A patent/CN102316005B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1469587A (en) * | 2002-07-16 | 2004-01-21 | 华为技术有限公司 | Routing calculation method based on opened shortest route priority routing protocol |
| CN1543160A (en) * | 2003-04-29 | 2004-11-03 | 华为技术有限公司 | A method for implementing external route calculation for router |
| CN1889520A (en) * | 2006-07-25 | 2007-01-03 | 华为技术有限公司 | Route information update method and network equipment based on OSPF |
| CN101272393A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Routing computing method and network node based on link condition routing protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102316005A (en) | 2012-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10541905B2 (en) | Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment | |
| US9749214B2 (en) | Software defined networking (SDN) specific topology information discovery | |
| US8259569B2 (en) | Differentiated services for unicast and multicast frames in layer 2 topologies | |
| CN111147373B (en) | Method for realizing participation of non-flexible algorithm router in flexible algorithm routing protocol | |
| CN109218197B (en) | Conflict resolution method in segmented routing and router | |
| US9794148B1 (en) | Node protection for stacked labels | |
| US20170093611A1 (en) | Egress node protection in evpn all-active topology | |
| CN111865783B (en) | Method and network device for computer network | |
| US9264343B2 (en) | Method and apparatus for limiting topology and reachability information in an OSPF area | |
| US9755962B2 (en) | Reducing link state protocol traffic during graceful restart | |
| CN102316005B (en) | Method for updating OSPF (open shortest path first) route and OSPF router | |
| US9350654B1 (en) | Microloop protection for multi-protocol label switching paths | |
| US20110080854A1 (en) | Method And System For Controlled Tree Management | |
| WO2020132180A1 (en) | Interior gateway protocol (igp) for segment routing (sr) proxy segment identifier (sids) | |
| US9088498B2 (en) | Communication networks that provide a common transport domain for use by multiple service domains and methods and computer program products for using the same | |
| CN103200097A (en) | Route calculation method and network equipment | |
| CN112671652B (en) | Message forwarding method and device | |
| CN109039908B (en) | Recursive routing switching method, router, switch and electronic equipment | |
| Kamamura et al. | Autonomous IP fast rerouting with compressed backup flow entries using OpenFlow | |
| EP3694161A1 (en) | Conflict resolution in segment routing | |
| EP3977688A1 (en) | System and method for abstracting an igp zone | |
| WO2023234997A1 (en) | Ospf for source address validation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: Xinhua three Technology Co., Ltd. Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base Patentee before: Huasan Communication Technology Co., Ltd. |
|
| CP03 | Change of name, title or address |