CN100496023C - A method of transmitting link state information - Google Patents
A method of transmitting link state information Download PDFInfo
- Publication number
- CN100496023C CN100496023C CNB2006100810979A CN200610081097A CN100496023C CN 100496023 C CN100496023 C CN 100496023C CN B2006100810979 A CNB2006100810979 A CN B2006100810979A CN 200610081097 A CN200610081097 A CN 200610081097A CN 100496023 C CN100496023 C CN 100496023C
- Authority
- CN
- China
- Prior art keywords
- router
- state information
- ospf
- link
- update message
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The method is applicable to system of open shortest path first (OSPF) neighbor of establishing N number of state larger than or equal to number of minimum transmissible states between any two adjacent first router and second router in OSPF protocol, where N is natural number larger than 1. Through number at least 1 and less than N of OSPF neighbor, first router sends LSA Update message of carrying information of link state to second router. The invention reduces number of message transmitted in network, and reduces occupancy of network bandwidth resources.
Description
Technical field
The present invention relates to the network communications technology, particularly relate to a kind of between the router of the agreement that adopts that Open Shortest Path First (OSPF) method of transmitting link-state information.
Background technology
Ospf protocol is a kind of autonomous system interior routing protocol based on link-state algorithm.Autonomous system is meant one group of network by unified routing policy or the mutually mutual routing iinformation of Routing Protocol.In autonomous system, adopt each router of ospf protocol all to need to safeguard a database of describing this autonomous system structure, and according to the state information of each bar link of the autonomous system of preserving in this database, calculate ospf routing table, thereby can in subsequent process, realize message forwarding according to this ospf routing table.
As seen, in autonomous system, for each router that adopts ospf protocol, the state information of each bar link of the autonomous system of preserving in its database must be identical, because have only the identical ospf routing table that could guarantee that each router calculates correct, thereby guarantee to realize the correct forwarding of message.And to guarantee that the autonomous system link-state information in each routers rs database is identical, then must be when network configuration changes, such as when increase/minimizing router or Link State change, by each router relevant link-state information is transferred to its adjacent router, make each router all can obtain the information of link change, thereby new database more, in the fulfillment database link-state information synchronously.
At present, comprise polytype route among the OSPF, wherein a kind of route is Autonomy System-External link broadcasting route (ASE LSA).Fig. 1 is the transmitting link-state information between router of flow chart prior art is implemented in to(for) ASE LSA.Fig. 2 is a structural representation of setting up a plurality of ospf neighbors between neighboring router.Referring to Fig. 1 and Fig. 2, for ASE LSA, in the prior art, having set up a plurality of states when between two neighboring routers is the ospf neighbor of ExChange more than or equal to I transmission state, such as, set up the ospf neighbor of N state between adjacent the first router and the second router more than or equal to ExChange, adjacent the second router and Third Road are by having set up the ospf neighbor of M state more than or equal to ExChange between device, M and N are the natural number greater than 1, when network configuration changes, at any two neighboring routers, such as between the first router and the second router, the process of transmission relevant link state information may further comprise the steps:
Step 101: the first router is carried at the relevant link state information that changes in the LSA Update message, respectively by and the second router between ospf neighbor 1, ospf neighbor 2 until ospf neighbor N, send to the second router.
Here, the first router receive that other neighbor router except that the second router sends carry the LSA Update message of link-state information the time, carry out the process of this step; Perhaps, the first router also can be when self link change, carries out the process of this step.
As seen, in this step, the first router has sent N part and has carried the LSAUpdate message of link-state information.
Step 102: after the second router receives the LSAUpdate message that carries link-state information by ospf neighbor 1, by ospf neighbor 1 LSA Ack message is sent to the first router, the rest may be inferred, until receive the LSA Update message that carries link-state information by ospf neighbor N after, by this ospf neighbor N LSA Ack message is sent to the first router, wherein, the LSAAck message is used to confirm that LSA Update message receives.
Here, the second router is after receiving N part and carrying the LSA Update message of link-state information, only preserve the link-state information in a LSA Update message, and utilize this link-state information renewal database that self safeguard, that describe the autonomous system structure.
As seen, in this step, the second router has sent N part LSA Ack message.
Step 103: the second router is being passed through an ospf neighbor, such as passing through ospf neighbor 1, receive first part when carrying the LSA Update message of link-state information, respectively by other ospf neighbor except that this ospf neighbor 1, promptly pass through ospf neighbor 2 to ospf neighbor N, the received LSA Update message that carries link-state information is sent to the first router respectively.
As seen, for the situation that has N ospf neighbor, the second router need send N-1 part LSA Update message to the first router.
Referring to Fig. 2, after receiving the LSA Update message that carries link-state information when the second router, the second router also can be respectively by and Third Road by the ospf neighbor of the M between the device, the LSA Update message that M part is carried link-state information is sent to the Third Road that is adjacent respectively by device, and its specific implementation process and above-mentioned Principle of Process shown in Figure 1 are identical.
By above description as can be seen, in the prior art, for ASE LSA, when set up between any two neighboring routers that adopt ospf protocol state more than or equal to ExChange and number greater than 1 N ospf neighbor after, the first router must by and the second router between N ospf neighbor send the LSA Update message that N part is carried link-state information respectively, accordingly, the second router also must by and the first router between this N ospf neighbor send N part LSA Ack message respectively, therefore, the message amount that causes in the network being transmitted is too much, thereby has taken too much network bandwidth resources.
In addition, in the prior art, the second router is after receiving first part of LSA Update message that carries link-state information by an ospf neighbor, still can return to the first router by the LSA Update message that other N-1 OSpF neighbour carry link-state information with N-1 part, therefore, the message amount that further causes in the network being transmitted is too much, has further taken the bandwidth resources of network.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method of transmitting link-state information, so that reduce the message amount of being transmitted in the network.
In order to achieve the above object, technical scheme of the present invention is achieved in that
A kind of method of transmitting link-state information, be applied between the first router and the second router of any two adjacent, ospf protocols that adopt that Open Shortest Path First, establish the system of N state more than or equal to the ospf neighbor of I transmission state, N is the natural number greater than 1, it is characterized in that, this method comprises: the first router by quantity at least one and be less than the described ospf neighbor of N, the LSA Update message that carries link-state information is sent to the second router.
Described quantity at least one and the ospf neighbor that is less than N are selected arbitrarily from a described N ospf neighbor by the first router.
Described quantity at least one and the ospf neighbor that is less than N are to be selected according to the current service load quantity of a described N ospf neighbor by the first router.
After the first router receives the LSA Update message that carries link-state information that other neighbor router except that the second router sends, carry out the step that the described LSA Update message that will carry link-state information is sent to the second router.
When the first router self link change, carry out the step that the described LSAUpdate message that will carry link-state information is sent to the second router.
Restart in the second router, and set up in the process of N state more than or equal to the ospf neighbor of ExChange, carry out the step that the described LSA Update message that will carry link-state information is sent to the second router by the first router and the second router.
This method further comprises: whenever the second router by and the first router between an ospf neighbor receive the LSA Update message that carries link-state information after, the second router is sent to the first router by this ospf neighbor with LSA Ack message.
This method further comprises: the second router by and the first router between an ospf neighbor, receive first part when carrying the LSA Update message of link-state information, this the second router by except that a described ospf neighbor, quantity is less than the described ospf neighbor of N-1, and the LSA Update message that carries link-state information is sent to the first router.
This method further comprises: the second router by and the first router between an ospf neighbor, receive first part when carrying the LSA Update message of link-state information, this the second router judges whether the value in the advertise route territory in the received LSA Update message is the sign of the first router, if then do not send and carry the LSAUpdate message of link-state information to the first router.
Described the first router only is sent to the second router by 1 ospf neighbor with the described LSAUpdate message that carries link-state information.
Described the second router is sent to the first router by 1 ospf neighbor except that a described ospf neighbor with the LSA Update message that carries link-state information.
This shows that the present invention has the following advantages:
1, in order between the first router and the second router, to finish the synchronous of a link-state information, in the prior art, the first router need send N LSA Update message, and the second router need send N-1 LSA Update message, and N LSA Ack message; And with respect to prior art, in the present invention, the first router only need send and be less than N LSA Update message, the second router also only needs to send to be less than N-1 LSA Update message, and the LSA Ack message that is less than N, further, the first router and the second router can also only send described each message by an ospf neighbor, that is to say, no matter the number of ospf neighbor is many again, and the each LSA Update message that sends of the first router and the second router or the individual number average of LSA Ack message can be 1, therefore, reduced the message amount of being transmitted in the network, reduced taking network bandwidth resources.
2, in the present invention, the second router is after receiving the LSA Update message that carries link-state information that the first router sends, can not send and carry the LSA Update message of link-state information to the first router, therefore, further reduced the message amount of being transmitted in the network, reduced taking network bandwidth resources.
Description of drawings
Fig. 1 is the transmitting link-state information between router of flow chart prior art is implemented in to(for) ASE LSA.
Fig. 2 is a structural representation of setting up a plurality of ospf neighbors between neighboring router.
Fig. 3 is the transmitting link-state information between router of flow chart the present invention is implemented in to(for) ASE LSA.
Embodiment
In the prior art, the LSA Update message that each part that the first router sends to the second router carries link-state information is identical, but after the second router receives LSA Update message, the link-state information that also only needs to preserve in a LSA Update message gets final product, therefore, increased the quantity of the LSA Update message that is transmitted in the network meaninglessly.At this kind situation, the present invention proposes a kind of method of transmitting link-state information, be applied to set up in the system of a plurality of states more than or equal to the ospf neighbor of ExChange between any two the first router adjacent, that adopt ospf protocol and the second router, its core concept is: the first router by quantity at least one and be less than the described ospf neighbor of N, the LSA Update message that carries link-state information is sent to the second router.
In addition, in the prior art, the LSAUpdate message that the second router not only will be carried link-state information sends to other adjacent router, but also the LSA Update message that N-1 part is carried link-state information sent to the first router that produces this LSA Update message, therefore, increased the quantity of the LSA Update message that is transmitted in the network meaninglessly.At this kind situation, the present invention can further adopt, the second router receive that the first router sends carry the LSA Update message of link-state information the time, to be less than LSAUpdate message N-1 part, that carry link-state information and be sent to the first router, perhaps, the second router does not send the LSA Update message that this carries link-state information to the first router.
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.
Fig. 3 is the transmitting link-state information between router of flow chart the present invention is implemented in to(for) ASE LSA.Referring to Fig. 2 and Fig. 3, for ASE LSA, in the present invention, when between any two neighboring routers, set up the ospf neighbor of a plurality of states more than or equal to ExChange, such as, set up the ospf neighbor of N state between adjacent the first router and the second router more than or equal to ExChange, adjacent the second router and Third Road are by having set up the ospf neighbor of M state more than or equal to ExChange between device, M and N are the natural number greater than 1, when network configuration changes, at any two neighboring routers, such as between the first router and the second router, the process of transmitting link-state information may further comprise the steps:
Step 301: the first router is carried at the relevant link state information that changes in the LSA Update message, by and the second router between quantity at least one and be less than N described ospf neighbor, send to the second router.
In this step, passed through when the first router sends LSA Update message, quantity at least one and be less than N ospf neighbor, can be that the first router is selected arbitrarily from a described N ospf neighbor; Perhaps, also can be that the first router is selected according to the current service load quantity of a described N ospf neighbor, such as, in this step, the first router from a described N ospf neighbor, select the current business load less, quantity at least one and be less than the ospf neighbor of N; Perhaps, also can be to select according to the rule of other setting.
In addition, the first router can be behind the LSA Update message of the relevant link state information of carrying variation that other neighbor router that receives except that the second router is sent, and carries out the process of this step; Perhaps, also can be when the first router self link change, such as, when the first router has disposed the port of self, carry out the process of this step; Perhaps, also can be to restart, and set up in the process of N state more than or equal to the ospf neighbor of ExChange, carry out the process of this step by the first router and the second router in the second router.
Step 302: whenever the second router by and the first router between an ospf neighbor receive the LSA Update message that carries link-state information after, the second router all is sent to the first router by this ospf neighbor with LSA Ack message.
Here, the second router is after receiving the LSA Update message that carries link-state information, preserve the link-state information in this part LSA Update message, and utilize this link-state information renewal database that self safeguard, that describe the autonomous system structure.
As seen, because in above-mentioned steps 301, the first router send to the second router the LSAUpdate message quantity at least one and be less than N, therefore, in this step, the second router send to the first router LSA Ack message quantity also at least one and be less than N.
Step 303: the second router by and the first router between an ospf neighbor, receive first part when carrying the LSA Update message of link-state information, this second router is sent to the first router of sending this LSA Update message with the LSA Update message that this carries link-state information.
In this step, the second router comprises the specific implementation process that LSA Update message is sent to the first router: the second router by except that a described ospf neighbor, quantity is less than the ospf neighbor of N-1, and the LSA Update message that carries link-state information is sent to the first router.Such as, the second router receives the LSA Update message that carries link-state information that the first router is sent by ospf neighbor 1, so, this the second router can by ospf neighbor 2 to the ospf neighbor N, quantity is less than N-1 ospf neighbor, and the LSA Update message that carries link-state information is sent to the first router.
Preferably, in order further to reduce the quantity of the message that is transmitted between the first router and the second router, the implementation procedure of this step also can change to: the second router by and the first router between an ospf neighbor, receive first part when carrying the LSA Update message of link-state information, whether the value of judging expression LSA product survivor's advertise route territory in the received LSA Update message is the sign of the first router, if, can determine that then received LSA Update message is that the first router is sent, therefore, then can not send the LSA Update message that this carries link-state information to the first router.
Referring to Fig. 2, after receiving the LSA Update message that carries link-state information when the second router, the second router also can by and Third Road by the ospf neighbor between the device, the LSA Update message that carries link-state information is sent to Third Road by device, and the principle of its specific implementation process and said process of the present invention is identical.
Preferably, quantity for the message that farthest reduces in the network to be transmitted, in said process of the present invention, any one router all can be only by and neighboring router between an ospf neighbor, send described LSA Update message or LSA Ack message.Such as, in above-mentioned steps 301, the first router only by and the second router between ospf neighbor 1, the LSA Update message that portion is carried link-state information is sent to the second router.Certainly, in order to guarantee that the LSA Update message that the first router to major general's portion carries link-state information ASE LSA is sent to the second router, the first router is passed through an ospf neighbor for the first time, when LSA Update message is sent to the second router, the relevant information of the second router can be suspended under each link-state information ASE LSA that need send, like this, the first router is when carrying the LSA Update message of this link-state information ASE LSA by all the other N-1 ospf neighbors transmissions, the first router checks at first whether the relevant information of the second router has hung under the corresponding ASE LSA, if then need not to send the LSA Update message that carries this link-state information ASE LSA.
In a word, the above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (11)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100810979A CN100496023C (en) | 2006-05-25 | 2006-05-25 | A method of transmitting link state information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100810979A CN100496023C (en) | 2006-05-25 | 2006-05-25 | A method of transmitting link state information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1852264A CN1852264A (en) | 2006-10-25 |
| CN100496023C true CN100496023C (en) | 2009-06-03 |
Family
ID=37133733
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100810979A Expired - Fee Related CN100496023C (en) | 2006-05-25 | 2006-05-25 | A method of transmitting link state information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100496023C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350767B (en) * | 2007-07-19 | 2011-02-09 | 华为技术有限公司 | Parallel link message transmission method and routing device |
| CN101626341B (en) * | 2008-07-10 | 2013-04-24 | 华为技术有限公司 | Method and device for synchronizing information under link-state protocol |
| CN102761492B (en) * | 2012-07-25 | 2014-12-17 | 杭州华三通信技术有限公司 | Routing relearning method and device based on OSPF (Open Shortest Path First) protocol |
| CN103780482B (en) * | 2012-10-22 | 2017-06-27 | 华为技术有限公司 | A method for obtaining content, user equipment, and a cache node |
| CN102904817B (en) * | 2012-10-24 | 2015-05-20 | 福建星网锐捷网络有限公司 | Transmitting method for link state advertisement (LSA), OSPF (open shortest path first interior gateway protocol) equipment and network system |
| CN105991451B (en) * | 2015-03-09 | 2018-12-25 | 杭州迪普科技股份有限公司 | LSA delet method and device based on OSPF |
-
2006
- 2006-05-25 CN CNB2006100810979A patent/CN100496023C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1852264A (en) | 2006-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102377666B (en) | Flooding-based routing protocol having average-rate and burst-rate control | |
| US10476793B2 (en) | Multicast flow overlay using registration over a reliable transport | |
| CN101401083B (en) | A technique to prevent routing loops by disseminating BGP attribute information in an OSPF-configured network | |
| CN106656784B (en) | Data stream propagation system and method for block chain network | |
| US9392482B2 (en) | Method for optimizing the capabilities of an ad hoc telecommunication network | |
| CN101478474B (en) | Method, apparatus and system for cross-domain MPLS TE LSP establishment | |
| CN102546426B (en) | Route generation method and device for implementing fiber channel over Ethernet | |
| US9660898B2 (en) | Enhanced protocol independent multicast source registration over a reliable transport | |
| CN102638389A (en) | Redundancy backup method and system of TRILL (Transparent Interconnection over Lots of Links) network | |
| CN100496023C (en) | A method of transmitting link state information | |
| CN101179488A (en) | Method and device for announcing autonomous system boundary connection information | |
| AU2014252152B2 (en) | SMF-type communication method for a manet network, network node and mobile network which implement this communication method | |
| CN100388730C (en) | Link State Diffusion Method for Traffic Engineering | |
| CN105282041A (en) | Method and device of flooding on the basis of ISIS (intermediate system to intermediate system) | |
| CN105684362B (en) | Interworking between a first protocol entity of a stream reservation protocol and a second protocol entity of a routing protocol | |
| CN112350936B (en) | Method and device for optimizing interior gateway protocol flooding and storage medium | |
| WO2012079421A1 (en) | Method for processing inter-domain link state information and path computation element | |
| CN102857441B (en) | End system address is avoided to distribute the method and route-bridge of information protocol message storm | |
| CN106254241B (en) | A kind of trans-regional CSPF the whole network calculating implementation method based on IGP | |
| WO2013035286A1 (en) | Group-to-group broadcast distribution path establishing method and communication devices | |
| CN104253752B (en) | The method and system that LSP takes over seamlessly are realized in LDP agreements | |
| CN101005493A (en) | Method and system for saving network node resource | |
| Thubert et al. | Root initiated routing state in RPL draft-ietf-roll-dao-projection-03 | |
| CN104320346A (en) | Status information publishing method and device | |
| CN103685037B (en) | The processing method of a kind of bridge Media Access Controlled address change and primary nodal point |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: NEW H3C TECHNOLOGIES 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: HANGZHOU H3C TECHNOLOGIES Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090603 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |