CN101207555A - Method for automatically clearing over loading bit in the course of avoiding path black hole - Google Patents
Method for automatically clearing over loading bit in the course of avoiding path black hole Download PDFInfo
- Publication number
- CN101207555A CN101207555A CNA2006101678440A CN200610167844A CN101207555A CN 101207555 A CN101207555 A CN 101207555A CN A2006101678440 A CNA2006101678440 A CN A2006101678440A CN 200610167844 A CN200610167844 A CN 200610167844A CN 101207555 A CN101207555 A CN 101207555A
- Authority
- CN
- China
- Prior art keywords
- lsp
- router
- message
- csnp
- value
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 230000014759 maintenance of location Effects 0.000 claims description 10
- 238000012217 deletion Methods 0.000 claims description 9
- 230000037430 deletion Effects 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 5
- 230000008878 coupling Effects 0.000 claims description 2
- 238000010168 coupling process Methods 0.000 claims description 2
- 238000005859 coupling reaction Methods 0.000 claims description 2
- 238000007689 inspection Methods 0.000 claims description 2
- 230000001360 synchronised effect Effects 0.000 abstract description 3
- 230000007547 defect Effects 0.000 abstract 1
- 238000012423 maintenance Methods 0.000 abstract 1
- 230000006870 function Effects 0.000 description 3
- 230000001052 transient effect Effects 0.000 description 3
- 101100455541 Drosophila melanogaster Lsp2 gene Proteins 0.000 description 2
- 101000984710 Homo sapiens Lymphocyte-specific protein 1 Proteins 0.000 description 2
- 102100027105 Lymphocyte-specific protein 1 Human genes 0.000 description 2
- 230000033228 biological regulation Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008030 elimination Effects 0.000 description 2
- 238000003379 elimination reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000010926 purge Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Images
Abstract
The invention discloses a method which can spontaneously clear the overloading during the process of avoiding the routing black hole. As the CSNP message of IS-IS describes all LSP item information in a LSP database, the method can know the LSP database information of a neighboring router through the CSNP message sent from a neighbor, if the local router receives all LSP items described by the CSNP message, the local router is considered to finish the synchronous process of the LSP database with the neighboring router, then the overloading can be automatically cleared. The invention avoids the defect caused by allocating the overloading clearing time according to the empirical value without limitation of the network operation scope, and also reduces the complexity of the operation and the maintenance of the network.
Description
Technical field
The present invention relates to data network communication field, relate in particular in a kind of operation Intermediate System-to-Intermediate System Routing Protocol (IS-IS) network the method for automatically clearing over loading bit in the course of avoiding path black hole.
Background technology
Path black hole is meant: have an inaccessible false route in the network, attempt all can be dropped according to all flows of this route arrival destination.As seen, in network operation process, need avoid and stop the generation of path black hole.Usually under the situation of unstable networks, inevitably can produce the path black hole of transient state.For the network of operation Intermediate System to Intermediate System, if wherein certain router is restarted, then following two kinds of situations will produce path black hole:
Situation one:
Move BGP (Border Gateway Protocol) and Intermediate System to Intermediate System in the network simultaneously, D.1 certain destination network segment that wherein is connected on the purpose router D is announced to other routers in the network by bgp protocol, and its BGP next hop is router D.And Intermediate System to Intermediate System is responsible for learning how to arrive this BGP next hop D from source router S.Suppose to have in the path from S to D a via node T to restart.In case via node T is restarted end, and other routers are finished IS-IS LSP database synchronization (LSP are a Link State Protocol Data Unit in T and the network, Link State PDU is used for distributing link-state information), then source node S is just known and can be arrived destination node D by T.Yet, though the same EOS of its is-is database on the T router, may occur, and know how to arrive D, the BGP route of itself and D router still fails to finish synchronously, and it does not also know how to arrive D.1.All so just having occurred all is dropped to D.1 flow.Therefore in network, produced the path black hole of transient state.
Situation two:
Move Intermediate System to Intermediate System in the network, wherein certain router is restarted.Because restarting process was finished in tens of seconds in the several seconds, restart the LSP message information that produces before router is restarted so still remain with in the IS-IS LSP database of other routers in the network.Therefore set up neighborhood in case restart router with it, this router just may calculate the route of certain destination network segment A by restarting router according to these old LSP messages.Yet since restart router this moment the LSP database also not with network in other router synchronization finish, therefore, restart router and do not know how arrive this destination network segment A, flows of all arrival A will all be abandoned.Therefore in restarting router LSP database synchronization process, can produce the path black hole of transient state.
As can be seen, in both of these case, the former is because the IS-IS link state database synchronization finishes, but the not same EOS of bgp routing information causes producing path black hole; And the latter is because the IS-IS LSD does not have to cause producing path black hole with regard to using old LSP to calculate shortest path under the synchronous fully situation.At both of these case, proposed to avoid accordingly measure among the standard RFC3277 that Internet organizes IETF to announce, Here it is: in case router restart finish and and after other neighbor routers set up neighborhood, upgrade No. 0 LSP message of its non-dummy node and inundation at once and go out, and in this LSP message, overload bit (overload-bit) is set.So just prevented that other routers in the network from restarting router as flow forward relay node with this.After this, remove this overload bit again, this restarts router can be once more as flow forward relay node.
Yet the removing opportunity of this overload bit, for top first kind of situation, RFC3277 has clearly stipulated and notify Intermediate System to Intermediate System that overload bit is removed after BGP finishes synchronously, does not then point out when to remove overload bit for second kind of situation, removes after just pointing out wait for certain hour.RFC3277 does not describe waiting time and what is actually.At present industry way commonly used is: waiting time is set to a user configured empirical value, be used to during this period of time to finish IS-IS LSP database synchronously, in case the time to then remove overload bit at once.Yet do like this and incorrect, if adopt the mode that empirical value is set will produce following problem:
If the LSP clauses and subclauses are less in the 1 IS-IS LSP database, though can cause in the database LSP message synchronizing process be through with soon (finishing in common several seconds), but the removing of overload bit will wait for that for a long time the recovery of network operation state will expend a large amount of extra times like this.
If the LSP clauses and subclauses in the 2 IS-IS LSP databases a lot (occurring this situation probably) for backbone network, may cause owing to the time is set too short, this section in the period database synchronization process do not finish just to have removed overload bit, so still can not avoid the appearance of path black hole.
If 3 the present situations according to the network operation, according to the actual LSP message amount of each router how much come empirical value is set respectively, for the maintainability of network, extensibility can cause bigger influence again.The complexity of safeguarding can increase greatly.
Summary of the invention
The technical problem to be solved in the present invention just provides the method for automatically clearing over loading bit in a kind of course of avoiding path black hole, realize the automatic removing of overload bit, promptly in case find to restart other routers in router and the network finished database synchronously, just remove overload bit automatically.So just avoided rule of thumb that value disposes the drawback that the overload bit checkout time is brought, and be not subjected to the restriction of network operation scale, also reduced the complexity that network operation is safeguarded simultaneously.
In order to solve the problems of the technologies described above, the invention provides the method for automatically clearing over loading bit in a kind of course of avoiding path black hole, comprise the steps:
(1) after router is restarted, overload bit is set at once;
(2) when described restart the sufficient sequence protocol Data Unit CSNP message that router receives that neighbor router sends after, the Link State Protocol Data Unit LSP summary info that carries in the CSNP message is done inspection, if the LSP clauses and subclauses of describing in this CSNP message do not exist in described LSP database of restarting router, then generate " wait for and receive a LSP record " information according to the LSP summary info, this recorded information comprises waits for the LSP message that receives ID number;
(3) when described restart the LSP message that router receives that neighbours send after, " wait for and receive the LSP record " according to record in the ID traversal step 2 of LSP message, if find corresponding record, its ID number coupling then removed this record and these LSP clauses and subclauses stored in the LSP database; If do not find respective record, then only need the LSP clauses and subclauses are stored in the LSP database;
(4) when having received all CSNP messages, and after " wait receives the LSP record " all is eliminated, represent describedly to restart router and received the LSP clauses and subclauses of describing in all CSNP messages, its LSP database is finished synchronously with neighbor router, then removes overload bit.
Further, in the described step (2), " wait for and the receive the LSP record " information that generates also comprises the residue retention time of waiting for the LSP message that receives, after this residue retention time that every mistake will " be waited for and receive the LSP record " in 1 second subtracts 1, after its residue retention time is 0, with this recorded information deletion.
Further, if described to restart router be Designated Router DIS router on the broadcasting link, then this router is provided with the election that does not participate in DIS after the overload bit, be used for guaranteeing that it can not be the DIS router at database synchronization process that router is restarted the back, thereby this router is periodically received the CSNP message that the DIS router sends; After finishing, database synchronization process carries out the election of DIS again.
Further, if described to restart router be DIS router on the broadcasting link, after then described router was restarted, when neighborhood was set up, this router and neighbor router sent the CSNP message mutually.
Further, use the Hash table storage " to wait for and receive the LSP record ".
Further, described step (3) comprises the steps:
(a) after receiving the LSP message that neighbor router sends, carry out Hash calculation one time according to ID number of LSP message accounting;
(b) search corresponding " wait for and receive the LSP record " according to the Hash calculation result;
(c) if found ID number identical correspondence " to wait for and receive the LSP record ", then from hash chain, delete this record and store this LSP, otherwise only the LSP message is done storage operation.
Further, checked " wait for and receive the LSP record " every 1 second, if full scale clearance then illustrate that all LSP are received whether by full scale clearance; When record is eliminated entirely and after the CSNP message also all receives, stops regular check.
Further, use the method for CSNP record block deletion to determine the described all CSNP messages that router has received that neighbor router is sent of restarting, comprise the steps:
(A) chained list of definition, its chained list node comprises two fields, is respectively applied for the origin identification START LSP-ID of the Link State Protocol Data Unit that writes down unreceived CSNP message and the end sign END LSP-ID of Link State Protocol Data Unit;
(B) after router is received the CSNP message, on chained list, travel through, according to START LSP-ID that receives the CSNP message and END LSP-ID, revise respective nodes in the chained list, make its chained list node only write down the START LSP-ID and the END LSP-ID of unreceived CSNP message;
(C) in chained list, do not have node, then received all CSNP messages that neighbor router is sent.
Further, in the described step (A), two fields of chained list are bgn, end, after router is restarted beginning, first node are set earlier, and the bgn field value of this node is 0000.0000.0000.00-00, and the end field value is ffff.ffff.ffff.ff-ff.
Further, described step (B) comprises the steps:
(a) if find END LSP-ID value＜end value of describing in START LSP-ID value＜CSNP message of describing in its bgn value＜CSNP message of chained list node, then create a new node again, the bgn field value of this new node is the END LSP-ID+1 that describes in the CSNP message of receiving, the end field value that its end field value is an origin node, and this new node is inserted into the origin node back, the end field value of revising origin node is the START LSP-ID-1 that describes in the CSNP message of receiving;
(b) if find chained list node, the END LSP-ID value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn field value＜end field value＜=CSNP message is then deleted this node; If on the chained list other nodes are arranged, then continue other nodes on the traversal chained list;
(c) if find chained list node, END LSP-ID value＜end value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn value＜CSNP message, then revise this chained list node, its bgn is last LSP-ID+1 that describes in the CSNP message, and continues other nodes of traversal;
(d) if find chained list node, the END LSP-ID value of describing in the START LSP-ID value of describing in its bgn value＜CSNP message＜end value＜=CSNP message, then revise this chained list node, its end value START LSP-ID value-1 and other nodes of continuation traversal for describing in the CSNP message.
The present invention has utilized the existing message format of Intermediate System to Intermediate System, employing judges whether all to receive the method for the LSP clauses and subclauses that write down in the CSNP message of neighbor router transmission, judge restart router whether with network in other routers finish the synchronizing process of database, thereby can remove the overload bit that produces in the course of avoiding path black hole automatically, and then finish course of avoiding path black hole automatically, avoided by the defective that empirical value brings is set by hand.Therefore the method for this automatic removing overload bit has improved reliability greatly in course of avoiding path black hole, has improved the flexibility of the network operation, and has reduced the complexity of network operation.
Description of drawings
Fig. 1 avoids the disposed of in its entirety frame diagram of auto-complete function for path black hole;
Fig. 2 is restarted the process chart of router to the CSNP message that receives;
Fig. 3 is restarted the process chart of router to the LSP message that receives;
Fig. 4 is for restarting router Timing Processing flow chart;
Fig. 5～Fig. 6 gives an example for the CSNP message content;
Fig. 7～Fig. 9 is the method that illustrates the deletion of CSNP record block.
Embodiment
The automatic purge mechanism of overload bit in the course of avoiding path black hole that the present invention proposes, make the Intermediate System to Intermediate System course of avoiding path black hole to finish automatically, thereby remove overload bit and finish path black hole and avoid the drawback brought to solve in the prior art by the experience time is set.
The feasibility of this automatic removing overload bit mode is: because the CSNP message of IS-IS has been described all the LSP items for information in the LSP database, therefore the CSNP message of sending by neighbours can be known neighbor router LSP database information, in case local router has been received all LSP clauses and subclauses of describing in the CSNP message, can think that then local router finished the synchronizing process of LSP database with neighbor router, just can remove overload bit this moment.On point-to-point link, when neighborhood is set up, can send the CSNP message.The CSNP message then is periodically to send on broadcasting link.Therefore, can compare by LSP summary info of describing in the CSNP message of receiving and the concrete LSP message of receiving, judge whether current local router has finished the synchronous of LSP database with neighbor router, thereby realize the autoclear function of overload bit.
As shown in Figure 1, specific implementation process of the present invention mainly is made up of three steps, step 102, restart router the CSNP message that receives is handled, step 103 is restarted the processing of router to the LSP message that receives, step 104, restart the router timer processing, comprise regularly judging whether finish synchronously, judge regularly whether " waiting for that receiving LSP writes down " lost efficacy with other routers rs databases.
Embodiment is as follows:
Wherein, step 102 detailed process flow process as shown in Figure 2, step 103 detailed process flow process as shown in Figure 3, the detailed process flow process of step 104 is as shown in Figure 4.
As shown in Figure 2, after step 201 beginning, execution in step 202 receives the CSNP message.On point-to-point link,, then send the CSNP message at once in case neighborhood is set up.On broadcasting link, owing to have only the DIS router just periodically to send the CSNP message, if after therefore non-DIS router was restarted, it can periodically receive the CSNP message from the DIS router.If the DIS router is restarted, then can consider to adopt following two methods to guarantee to restart and enough to receive the CSNP message that neighbours send.
In case a) neighborhood is set up, both sides send the CSNP message at once.
B) restart router on the broadcasting link and do not participate in the DIS election in course of avoiding path black hole, neighbor router just can selected certificate become the DIS router like this, and then sends the CSNP message to the side of restarting.
In case receive the CSNP message that neighbours send, then travel through the TLV that writes down in the CSNP message (＜Type, Length, Value 〉,＜type, length, value 〉) field, find the LSP descriptor of record among the TLV9 (referring to that type is 9 TLV).
Record LSP-ID and residue retention time " wait for and receive the LSP record " to step 207 at this, and the particular content of these two fields can be by obtaining among the TLV9.
Step 208 is done Hash calculation one time according to the LSP-ID that comprises in " wait for and receive the LSP record " information, should " wait for and receive the LSP record " according to result calculated and insert in the corresponding hash chain.
Step 209 is carried out the IS-IS of RFC1142 regulation other processing to the CNSP message;
Step 210 finishes to restart router the CSNP message that receives is handled.
As shown in Figure 3, step 301 begins to restart the processing of router to the LSP message that receives;
Step 302 is restarted router and is received the LSP message that neighbor router sends;
Step 303 is carried out Hash operation LSP-ID number that the LSP message is carried;
Step 304 is searched corresponding hash chain according to operation result, sees whether to find corresponding " wait for and receive the LSP record " information;
Step 305 judges whether to find corresponding " wait for and receive the LSP record " information, if, execution in step 306, if not, execution in step 307;
Step 306 has found ID identical " wait for and receive the LSP record ", then this record of deletion from hash chain.
Step 307 is stored this LSP, and carries out other handling processes to reception LSP message of RFC1142 regulation.
Step 308 finishes.
As shown in Figure 4, step 401, beginning;
Step 402 is done every 1 second traversal " wait for receive LSP record " and to the residue retention time field in this record in timer and is subtracted 1 and operate;
Step 403 is if residue is 0 then this record of deletion the retention time;
Describe path black hole below in detail and avoid judging whether in the automatic Method Of Accomplishment to receive all CSNP messages---CSNP record block elimination method.
Before describing this method, the characteristics of CSNP message once are discussed at first.The CSNP message carries the LSP summary info by the TLV9 field, summary info comprises the residue retention time (remain life-time) of LSP message, LSP message ID (lsp-id), sequence of message number (sequence-number), message checking and (check-sum).In addition, the scope of the LSP summary info that carries in this CSNP message by START LSP-ID and ENDLSP-ID field description in the CSNP message, wherein START LSP-ID always begins with 0000.0000.0000.00.00, and END LSP-ID always finishes with ffff.ffff.ffff.ff.ff.And if the LSP clauses and subclauses are too much in the LSP database, in a CSNP message, can not describe fully, then describe by a plurality of CSNP messages of continuous transmission, wherein the START LSP-ID of first CSNP message is 0000.0000.0000.00.00, the END LSP-ID of last CSNP message is ffff.ffff.ffff.ff.ff, for other CSNP message, its START LSP-ID is the LSP-ID+1 of last LSP descriptor of carrying in the last CSNP message, and its ENDLSP-ID is the LSP-ID of last LSP descriptor of carrying in this CSNP message.
Be exemplified below: if four LSP messages are arranged in the LSP database, its ID is respectively 1111.1111.1111.00-00,2222.2222.2222.00-00,3333.3333.3333.00-00, and 4444.4444.4444.00-00, if these four LSP send by two CSNP messages, carry two LSP summary infos in each CSNP message, the content of describing in these two CSNP messages is respectively as Fig. 5, (here just for example simple and supposed only to carry in each CSNP message two LSP message digest information) shown in Figure 6.
Consider this characteristics, can judge whether to receive all CSNP messages in the following way.
1. define a chained list, STARTLSP-ID and END LSP-ID that its chained list node is used to write down unreceived CSNP message represent with bgn and end respectively.
2. after router was restarted beginning, owing to do not receive the CSNP message, first node bgn field value of therefore hanging chained list was 0000.0000.0000.00-00, and the end field value is ffff.ffff.ffff.ff-ff.
3. in case after router is received the CSNP message, on chained list, travel through
If a) find chained list node (node 1), END LSP-ID value＜end value of describing in STARTLSP-ID value＜CSNP message of describing in its bgn value＜CSNP message then is divided into two this node, and the LSP-ID of centre is removed.Specific practice is: create a new node (node 2) again, the bgn field value of node 2 is the END LSP-ID+1 that describes in the CSNP message of receiving.The end field value that its end field value is a node 1, and node 2 is inserted into node 1 back.The end field value of revising node 1 is the START LSP-ID-1 that describes in the CSNP message of receiving.
B) if find chained list node (node 1), the END LSP-ID value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn field value＜end field value＜=CSNP message is then deleted this chained list node.If other nodes are arranged on the chained list, then continue other nodes on the traversal chained list.
C) if find chained list node (node 1), END LSP-ID value＜end value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn value＜CSNP message, then revise this chained list node, its bgn is last lsp-id+1 that describes in the CSNP message, and continues other nodes of traversal.
D) if find chained list node (node 1), the END LSP-ID value of describing in the STARTLSP-ID value of describing in its bgn value＜CSNP message＜end value＜=CSNP message, then revise this chained list node, its end value START LSP-ID value-1 and other nodes of continuation traversal for describing in the CSNP message.
4. in case do not had node in the chained list, at this moment can think and receive all CSNP messages.
Above judge whether receive that the mode that all CSNP method of message are removed CSNP record node by block-by-block finishes, after all record nodes were all deleted, we thought and have received all CSNP messages.Therefore, we claim that this method is a CSNP record block elimination method.
Be exemplified below:
Supposing has following LSP clauses and subclauses among the LSP-DB of router
LSP1：1111.1111.1111.00-00
LSP2：2222.2222.2222.00-00
LSP3：3333.3333.3333.00-00
LSP4：4444.4444.4444.00-00
LSP5：5555.5555.5555.00-00
LSP6：6666.6666.6666.00-00
These LSP send by three CSNP messages, and wherein CSNP message 1 carries LSP1 and LSP2 information, and CSNP message 2 carries LSP3 and LSP4 information, and CSNP message 3 carries LSP5 and LSP6 information.According to above-described CSNP record block delet method.
The first step: create chained list and first node hang into owing to also fail to receive the CSNP message this moment, so the bgn of node and end field be respectively 0,000 0,000 0,000 00 00 and FFFF FFFFFFFF FF FF, as shown in Figure 6.
Second step: receive after the CSNP message 2, owing in the chained list node is arranged, its bgn is 0,000 00,000,000 00 00, its end is FFFF FFFF FFFF FF FF, and the START LSP ID that describes in the CSNP message 2 is 2,222 2,222 2,222 00 01, END LSP ID is 4,444 4,444 4,444 0000, therefore satisfies the algorithm flow a flow process in the 3rd step.Remaining CSNP piece as shown in Figure 7 in the final chained list
The 3rd step: receive after the CSNP message 1, owing in the chained list node is arranged, its bgn is 0,000 00,000,000 00 00, end is 2,222 2,222 2,222 00 00, and the START LSP-ID of CSNP message 1 is 0,000 0,000 0,000 00 00, END LSP-ID is 2,222 2,222 2,222 00 00, satisfies the 3rd step of algorithm flow b flow process.Remaining CSNP piece as shown in Figure 8 in the final chained list
The 4th step: receive after the CSNP message 3 that CSNP record block all in the chained list is all deleted.
From top description as can be seen, no matter the sequencing of receiving the CSNP message how, in case the chained list that is used to write down the CSNP message block just illustrates that for empty all CSNP messages have all been received, otherwise explanation CSNP message is not all received yet.
Claims (10)
1. the method for automatically clearing over loading bit in the course of avoiding path black hole comprises the steps:
(1) after router is restarted, overload bit is set at once;
(2) when described restart the sufficient sequence protocol Data Unit CSNP message that router receives that neighbor router sends after, the Link State Protocol Data Unit LSP summary info that carries in the CSNP message is done inspection, if the LSP clauses and subclauses of describing in this CSNP message do not exist in described LSP database of restarting router, then generate " wait for and receive a LSP record " information according to the LSP summary info, this recorded information comprises waits for the LSP message that receives ID number;
(3) when described restart the LSP message that router receives that neighbours send after, " wait for and receive the LSP record " according to record in the ID traversal step 2 of LSP message, if find corresponding record, its ID number coupling then removed this record and these LSP clauses and subclauses stored in the LSP database; If do not find respective record, then only need the LSP clauses and subclauses are stored in the LSP database;
(4) when having received all CSNP messages, and after " wait receives the LSP record " all is eliminated, represent describedly to restart router and received the LSP clauses and subclauses of describing in all CSNP messages, its LSP database is finished synchronously with neighbor router, then removes overload bit.
2. method according to claim 1, it is characterized in that: in the described step (2), " wait for and the receive the LSP record " information that generates also comprises the residue retention time of waiting for the LSP message that receives, after this residue retention time that every mistake will " be waited for and receive the LSP record " in 1 second subtracts 1, after its residue retention time is 0, with this recorded information deletion.
3. method according to claim 1 and 2, it is characterized in that: if described to restart router be Designated Router DIS router on the broadcasting link, then this router is provided with the election that does not participate in DIS after the overload bit, be used for guaranteeing that it can not be the DIS router at database synchronization process that router is restarted the back, thereby this router is periodically received the CSNP message that the DIS router sends; After finishing, database synchronization process carries out the election of DIS again.
4. method according to claim 1 and 2 is characterized in that: if described to restart router be DIS router on the broadcasting link, after then described router was restarted, when neighborhood was set up, this router and neighbor router sent the CSNP message mutually.
5. method according to claim 1 and 2 is characterized in that: use the Hash table storage " to wait for and receive the LSP record ".
6. method according to claim 5 is characterized in that: described step (3) comprises the steps:
(a) after receiving the LSP message that neighbor router sends, carry out Hash calculation one time according to ID number of LSP message accounting;
(b) search corresponding " wait for and receive the LSP record " according to the Hash calculation result;
(c) if found ID number identical correspondence " to wait for and receive the LSP record ", then from hash chain, delete this record and store this LSP, otherwise only the LSP message is done storage operation.
7. method according to claim 2 is characterized in that: checked " wait for and receive the LSP record " every 1 second whether by full scale clearance, if full scale clearance then illustrate that all LSP are received; When record is eliminated entirely and after the CSNP message also all receives, stops regular check.
8. method according to claim 1 is characterized in that: use the method for CSNP record block deletion to determine the described all CSNP messages that router has received that neighbor router is sent of restarting, comprise the steps:
(A) chained list of definition, its chained list node comprises two fields, is respectively applied for the origin identification START LSP-ID of the Link State Protocol Data Unit that writes down unreceived CSNP message and the end sign END LSP-ID of Link State Protocol Data Unit;
(B) after router is received the CSNP message, on chained list, travel through, according to START LSP-ID that receives the CSNP message and END LSP-ID, revise respective nodes in the chained list, make its chained list node only write down the START LSP-ID and the END LSP-ID of unreceived CSNP message;
(C) in chained list, do not have node, then received all CSNP messages that neighbor router is sent.
9. method according to claim 8, it is characterized in that: in the described step (A), two fields of chained list are bgn, end, after router is restarted beginning, first node is set earlier, the bgn field value of this node is 0000.0000.0000.00-00, and the end field value is ffff.ffff.ffff.ff-ff.
10. method according to claim 9 is characterized in that: described step (B) comprises the steps:
(a) if find END LSP-ID value＜end value of describing in START LSP-ID value＜CSNP message of describing in its bgn value＜CSNP message of chained list node, then create a new node again, the bgn field value of this new node is the END LSP-ID+1 that describes in the CSNP message of receiving, the end field value that its end field value is an origin node, and this new node is inserted into the origin node back, the end field value of revising origin node is the START LSP-ID-1 that describes in the CSNP message of receiving;
(b) if find chained list node, the END LSP-ID value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn field value＜end field value＜=CSNP message is then deleted this node; If on the chained list other nodes are arranged, then continue other nodes on the traversal chained list;
(c) if find chained list node, END LSP-ID value＜end value of describing in the START LSP-ID value of describing in the CSNP message＜=bgn value＜CSNP message, then revise this chained list node, its bgn is last LSP-ID+1 that describes in the CSNP message, and continues other nodes of traversal;
(d) if find chained list node, the END LSP-ID value of describing in the START LSP-ID value of describing in its bgn value＜CSNP message＜end value＜=CSNP message, then revise this chained list node, its end value START LSP-ID value-1 and other nodes of continuation traversal for describing in the CSNP message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101678440A CN101207555B (en) | 2006-12-18 | 2006-12-18 | Method for automatically clearing over loading bit in the course of avoiding path black hole |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101678440A CN101207555B (en) | 2006-12-18 | 2006-12-18 | Method for automatically clearing over loading bit in the course of avoiding path black hole |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101207555A true CN101207555A (en) | 2008-06-25 |
| CN101207555B CN101207555B (en) | 2010-07-14 |
Family
ID=39567453
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101678440A Expired - Fee Related CN101207555B (en) | 2006-12-18 | 2006-12-18 | Method for automatically clearing over loading bit in the course of avoiding path black hole |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101207555B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350789B (en) * | 2008-09-17 | 2010-12-08 | 杭州华三通信技术有限公司 | Method and apparatus for clearing residual LSP banding |
| CN105939260A (en) * | 2015-03-05 | 2016-09-14 | 瞻博网络公司 | Overload functionality in overlay networks |
| CN106844233A (en) * | 2016-12-07 | 2017-06-13 | 深圳市德传技术有限公司 | A kind of router service data caching method and system based on Hash table |
| US9847886B2 (en) | 2013-01-25 | 2017-12-19 | Huawei Technologies Co., Ltd. | Sleeping link waking method and apparatus |
| CN108206823A (en) * | 2016-12-20 | 2018-06-26 | 华为技术有限公司 | A kind of method and the network equipment for handling message |
| CN109005121A (en) * | 2018-08-24 | 2018-12-14 | 新华三技术有限公司 | A kind of route computing method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1223145C (en) * | 2002-08-20 | 2005-10-12 | 华为技术有限公司 | Message safety protection method based on boundary gateway protocol message |
| CN100438503C (en) * | 2005-10-26 | 2008-11-26 | 华为技术有限公司 | Path selecting method |
-
2006
- 2006-12-18 CN CN2006101678440A patent/CN101207555B/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350789B (en) * | 2008-09-17 | 2010-12-08 | 杭州华三通信技术有限公司 | Method and apparatus for clearing residual LSP banding |
| US9847886B2 (en) | 2013-01-25 | 2017-12-19 | Huawei Technologies Co., Ltd. | Sleeping link waking method and apparatus |
| CN105939260A (en) * | 2015-03-05 | 2016-09-14 | 瞻博网络公司 | Overload functionality in overlay networks |
| CN105939260B (en) * | 2015-03-05 | 2019-08-13 | 瞻博网络公司 | Overload function in overlay network |
| CN106844233A (en) * | 2016-12-07 | 2017-06-13 | 深圳市德传技术有限公司 | A kind of router service data caching method and system based on Hash table |
| CN108206823A (en) * | 2016-12-20 | 2018-06-26 | 华为技术有限公司 | A kind of method and the network equipment for handling message |
| WO2018113560A1 (en) * | 2016-12-20 | 2018-06-28 | 华为技术有限公司 | Message processing method and network device |
| CN108206823B (en) * | 2016-12-20 | 2020-06-02 | 华为技术有限公司 | Method, system and network equipment for processing message |
| US11063859B2 (en) | 2016-12-20 | 2021-07-13 | Huawei Technologies Co., Ltd. | Packet processing method and network device |
| CN109005121A (en) * | 2018-08-24 | 2018-12-14 | 新华三技术有限公司 | A kind of route computing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101207555B (en) | 2010-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5095823B2 (en) | Transport control server, network system, and transport control method | |
| US20060013127A1 (en) | MPLS network system and node | |
| EP0481610B1 (en) | Method and apparatus for distance vector routing on datagram point-to-point links | |
| CN101207555B (en) | Method for automatically clearing over loading bit in the course of avoiding path black hole | |
| CN101340369B (en) | Method and router for realizing virtual connection supported optimum restart | |
| US20060203720A1 (en) | Data relay apparatus and data relay method | |
| US7936667B2 (en) | Building backup tunnels for fast reroute in communications networks | |
| CN102123091B (en) | Method, device and network equipment for generating multilink transparent transmission interconnection forwarding table | |
| CN103688498B (en) | Network element and the method that can be performed by network element | |
| JP2005503055A (en) | Method and system for implementing OSPF redundancy | |
| CN101599898B (en) | Method for avoiding loop for routers adopting LFA mode in multilink fault environment | |
| CN102075419B (en) | Method for generating and transmitting three-layer virtual special network equative routing and edge router | |
| CN102546427B (en) | OSPF (Open Shortest Path First) protocol-based graceful restart (GR) method and router | |
| CN101640637A (en) | Resource reservation protocol tunnel management method based on flow rate engineering and system thereof | |
| CN109495345B (en) | BFD processing method and network equipment | |
| Shand et al. | A framework for loop-free convergence | |
| CN102325080B (en) | Open shortest path first (OSPF) protocol graceful restarting method and device | |
| CN103354521A (en) | LDP-based optimization method and device for LSP update | |
| EP4012987A1 (en) | Method and apparatus for processing link state information | |
| WO2002006918A2 (en) | A method, system, and product for preventing data loss and forwarding loops when conducting a scheduled change to the topology of a link-state routing protocol network | |
| CN100563140C (en) | The method of a kind of multicast network system and detection multicast network link defective | |
| CN100550840C (en) | The steady method for restarting of CR-LSR | |
| US7496644B2 (en) | Method and apparatus for managing a network component change | |
| US7869350B1 (en) | Method and apparatus for determining a data communication network repair strategy | |
| CN101202734A (en) | Method for deleting complete sequence number protocol data unit record block |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100714 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |