CN101237462B - A method for processing disorderly OSPF report and OSPF router - Google Patents
A method for processing disorderly OSPF report and OSPF router Download PDFInfo
- Publication number
- CN101237462B CN101237462B CN2008101018986A CN200810101898A CN101237462B CN 101237462 B CN101237462 B CN 101237462B CN 2008101018986 A CN2008101018986 A CN 2008101018986A CN 200810101898 A CN200810101898 A CN 200810101898A CN 101237462 B CN101237462 B CN 101237462B
- Authority
- CN
- China
- Prior art keywords
- sequence number
- ospf
- message
- current
- packet
- 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 processing a scrambled OSPF report and an OSPF router. In the technical proposal of the embodiment of the invention, the serial number of the OSPF report is examined according to the OSPF report type branch serial number, thereby solving the problem of the prior examination proposal of the serial number that the examination can not be executed after the reportprocessing sequence is adjusted, realizing the examination of the report serial number after the report processing sequence is adjusted and overcoming the scrambled shortcoming caused by the report processing sequence adjustment.
Description
Technical field
The present invention relates to ospf (OSPF, Open Shortest Path First) technology, refer to a kind of method and ospf router of the OSPF of processing packet out-ordering especially.
Background technology
In ospf protocol, in order to guarantee the reliability of establishing route, on ospf router, enable identity authentication function, make router ability intercommunication routing iinformation by authentication, realize creating the reliability of route.At present, ospf protocol is used md5-challenge (MD5, Message-Digest Algorithm 5) authentication usually.In md5 authentication, transmit leg and recipient consult to determine the key of both sides' use, and transmit leg is according to key and send the afterbody that message information calculates message digest and is carried at message, sends to the recipient; The recipient receives message and according to the key of consulting with receive that the information calculations of message obtains message digest, whether the message digest that relatively calculates is identical, identical with the message digest of receiving, determines that then current message is from validated user, otherwise, abandon the current message of receiving.
In the md5 authentication process, in order to strengthen the fail safe of verification process, the head at message adds the MD5 sequence number usually, and the transmit leg ospf router is added on sequence number in the OSPF message of transmission according to the mode that increases progressively.Recipient's ospf router is safeguarded the current maximum sequence number of receiving at each neighbor router, if receive the OSPF message that transmit leg A sends, then obtain the sequence number that carries in this message, and the maximum sequence number of this neighbor router transmission of acquisition self record, with the maximum sequence number of the sequence number that carries in the message and self current record relatively, if the current sequence number that carries is more than or equal to the sequence number of record, then carry out the checking of eap-message digest, carry out subsequent treatment according to ospf protocol, and the maximum sequence number of safeguarding for transmit leg A with the current sequence number update that obtains; If the sequence number less than record then abandons the current message of receiving, do not carry out subsequent treatment.
In ospf protocol, mainly comprise five class messages: (DD is described in health examination (HELLO) message, link-state information storehouse, Database Description) message, link-state information request (LSR, Link State Request) message, link-state information are upgraded (LSU, Link State Update) message and link-state information are confirmed (LSAck, Link State Acknowledgment) message.The HELLO message is used for finding and keeping neighborhood, election DR, BDR; Data Description (DD) packet is used to describe the situation of link-local slip condition database (LSDB, Link State Database); Link state request packet is used for the LSA to opposite end request local terminal does not have or the opposite end is upgraded; Link state update packet is used for upgrading LSA to the other side; Link state acknowledgment packet is used to confirm after receiving LSU.Wherein, can cause neighbours DOWN, and then will send a large amount of link state update packet owing to neighbours change if the HELLO message can not get timely processing; Simultaneously, if link state acknowledgment packet can not get the re-transmission that timely processing can cause link state update packet.Network oscillation that causes for fear of not having in time to handle above-mentioned two class messages and unnecessary LSA retransmit, and RFC4222 proposes the solution of priority treatment HELLO message and link state acknowledgment packet.Make HELLO message and link state acknowledgment packet enter the OSPF high-priority buffer, the message of other types enters the OSPF low-priority buffer, reading the current OSPF message of handling, preferentially reads from the OSPF high-priority buffer.
If this message of two types of priority treatment HELLO message and link state acknowledgment packet, the order that will cause handling message is different with the order that neighbor router sends message, like this, owing to carry the sequence number of inserting according to sending order in the message.Therefore, carrying out sequence number when checking, can make reception formerly and not be regarded as invalid packet and be dropped, causing packet out-ordering by the message of priority treatment.In order to address this problem, in concrete processing procedure, prior art is carried out message before the priority adjustment, and the ospf protocol message that first preliminary treatment is received carries out the inspection of sequence number and the checking of message digest to it; And then adjust the processing sequence of message according to the priority treatment strategy, to solve the out of order problem that exists in the md5 authentication process.
Why before adjusting processing sequence message being carried out preliminary treatment in the prior art, mainly is because the concrete mode that sequence number is checked in the prior art.As previously mentioned, ospf router is only safeguarded a maximum sequence number for each neighbor router of self, all are from the message of this neighbor router, the capital compares with the sequence number that same sequence number of safeguarding and message carry, carry out the renewal of sequence number, therefore after adjusting OSPF message processing sequence, again message is carried out the sequence number inspection, because what upgrade is same sequence number, and then can't avoid the out of order problem that occurs in the md5 authentication process.
This shows, in the prior art, the out of order problem of adjusting the message processing sequence in the md5 authentication process and causing, prior art must be checked sequence number of message before adjusting the message processing sequence, can't be after adjusting the message processing sequence, realize successful inspection to sequence of message number.Yet, under some scene, for example just begin to adjust the message processing sequence according to the priority treatment strategy from the IP layer, because the operation of sequence number inspection must carry out in the OSPF module after the IP layer, so prior art can't solve under this scene problem of packet out-ordering in the md5 authentication process.
Summary of the invention
In view of this, the invention provides a kind of method and ospf router of the OSPF of processing packet out-ordering, using method provided by the present invention and ospf router can be after the processing sequence of adjusting message, realization is carried out the inspection of sequence number to message, overcomes the out of order problem that occurs after the message processing sequence of adjusting.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of method of handling the OSPF packet out-ordering, this method comprises:
When checking the OSPF sequence number of message, obtain the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message;
Judge the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if, write down the sequence number that current OSPF message carries, handle current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message.
A kind of ospf router, this ospf router comprises processing unit and memory cell;
Processing unit is used for obtaining the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message from described memory cell when checking ospf OSPF sequence number of message; Judge that the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if the sequence number that current OSPF message is carried is recorded to described memory cell, handles current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message;
Memory cell is used for storing the sequence number that the OSPF message carries.
A kind of method and ospf router of handling the OSPF packet out-ordering provided by the present invention, in the technical scheme of the embodiment of the invention, when checking sequence number of message, according to current OSPF type of message sub-sequence number, the OSPF message is carried out the sequence number inspection, solved existing sequence number checks that scheme can't be carried out after adjusting the message processing sequence problem, realized after adjusting the message processing sequence inspection, overcome the adjustment of message processing sequence and the out of order problem brought sequence of message number.In addition, the technical scheme of the embodiment of the invention not only can be after adjusting the message processing sequence, the inspection of carrying out sequence of message number of success, simultaneously, check scheme with respect to existing sequence number, can also improve the efficient that ospf router is handled the ospf protocol message.
Description of drawings
Fig. 1 is the exemplary process diagram of the inventive method;
Fig. 2 is the exemplary block diagram of ospf router of the present invention;
Fig. 3 is the flow chart of embodiment of the invention method;
Fig. 4 is the structure chart of embodiment of the invention ospf router.
Embodiment
In the technical scheme of the embodiment of the invention, for can be after adjusting OSPF message processing sequence, still can normally realize inspection to sequence of message number, can carry out the sequence number inspection to the OSPF message according to OSPF message type of message.
Referring to Fig. 1, Fig. 1 is the exemplary process diagram of the inventive method, comprising: in step 101, when checking the OSPF sequence number of message, obtain the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message.In step 102, judge the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if, execution in step 103; Otherwise, execution in step 104.In step 103, write down the sequence number that current OSPF message carries, handle current OSPF message according to ospf protocol.In step 104, abandon current OSPF message.
In addition, referring to Fig. 2, Fig. 2 comprises processing unit and memory cell for the exemplary block diagram of ospf router of the present invention.Wherein, processing unit is used for obtaining the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message from described memory cell when checking ospf OSPF sequence number of message; Judge that the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if the sequence number that current OSPF message is carried is recorded to described memory cell, handles current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message; Memory cell is used for storing the sequence number that the OSPF message carries.
When HELLO message in the ospf router priority treatment OSPF message and link state acknowledgment packet, when the OSPF type of message of receiving is HELLO message or link state acknowledgment packet, obtain first maximum sequence number of the neighbor router correspondence of described HELLO message of transmission or link state acknowledgment packet; When the OSPF type of message of receiving is described Data Description (DD) packet, link-state information request link state request packet or link-state information renewal link state update packet for the link-state information storehouse, obtain second maximum sequence number of the neighbor router correspondence of transmission described Data Description (DD) packet, link state request packet or link state update packet.
Ospf router is created the first sequence number variable and the second sequence number variable for each neighbor router; When obtaining described first maximum sequence number, obtain the sequence number variable of the first sequence number correspondence, the value that this first sequence number variable is current is as first maximum sequence number of required acquisition; Accordingly, the sequence number that carries in the current OSPF message of described record is: with the first sequence number variable of the sequence number update first sequence number correspondence of carrying in the current OSPF message; When obtaining described second maximum sequence number, obtain the second sequence number variable of the second sequence number correspondence, the value that the second sequence number variable is current is as second maximum sequence number of required acquisition; Accordingly, the sequence number that carries in the current OSPF message of described record is: with the second sequence number variable of the sequence number update second sequence number correspondence of carrying in the current OSPF message.
In addition, for the corresponding method that other can also be arranged between OSPF type of message and the maximum sequence number.Such as, corresponding maximum sequence number of each type of message: corresponding first maximum sequence number of HELLO message; Corresponding second maximum sequence number of link state acknowledgment packet; Corresponding the 3rd maximum sequence number of Data Description (DD) packet; Corresponding the 4th maximum sequence number of link state request packet; Corresponding the 5th maximum sequence number of link state update packet.Generally speaking, the OSPF message that system has the priority of processing, the present invention will be in same priority level type to the OSPF message is provided with the maximum sequence number of a correspondence, and the OSPF message of another one priority level is provided with another corresponding maximum sequence number.This corresponding method can be good at being applicable to that the priority treatment strategy determines the scene of priority treatment grade according to the type of message of OSPF message.Under this kind scene, when obtaining the maximum sequence number of this type of message correspondence, then find the neighbor router that sends current OSPF message to maximum sequence number variable that should type of message, the current value of this maximum sequence number variable is required maximum sequence number.The sequence number that carries at current OSPF message is during greater than current maximum sequence number, then with the maximum sequence number variable of the sequence number update correspondence of carrying in the current OSPF message.
Because being the priority treatment strategy according to the OSPF message, the division of sequence number carries out, make and have the corresponding same sequence number of other message of equal priority processing level, therefore the message of corresponding same sequence number is still according to the reception processing of ranking in proper order, therefore the present invention carries out the sequence number inspection according to the OSPF type of message, can solve packet out-ordering and causes legal sequence of message number to check the problem of not passing through.The technical scheme of the embodiment of the invention has overcome adjusts the out of order problem that occurs after the message processing sequence, has realized that the processing sequence of adjustment message is carried out the inspection of sequence number to message afterwards.
Except above-mentioned two kinds of priority treatment strategies mentioning, technical scheme of the present invention also is applicable to other priority treatment strategy.For example, when only needing processed HELLO message, then can be set to the high priority type by the HELLO message, four types of other in the OSPF message are set to the low priority type.And for example, when the priority treatment grade is divided three classes, have high isopreference level for the HELLO message, have high medium priority for link state acknowledgment packet, Data Description (DD) packet, link state request packet and link state update packet with low isopreference level then can be provided with high priority type, medium priority type and low priority type this moment.
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in further detail.
Because the embodiment of the invention can be good at being applied to adjusting earlier the message processing sequence, carries out the occasion that sequence number is checked again, therefore, the embodiment of the invention is that example is introduced with this application scenario mainly.
At first, when the priority treatment strategy is HELLO message in the priority treatment OSPF message and link state acknowledgment packet, can the HELLO message and link state acknowledgment packet be set to the corresponding first sequence number variable; Data Description (DD) packet, link state request packet and link state update packet are set to the corresponding second sequence number variable.Simultaneously, at ospf router sequence number being set needs corresponding each neighbor router that corresponding sequence number variable is set.For example, current ospf router A exists three neighbor router B, C and D, when the first sequence number variable and the second sequence number variable are set, need the first and second sequence number variablees be set for each neighbor router so.The sequence number variable is along with the increase of the entrained sequence number of the corresponding message of this variable, and brings in constant renewal in, and the value that remains the sequence number variable is for having received the maximum of sequence number since the type message.
Referring to Fig. 3, Fig. 3 is the flow chart of present embodiment method, specifically comprises:
In step 301, receive the OSPF message.
In step 302, judge whether to be HELLO message or link state acknowledgment packet, if, execution in step 303; Otherwise, execution in step 304.
In step 303, the current OSPF message that receives is sent into high-priority channel, execution in step 305.
In embodiments of the present invention, high-priority channel can be made up of high priority OSPF buffer memory, after message is handled through the IP layer, current OSPF message is sent into high priority OSPF buffer memory according to first in first out, waits pending OSPF to handle.In addition, high-priority channel also can be made up of high priority IP formation and high priority OSPF buffer memory, before current OSPF message carries out the processing of IP layer, current message is sent into high priority IP formation according to first in first out, after treating that the IP layer disposes, send into high priority OSPF buffer memory according to first in first out again, wait pending OSPF to handle.
In step 304, the current OSPF message that receives is sent into low-priority channel.
Relative, the low-priority channel in the embodiment of the invention can be that low priority OSPF buffer memory is formed, and after message is handled through the IP layer, current OSPF message is sent into low priority OSPF buffer memory according to first in first out, waits pending OSPF to handle.In addition, low-priority channel also can be made up of low priority I P formation and low priority OSPF buffer memory, before current OSPF message carries out the processing of IP layer, current message is sent into low priority I P formation according to first in first out, after treating that the IP layer disposes, send into low priority OSPF buffer memory according to first in first out again, wait pending OSPF to handle.
In step 305, when needs read the OSPF message of the current OSPF of carrying out processing, preferentially from high-priority channel, read the OSPF message.Just, when high priority OSPF buffer memory has the message of queuing, preferentially from the OSPF buffer memory, read the message that the current OSPF of carrying out handles.Certainly, also be not limited in this mode that preferentially reads.
In step 306, determine the sequence number variable of current OSPF message correspondence.
When the OSPF type of message is HELLO message or link state acknowledgment packet, obtain first maximum sequence number of the neighbor router correspondence of current HELLO message of transmission or link state acknowledgment packet; When the OSPF type of message is Data Description (DD) packet, link state request packet or link state update packet, obtain to send second maximum sequence number of the neighbor router correspondence of current Data Description (DD) packet, link state request packet or link state update packet.
In step 307, the value that reads the current sequence number variable obtains maximum sequence number, promptly sends the maximum sequence number of the neighbor router correspondence of current OSPF message.
In step 308, obtain the sequence number that carries in the current taking-up OSPF message, judge the sequence number that carries in the current OSPF message whether more than or equal to the maximum sequence number of current acquisition, if, execution in step 309; Otherwise, execution in step 310.
In this step, obtain the operation of the sequence number that carries in the current OSPF message, can carry out in this step, also can execution after step 305 is taken out current OSPF message.
In step 309, the sequence number that carries with current OSPF message upgrades the sequence number variable of the neighbor router correspondence that sends this message, and according to ospf protocol should before the OSPF message, finish current handling process.
In step 310, then abandon current OSPF message, finish current handling process.
In addition, referring to Fig. 4, Fig. 4 is the structure chart of embodiment of the invention ospf router, comprises processing unit and memory cell.
Identical with structure shown in Figure 2, processing unit is used for obtaining the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message from described memory cell when checking ospf OSPF sequence number of message; Judge that the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if the sequence number that current OSPF message is carried is recorded to described memory cell, handles current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message; Memory cell is used for storing the sequence number that the OSPF message carries.
Concrete, described processing unit, when being used for sending the maximum sequence number of neighbor router correspondence of this OSPF message according to the OSPF type of message, when the OSPF type of message is health examination HELLO message or link-state information affirmation link state acknowledgment packet, from described memory cell, obtain first maximum sequence number of the neighbor router correspondence of described HELLO message of transmission or link state acknowledgment packet; When the OSPF type of message is described Data Description (DD) packet, link-state information request link state request packet or link-state information renewal link state update packet for the link-state information storehouse, from described memory cell, obtain second maximum sequence number of the neighbor router correspondence of transmission described Data Description (DD) packet, link state request packet or link state update packet.
Concrete, described memory cell is used to each neighbor router to create the first sequence number variable and the second sequence number variable; Described processing unit is used for finding the first sequence number variable of the first sequence number correspondence in the described memory cell when obtaining described first maximum sequence number, and the value that this first sequence number variable is current is as first maximum sequence number of required acquisition; Accordingly, when the sequence number that record carries in the current OSPF message, with the first sequence number variable of the sequence number update first sequence number correspondence of carrying in the current OSPF message; When obtaining described second maximum sequence number, find the second sequence number variable of the second sequence number correspondence in the described memory cell, the value that this second sequence number variable is current is as second maximum sequence number of required acquisition; Accordingly, when the sequence number that record carries in the current OSPF message, with the second sequence number variable of the sequence number update second sequence number correspondence of carrying in the current OSPF message.
In addition, ospf router further comprises: receiving element, high priority processing unit, low priority processing unit and control unit.Wherein, described receiving element is used for sending into the high priority processing unit when receiving HELLO message or link state acknowledgment packet; When receiving the OSPF message of other type of messages, send into the low priority processing unit; Described high priority processing unit and low priority processing unit are used for the message of sending into according to the first in first out access vector cache; Described control unit is used for preferentially reading the OSPF message from high priority element, and the message that reads is sent to described processing unit.
Concrete, described high priority processing unit comprises: high priority IP formation and high priority OSPF buffer memory; Described high priority IP formation is used for according to the first in first out strategy, receives the OSPF message that described receiving element sends into and be sent to the IP layer to handle; Described high priority OSPF buffer memory is used for receiving through the OSPF message after the processing of IP layer according to the first in first out strategy; Described low priority processing unit comprises: low priority I P formation and low priority OSPF buffer memory; Described low priority I P formation is used for according to the first in first out strategy, receives the OSPF message that described receiving element sends into and be sent to the IP layer to handle; Described low priority OSPF buffer memory is used for receiving through the OSPF message after the processing of IP layer according to the first in first out strategy.
When the priority treatment strategy is to determine the priority treatment grade according to the type of message of OSPF message, then the type of message according to the OSPF message is provided with corresponding sequence number, for example, the corresponding HELLO sequence number of HELLO message variable, the corresponding LSAck sequence number of link state acknowledgment packet variable, the corresponding DD sequence number of Data Description (DD) packet variable, the corresponding LSR sequence number of link state request packet variable, the corresponding LSU sequence number of link state update packet variable.Receiving the OSPF message, then the type of message according to correspondence obtains corresponding sequence number variable, the current value of sequence number variable is the maximum of this type of message correspondence, compares according to maximum sequence number variable that obtains and self-contained sequence number then, carries out the inspection of sequence number.Obviously, according to the type of message of OSPF message corresponding sequence number variable being set, to be equally applicable to priority policy be the HELLO message in the priority treatment OSPF message and the scene of link state acknowledgment packet.
Corresponding sequence number variable is being set according to type of message, when processing unit to send the maximum sequence number of neighbor router correspondence of this OSPF message according to the OSPF type of message, then according to the type of message of current OSPF message, the neighbor router that obtains to send described OSPF message is to maximum sequence number that should type of message.
Pass through technique scheme, the embodiment of the invention is by according to the dissimilar sub-sequences of message number, the OSPF message is carried out the sequence number inspection, solved existing sequence number checks that scheme can't be carried out after adjusting the message processing sequence problem, realized after adjusting the message processing sequence, to the inspection of sequence of message number, overcome the adjustment of message processing sequence and the out of order problem brought.
In addition, be not difficult to draw from the technical scheme of the embodiment of the invention, technical scheme of the present invention not only can be after adjusting the message processing sequence, successfully sequence of message number checked; Can also be before adjusting the message processing sequence, sequence of message number is successfully checked, overcome the adjustment of message processing sequence and the out of order problem brought.
Simultaneously, check scheme, can also improve the efficient that ospf router is handled the ospf protocol message with respect to existing sequence number.Existing sequence number is checked scheme, and first analytic message takes out sequence number wherein, carries out the inspection of sequence number; Then, send into the OSPF buffer memory of different priorities, handle and resolve the OSPF message once more and carry out OSPF and handle formally carrying out OSPF according to the variety classes of message.As seen, in the prior art message that receives has been carried out twice parsing.And in technical scheme of the present invention, because the inspection of sequence number is carried out after adjusting the message processing sequence, like this, just can be by the operation of one parsing, finish to the checking of sequence number of message, message digest and according to ospf protocol and handle the operation of message, improve the efficient of handling the ospf protocol message.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. a method of handling ospf OSPF packet out-ordering is characterized in that, this method comprises:
When checking ospf OSPF sequence number of message, obtain the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message;
Judge the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if, write down the sequence number that current OSPF message carries, handle current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message.
2. method according to claim 1 is characterized in that,
The described maximum sequence number that to send the neighbor router correspondence of this OSPF message according to the OSPF type of message specifically comprises:
When the OSPF type of message is health examination HELLO message or link-state information affirmation link state acknowledgment packet, obtain first maximum sequence number of the neighbor router correspondence of described HELLO message of transmission or link state acknowledgment packet;
When the OSPF type of message is described Data Description (DD) packet, link-state information request link state request packet or link-state information renewal link state update packet for the link-state information storehouse, obtain second maximum sequence number of the neighbor router correspondence of transmission described Data Description (DD) packet, link state request packet or link state update packet.
3. method according to claim 2 is characterized in that,
This method further comprises: for each neighbor router is created the first sequence number variable and the second sequence number variable;
When obtaining described first maximum sequence number, obtain the first sequence number variable of the first sequence number correspondence, the value that this first sequence number variable is current is as first maximum sequence number of required acquisition; Accordingly, the sequence number that carries in the current OSPF message of described record is: with the first sequence number variable of the sequence number update first sequence number correspondence of carrying in the current OSPF message;
When obtaining described second maximum sequence number, obtain the second sequence number variable of the second sequence number correspondence, the value that the second sequence number variable is current is as second maximum sequence number of required acquisition; Accordingly, the sequence number that carries in the current OSPF message of described record is: with the second sequence number variable of the sequence number update second sequence number correspondence of carrying in the current OSPF message.
4. according to the described method of arbitrary claim in the claim 1 to 3, it is characterized in that before checking the OSPF sequence number of message, this method further comprises:
When receiving HELLO message or link state acknowledgment packet, send into high-priority channel; When receiving the OSPF message of other type of messages, send into low-priority channel;
When reading the OSPF message of the current OSPF of carrying out processing, preferentially from high-priority channel, read the OSPF message and carry out the sequence number inspection.
5. an ospf router is characterized in that, this ospf router comprises processing unit and memory cell;
Processing unit is used for obtaining the maximum sequence number of the neighbor router correspondence of this OSPF message of transmission according to the OSPF type of message from described memory cell when checking ospf OSPF sequence number of message; Judge that the sequence number that carries in this OSPF message whether more than or equal to the maximum sequence number of described acquisition, if the sequence number that current OSPF message is carried is recorded to described memory cell, handles current OSPF message according to ospf protocol; Otherwise, abandon current OSPF message;
Memory cell is used for storing the sequence number that the OSPF message carries.
6. ospf router according to claim 5 is characterized in that,
Described processing unit, when being used for sending the maximum sequence number of neighbor router correspondence of this OSPF message according to the OSPF type of message, when the OSPF type of message is health examination HELLO message or link-state information affirmation link state acknowledgment packet, from described memory cell, obtain first maximum sequence number of the neighbor router correspondence of described HELLO message of transmission or link state acknowledgment packet; When the OSPF type of message is described Data Description (DD) packet, link-state information request link state request packet or link-state information renewal link state update packet for the link-state information storehouse, from described memory cell, obtain second maximum sequence number of the neighbor router correspondence of transmission described Data Description (DD) packet, link state request packet or link state update packet.
7. ospf router according to claim 6 is characterized in that,
Described memory cell is used to each neighbor router to create the first sequence number variable and the second sequence number variable;
Described processing unit is used for finding the first sequence number variable of the first sequence number correspondence in the described memory cell when obtaining described first maximum sequence number, and the value that this first sequence number variable is current is as first maximum sequence number of required acquisition; Accordingly, when the sequence number that record carries in the current OSPF message, with the first sequence number variable of the sequence number update first sequence number correspondence of carrying in the current OSPF message; When obtaining described second maximum sequence number, find the second sequence number variable of the second sequence number correspondence in the described memory cell, the value that this second sequence number variable is current is as second maximum sequence number of required acquisition; Accordingly, when the sequence number that record carries in the current OSPF message, with the second sequence number variable of the sequence number update second sequence number correspondence of carrying in the current OSPF message.
8. according to the described ospf router of arbitrary claim in the claim 5 to 7, it is characterized in that this ospf router further comprises: receiving element, high priority processing unit, low priority processing unit and control unit;
Described receiving element is used for sending into the high priority processing unit when receiving HELLO message or link state acknowledgment packet; When receiving the OSPF message of other type of messages, send into the low priority processing unit;
Described high priority processing unit and low priority processing unit are used for the message of sending into according to the first in first out access vector cache;
Described control unit is used for preferentially reading the OSPF message from high priority element, and the message that reads is sent to described processing unit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101018986A CN101237462B (en) | 2008-03-13 | 2008-03-13 | A method for processing disorderly OSPF report and OSPF router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101018986A CN101237462B (en) | 2008-03-13 | 2008-03-13 | A method for processing disorderly OSPF report and OSPF router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101237462A CN101237462A (en) | 2008-08-06 |
| CN101237462B true CN101237462B (en) | 2011-01-05 |
Family
ID=39920820
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101018986A Active CN101237462B (en) | 2008-03-13 | 2008-03-13 | A method for processing disorderly OSPF report and OSPF router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101237462B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394098B (en) * | 2014-11-20 | 2018-07-10 | 迈普通信技术股份有限公司 | A kind of message processing method and device |
| CN107888495B (en) * | 2017-12-28 | 2021-06-29 | 新华三技术有限公司 | Route calculation method and device |
| CN109756487B (en) * | 2018-12-25 | 2021-07-23 | 杭州迪普科技股份有限公司 | Authentication method, device, equipment and storage medium |
| CN113824636B (en) * | 2020-06-18 | 2024-10-15 | 中兴通讯股份有限公司 | Message sending method, message receiving method, electronic equipment, system and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1455564A (en) * | 2003-06-19 | 2003-11-12 | 北京港湾网络有限公司 | Method for solving stability of OSPF protocol at multi-neighbour high route |
| CN1997082A (en) * | 2006-01-05 | 2007-07-11 | 华为技术有限公司 | Recognition method of in-band voice data based on the change switching of the net load in the network |
| WO2007102965A2 (en) * | 2006-03-08 | 2007-09-13 | Cisco Technology, Inc. | Technique for preventing routing loops by disseminating bgp attribute information in an ospf-configured network |
-
2008
- 2008-03-13 CN CN2008101018986A patent/CN101237462B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1455564A (en) * | 2003-06-19 | 2003-11-12 | 北京港湾网络有限公司 | Method for solving stability of OSPF protocol at multi-neighbour high route |
| CN1997082A (en) * | 2006-01-05 | 2007-07-11 | 华为技术有限公司 | Recognition method of in-band voice data based on the change switching of the net load in the network |
| WO2007102965A2 (en) * | 2006-03-08 | 2007-09-13 | Cisco Technology, Inc. | Technique for preventing routing loops by disseminating bgp attribute information in an ospf-configured network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101237462A (en) | 2008-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lindgren et al. | Probabilistic routing protocol for intermittently connected networks | |
| KR100865357B1 (en) | Method and apparatus of modifying integrity protection configuration in a mobile user equipment of a wireless communications system | |
| Iyengar et al. | RFC 9000: QUIC: A UDP-based multiplexed and secure transport | |
| US7447796B2 (en) | System, method and program product to route message packets | |
| US10439940B2 (en) | Latency correction between transport layer host and deterministic interface circuit | |
| US9247430B2 (en) | Method of processing a data packet on transmission, a method of processing a data packet on reception, and associated devices and nodes | |
| US20150207793A1 (en) | Feature Enablement or Disablement Based on Discovery Message | |
| US20080137669A1 (en) | Network of nodes | |
| CA2676770A1 (en) | System and method for data transfer in a peer-to-peer hybrid communication network | |
| US10461886B2 (en) | Transport layer identifying failure cause and mitigation for deterministic transport across multiple deterministic data links | |
| US20220191309A1 (en) | Method for filtering redundant data packet at node in bluetooth mesh network | |
| CN101237462B (en) | A method for processing disorderly OSPF report and OSPF router | |
| US8160066B2 (en) | Method for mobile IPv6 data traversing state firewall | |
| CN111886835B (en) | Message cache management in a mesh network | |
| US7916640B1 (en) | Buffer overflow prevention for network devices | |
| CN106254152A (en) | A kind of flow control policy treating method and apparatus | |
| US8069469B1 (en) | Addressing security in asymmetrical networks | |
| JP4772553B2 (en) | Data transmitting / receiving apparatus and data transmitting / receiving method | |
| US9306704B2 (en) | Broadcasting method and communication device | |
| CN101562500A (en) | Data transmission request method, data transmission method and data transmission device | |
| US10447549B2 (en) | Neighbor establishment method and system, and device | |
| US8819790B2 (en) | Cooperation method and system between send mechanism and IPSec protocol in IPV6 environment | |
| US9261948B2 (en) | Image forming apparatus and control method for executing a proxy in response to a heartbeat | |
| US20180262418A1 (en) | Method and apparatus for communication in virtual network | |
| US6088826A (en) | Method for checking data for errors in data communication systems |
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: 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 |