CN105991451B - LSA delet method and device based on OSPF - Google Patents
LSA delet method and device based on OSPF Download PDFInfo
- Publication number
- CN105991451B CN105991451B CN201510103106.9A CN201510103106A CN105991451B CN 105991451 B CN105991451 B CN 105991451B CN 201510103106 A CN201510103106 A CN 201510103106A CN 105991451 B CN105991451 B CN 105991451B
- Authority
- CN
- China
- Prior art keywords
- lsa
- aging
- local
- chained list
- time
- 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
Abstract
The present invention provides LSA delet method and device based on OSPF, and this method is applied on ospf router, comprising: whether when needing to delete any LSA to be aging in local aging chained list, judging that neighbours retransmit in chained list includes LSA to be aging；If it does not include LSA to be aging that neighbours, which retransmit in chained list, and local router establishes syntople state without being in any neighbor router, the generation time of LSA to be aging is then obtained, and calculates the time difference of current time and the generation time of LSA to be aging；If the time difference, which is greater than preset LSA, generates spacing value, the corresponding link-state information of LSA to be aging in local LSA database is deleted, and deletes the corresponding LSA mark of LSA to be aging in local aging chained list.Therefore, the present invention may be implemented LSA to be aging will not be deleted quickly and LSA generate after, preset LSA generate spacing value in still have.
Description
Technical field
The present invention relates to network communication technology fields, more particularly to LSA delet method and device based on OSPF.
Background technique
Ospf (Open Shortest Path First, OSPF) is current most popular one
Kind Interior Gateway Protocol (Interior Gateway Protocol, IGP).Router calculates the consistency of routing in ospf domain
Be on the LSA database of each router itself it is consistent premised on.
In the prior art, when generating a LSA, the generation time for recording the LSA is generally required, regenerates LSA next time
When need to calculate current time and the last difference for generating the time, then postponed to generate if it is less than MinLSInterval seconds, it is no
It can then directly generate.Wherein, refer within MinLSInterval seconds generating the minimum interval of a specific LSA, value is generally set to
5 seconds；It refers within MinLSArrival seconds that specific LSA must be spaced between the new example of LSA receiving in flooding process
Time, value is generally set to 1 second.
The method of above-mentioned generation LSA is all built upon the basis that local ospf router preserves the LSA of last generation
On, it is not particularly suited for the situation that the LSA of last generation has been aging.And existing LSA delet method is general are as follows: work as OSPF
When router needs one LSA of aging, then the LSA is set in vain, and deletes the LSA from the LSA database of itself and correspond to
All information.
But due to being deleted quickly after LSA aging, when so that regenerating the LSA, it can not judge that this time generating the time is
It is no suitable, so that it is inconsistent to be easy to cause the data saved in each LSA database in ospf area to occur.
Summary of the invention
The present invention provide LSA delet method and device based on OSPF, with solve in the prior art due to after LSA aging very
It is fast to be deleted, when so that regenerating the LSA, can not judge whether this generation time is suitable, to be easy to cause ospf area
There is inconsistent problem in the data saved in interior each LSA database.
According to a first aspect of the embodiments of the present invention, a kind of LSA delet method based on OSPF, the method application are provided
In on ospf router, comprising:
When needing to delete any Link State Advertisement LSA to be aging in local aging chained list, judge that neighbours retransmit chain
It whether include the LSA to be aging in table；
If it does not include the LSA to be aging in chained list that the neighbours, which retransmit, and local router does not have and any neighbours
Router is in and establishes syntople state, then obtains the generation time of the LSA to be aging, and calculate current time and institute
State the time difference of the generation time of LSA to be aging；
If the time difference, which is greater than preset LSA, generates spacing value, delete to be aging described in local LSA database
The corresponding link-state information of LSA, and delete the corresponding LSA mark of LSA to be aging described in local aging chained list.
According to a second aspect of the embodiments of the present invention, a kind of LSA deletion device based on OSPF, described device application are provided
In on ospf router, comprising:
Judging unit, for sentencing when needing to delete any Link State Advertisement LSA to be aging in local aging chained list
Whether it includes the LSA to be aging that disconnected neighbours retransmit in chained list；
Acquiring unit, if retransmitting in chained list for the neighbours does not include the LSA to be aging, and local router does not have
Have to be in any neighbor router and establish syntople state, then obtains the generation time of the LSA to be aging, and calculate
The time difference of the generation time of current time and the LSA to be aging；
Unit is deleted, if being greater than preset LSA for the time difference generates spacing value, deletes local LSA database
Described in the corresponding link-state information of LSA to be aging, and to delete LSA to be aging described in local aging chained list corresponding
LSA mark.
Using the embodiment of the present invention, when needing to delete any LSA to be aging in local aging chained list, neighbours' weight is judged
Whether include the to be aging LSA, if in neighbours' re-transmission chained list not including LSA to be aging, and local router if passing in chained list
Syntople state is established without being in any neighbor router, then obtains the generation time of LSA to be aging, and calculate and work as
The time difference of preceding time and the generation time of LSA to be aging, if the time difference being calculated is greater than preset LSA and generates interval
Value then deletes the corresponding link-state information of LSA to be aging in local LSA database, and deletes in local aging chained list
The corresponding LSA mark of LSA to be aging, so that realizing LSA to be aging will not be deleted quickly, only meets deletion condition
After could be deleted, and then ensure that LSA generate after, preset LSA generate spacing value in still have, to avoid neighbours
There is packet loss when receiving LSA in router.
Detailed description of the invention
Fig. 1 is the application scenarios schematic diagram deleted using the embodiment of the present invention based on the LSA of OSPF；
Fig. 2 is one embodiment flow chart of the LSA delet method the present invention is based on OSPF；
Fig. 3 is another embodiment flow chart of the LSA delet method the present invention is based on OSPF；
Fig. 4 is a kind of hardware structure diagram of equipment where deleting device the present invention is based on the LSA of OSPF；
Fig. 5 is that the present invention is based on one embodiment block diagrams that the LSA of OSPF deletes device.
Specific embodiment
Technical solution in embodiment in order to enable those skilled in the art to better understand the present invention, and make of the invention real
The above objects, features, and advantages for applying example can be more obvious and easy to understand, with reference to the accompanying drawing to technical side in the embodiment of the present invention
Case is described in further detail.
Referring to Fig. 1, the application scenarios schematic diagram deleted for the application embodiment of the present invention based on the LSA of OSPF:
A kind of group-network construction of multiple ospf routers is shown in Fig. 1.Multiple ospf router calculates the one of routing
Cause property be on the LSA database of each ospf router itself it is consistent premised on.
Wherein, each ospf router all can be all effective Link State Advertisement (Link-State
Advertisement, LSA) it is put into the LSA database of itself, and routing is calculated using these LSA, thus it is guaranteed that same
The uniformity and correctness of each LSA database in ospf area are just particularly important.
Ospf protocol regulation: when ospf router receives a LSA, if in the LSA database of local including the LSA,
And the LSA of local LSA database is that local LSA database is added by flooding in MinLSArrival seconds, then abandons
New received LSA it requires that the time interval of ospf router transmission LSA cannot be less than MinLSInterval seconds.Wherein,
Refer within MinLSInterval seconds generating the minimum interval of a specific LSA, value is generally set to 5 seconds；MinLSArrival seconds
Refer to for specific LSA, received in flooding process between the new example of LSA must interval time, value is generally set to 1
Second.
Such as: as shown in Figure 1, the LSA of the frequent updating includes when some LSA frequent updating of ospf router 2
LSA1 and LSA2, wherein LSA2 is newer LSA, to ospf router 1 and OSPF in time LSA2 very short after the LSA1
Router 3 floods, and does not receive ospf router 1 and ospf router 3 also at this time to the confirmation message of LSA1, then can weigh neighbours
The LSA1 passed on chained list replaces with LSA2, and receives ospf router 1 and ospf router 3 later to the confirmation message of LSA1,
Since the confirmation message received does not have the particular content of corresponding LSA1 or LSA2, can not judge be LSA1 confirmation message also
It is the confirmation message of LSA2, is deleted on chained list so ospf router 2 also can retransmit LSA2 from neighbours.And ospf router 1
With ospf router 3 also due to receiving interval time is that MinLSArrival is checked, and abandons LSA2 in MinLSArrival,
To which the data saved in the LSA database of ospf router 2, ospf router 1 or ospf router 3 are inconsistent.Therefore, it is
Above-mentioned confirmation random ordering problem is avoided, still requires each router interval when sending LSA cannot to be less than MinLSInterval
Second.
In the prior art, when generating a LSA, the generation time for recording the LSA is generally required, regenerates LSA next time
When need to calculate current time and the last difference for generating the time, then postponed to generate if it is less than MinLSInterval seconds, it is no
It can then directly generate.
Wherein, refer within MinLSInterval seconds generating the minimum interval of a specific LSA, value is generally set to 5 seconds；
Refer within MinLSArrival seconds for specific LSA, received in flooding process must be spaced between the new example of LSA when
Between, value is generally set to 1 second.
In addition, the generation of LSA is there are two trigger condition, one be LSA content change, for example, the network segment of LSA, mask,
The information such as cost change；The other is the periodic refreshing of LSA.
The method of above-mentioned generation LSA is all built upon the basis that local ospf router preserves the LSA of last generation
On, it is not particularly suited for the situation that the LSA of last generation has been aging.And existing LSA delet method is general are as follows: work as OSPF
When router needs one LSA of aging, then the LSA is set in vain, and deletes the LSA from the LSA database of itself and correspond to
All information.But due to being deleted quickly after LSA aging, when so that regenerating the LSA, when can not judge this time to generate
Between it is whether suitable, so that it is inconsistent to be easy to cause the data saved in each LSA database in ospf area to occur.
And in the embodiment of the present invention, when ospf router needs one LSA of aging, be not the LSA is deleted quickly, and
It is to hang over the LSA on local aging chained list, after waiting for a period of time, judges whether the LSA needs to delete, when meets deletion item
Part then deletes the LSA, if not meeting deletion condition, the delayed deletion LSA, until deleted again after meeting deletion condition, thus
After ensure that LSA is generated, still had in MinLSInterval seconds, and then ensure that each LSA data in ospf area
The data saved in library occur inconsistent.
The embodiment of the LSA method the present invention is based on OSPF is described in detail with reference to the accompanying drawing.
Referring to fig. 2, for the present invention is based on one embodiment flow chart of the LSA delet method of OSPF, which can be with
Applied on ospf router, comprising the following steps:
Step 210: when needing to delete any LSA to be aging in local aging chained list, judging that neighbours retransmit in chained list
It whether include the LSA to be aging.Wherein, local aging chained list following can hang multiple LSA to be aging.
Specifically, after local router itself generates new LSA or the new LSA that receives, by the new LSA to
Other neighbor router floodings are spread.In order to guarantee that neighbor router is actually received the new LSA, need that this is new
LSA is suspended to neighbours and retransmits on chained list.If receiving the confirmation message of neighbor router reply, retransmits from neighbours and deleted on chained list
The new LSA；If being not received by the confirmation message of neighbor router reply, it can periodically continue to retransmit to neighbor router and be somebody's turn to do
New LSA.So since neighbours retransmit the presence of chained list, it can be ensured that new LSA accurate delivery.When neighbours retransmit in chained list
Including LSA to be aging, shows that the LSA to be aging also needs to retransmit, cannot delete；When neighbours retransmit chained list in do not include to
The LSA of aging shows that the LSA to be aging does not need to retransmit, if needs to delete the LSA to be aging and also needs further
Analysis.
Wherein, which is old LSA, and new and old can use for distinguishing LSA provides in existing ospf protocol
LSA new/old decision principle, repeat no more herein.
Step 220: if it does not include LSA to be aging in chained list that neighbours, which retransmit, and local router does not have and any neighbours
Router be in establish syntople state, then obtain the generation time of LSA to be aging, and calculate current time with it is to be aging
LSA generation the time time difference.
Specifically, when local router and any neighbor router, which are in, establishes syntople state, local router
Need to exchange respective LSA database with neighbor router.In order to guarantee the consistent of the data saved in each LSA database
Property, the data in LSA database cannot be deleted at this time.
Step 230: if the time difference being calculated is greater than preset LSA and generates spacing value, deleting local LSA database
In the corresponding link-state information of LSA to be aging, and delete the corresponding LSA mark of LSA to be aging in local aging chained list
Know.Wherein, preset LSA generates spacing value and is generally 5 seconds, and LSA identifies the title that can be LSA, is also possible to the title of LSA
With the generation time of LSA.
Specifically, when the time difference, which is greater than preset LSA, generates spacing value, show after LSA is generated, in preset LSA
It generates and is still had in spacing value, that is, MinLSInterval seconds, and meet other deletion conditions, then it is to be aging can to delete this
LSA.
It in one embodiment, can be according to the life of LSA to be aging when obtaining the generation time of LSA to be aging
The position saved at the time is different, and uses different acquisition modes, specific as follows:
First: being stored in local aging chained list.
Specifically: when if the corresponding LSA of LSA to be aging is identified as LSA title and LSA generation in local aging chained list
Between, then the generation time of the LSA to be aging is obtained from local aging chained list.
Second: being stored in local LSA database.
Specifically: if the corresponding LSA of LSA to be aging is identified as LSA title in local aging chained list, from local LSA
The generation time of the LSA to be aging is obtained in the corresponding link-state information of LSA to be aging of database.
In another embodiment, the data source of local aging chained list by following two source mode or following two Lai
The combination of source mode:
First: receiving at least one LSA to be aging that neighbor router is sent, and the LSA to be aging that will be received
It is stored in local aging chained list.
Second: at least one local LSA to be aging being determined according to ospf protocol, and determining LSA to be aging is deposited
Enter in local aging chained list.
In addition, can star ageing timer, only the aging after LSA to be aging is stored in local aging chained list
It just can star after timer expiry and the judgement for deleting the LSA to be aging whether needed to identify.
Therefore, neighbours are judged when needing to delete any LSA to be aging in local aging chained list in the embodiment of the present invention
Whether include the to be aging LSA, if in neighbours' re-transmission chained list not including LSA to be aging, and local routing if retransmitting in chained list
Device establishes syntople state without being in any neighbor router, then obtains the generation time of LSA to be aging, and calculate
The time difference of the generation time of current time and LSA to be aging, if the time difference being calculated is greater than between preset LSA generation
Every value, then the corresponding link-state information of LSA to be aging in local LSA database is deleted, and deletes local aging chained list
In the corresponding LSA mark of to be aging LSA, so that realizing LSA to be aging will not be deleted quickly, only meet deletion item
Could be deleted after part, so ensure that LSA generate after, preset LSA generate spacing value in still have, to avoid neighbour
It occupies router and packet loss occurs.
Referring to Fig. 3, for the present invention is based on another embodiment flow chart of the LSA delet method of OSPF, which can
To be applied on ospf router, and be the further expansion to embodiment illustrated in fig. 2, the embodiment the following steps are included:
Step 310: when needing to delete any LSA to be aging in local aging chained list, judging that neighbours retransmit in chained list
It whether include the LSA to be aging, if so, thening follow the steps 320；It is no to then follow the steps 330.
Step 320: detection neighbours retransmit chained list, until the neighbours, which retransmit, does not include the LSA to be aging in chained list
Afterwards, and local router is no and any neighbor router is in and establishes syntople state, then obtains the life of LSA to be aging
At the time, and the time difference of current time and the generation time of the LSA to be aging is calculated, then, executes step 360.
Step 330: judge that local router and neighbor router are in and establish syntople state, if local router and
At least one neighbor router is in and establishes syntople state, thens follow the steps 340；If local router does not have and any neighbour
Router is occupied in syntople state is established, thens follow the steps 350.
Step 340: detection syntople state, until local router is without adjacent in establishing with any neighbor router
After connecing relation condition, then the generation time of LSA to be aging is obtained, and calculates the life of current time Yu the LSA to be aging
At the time difference of time, then, step 360 is executed.
Step 350: obtaining the generation time of LSA to be aging, and calculate the life of current time Yu the LSA to be aging
At the time difference of time, then, step 360 is executed.
Step 360: judging whether the time difference being calculated is greater than preset LSA and generates spacing value, if so, executing step
Rapid 370；Otherwise, step 380 is executed.
Step 370: deleting the corresponding link-state information of LSA to be aging in the LSA database of local, and delete local
The corresponding LSA mark of LSA to be aging, process terminate in aging chained list.
Step 380: delayed deletion mark, and the LSA that delayed deletion is to be aging, and timing are added to LSA to be aging
The time difference of current time and the generation time of the LSA to be aging is calculated, until the time difference is greater than preset time value
When, then the corresponding link-state information of LSA to be aging in local LSA database is deleted, and delete in local aging chained list
The corresponding LSA mark of LSA to be aging, process terminate.
Wherein, add delayed deletion mark purpose be in order to in local LSA database for the LSA of normal use into
Row is distinguished, which appears to be in ospf protocol has been not present, and only forces to allow it in local
Retain a period of time in LSA database again, but it will not be synchronized as the LSA for normal use, will not influence in this way
The normal function of ospf protocol, so showing that this time point is when certain LSA is there is no in the LSA database of local can be again
Generate new LSA's.
Therefore, delayed deletion mechanism is utilized in the embodiment of the present invention, after on the one hand can ensure that LSA is generated,
It is still had in MinLSInterval seconds, so that neighbor router MinLSArrival be avoided packet loss occur when checking；Another party
It is too fast that face can also inhibit link state ID in OSPFv3 (Link State ID, LSID) to increase.
By taking five class LSA as an example, when being configured in OSPFv3 to the LSID in five class LSA, existing method is general
Using recording allocated maximum LSID, if when newly-generated LSA, adding 1 with maximum LSID, but the frequent aging of LSA,
When generation, aging then deletes original LSA from database, and then generates new LSA again, is using maximum every time
LSID add 1, so as to cause LSID is increased can be quickly.And delayed deletion mechanism is used in the embodiment of the present invention, generating one
When a new LSA, no when being certain to first search in local LSA database there are the LSA, and if so, will use same
LSID, will not be too fast so that LSID is increased.
Corresponding with the aforementioned embodiment of the method for LSA delet method based on OSPF, the present invention also provides be based on OSPF
LSA delete device embodiment.
The present invention is based on the LSA of the OSPF embodiments for deleting device to apply on ospf router.Installation practice
It can also be realized by way of hardware or software and hardware combining by software realization.Taking software implementation as an example, as one
Device on a logical meaning is by the processor of equipment where it by computer program corresponding in nonvolatile memory
Instruction is read into memory what operation was formed.For hardware view, as shown in figure 4, for the present invention is based on the LSA of OSPF deletions
A kind of hardware structure diagram of equipment where device in addition to processor shown in Fig. 4, network interface, memory and non-volatile is deposited
Except reservoir, the equipment in embodiment where device can also include usually other hardware, such as be responsible for the forwarding core of processing message
Piece etc.；The equipment is also possible to be distributed equipment from hardware configuration, may include multiple interface cards, so as to hard
The extension of part level progress Message processing.
Referring to Fig. 5, for the present invention is based on one embodiment block diagram that the LSA of OSPF deletes device, described device can be answered
With on ospf router, described device includes: judging unit 51, acquiring unit 52 and deletion unit 53.
Wherein, judging unit 51 is used to delete any Link State Advertisement to be aging in local aging chained list when needs
Whether when LSA, judging that neighbours retransmit in chained list includes the LSA to be aging.
If it does not include the LSA to be aging that acquiring unit 52 retransmits in chained list for the neighbours, and local router
Syntople state is established without being in any neighbor router, then obtains the generation time of the LSA to be aging, and count
Calculate the time difference of current time and the generation time of the LSA to be aging.
Spacing value is generated if deleting unit 53 and being greater than preset LSA for the time difference, deletes local LSA database
Described in the corresponding link-state information of LSA to be aging, and to delete LSA to be aging described in local aging chained list corresponding
LSA mark.
In an optional implementation, it may include: detection unit (Fig. 5 that the LSA based on OSPF, which deletes device,
In be not shown).
Wherein, if it includes the LSA to be aging that detection unit retransmits in chained list for the neighbours, the neighbour is detected
Residence retransmits chained list, until the neighbours retransmit after not including the LSA to be aging in chained list, and local router is no and appoints
One neighbor router is in and establishes syntople state, then obtains the generation time of the LSA to be aging, and when calculating current
Between with the LSA to be aging generation the time time difference；And if it does not include described to old that the neighbours, which retransmit in chained list,
The LSA of change, and local router and neighbor router are in and establish syntople state, then detect the syntople state,
Until local router is no and any neighbor router is in after establishing syntople state, then obtain described to be aging
The generation time of LSA, and calculate the time difference of current time and the generation time of the LSA to be aging.
In another optional implementation, it may include: delay cell that the LSA based on OSPF, which deletes device,
(being not shown in Fig. 5).
Wherein, if delay cell generates spacing value no more than preset LSA for the time difference, to described to old
The LSA of change adds delayed deletion mark, and LSA to be aging described in delayed deletion, and timing calculate the time difference, until
When the time difference is greater than preset time value, then delete the corresponding link shape of LSA to be aging described in local LSA database
State information, and delete the corresponding LSA mark of LSA to be aging described in local aging chained list.
In another optional implementation, it may include: receiving unit that the LSA based on OSPF, which deletes device,
(being not shown in Fig. 5).
Wherein, receiving unit is used to receive at least one LSA to be aging of neighbor router transmission, and by described at least
One LSA to be aging is stored in local aging chained list；And/or determine that locally at least one is to be aging according to ospf protocol
LSA, and at least one described LSA to be aging is stored in local aging chained list.
The function of each unit and the realization process of effect are specifically detailed in the above method and correspond to step in above-mentioned apparatus
Realization process, details are not described herein.
For device embodiment, since it corresponds essentially to embodiment of the method, so related place is referring to method reality
Apply the part explanation of example.The apparatus embodiments described above are merely exemplary, wherein described be used as separation unit
The unit of explanation may or may not be physically separated, and component shown as a unit can be or can also be with
It is not physical unit, it can it is in one place, or may be distributed over multiple network units.It can be according to actual
The purpose for needing to select some or all of the modules therein to realize the present invention program.Those of ordinary skill in the art are not paying
Out in the case where creative work, it can understand and implement.
As seen from the above-described embodiment, when needing to delete any LSA to be aging in local aging chained list, judge neighbours' weight
Whether include the to be aging LSA, if in neighbours' re-transmission chained list not including LSA to be aging, and local router if passing in chained list
Syntople state is established without being in any neighbor router, then obtains the generation time of LSA to be aging, and calculate and work as
The time difference of preceding time and the generation time of LSA to be aging, if the time difference being calculated is greater than preset LSA and generates interval
Value then deletes the corresponding link-state information of LSA to be aging in local LSA database, and deletes in local aging chained list
The corresponding LSA mark of LSA to be aging, so that realizing LSA to be aging will not be deleted quickly, only meets deletion condition
After could be deleted, and then ensure that LSA generate after, preset LSA generate spacing value in still have, to avoid neighbours
There is packet loss in router.
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to of the invention its
Its embodiment.This application is intended to cover any variations, uses, or adaptations of the invention, these modifications, purposes or
Person's adaptive change follows general principle of the invention and including the undocumented common knowledge in the art of the present invention
Or conventional techniques.The description and examples are only to be considered as illustrative, and true scope and spirit of the invention are by following
Claim is pointed out.
It should be understood that the present invention is not limited to the precise structure already described above and shown in the accompanying drawings, and
And various modifications and changes may be made without departing from the scope thereof.The scope of the present invention is limited only by the attached claims.
Claims (10)
1. a kind of LSA delet method based on open shortest path first OSPF, which is characterized in that the method is applied to
On ospf router, comprising:
When needing to delete any Link State Advertisement LSA to be aging in local aging chained list, judge that neighbours retransmit in chained list
It whether include the LSA to be aging；
If it does not include the LSA to be aging in chained list that the neighbours, which retransmit, and local router with any neighbours without routing
Device be in establish syntople state, then obtain the generation time of the LSA to be aging, and calculate current time and it is described to
The time difference of the generation time of the LSA of aging；
If the time difference is greater than the minimum spacing value that a specific LSA is generated, delete described in local LSA database to old
The corresponding link-state information of the LSA of change, and delete the corresponding LSA mark of LSA to be aging described in local aging chained list.
2. the method according to claim 1, wherein it is described judge neighbours retransmit in chained list whether include it is described to
After the LSA of aging, further includes:
If it includes the LSA to be aging in chained list that the neighbours, which retransmit, detects the neighbours and retransmit chained list, until the neighbour
It occupies after not including the LSA to be aging in re-transmission chained list, and local router is without being in foundation with any neighbor router
Syntople state, then the generation time of the LSA to be aging is obtained, and calculate current time and the LSA to be aging
Generation the time time difference.
3. the method according to claim 1, wherein it is described judge neighbours retransmit in chained list whether include it is described to
After the LSA of aging, further includes:
If it does not include the LSA to be aging in chained list that the neighbours, which retransmit, and local router and neighbor router are in and build
Vertical syntople state, then detect the syntople state, until local router with any neighbor router without being in
After establishing syntople state, then obtain the generation time of the LSA to be aging, and calculate current time with it is described to be aging
LSA generation the time time difference.
4. method according to any one of claims 1 to 3, which is characterized in that the life for obtaining the LSA to be aging
It is specifically included at the time:
If the corresponding LSA of LSA to be aging is identified as LSA title described in local aging chained list and LSA generates the time, from this
The generation time of the LSA to be aging is obtained in ground aging chained list；
If the corresponding LSA of LSA to be aging described in local aging chained list is identified as LSA title, from local LSA database
The generation time of the LSA to be aging is obtained in the corresponding link-state information of the LSA to be aging.
5. method according to any one of claims 1 to 3, which is characterized in that the calculating current time is with described to old
After the time difference of the generation time of the LSA of change, further includes:
If the time difference generates spacing value no more than preset LSA, delayed deletion mark is added to the LSA to be aging
Will, and LSA to be aging described in delayed deletion, and timing calculate the time difference, until the time difference is greater than preset
When time value, then the corresponding link-state information of LSA to be aging described in local LSA database is deleted, and deleted local
The corresponding LSA mark of LSA to be aging described in aging chained list.
6. the method according to claim 1, wherein the method also includes:
At least one LSA to be aging that neighbor router is sent is received, and at least one described LSA to be aging is stored in this
In ground aging chained list；And/or at least one local LSA to be aging is determined according to ospf protocol, and by it is described at least one wait for
The LSA of aging is stored in local aging chained list.
7. a kind of LSA based on open shortest path first OSPF deletes device, which is characterized in that described device is applied to
On ospf router, comprising:
Judging unit, for judging neighbour when needing to delete any Link State Advertisement LSA to be aging in local aging chained list
It occupies and whether retransmits in chained list including the LSA to be aging；
Acquiring unit, if retransmitting in chained list for the neighbours does not include the LSA to be aging, and local router without and
Any neighbor router is in and establishes syntople state, then obtains the generation time of the LSA to be aging, and calculates current
The time difference of time and the generation time of the LSA to be aging；
Unit is deleted, if being greater than the minimum spacing value that a specific LSA is generated for the time difference, deletes local LSA number
According to the corresponding link-state information of LSA to be aging described in library, and delete LSA to be aging described in local aging chained list
Corresponding LSA mark.
8. device according to claim 7, which is characterized in that described device further include:
Detection unit detects the neighbours and retransmits chain if retransmitting for the neighbours includes the LSA to be aging in chained list
Table, until the neighbours retransmit chained list in do not include the LSA to be aging after, and local router without and any neighbours road
Be in by device and establish syntople state, then obtain the generation time of the LSA to be aging, and calculate current time with it is described
The time difference of the generation time of LSA to be aging；And if it does not include the LSA to be aging that the neighbours, which retransmit in chained list,
And local router and neighbor router are in and establish syntople state, then detect the syntople state, until local
Router is no and any neighbor router is in after establishing syntople state, then obtains the generation of the LSA to be aging
Time, and calculate the time difference of current time and the generation time of the LSA to be aging.
9. device according to claim 7, which is characterized in that described device further include:
Delay cell, if generate spacing value no more than preset LSA for the time difference, to the LSA to be aging
Delayed deletion mark is added, and LSA to be aging described in delayed deletion, and timing calculate the time difference, until when described
Between difference when being greater than preset time value, then delete LSA to be aging described in local LSA database corresponding link state letter
Breath, and delete the corresponding LSA mark of LSA to be aging described in local aging chained list.
10. device according to claim 7, which is characterized in that described device further include:
Receiving unit, for receive neighbor router transmission at least one LSA to be aging, and by it is described at least one wait for always
The LSA of change is stored in local aging chained list；And/or at least one local LSA to be aging is determined according to ospf protocol, and by institute
At least one LSA to be aging is stated to be stored in local aging chained list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510103106.9A CN105991451B (en) | 2015-03-09 | 2015-03-09 | LSA delet method and device based on OSPF |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510103106.9A CN105991451B (en) | 2015-03-09 | 2015-03-09 | LSA delet method and device based on OSPF |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105991451A CN105991451A (en) | 2016-10-05 |
| CN105991451B true CN105991451B (en) | 2018-12-25 |
Family
ID=57040294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510103106.9A Active CN105991451B (en) | 2015-03-09 | 2015-03-09 | LSA delet method and device based on OSPF |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105991451B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417901B (en) * | 2019-07-31 | 2022-04-29 | 北京金山云网络技术有限公司 | Data processing method and device and gateway server |
| CN113037633B (en) * | 2021-02-25 | 2023-04-18 | 杭州迪普科技股份有限公司 | Notification processing method, device, equipment and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6885634B1 (en) * | 2001-01-24 | 2005-04-26 | At&T Corp. | Network protocol having staggered recovery |
| CN1852264A (en) * | 2006-05-25 | 2006-10-25 | 杭州华为三康技术有限公司 | Method for transmitting link-state information |
| CN101316229A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Method and router for synchronizing link state advertisement |
| CN101488863A (en) * | 2009-02-19 | 2009-07-22 | 华为技术有限公司 | Method, apparatus and system for eliminating route oscillation in neighbor reconstruction |
| CN102761492A (en) * | 2012-07-25 | 2012-10-31 | 杭州华三通信技术有限公司 | Routing relearning method and device based on OSPF (Open Shortest Path First) protocol |
| CN103095590A (en) * | 2013-01-05 | 2013-05-08 | 杭州华三通信技术有限公司 | Method and network device for suppressing link status message periodical refreshing and aging |
-
2015
- 2015-03-09 CN CN201510103106.9A patent/CN105991451B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6885634B1 (en) * | 2001-01-24 | 2005-04-26 | At&T Corp. | Network protocol having staggered recovery |
| CN1852264A (en) * | 2006-05-25 | 2006-10-25 | 杭州华为三康技术有限公司 | Method for transmitting link-state information |
| CN101316229A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Method and router for synchronizing link state advertisement |
| CN101488863A (en) * | 2009-02-19 | 2009-07-22 | 华为技术有限公司 | Method, apparatus and system for eliminating route oscillation in neighbor reconstruction |
| CN102761492A (en) * | 2012-07-25 | 2012-10-31 | 杭州华三通信技术有限公司 | Routing relearning method and device based on OSPF (Open Shortest Path First) protocol |
| CN103095590A (en) * | 2013-01-05 | 2013-05-08 | 杭州华三通信技术有限公司 | Method and network device for suppressing link status message periodical refreshing and aging |
Non-Patent Citations (1)
| Title |
|---|
| 基于OSPF协议的网络优化技术;黄石平;《现代计算机（专业版）》;20140409;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105991451A (en) | 2016-10-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106063195B (en) | Control equipment discovery in network with independent control equipment and forwarding device | |
| Mühlbauer et al. | Building an AS-topology model that captures route diversity | |
| KR100969158B1 (en) | Method of trust management in wireless sensor networks | |
| CN100394745C (en) | Method for dynamically selecting outlet pathway | |
| CN111431800B (en) | Method, device and equipment for establishing path and machine-readable storage medium | |
| CN106027326B (en) | Link healthprobe method and device | |
| CN107547507A (en) | A kind of anti-attack method, device, router device and machinable medium | |
| CN105991451B (en) | LSA delet method and device based on OSPF | |
| CN105591962B (en) | A kind of detection method and device of balancing link load | |
| CN109525491A (en) | Information processing method and device, the storage medium of open type shortest path priority protocol | |
| CN110086711A (en) | Flow switchback method, apparatus, electronic equipment and readable storage medium storing program for executing | |
| Jesus et al. | Dependability in aggregation by averaging | |
| Pei et al. | An analysis of convergence delay in path vector routing protocols | |
| CN105763468B (en) | A kind of transmission method and device of bgp update message | |
| CN106230728B (en) | The method and device of fast route convergence in the case that route shakes | |
| JP5135275B2 (en) | Route fault location estimation apparatus and computer program | |
| CN109274546A (en) | A kind of scheduling method for timer and device | |
| CN107872391A (en) | A kind of entry updating method and device | |
| CN111884827B (en) | Method for synchronizing topological information in SFC network and routing network element | |
| CN105991427A (en) | Method and device for determining and switching backup paths | |
| CN113812119B (en) | Network node for performance measurement | |
| Pei et al. | An analysis of path-vector routing protocol convergence algorithms | |
| Goyal et al. | Scheduling routing table calculations to achieve fast convergence in OSPF protocol | |
| Thompson et al. | A method of proactive MANET routing protocol evaluation applied to the OLSR protocol | |
| CN107181832A (en) | A kind of Router ID collision detection methods and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Binjiang District and Hangzhou city in Zhejiang Province Road 310051 No. 68 in the 6 storey building Applicant after: Hangzhou Dipu Polytron Technologies Inc Address before: Binjiang District and Hangzhou city in Zhejiang Province Road 310051 No. 68 in the 6 storey building Applicant before: Hangzhou Dipu Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |