CN102075435A - Routing issuing method and device - Google Patents

Routing issuing method and device Download PDF

Info

Publication number
CN102075435A
CN102075435A CN2011100350321A CN201110035032A CN102075435A CN 102075435 A CN102075435 A CN 102075435A CN 2011100350321 A CN2011100350321 A CN 2011100350321A CN 201110035032 A CN201110035032 A CN 201110035032A CN 102075435 A CN102075435 A CN 102075435A
Authority
CN
China
Prior art keywords
route
list item
forwarding engine
high speed
issue
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.)
Pending
Application number
CN2011100350321A
Other languages
Chinese (zh)
Inventor
李鑫
李军军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou H3C Technologies Co Ltd
Original Assignee
Hangzhou H3C Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou H3C Technologies Co Ltd filed Critical Hangzhou H3C Technologies Co Ltd
Priority to CN2011100350321A priority Critical patent/CN102075435A/en
Publication of CN102075435A publication Critical patent/CN102075435A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

The invention provides a routing issuing method and a device. The routing issuing method comprises the following steps of: A, issuing first type routing R1 which is conflicted with second type routing in service forwarding engine list items to high-speed forwarding engine list items, executing step B if the issuing fails, and finishing the R1 issuing flow process if the issuing succeeds; and B, judging whether routing suboptimal to the R1 exists in the high-speed forwarding engine list items or not, if NO, inserting R1 into second list items and finishing the R1 issuing flow process, if YES, deleting routing suboptimal to the R1 in priority sequences in the high-speed forwarding engine list items, next issuing the R1 to the high-speed forwarding engine list items, returning to the step B if the issuing fails, and finishing the R1 issuing flow process if the issuing succeeds. When the routing issuing method and the device provided by the invention are adopted, the issuing of the optimal routing to the high-speed forwarding engine list items can be realized, and further, the message transmitting by the optimal routing is realized.

Description

Route sending-down method and device
Technical field
The present invention relates to the network communications technology, particularly route sending-down method and device.
Background technology
In the network communications technology, in order to satisfy the demand of flexibility in the professional repeating process and high bandwidth, two forwarding engine system has as shown in Figure 1 been proposed.In Fig. 1, two forwarding engine system comprises following three parts: routing engine, professional forwarding engine and high speed forwarding engine, wherein, collaborative service of transmitting of professional forwarding engine and high speed forwarding engine and Business Processing.Respectively this three part is described below:
Routing engine, it mainly is to utilize Routing Protocol such as study routes such as RIP, OSPF or other modes, and the route sending-down that will learn is to professional forwarding engine and high speed forwarding engine.Wherein, this route specifically comprises: destination address/mask, outgoing interface, next jumping etc.; How issuing route as for routing engine is described hereinafter.
Professional forwarding engine can be by realizations such as network processing unit with monokaryon or multinuclear (NP) or general processors, and it comprises professional forwarding engine list item, is used to hold all routes that routing engine issues.In addition, the business that this business forwarding engine can also be handled more complicated is such as encrypting etc., and can support the interface type that enriches, such as Ethernet interface, CPOS interface, pos interface and atm interface etc.But the forwarding performance of professional forwarding engine is lower.
The high speed forwarding engine can realize that with respect to professional forwarding engine, have than higher forwarding performance, it comprises high speed forwarding engine list item, is used to hold the route that routing engine issues by FPGA, NP or private exchange chip.In addition, the high speed forwarding engine only can be handled a kind of interface type, such as, if this high speed forwarding engine realizes that by the private exchange chip then this high speed forwarding engine can only be handled Ethernet interface.
Because the interface type that professional forwarding engine support is abundant, and the high speed forwarding engine is supported single interface type, based on this, the interface that exists in the two forwarding engine system can be classified as following two class different interface types: the first kind interface and second style interface; Wherein,
First kind interface is the interface type that professional forwarding engine and high speed forwarding engine are all supported, route next jump is that the route of first kind interface abbreviates the Class1 route as;
Second style interface only is the interface type that professional forwarding engine is supported, but the unsupported interface type of high speed forwarding engine, route next jump is that the route of second style interface abbreviates type 2 routes as.
Because the high speed forwarding engine is only supported first kind interface, therefore, routing engine issue route to the high speed forwarding engine before, need to carry out following decision operation: whether next jumping of judging this route is first kind interface, if, then with this route sending-down to the high speed forwarding engine, otherwise, do not issue this route.And because the total interface type that exists in the two forwarding engine systems of professional forwarding engine support is the first kind interface and second style interface, therefore, routing engine can omit above-mentioned decision operation issuing when routing to professional forwarding engine, directly issues to route to professional forwarding engine and get final product.
More than the structure of two forwarding engine system is described.
Afterwards, as shown in Figure 1, when two forwarding engine system receives message by first kind interface, earlier in high speed forwarding engine list item, search the route that is used to transmit this message by the high speed forwarding engine, if find, then by next redirect of this route that finds literary composition of transmitting messages, otherwise, by giving this message on the high speed forwarding engine to professional forwarding engine, in professional forwarding engine list item, search the route that is used to transmit this message by professional forwarding engine, afterwards, by professional forwarding engine by next redirect of the route that finds literary composition of transmitting messages.
In application, the volume space of professional forwarding engine list item is bigger, can hold all routes that routing engine issues, and the volume space of high speed forwarding engine list item is smaller comparatively speaking, be easy to reach the full situation in space, and then cause to continue to hold the follow-up route that issues of routing engine, so, just may there be following problem: when two forwarding engine system receives message by first kind interface, be not issued to high speed forwarding engine list item because high speed forwarding engine list item volume space is full if be used to transmit the optimum route of this message, and the hypo-optimal route that is used to transmit this message was learned to before high speed forwarding engine list item volume space is full, and successfully be issued to high speed forwarding engine list item, so, when searching the route that is used to transmit this message in high speed forwarding engine list item, the high speed forwarding engine can only find the hypo-optimal route that is used to transmit this message, and then E-Packet by the hypo-optimal route that this finds, this has violated in the message repeating process according to the principle of optimum routing forwarding, may cause message by wrong routing forwarding.Such as, two forwarding engine system receives the message that destination address is 1.1.1.3 by first kind interface, if be used to transmit this message optimum route 1.1.1.0/24 since high speed forwarding engine list item completely can't issue, only there is a hypo-optimal route 1.1.0.0/16 who is used to transmit this message and high speed forwarding engine list item is current, so, the high speed forwarding engine just can only be sent out this message by next redirect of route 1.1.0.0/16, this has violated in the message repeating process according to the principle of optimum routing forwarding, may cause message by wrong routing forwarding.
Summary of the invention
The invention provides route sending-down method and device, to realize with optimum route sending-down realizing utilizing optimum routing forwarding message to high speed forwarding engine list item.
Technical scheme provided by the invention comprises:
A kind of route sending-down method, this method is applied to comprise in the two forwarding engine system of routing engine, professional forwarding engine and high speed forwarding engine, professional forwarding engine list item in the professional forwarding engine is used to deposit Class1 route and type 2 routes that routing engine issues, high speed forwarding engine list item in the high speed forwarding engine is used to deposit the Class1 route that routing engine issues, its key is, described pair of forwarding engine system also comprises second list item, and described second list item is used to write down routing engine issues Class1 route from failure to high speed forwarding engine list item; This method comprises:
A, to high speed forwarding engine list item issue not with professional forwarding engine list item in the afoul Class1 route of type 2 routes R1, if issue failure, then execution in step B if issue successfully, then finishes R1 and issues flow process;
B, judge and whether have the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, if, the route that from high speed forwarding engine list item, is better than R1 for one time according to the priority deletion, issue R1 afterwards once more to high speed forwarding engine list item,, then return step B if issue failure, if issue successfully, then finish R1 and issue flow process.
A kind of route sending-down device, this device is applied to comprise in the two forwarding engine system of routing engine, professional forwarding engine and high speed forwarding engine, professional forwarding engine list item in the professional forwarding engine is used to deposit Class1 route and type 2 routes that routing engine issues, high speed forwarding engine list item in the high speed forwarding engine is used to deposit the Class1 route that routing engine issues, and this device comprises: second list item, issue the unit and first judging unit; Wherein,
Described second list item is used to write down routing engine issues Class1 route from failure to high speed forwarding engine list item;
The described unit that issues is used for issuing not and the afoul Class1 route of professional forwarding engine list item type 2 routes R1 to high speed forwarding engine list item, if issue failure, then send judgement and be notified to described first judging unit,, then finish R1 and issue flow process if issue successfully;
After described first judging unit is used to receive described judgement notice, judge whether there is the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, finish R1 and issue flow process; If, the route that from high speed forwarding engine list item, is better than R1 for one time according to the priority deletion, trigger the described unit that issues afterwards and issue R1 once more to high speed forwarding engine list item, if issue failure, then continue to carry out and judge whether have inferior the be better than route of R1 and follow-up operation in the described high speed forwarding engine list item, if issue successfully, then finish R1 and issue flow process.
As can be seen from the above technical solutions, among the present invention, since high speed forwarding engine list item completely cause after to high speed forwarding engine list item issue do not fail with the afoul Class1 route of type 2 routes R1 the time, judge and whether have the inferior route that is better than R1 in the described high speed forwarding engine list item, if, then from high speed forwarding engine list item, delete the route that is better than R1 for time, issue R1 afterwards once more to high speed forwarding engine list item, if issue failure, then continue to carry out above-mentioned decision operation, if issue successfully, then finish the flow process that R1 is issued to high speed forwarding engine list item, optimum route still was issued to high speed forwarding engine list item when this had guaranteed that high speed forwarding engine list item is full, and then had guaranteed that the high speed forwarding engine can improve the reliability that the high speed forwarding engine E-Packets by optimum routing forwarding message.
Description of drawings
Fig. 1 is existing two forwarding engine system configuration schematic diagrames;
Fig. 2 provides 4 list item structural representations for the embodiment of the invention;
The basic flow sheet that Fig. 3 provides for the embodiment of the invention;
The radix tree schematic diagram that Fig. 4 provides for the embodiment of the invention;
The detail flowchart that Fig. 5 provides for the embodiment of the invention;
The concrete enforcement schematic diagram that Fig. 6 provides for the embodiment of the invention;
The structure drawing of device that Fig. 7 provides for the embodiment of the invention.
Embodiment
In order to make the purpose, technical solutions and advantages of the present invention clearer, describe the present invention below in conjunction with the drawings and specific embodiments.
Method provided by the invention relates to four list items shown in Figure 2: professional forwarding engine list item, high speed forwarding engine list item, first list item and second list item.Professional forwarding engine list item and high speed forwarding engine list item are that physics exists, and first list item and second list item be extra increasing in order to realize route sending-down method provided by the invention.Be that example is described these four list items respectively with shown in Figure 1 two forwarding engine system below:
Professional forwarding engine list item, it is the list item in the professional forwarding engine, is used to deposit Class1 route and type 2 routes that routing engine issues.
High speed forwarding engine list item, it is the list item in the high speed forwarding engine, be used for depositing routing engine issues not with the afoul Class1 route of professional forwarding engine list item type 2 routes.Wherein, conflict is meant that there are type 2 routes more excellent than this Class1 route that issues in professional forwarding engine list item mutually.So-called route optimum, can define in the following manner: if there are two routes all can send message to a certain address, these two routes be respectively the first via by and secondary route, wherein, the first via by destination address be d1, mask is m1, the destination address of secondary route is d2, mask is m2, then ought meet the following conditions: (d1^d2) ﹠amp; (m1﹠amp; M2)=0, during and m1>m2, claim the first via by more excellent than secondary route, secondary route than the first via by suboptimum.
First list item is used to write down Class1 route and type 2 routes that routing engine has issued, and it can regard duplicating of professional forwarding engine list item as, but both may be different on structural order.When routing engine is learnt not with the afoul Class1 route of type 2 routes, its can be earlier with the type 1 route sending-down to professional forwarding engine list item, finish issue after, the type 1 route is inserted into first list item, afterwards, issue the type 1 route to high speed forwarding engine list item again.When routing engine is learnt type 2 routes, its can be earlier with the type 2 route sending-downs to professional forwarding engine list item, finish issue after, the type 2 routes are inserted into first list item.
Second list item comprises the Class1 route that issues failure to high speed forwarding engine list item.This issues failure and is completely caused by high speed forwarding engine list item.Wherein, high speed forwarding engine list item completely comprises multiple situation, and only lift two kinds of situations below and be described: first kind of situation is: the volume space of high speed forwarding engine list item is taken fully; Second kind of situation is: the volume space of high speed forwarding engine list item is not taken fully, but because of brush mode or following brush algorithm can't be brushed the Class1 route down down.By a simple case second kind of situation described: the volume space of supposing high speed forwarding engine list item is divided into three space pieces: the first space piece to the, three space pieces, wherein, each space piece can be deposited 10 routes, but the different corresponding different routing index intervals of space piece; If high speed forwarding engine list item has been deposited 27 routes, promptly, the first space piece has been deposited 10 routes, the second space piece has been deposited 9 routes, the 3rd space piece deposited 8 routes, when routing engine is current when learning a Class1 route, automatically generate the routing index value of this route, if the routing index value that should generate is just in time on the routing index space of the first space piece correspondence, because the first space piece has been deposited and has been expired 10 routes, therefore, this route can issue failure, second kind of above-mentioned situation promptly occurred.
Can simply find out by top description, can above-mentioned high speed forwarding engine list item is full be equivalent to not successfully to be issued to high speed forwarding engine list item with the afoul Class1 route of type 2 routes with not being full of, issue successfully, then illustrate high speed forwarding engine list item less than, otherwise, illustrate that then high speed forwarding engine list item is full.
So far, finish the description of four list items shown in Figure 2.
Based on above-described four list items, the flow process that the embodiment of the invention provides is simply described below by Fig. 3.
Referring to Fig. 3, the basic flow sheet that Fig. 3 provides for the embodiment of the invention.As shown in Figure 3, this flow process can may further comprise the steps:
Step 301, to high speed forwarding engine list item issue not with professional forwarding engine list item in the afoul Class1 route of type 2 routes R1, if issue failure, then execution in step 302, if issue successfully, then finish R1 and issue flow process.
Wherein, this flow process is before execution in step 301, can further comprise: the R1 that will learn is inserted into first list item, judge R1 whether with first list item in type 2 routes conflict mutually, because first list item can be regarded duplicating of professional forwarding engine list item as, therefore, when R1 does not conflict mutually with type 2 routes in first list item, as can be seen this R1 not with professional forwarding engine list item in type 2 routes conflict mutually, can know according to above-mentioned afoul definition, need issue R1 this moment, promptly continues the operation that issues in the execution in step 301; And when R1 conflicts mutually with type 2 routes in first list item, can know according to above-mentioned afoul definition, there is no need to issue R1 this moment, therefore, can directly finish R1 and issue flow process.
Step 302, judge and whether have the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, if, the route that from high speed forwarding engine list item, is better than R1 for one time according to the priority deletion, issue R1 afterwards once more to high speed forwarding engine list item,, then return step 302 if issue failure, if issue successfully, then finish R1 and issue flow process.
From step 301 to step 302 as can be seen, issue when failure to high speed forwarding engine list item first at R1, be not immediately this R1 to be inserted into second list item, but the judgement of first execution in step 302, determine whether this R1 is inserted into second list item according to the judgement of step 302.
So far, finish flow process shown in Figure 3.
In the present embodiment, route in above-mentioned first list item and the route in second list item can utilize the data structure with ranking function to realize.
Among the present invention, the route in first list item can adopt base (Radix) tree structure tissue, and each route in described first list item is served as father node in described Radix tree, serve as the child node of other routes simultaneously, perhaps only serves as child node.Adopting the Radix tree structure to organize route is known technology, no longer describes in detail here.In the Radix tree, a father node can extend two child nodes at most, and child node can also be extended the child node of next stage again as father node; The value of bit x on the father node, and father node to extend the value that off in two branches and on combine the child node x position that this father node of expression extends out be 1 or 0, wherein, off represents 0, on represents 1, the x minimum is 0, is 31 to the maximum.Among the present invention, the relation between father node and the child node has just in time met the relation between hypo-optimal route and the optimum route, wherein, the inferior route that is better than on the child node of route on the father node, also promptly, the route on the father node is a hypo-optimal route, and the route on the child node of this father node is optimum route.As can be seen, organize route in first list item, can find corresponding hypo-optimal route quickly and easily by the Radix tree structure.
Issuing following 4 with routing engine to high speed forwarding engine list item is not example with the afoul Class1 route of type 2 routes, route 1:3.3.0.0/16, next is jumped and is first kind interface, route 2:2.1.0.0/16, next is jumped and is first kind interface, route 3:2.2.0.0/16, next is jumped and is first kind interface, route 4:2.2.128.0/24, next is jumped and is first kind interface, then with the effect behind these 4 routes insertion Radix trees as shown in Figure 4.
In addition, need to prove, merely the route that issues by routing engine can not be formed satisfactory Radix tree, therefore, meeting of the present invention increases the route that some serve as root node and auxiliary node according to actual conditions, and the route of this increase and the route in first list item are organized into satisfactory Radix tree together.In Fig. 4, bit31 (0.0.0.0/0) is a root node, and bit25 (0.0.0.0/6), bit24 (2.0.0.0/8) and bit17 etc. are auxiliary node.
Among the present invention, the route in second list item can adopt the RBTree structure organization, utilizes this RBTree structure can make things convenient for functions such as searching, sort, inserting of route and deletion.Wherein, adopting RBTree structure organization route is known technology, no longer describes in detail here.Certainly, the also not strict qualification of the present invention must adopt the RBTree result to organize the route of second list item, also can adopt other to have and search, sorts, inserts and the data structure of function such as deletion.
Organizing the route in second list item with route, RBTree in employing Radix tree tissue first list item below is example, and flow process shown in Figure 2 is described in detail.
Referring to Fig. 5, the detail flowchart that Fig. 5 provides for the embodiment of the invention.As shown in Figure 5, this flow process shown in Figure 5 is based on networking shown in Figure 1, and it can may further comprise the steps:
The Class1 route R1 that step 501, routing engine will be learnt is inserted into the radix tree.
In this step 501, process from route to the radix tree that insert is the known technology means, no longer describes in detail here.
Step 502, routing engine judge in the radix tree whether have afoul type 2 routes with R1, if, finish R1 and issue flow process, otherwise, execution in step 503.
Step 503, routing engine issues R1 to high speed forwarding engine list item.
Step 504, routing engine judge whether R1 successfully is issued to high speed forwarding engine list item, if, finish R1 and issue flow process, otherwise, execution in step 505.
When the high speed forwarding engine receives R1, if high speed forwarding engine list item is full, can not hold R1 again, then can be notified to routing engine, when high speed forwarding engine list item less than, when successfully depositing R1, also can be notified to routing engine, therefore, in this step 504, routing engine can be carried out decision operation according to the notice of high speed forwarding engine.
Step 505 is recalled the father node of R1 in radix tree, with the father node that dates back to as current parent's node.
Step 506 judges that whether current parent's node is not conflict with type 2 routes and be not present in Class1 route in the RBTree, if, execution in step 507; Otherwise, execution in step 508.
Step 507 to the chained list of route R1 correspondence, continues to recall the father node of current parent's node with current parent's nodes records, and with the father node of current parent's node of dating back to once more as current parent's node, return step 506.
Mention in the above description, the route that exists in the RBTree is the route that is issued to the failure of high speed forwarding engine list item, therefore, if current parent's node is not for conflicting with type 2 routes and not being present in Class1 route in the RBTree, then this current father node of expression successfully has been issued to high speed forwarding engine list item, and then knows that also the route of this step 507 medium chain table records all is the route that successfully is issued to high speed forwarding engine list item.
Step 508 judges whether current parent's node is auxiliary node, if, execution in step 509, otherwise, execution in step 510.
Step 509 continues to recall the father node of current parent's node, and with the father node of current parent's node of dating back to once more as current parent's node, return step 506.
Step 510 finishes the father node back tracking operation, and execution in step 511 afterwards.
This step 510 is to carry out for not the time in the judged result of step 508, and wherein, judged result can comprise for situation not: current parent's node is root node, for type 2 routes or for being present in the Class1 route in the RBTree.
Step 511 judges whether the chained list of R1 correspondence is empty, if then execution in step 512; Otherwise, execution in step 513.
Step 512 is inserted into R1 in the RBTree, finishes route R1 and issues flow process.
Inserting route in RBTree is any means known, repeats no more here.
This step 512 is to carry out when the chained list of R1 correspondence is sky.Chained list is empty, that is to say that the father node that dates back in above-mentioned steps 505 to step 510 does not meet the following conditions: do not conflict with type 2 routes and be not present in Class1 route in the RBTree.Because the father node of R1 is better than R1, therefore, when chained list is sky, also can think and not have the route that time is better than R1 in the high speed forwarding engine list item, so in step 504, cause R1 to issue under the prerequisite of failure owing to high speed forwarding engine list item is full, this step 512 can only be inserted into R1 in the RBTree, finishes R1 and issues flow process.
Step 513 reads a Class1 route according to the principle that last in, first out from the chained list of R1 correspondence, this Class1 route that reads of deletion from described high speed forwarding engine list item.
Present embodiment is to be the father node that starting point begins upwards to recall R1 with R1 in Radix tree, because the route of child node is better than the route of father node in the radix tree, therefore, can know that the route of being write into earlier chained list is better than the route that chained list is write in the back.And the principle that last in, first out in this step 513 in fact also is the priority of route, promptly begins order to optimum route from least excellent route.
Step 514 after finishing deletion action, issues R1 once more to high speed forwarding engine list item, if issue failure, then execution in step 515, if issue successfully, finishes route R1 and issues flow process.
Step 515, judge in the chained list of R1 correspondence whether have the Class1 route that is not read, if read a Class1 route that is not read according to the principle that last in, first out, this Class1 route that reads of deletion is returned step 514 afterwards from described high speed forwarding engine list item; Otherwise, R1 is inserted in the RBTree, finish R1 and issue flow process.
Wherein, the chained list of R1 correspondence is an interim chained list, and it can be deleted for not the time in judged result of step 515.
So far, finish flow process shown in Figure 5.
For making flow process shown in Figure 5 clearer, be described below by a specific embodiment.
Referring to Fig. 6, the concrete enforcement schematic diagram that Fig. 6 provides for the embodiment of the invention.Fig. 6 shows the part of the Radix tree that is used for organizing the first list item route.The Radix that shows according to Fig. 6 sets as can be seen, type 2 route bit7 (2.2.1.0/24) in this Radix tree conflict mutually with Class1 route bit8 (2.2.0.0/23), and the type 2 route bit9 (2.2.0.0/22) in this Radix tree conflict mutually with Class1 route bit15 (2.2.0.0/16), therefore, based on the description of step 502, can know that bit8 and bit15 all are not issued to high speed forwarding engine list item.
When learn shown in Fig. 6 not with Radix tree in afoul following five the Class1 routes of type 2 routes: route (1) then issues this 5 routes to high speed forwarding engine list item during to route (5):
At route (1): 1.1.0.0/16, issue successfully;
At route (2): 1.1.1.0/24, issue successfully;
At route (3): 2.1.0.0/16, issue successfully;
At route (4): 1.0.0.0/8, high speed forwarding engine list item is full, issue failure, still, by recalling the radix tree, the father node of finding this route (4) is auxiliary node bit25, then continue to recall the father node of this auxiliary contact, find that this father node that dates back to is root node bit31, according to the description of step 510, then finish back tracking operation, and this route (4) is inserted into RBTree.
At route (5): 1.1.2.0/24, high speed forwarding engine list item is full, issue failure, but, by recalling the radix tree, it is route (1) that there is the father node of route (5) in discovery, can know according to top description, this route (1) successfully has been issued to high speed forwarding engine list item, based on this, can know that according to step 506 to the description of step 507 current needs are recorded in this route (1) in the corresponding chained list of route (5), continue to recall the father node of route (1) afterwards, the father node of finding route (1) is route (4), because route (4) has been inserted in the RBTree, then can know that according to step 506 to the description of step 510 current needs finish back tracking operation.Afterwards, according to the route (1) of description from the corresponding chained list of high speed forwarding engine list item deletion route (5) of step 513, and issue route (5) once more to high speed forwarding engine list item.Because route (1) is deleted from high speed forwarding engine list item, so, the route that issues once more (5) is likely and issues successfully.Definition according to above-mentioned optimum route can know that route (5) is more excellent than route (1), and promptly route (5) 1.1.2.0/24 is optimum route, and route (1) 1.1.0.0/16 is a hypo-optimal route, so, has realized the purpose that optimum route is issued.
From Fig. 5 or flow process shown in Figure 6 as can be seen, when the Class1 route successfully is issued to high speed forwarding engine list item, no matter whether exist in the high speed forwarding engine list item time to be better than the route that this quilt issues, all the Class1 route in the high speed forwarding engine list item do not done any processing; When Class1 route sending-down to high speed forwarding engine list item is failed,, the Class1 route in the high speed forwarding engine list item is not done any processing if there is not the inferior Class1 route that this issues the failure route that is better than in the high speed forwarding engine list item yet; Fail and work as Class1 route sending-down to high speed forwarding engine list item, and there is the inferior Class1 route that this issues the failure route that is better than in the high speed forwarding engine list item, then need from high speed forwarding engine list item, to delete and be better than the Class1 route that this quilt issues the failure route one time, what issue once more afterwards that this quilt issues failure routes to high speed forwarding engine list item, if also failure, then in high speed forwarding engine list item, also there is the inferior Class1 route that this quilt issues the failure route that is better than, then continue from high speed forwarding engine list item, to delete and be better than the Class1 route that this quilt issues the failure route one time, what issue once more that this quilt issues failure routes to high speed forwarding engine list item, and the like, until issuing successfully, perhaps in high speed forwarding engine list item, there is not the inferior Class1 route that this quilt issues the failure route that is better than, this route that issues failure is inserted into RBTree.
More than method that the embodiment of the invention is provided be described.The device that the embodiment of the invention is provided is described below.
Referring to Fig. 7, the route sending-down structure drawing of device that Fig. 7 provides for the embodiment of the invention.This device is applied to comprise in the two forwarding engine system of routing engine, professional forwarding engine and high speed forwarding engine, professional forwarding engine list item in the professional forwarding engine is used to deposit Class1 route and type 2 routes that routing engine issues, high speed forwarding engine list item in the high speed forwarding engine is used to deposit the Class1 route that routing engine issues, as shown in Figure 7, this device can comprise: second list item, issue the unit and first judging unit; Wherein,
Described second list item is used to write down routing engine issues Class1 route from failure to high speed forwarding engine list item;
The described unit that issues is used for issuing not and the afoul Class1 route of professional forwarding engine list item type 2 routes R1 to high speed forwarding engine list item, if issue failure, then send judgement and be notified to described first judging unit,, then finish R1 and issue flow process if issue successfully;
After described first judging unit is used to receive described judgement notice, judge and whether have the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, if, the route that from high speed forwarding engine list item, is better than R1 for one time according to the priority deletion, trigger the described unit that issues afterwards and issue R1 once more to high speed forwarding engine list item, if issue failure, then continue to carry out and judge whether have inferior the be better than route of R1 and follow-up operation in the described high speed forwarding engine list item, if issue successfully, then finish R1 and issue flow process.
Wherein, as shown in Figure 7, this device further comprises:
Unit, the R1 that is used for learning is inserted into first list item, and described first list item is used to write down Class1 route and type 2 routes that routing engine has issued;
Second judging unit is used for judging whether R1 conflicts mutually with type 2 routes of first list item, if not, then determine R1 not with professional forwarding engine list item in type 2 routes conflict mutually, trigger the described unit that issues and carry out and to issue operation, otherwise, finish R1 and issue flow process.
Preferably, as shown in Figure 7, described first judging unit can comprise following subelement when specific implementation:
The route querying subelement, be used for receiving and receive described judgement notice back after the described judgement notice and search from described first list item and time be better than R1 and be present in Class1 route the high speed forwarding engine list item, with the route record that finds to the chained list of R1 correspondence, send afterwards to handle and notify to route deletion subelement, if do not find, R1 is inserted into second list item, finishes R1 and issue flow process;
Route deletion subelement, after being used to receive the processing notice, from described high speed forwarding engine list item, delete a route in the described chained list according to priority, trigger the described unit that issues afterwards and issue R1 once more to high speed forwarding engine list item, if issue failure, then send and issue failure notification to the route judgment sub-unit; If issue successfully, then finish R1 and issue flow process;
The route judgment sub-unit, be used to receive issue failure notification after, judge the Class1 route that whether also exists described route querying subelement to find in the described high speed forwarding engine list item, if, trigger described route deletion subelement and continue to carry out deletion action, if not, then R1 is inserted into second list item, finishes R1 and issue flow process.
In the present embodiment, the structure organization that the route in first list item is set according to Radix, wherein, the inferior route that is better than child node of the route on the father node.Based on this, as shown in Figure 7, can comprise with lower module during route querying subelement specific implementation: recall module, judge module, logging modle and back tracking operation and finish module.
Wherein, recall module, be used for recalling the father node of R1 in described Radix tree, with the father node that dates back to as current parent's node;
Judge module, be used to judge that whether current parent's node is not conflict mutually with type 2 routes and be not present in the Class1 route of second list item, if, send record and notify to logging modle, otherwise, judge further whether current parent's node is auxiliary node, if, then continue to recall the father node of current parent's node, this father node that dates back to as current parent's node, is triggered described judge module and carries out decision operation at this current father node; If not, send end notification to back tracking operation and finish module;
Logging modle, after being used to receive the record notice, with current parent's nodes records to the described chained list, continue to recall the father node of current parent's node afterwards, if date back to, then the father node that this is dated back to triggers described judge module and carries out decision operation at this current father node as current parent's node;
Back tracking operation finishes module, after being used to receive end notification, finishes back tracking operation, and judges whether described chained list is empty, and if not, send and handle notice to described route deletion subelement, if, R1 is inserted into second list item, finish R1 and issue flow process.
Based on above description of route being searched four modules that subelement comprises, the deletion action that route deletion subelement is carried out specifically comprises: read a route according to the principle that last in, first out from described chained list, this route that reads of deletion from described high speed forwarding engine list item.And the decision operation that the route judgment sub-unit is carried out comprises: judge whether also there is the route that is not read in the described chained list.
In the present embodiment, the route in described second list item is according to the structure organization of RBTree.
So far, finish unit describe shown in Figure 7.
As can be seen from the above technical solutions, among the present invention, since high speed forwarding engine list item completely cause after to high speed forwarding engine list item issue do not fail with the afoul Class1 route of type 2 routes R1 the time, judge and whether have the inferior route that is better than R1 in the described high speed forwarding engine list item, if, then from high speed forwarding engine list item, delete the route that is better than R1 for time, issue R1 afterwards once more to high speed forwarding engine list item, if issue failure, then continue to carry out above-mentioned decision operation, if issue successfully, then finish the flow process that R1 is issued to high speed forwarding engine list item, optimum route still was issued to high speed forwarding engine list item when this had guaranteed that high speed forwarding engine list item is full, and then had guaranteed that the high speed forwarding engine can improve the reliability that the high speed forwarding engine E-Packets by optimum routing forwarding 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 the scope of protection of the invention.

Claims (10)

1. route sending-down method, this method is applied to comprise in the two forwarding engine system of routing engine, professional forwarding engine and high speed forwarding engine, professional forwarding engine list item in the professional forwarding engine is used to deposit Class1 route and type 2 routes that routing engine issues, high speed forwarding engine list item in the high speed forwarding engine is used to deposit the Class1 route that routing engine issues, it is characterized in that, described pair of forwarding engine system also comprises second list item, and described second list item is used to write down routing engine issues Class1 route from failure to high speed forwarding engine list item; This method comprises:
A, to high speed forwarding engine list item issue not with professional forwarding engine list item in the afoul Class1 route of type 2 routes R1, if issue failure, then execution in step B if issue successfully, then finishes R1 and issues flow process;
B, judge whether there is the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, finish R1 and issue flow process, if from high speed forwarding engine list item,, issue R1 afterwards once more to high speed forwarding engine list item according to inferior route that is better than R1 of priority deletion, if issue failure, then return step B,, then finish R1 and issue flow process if issue successfully.
2. method according to claim 1 is characterized in that, before the steps A, further comprises:
The R1 that learns is inserted into first list item, and described first list item is used to write down Class1 route and type 2 routes that routing engine has issued;
Judge R1 whether with first list item in type 2 routes conflict mutually, if not, then determine R1 not with professional forwarding engine list item in type 2 routes conflict mutually, continue the operation that issues among the execution in step A, otherwise, finish R1 and issue flow process.
3. method according to claim 2 is characterized in that step B comprises:
B1 searches from first list item and time is better than R1 and is present in Class1 route in the high speed forwarding engine list item, with the Class1 route record that finds to the chained list of R1 correspondence, execution in step B2 afterwards, if do not find, R1 is inserted into second list item, finish R1 and issue flow process;
B2 deletes the Class1 route that step B1 finds according to priority from described high speed forwarding engine list item, issue R1 afterwards once more to high speed forwarding engine list item, if issue failure, and execution in step B3 then; If issue successfully, then finish R1 and issue flow process;
B3 judges the Class1 route that whether also exists step B1 to find in the described high speed forwarding engine list item, if, return execution in step B2, if not, R1 is inserted into second list item, finish R1 and issue flow process.
4. method according to claim 3 is characterized in that, the route in described first list item is according to the structure organization of JiRadixShu, and wherein, the route on the father node time is better than the route of child node;
Step B1 comprises:
B11 recalls the father node of R1 in described Radix tree, with the father node that dates back to as current parent's node;
B12, judge that whether current parent's node is not conflict mutually with type 2 routes and be not present in the Class1 route of second list item, if, execution in step B13, otherwise, judge whether current parent's node is auxiliary node, if then continue to recall the father node of current parent's node, with this father node that dates back to as current parent's node, return step B12, if not, execution in step B14;
B13 to described chained list, continues to recall the father node of current parent's node with current parent's nodes records afterwards, and this father node that dates back to as current parent's node, is returned step B12;
B14 finishes back tracking operation, judges whether described chained list is empty, if not, and execution in step B2, if, R1 is inserted into second list item, finish R1 and issue flow process;
Deletion among the step B2 comprises: read a route according to the principle that last in, first out from described chained list, this route that reads of deletion from described high speed forwarding engine list item;
Judgement among the step B3 comprises: judge whether also there is the route that is not read in the described chained list.
5. according to the arbitrary described method of claim 1 to 4, it is characterized in that the route in described second list item is according to the structure organization of RBTree.
6. route sending-down device, this device is applied to comprise in the two forwarding engine system of routing engine, professional forwarding engine and high speed forwarding engine, professional forwarding engine list item in the professional forwarding engine is used to deposit Class1 route and type 2 routes that routing engine issues, high speed forwarding engine list item in the high speed forwarding engine is used to deposit the Class1 route that routing engine issues, it is characterized in that this device comprises: second list item, issue the unit and first judging unit; Wherein,
Described second list item is used to write down routing engine issues Class1 route from failure to high speed forwarding engine list item;
The described unit that issues is used for issuing not and the afoul Class1 route of professional forwarding engine list item type 2 routes R1 to high speed forwarding engine list item, if issue failure, then send judgement and be notified to described first judging unit,, then finish R1 and issue flow process if issue successfully;
After described first judging unit is used to receive described judgement notice, judge whether there is the inferior route that is better than R1 in the described high speed forwarding engine list item, if not, then R1 is inserted into second list item, finish R1 and issue flow process; If, the route that from high speed forwarding engine list item, is better than R1 for one time according to the priority deletion, trigger the described unit that issues afterwards and issue R1 once more to high speed forwarding engine list item, if issue failure, then continue to carry out and judge whether have inferior the be better than route of R1 and follow-up operation in the described high speed forwarding engine list item, if issue successfully, then finish R1 and issue flow process.
7. device according to claim 6 is characterized in that, this device further comprises:
Unit, the R1 that is used for learning is inserted into first list item, and described first list item is used to write down Class1 route and type 2 routes that routing engine has issued;
Second judging unit is used for judging whether R1 conflicts mutually with type 2 routes of first list item, if not, then determine R1 not with professional forwarding engine list item in type 2 routes conflict mutually, trigger the described unit that issues and carry out and to issue operation, otherwise, finish R1 and issue flow process.
8. device according to claim 7 is characterized in that, described first judging unit comprises:
The route querying subelement, being used for receiving described judgement notice back searches from described first list item and time is better than R1 and is present in Class1 route the high speed forwarding engine list item, with the route record that finds to the chained list of R1 correspondence, send afterwards to handle and notify to route deletion subelement, if do not find, R1 is inserted into second list item, finishes R1 and issue flow process;
Route deletion subelement, after being used to receive the processing notice, from described high speed forwarding engine list item, delete the Class1 route that described route querying subelement finds according to priority, afterwards, trigger the described unit that issues and issue R1 once more to high speed forwarding engine list item, if issue failure, then send and issue failure notification to the route judgment sub-unit; If issue successfully, then finish R1 and issue flow process;
The route judgment sub-unit, be used to receive issue failure notification after, judge the Class1 route that whether also exists described route querying subelement to find in the described high speed forwarding engine list item, if, trigger described route deletion subelement and continue to carry out deletion action, if not, then R1 is inserted into second list item, finishes R1 and issue flow process.
9. device according to claim 8 is characterized in that, the route in described first list item is according to the structure organization of JiRadixShu, and wherein, the route on the father node time is better than the route of child node;
Described route querying subelement comprises:
Recall module, be used for recalling the father node of R1 in described Radix tree, with the father node that dates back to as current parent's node;
Judge module, be used to judge that whether current parent's node is not conflict mutually with type 2 routes and be not present in the Class1 route of second list item, if, send record and notify to logging modle, otherwise, judge further whether current parent's node is auxiliary node, if, then continue to recall the father node of current parent's node, this father node that dates back to as current parent's node, is triggered described judge module and carries out decision operation at this current father node; If not, send end notification to back tracking operation and finish module;
Logging modle, after being used to receive the record notice, current parent's nodes records to described chained list, is continued to recall the father node of current parent's node afterwards, this father node that dates back to as current parent's node, is triggered described judge module and carries out decision operation at this current father node;
Back tracking operation finishes module, after being used to receive end notification, finishes back tracking operation, and judges whether described chained list is empty, and if not, send and handle notice to described route deletion subelement, if, R1 is inserted into second list item, finish R1 and issue flow process;
The deletion action that route deletion subelement is carried out specifically comprises: read a route according to the principle that last in, first out from described chained list, this route that reads of deletion from described high speed forwarding engine list item;
The decision operation that the route judgment sub-unit is carried out comprises: judge whether also there is the route that is not read in the described chained list.
10. according to the arbitrary described device of claim 6 to 9, it is characterized in that the route in described second list item is according to the structure organization of RBTree.
CN2011100350321A 2011-02-09 2011-02-09 Routing issuing method and device Pending CN102075435A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100350321A CN102075435A (en) 2011-02-09 2011-02-09 Routing issuing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100350321A CN102075435A (en) 2011-02-09 2011-02-09 Routing issuing method and device

Publications (1)

Publication Number Publication Date
CN102075435A true CN102075435A (en) 2011-05-25

Family

ID=44033787

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100350321A Pending CN102075435A (en) 2011-02-09 2011-02-09 Routing issuing method and device

Country Status (1)

Country Link
CN (1) CN102075435A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220228A (en) * 2013-04-10 2013-07-24 杭州华三通信技术有限公司 Method and equipment for sending border gateway protocol (BGP) routes
CN106257876A (en) * 2015-06-16 2016-12-28 中兴通讯股份有限公司 Label processing method, routing iinformation delivery method and device
CN115484203A (en) * 2022-09-14 2022-12-16 杭州云合智网技术有限公司 Method, device and equipment for operating routing table entry and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1874305A (en) * 2006-03-22 2006-12-06 华为技术有限公司 Method of IP route selection
CN101227318A (en) * 2007-12-04 2008-07-23 东南大学 Method for overtrick real-time detection of high speed network flow quantity
CN101582846A (en) * 2009-06-10 2009-11-18 杭州华三通信技术有限公司 Route sending-down method, message forwarding method, forwarding engine and message forwarding equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1874305A (en) * 2006-03-22 2006-12-06 华为技术有限公司 Method of IP route selection
CN101227318A (en) * 2007-12-04 2008-07-23 东南大学 Method for overtrick real-time detection of high speed network flow quantity
CN101582846A (en) * 2009-06-10 2009-11-18 杭州华三通信技术有限公司 Route sending-down method, message forwarding method, forwarding engine and message forwarding equipment

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220228A (en) * 2013-04-10 2013-07-24 杭州华三通信技术有限公司 Method and equipment for sending border gateway protocol (BGP) routes
CN106257876A (en) * 2015-06-16 2016-12-28 中兴通讯股份有限公司 Label processing method, routing iinformation delivery method and device
CN106257876B (en) * 2015-06-16 2020-09-15 中兴通讯股份有限公司 Label processing method, routing information issuing method and device
CN115484203A (en) * 2022-09-14 2022-12-16 杭州云合智网技术有限公司 Method, device and equipment for operating routing table entry and storage medium
CN115484203B (en) * 2022-09-14 2024-05-24 云合智网(上海)技术有限公司 Routing table item operation method, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
CN104426768B (en) A kind of data message forwarding method and device
CN108566296B (en) Network device layering method, network management device and computer readable storage medium
CN104580027A (en) OpenFlow message forwarding method and equipment
CN104462549A (en) Data processing method and device
CN1552139A (en) Using link state information to discover IP network topology
CN105706391A (en) Multicast increasing through index localization
CN101888332A (en) Be used to provide the method for quick rerouting and transmit data cell
CN102932415A (en) Method and device for storing mirror image document
CN101388030A (en) Database and database processing methods
CN102648468A (en) Table search device, table search method, and table search system
CN111935000B (en) Message transmission method and device
CN101695054A (en) Method and device for route maintenance and method and device for route query
CN102946356A (en) CB-PE (controlling bridge-port extender) network-based multicast message transmitting method and device
CN104917681A (en) System and method for packet forwarding using a conjunctive normal from strategy in a content-centric network
CN109067585A (en) A kind of inquiry ACL table item delivery method and device
CN100486212C (en) Method for improving routing list capacity
CN102075435A (en) Routing issuing method and device
CN101562574A (en) Method for updating routing list and device thereof
CN101582846B (en) Route sending-down method, message forwarding method, forwarding engine and message forwarding equipment
CN102868775B (en) Method for expanding capacity of address resolution protocol table, and message forwarding method and device
CN109257275B (en) Method and system for forwarding multicast data
CN110661713B (en) Message forwarding method and device
CN102195868B (en) Method and device for dynamically classifying network messages at high efficiency
CN101459630B (en) IGP routing method and apparatus
CN110442645A (en) Data index method 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
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20110525