CN1728676A - Device for searching route - Google Patents
Device for searching route Download PDFInfo
- Publication number
- CN1728676A CN1728676A CN200410071045.4A CN200410071045A CN1728676A CN 1728676 A CN1728676 A CN 1728676A CN 200410071045 A CN200410071045 A CN 200410071045A CN 1728676 A CN1728676 A CN 1728676A
- Authority
- CN
- China
- Prior art keywords
- memory block
- address
- memory
- list item
- prefix
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The device is in use for IPv6 network. The device includes addressable memory of content in three stages, first comparator between addressable memory of content in first stage and addressable memory of content in second stage, second comparator between addressable memory of content in second stage and addressable memory of content in third stage. Since prefixion storage in each area of storage in addressable memory of content in each stage is not needed to consider, the disclosed device can carry out updating list item quickly. Moreover, in procedure of updating list item, flow for searching route is only interrupted for once. Thus, the invention has high continuity for searching route.
Description
Technical field
The present invention relates to the route querying technology, in particular, the present invention relates to the device for searching route in a kind of IPv6 of being applied to network.
Background technology
IP route forwarding table linear speed look up table technique is one of core P key technology.Route querying is meant determines output slogan and the next hop address that it should be transmitted to the IP message of each arrival according to its purpose IP address.For improving the utilance of IPv4 address space, slow down the growth rate of list item in the routing table, the IETF of Internet working group has proposed CIDR (ClasslessInter-domain Routing-CIDR) technology in 1993, address prefix length can be the random length that is no more than the IPv4 address width.The employing of elongated address prefix makes the level of IP address distribute becomes possibility, but when tabling look-up, route forwarding table just might find the route table items of a plurality of couplings, therefore the list item that need select address prefix length maximum in the list item of all couplings promptly carries out longest prefix match (LPM-Longest Prefix Match) as final lookup result.
At present, along with the demand of continuous growth of network size and service quality, the Internet is gradually to the next generation internet transition based on IPv6 network interconnection agreement.IPv6 compares with IPv4, and very big change has taken place on address format, and address size has become 128 by original 32, also improves on address assignment.Although the address structure of IPv6 has been compared many differences with IPv4, but whole address space still is the level structure, still exist the route that is similar under the IPv4CIDR address structure to merge, LPM is adopted in the IPv6 route querying equally, but along with the increase of IPv6 address width makes the longest prefix match problem become more outstanding.Along with the raising of link-speeds and the application of IPv6, LPM becomes the bottleneck of realizing the surface speed forwarding of IPv6 high speed routing table look-up day by day.
For the IPv6 P, searching speed, entry updating speed, searching continuity and upgrade the preliminary treatment complexity is to weigh the most important performance index of method for searching route.Though people have proposed many route querying algorithms at IPv4, the forwarding demand of incompatibility IPv6 P.Such as, even adopt the less binary search algorithm to prefix length of searching times, an IPv6 route querying need reach the search of 7 steps, and recalls problem because of existence and be difficult to hardware and realize.
The technology of present existing support IPv6 fast routing lookups is single-stage Content Addressable Memory (TCAM, a Ternary Content Addressable Memory) scheme.Its technical scheme that adopts is to adopt single-stage TCAM storage prefix, and the output slogan and the next hop address of prefix correspondence is stored in the static RAM (SRAM).When tabling look-up TCAM is sent in purpose IP address, TCAM exports (priority encoding) as follow-up lookup table index with the lowest address of occurrence, reads corresponding output slogan and next hop address in view of the above from SRAM, is the longest prefix match result.Because route table items needs to bring in constant renewal in the practical application, entry updating can interrupt the flow process of tabling look-up, and (index) output as a result of of the memory address of only simply that the address is the minimum coupling list item of TCAM, so ensure longest prefix match, the storage of list item must be by the relative memory address descending of prefix length, thereby a list item insertion TCAM needs the operation of tens of dimension prefaces sometimes, promptly interrupt the route querying flow process tens of times, not only influence upgrading in time of route table items, the continuous performance of tabling look-up is declined to a great extent.
In order to overcome described shortcoming, prior art adopts to reduce and inserts the required list item of list item according to the order of sequence and move number of times and further improve entry updating speed, though the average efficiency of route renewal is improved to some extent, the pretreatment operation complexity, updating cost is big under the worst condition.
Summary of the invention
The technical problem that the present invention solves provides a kind of device for searching route of quick renewal list item.Adopt described device, the list item storage does not need ordering, and an entry updating is merely hit and opened circuit by searching flow process once, and the route querying continuity is strong, and does not need the entry updating preliminary treatment.
For addressing the above problem, device for searching route of the present invention comprises:
First order TCAM, be used for storing transmitting of the IPv6 address prefix that expands to 64 accordingly respectively according to the memory block of 16 address size scope division, during route querying, carry out longest prefix match, export first longest prefix match I1 as a result then according to the address to be found of input;
First comparator links to each other with described first order TCAM, is used for the described first longest prefix match result and first dividing value are compared, and exports the first additional prefix Q1;
Second level TCAM, link to each other with described first comparator, be used for storing transmitting of the IPv6 address prefix that expands to 64 accordingly respectively according to 4 address size scope division and the memory block that increases corresponding additional prefix, during route querying, longest prefix match is carried out in described first additional prefix Q1 and address to be found according to input, exports second longest prefix match I2 as a result then;
Second comparator links to each other with described the 2nd TCAM, is used for the second additional prefix Q2 is exported in I2 and the comparison of second dividing value as a result of described second longest prefix match;
Third level TCAM, link to each other with described second comparator, the memory block that is used for 1 address size scope division and increases corresponding additional prefix is stored transmitting of the IPv6 address prefix that expands to 64 accordingly respectively, during route querying, longest prefix match is carried out in described first, second additional prefix Q1, Q2 and address to be found according to input, exports the 3rd longest prefix match I3 as a result then;
SRAM links to each other with described third level TCAM, is used to preserve corresponding longest prefix match result's forwarding routing iinformation, during route querying, according to the corresponding routing iinformation of transmitting of described the 3rd longest prefix match I3 output as a result.
Wherein, described first order TCAM is set to 5 memory blocks, is respectively: S11 memory block, empty list item district, S12 memory block, empty list item district, S13 memory block, and wherein S11 memory block, S12 memory block and S13 memory block are according to 16 address size scope division;
Described second level TCAM is set to 5 memory blocks, be respectively: S21 memory block, empty list item district, S22 memory block, empty list item district, S23 memory block, wherein S21 memory block, S22 memory block and S23 memory block be according to 4 address size scope division, and corresponding one first additional prefix of per 4 address size scopes;
Described third level TCAM is set to 7 memory blocks, be respectively: S31 memory block, empty list item district, S32 memory block, empty list item district, S33 memory block, empty list item district, S34 memory block, wherein S31 memory block, S32 memory block, S33 and S34 memory block be according to 1 address size scope division, and per 1 address size scope corresponding one first and corresponding second additional prefix.
Wherein, first value of defining of described first comparator input comprises 3 amounts of defining: the empty list item address b11 between S11 memory block and S12 memory block in the empty list item district, the empty list item address b12 between S12 memory block and S13 memory block in the empty list item district, the highest memory address b13, and the first additional prefix Q1 comprises 4 optional comparative results:
If I1＜b11 is Q1=11 then;
If b11＜I1＜b12 is Q1=10 then;
If b12＜I1＜b13 is Q1=01 then;
If I1=b13 is Q1=00 then;
Q1 is as the 1st, 2 of the additional prefix of third level TCAM input.
Second value of defining of second comparator comprises 3 amounts of defining: a certain empty list item address b21 between S21 memory block and S22 memory block in the empty list item district, a certain empty list item address b22 between S22 memory block and S23 memory block in the empty list item district, the highest memory address b23; The second additional prefix Q2 comprises 4 optional comparative results:
If I2＜b21 is Q2=11 then;
If b21＜I2＜b22 is Q2=10 then;
If b22＜I2＜b23 is Q2=01 then;
If I2=b23 is Q2=00 then
Q2 is as the 3rd, 4 of the additional prefix of third level TCAM input.
Wherein, adopting strange expansion prescription with ingredients even in number formula or distributed expansion mode is 64 bit address length ranges with 128 IPv6 address size range expansion.
Wherein, transmit when upgrading, when the list item T of need renewal arrives, first count is sent T into first order TCAM, second count is sent into T second level TCAM and is transferred first order TCAM to the route querying state, triple time is sent into T third level TCAM and transfers second level TCAM to the route querying state, and the 4th bat transfers third level TCAM to the route querying state.
Compared with prior art, the present invention has following beneficial effect:
1, the list item storage does not need ordering, and entry updating speed is fast;
Prior art single-stage TCAM method for searching route then needs the list item ordering, and entry updating speed is slow, and the present invention is not because the prefix storage in each memory block of TCAM at different levels need be considered the length order, so can carry out quick entry updating.
2, an entry updating is merely hit and is opened circuit by searching flow process once, and the route querying continuity is strong;
Prior art single-stage TCAM method for searching route then needs list item is sorted, will carry out repeatedly list item in the sequencer procedure moves, whenever move a list item and will interrupt the route querying flow process one time, it searches poor continuity, the present invention is not because the prefix storage in each memory block of TCAM at different levels need be considered the length order, so an entry updating only need interrupt the route querying flow process once.
3, do not need the entry updating preliminary treatment.
Prior art single-stage TCAM method for searching route, for improve reducing in the list item sequencer procedure mobile number of times to list item, need complicated entry updating preliminary treatment, the present invention is not because the prefix storage in each memory block of TCAM at different levels need be considered the length order, so only need directly deposit definite storage area in during an entry updating, so do not need the entry updating preliminary treatment.
Description of drawings
Fig. 1 is that device for searching route embodiment of the present invention forms schematic diagram;
Fig. 2 is three grades of flowing structure storages of the present invention schematic diagram.
Embodiment
Device for searching route of the present invention adopts three grades of water operations to realize route queryings, by transmitting after Prefix Expansion four minutes step by step, is stored in the corresponding memory block after adding the additional prefix of different length again.Because the storage of the prefix in each memory block can be avoided the list item memory sequencing, therefore, can improve entry updating speed.
Described memory block can adopt known TCAM general-purpose device to realize, describes with specific embodiment below.
Fig. 1 is that route querying specific embodiment of the present invention is formed schematic diagram.
Adopt 3 grades of water operations to carry out route querying among the present invention, flowing water is searched structure and is respectively the first order, the second level, the third level from left to right.First and second level is made up of a TCAM and a comparator respectively, and the third level is a TCAM, after meet the SRAM that stores next hop address.
First order TCAM is divided into 5 storage areas from the low address to the high address, 5 storage areas are respectively S11 memory block, empty list item district, S12 memory block, empty list item district, S13 memory block;
Second level TCAM is divided into 5 storage areas from the low address to the high address, 5 storage areas are respectively S21 memory block, empty list item district, S22 memory block, empty list item district, S23 memory block;
Third level TCAM is divided into 7 storage areas from the low address to the high address, 7 storage areas are respectively S31 memory block, empty list item district, S32 memory block, empty list item district, S33 memory block, empty list item district, S34 memory block.
Table one is a comparator operation rule of the present invention.
The comparator operation rule
| Condition | Output |
| I＜b 1 | 11 |
| b 1＜I＜ b 2 | 10 |
| b 1＜I＜ b 3 | 01 |
| I＝b 3 | 00 |
Table one
First comparator described in the present invention adopts identical comparator operation rule with second comparator, and comparator has four input variables, an output variable.
Four input variables of first comparator are respectively:
The current matching result I1 (i.e. the first longest prefix match result) of a certain empty list item address b11 between S11 memory block and S12 memory block in the empty list item district, a certain empty list item address b12 between S12 memory block and S13 memory block in the empty list item district, the highest memory address b13, first order TCAM output.Wherein b11, b12 and b13 be as the value of defining (i.e. first value of defining), and the comparative result Q1 that output variable is 2 bits is as first additional prefix.
Wherein shown in the operation rule reference table one of first comparator, export Q1 according to following rule:
If I1＜b11 is Q1=11 then;
If b11＜I1＜b12 is Q1=10 then;
If b12＜I1＜b13 is Q1=01 then;
If I1=b13 is Q1=00 then
Q1 is as the 1st, 2 of the additional prefix of the second level, third level TCAM input.
Four input variables of second comparator are respectively: the current matching result I2 (i.e. the second longest prefix match result) of a certain empty list item address b21 between S21 memory block and S22 memory block in the empty list item district, a certain empty list item address b22 between S22 memory block and S23 memory block in the empty list item district, the highest memory address b23, second level TCAM output.Wherein b21, b22 and b23 be as the value of defining (i.e. second value of defining), and the comparative result Q2 that output variable is 2 bits is as second additional prefix.
Same, the operation rule of described second comparator is exported Q2 with reference to shown in Figure 2 according to following rule:
If I2＜b21 is Q2=11 then;
If b21＜I2＜b22 is Q2=10 then;
If b22＜I2＜b23 is Q2=01 then;
If I2=b23 is Q2=00 then
Q2 is as the 3rd, 4 of the additional prefix of third level TCAM input.
Like this, longest prefix match is carried out in described first, second additional prefix Q1, Q2 and address to be found according to input, export the 3rd longest prefix match I3 as a result then, be final longest prefix match result, by described the 3rd longest prefix match as a result I3 can search the corresponding routing iinformation of transmitting of output by SRAM.
Need to prove, for realizing 3 grades of above-mentioned water operations, adopt Prefix Expansion among the present invention, the address size number that is about to IPv6 is reduced to 64 by 128.Prefix Expansion can adopt method more, and present embodiment is only introduced two kinds of fairly simple methods, and first kind is very to expand the prescription with ingredients even in number formula.Be to become the even length prefix after 1 of the odd length Prefix Expansion, for example scope has the prefix 0110011/7,10111000/8 of two length, is 01100110/8,01100111/8,10111000/8 after the odd even expansion, has had only a length; Second kind is the distributed expansion mode, promptly according to the distribution situation of prefix length in transmitting is done different expansions.If the frequency height that the prefix of certain length occurs does not then expand or few the expansion; If low then expansion of the frequency that the prefix of some length occurs more.Contain 64 different lengths after the former Prefix Expansion, 64 length are designated 01～64 by incremental order respectively, as the prefix length of three grades of stream treatment.
The identical prefix symbol under unified control " * " of the location superlatively of first, second and third grade TCAM storage _
First, second and third grade TCAM removes superlatively other storage area stores the prefix length scope and the additional prefix different, that determine of location, and the prefix storage in each memory block need not considered the length order.
The prefix length scope and the additional prefix of first order TCAM storage are respectively:
S13：[17，32]
S12：[33，48]
S11：[49，64]
The prefix length scope and the additional prefix of second level TCAM storage are respectively:
S23：00[05，08]、01[21，24]、10[37，40]、11[53，56]
S22：00[09，12]、01[25，28]、10[41，44]、11[57，60]
S21：00[13，16]、01[29，32]、10[45，48]、11[61，64]
The prefix length scope and the additional prefix of third level TCAM storage are respectively:
S34：0000[0]、0100[17]、1000[33]、1100[49]、0001[05]、0101[21]、1001[37]、1101[53]、0010[09]、0110[25]、1010[41]、1110[57]、0011[13]、0111[29]、1011[45]、1111[61]
S33：0000[02]、0100[18]、1000[34]、1100[50]、0001[06]、0101[22]、1001[38]、1101[54]、0010[10]、0110[26]、1010[42]、1110[58]、0011[14]、0111[30]、1011[46]、1111[62]
S32：0000[03]、0100[19]、1000[35]、1100[51]、0001[07]、0101[23]、1001[37]、1101[55]、0010[11]、0110[27]、1010[43]、1110[59]、0011[15]、0111[31]、1011[47]、1111[63]
S31：0000[04]、0100[20]、1000[36]、1100[52]、0001[08]、0101[24]、1001[40]、1101[56]、0010[12]、0110[28]、1010[44]、1110[60]、0011[16]、0111[32]、1011[48]、1111[64]
The following describes the route querying process:
First, second and third grade TCAM carries out synchronous flowing water search operation.When purpose IPv6 address P arrives, first count is directly sent into first order TCAM, second count is given first comparator with the result of first order TCAM output, it is last with inputing to second level TCAM that the result that triple time produces first comparator is added in address P, the 4th result who claps second level TCAM output gives second comparator, the 5th result who claps first comparator and the generation of second comparator is added in the last third level TCAM that inputs to together of P, the 6th bat is sent the output of third level TCAM into SRAM, therefrom obtains next hop address.
When needs upgrade list item, can carry out according to following process:
1,2,3 grades of TCAM carry out synchronous flowing water renewal operation.When the list item T of need renewal arrives, first count is sent T into first order TCAM, second count is sent into T second level TCAM and is transferred first order TCAM to the route querying state, triple time is sent into T third level TCAM and transfers second level TCAM to the route querying state, and the 4th bat transfers third level TCAM to the route querying state.
To sum up, the present invention is reduced into 16 with the length range at the longest prefix match item place of destination address P by initial 64 by first order TCAM, the scope that is about to the occurrence existence is contracted to 1/4 of former scope, such as being the shortest scope of length [1,16], or the scope [17 of inferior weak point, 32], or long scope [33,48], or the longest scope [49,64].Judge the length range at the longest prefix match item place of destination address P then by first comparator.The process of judging is that (memory address of a prefix/performance exactly is in all and the P prefix of mating, the memory address of that prefix of memory address minimum with the output of first order TCAM.This function is the basic function of TCAM), and scope S11 and S12 between between memory address, scope S12 and a S13 in empty list item district empty list item district a memory address, the highest memory address relatively, first comparator produces 4 different comparative results, four different scopes of corresponding indication, then comparative result is given second level TCAM, which 1/4 scope second level TCAM knows in view of the above in is continued to search.For example, if first comparator output 11, then Dui Ying scope is [49,64].
In like manner, second level TCAM is reduced into 4 with the length range at the longest prefix match item place of destination address P by initial 16, is about to the scope that occurrence exists and is contracted to 1/4 of former scope, such as to scope [49,64], may be the shortest scope of length [49,52], or the scope [53 of inferior weak point, 56], or long scope [57,60], or the longest scope [61,64].Second comparator is further judged the length range at the longest prefix match item place of destination address P then.The process of judging is that (memory address of a prefix/performance exactly is in all and the P prefix of mating, the memory address of that prefix of memory address minimum for output with second level TCAM.This function is the basic function of TCAM), and scope S21 and S22 between between memory address, scope S22 and a S23 in empty list item district empty list item district a memory address, the highest memory address relatively.Second comparator produces 4 different comparative results, four different scopes of corresponding indication, and comparative result is given third level TCAM, and in conjunction with the result of first order TCAM output, which 1/4 scope third level TCAM knows in view of the above in is continued to search.For example, if second comparator output 00, then Dui Ying scope is [49,52].
At last determine the longest final matching result, for example scope [49,52] further is contracted to 1/4 of former scope by third level TCAM.Its output this moment has been exactly the memory address of longest prefix match item, takes out next hop address at last in view of the above from SRAM.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (5)
1, a kind of device for searching route is used for the IPv6 network, it is characterized in that, comprising:
First order Content Addressable Memory, be used for storing transmitting of the IPv6 address prefix that expands to 64 address size scopes accordingly respectively according to the memory block of 16 address size scope division, during route querying, longest prefix match is carried out in address to be found according to input, exports first longest prefix match I1 as a result then;
First comparator links to each other with described first order Content Addressable Memory, is used for the described first longest prefix match result and first dividing value are compared, and exports the first additional prefix Q1;
Second level Content Addressable Memory, link to each other with described first comparator, be used for storing transmitting of the IPv6 address prefix that expands to 64 address size scopes accordingly respectively according to 4 address size scope division and the memory block that increases corresponding additional prefix, during route querying, longest prefix match is carried out in described first additional prefix Q1 and address to be found according to input, exports second longest prefix match I2 as a result then;
Second comparator links to each other with described second level Content Addressable Memory, is used for the second additional prefix Q2 is exported in I2 and the comparison of second dividing value as a result of described second longest prefix match;
Third level Content Addressable Memory, link to each other with described second comparator, the memory block that is used for 1 address size scope division and increases corresponding additional prefix is stored transmitting of the IPv6 address prefix that expands to 64 address size scopes accordingly respectively, during route querying, longest prefix match is carried out in described first, second additional prefix Q1, Q2 and address to be found according to input, exports the 3rd longest prefix match I3 as a result then;
Static RAM, link to each other with described third level Content Addressable Memory, be used to preserve corresponding longest prefix match result's forwarding routing iinformation, during route querying, according to the corresponding routing iinformation of transmitting of described the 3rd longest prefix match I3 output as a result.
2, device for searching route according to claim 1, it is characterized in that, described first order Content Addressable Memory is set to 5 memory blocks, be respectively: S11 memory block, empty list item district, S12 memory block, empty list item district, S13 memory block, wherein S11 memory block, S12 memory block and S13 memory block are according to 16 address size scope division;
Described second level Content Addressable Memory is set to 5 memory blocks, be respectively: S21 memory block, empty list item district, S22 memory block, empty list item district, S23 memory block, wherein S21 memory block, S22 memory block and S23 memory block be according to 4 address size scope division, and corresponding one first additional prefix of per 4 address size scopes;
Described third level Content Addressable Memory is set to 7 memory blocks, be respectively: S31 memory block, empty list item district, S32 memory block, empty list item district, S33 memory block, empty list item district, S34 memory block, wherein S31 memory block, S32 memory block, S33 and S34 memory block be according to 1 address size scope division, and per 1 address size scope corresponding one first and corresponding second additional prefix.
3, device for searching route according to claim 2, it is characterized in that, first value of defining of described first comparator input comprises 3 amounts of defining: the empty list item address b11 between S11 memory block and S12 memory block in the empty list item district, the empty list item address b12 between S12 memory block and S13 memory block in the empty list item district, the highest memory address b13, and the first additional prefix Q1 comprises 4 optional comparative results:
If I1＜b11 is Q1=11 then;
If b11＜I1＜b12 is Q1=10 then;
If b12＜I1＜b13 is Q1=01 then;
If I1=b13 is Q1=00 then;
Q1 is as the 1st, 2 of the additional prefix of third level Content Addressable Memory input.
Second value of defining of second comparator comprises 3 amounts of defining: a certain empty list item address b21 between S21 memory block and S22 memory block in the empty list item district, a certain empty list item address b22 between S22 memory block and S23 memory block in the empty list item district, the highest memory address b23; The second additional prefix Q2 comprises 4 optional comparative results:
If I2＜b21 is Q2=11 then;
If b21＜I2＜b22 is Q2=10 then;
If b22＜I2＜b23 is Q2=01 then;
If I2=b23 is Q2=00 then
Q2 is as the 3rd, 4 of the additional prefix of third level Content Addressable Memory input.
4, device for searching route according to claim 1 is characterized in that, adopting strange expansion prescription with ingredients even in number formula or distributed expansion mode is 64 address size scopes with 128 IPv6 address size range expansion.
5, according to each described device for searching route of claim 1-4, it is characterized in that, transmit when upgrading, when the list item T of need renewal arrives, first count is sent T into first order Content Addressable Memory, second count is sent into T second level Content Addressable Memory and is transferred first order Content Addressable Memory to the route querying state, triple time is sent into T third level Content Addressable Memory and transfers second level Content Addressable Memory to the route querying state, and the 4th bat transfers third level Content Addressable Memory to the route querying state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100710454A CN100366023C (en) | 2004-07-28 | 2004-07-28 | Device for searching route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100710454A CN100366023C (en) | 2004-07-28 | 2004-07-28 | Device for searching route |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1728676A true CN1728676A (en) | 2006-02-01 |
| CN100366023C CN100366023C (en) | 2008-01-30 |
Family
ID=35927695
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100710454A Expired - Fee Related CN100366023C (en) | 2004-07-28 | 2004-07-28 | Device for searching route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100366023C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100466627C (en) * | 2006-06-01 | 2009-03-04 | 华为技术有限公司 | Method and device for searching address prefixion and message transfer method and system |
| CN100531140C (en) * | 2006-12-20 | 2009-08-19 | 中国科学院计算技术研究所 | A method and device for maximum prefix matching searching without retrospection |
| CN102663061A (en) * | 2012-03-30 | 2012-09-12 | Ut斯达康通讯有限公司 | Quick sorting and searching device for high-capacity lookup table and method for implementing quick sorting and searching device |
| CN102831235A (en) * | 2012-09-03 | 2012-12-19 | 苏州雄立科技有限公司 | Range match and lookup method |
| CN104539537A (en) * | 2014-12-25 | 2015-04-22 | 北京华为数字技术有限公司 | Routing lookup method and device |
| WO2022037571A1 (en) * | 2020-08-21 | 2022-02-24 | 深圳市中兴微电子技术有限公司 | Packet forwarding method and apparatus, and computer-readable storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101510839B (en) * | 1999-12-10 | 2014-07-09 | 赛泰克集团Ab有限责任公司 | Method and apparatus for storing sparse and dense subtrees in a longest prefix match lookup table |
| US6996664B2 (en) * | 2003-01-22 | 2006-02-07 | Micron Technology, Inc. | Ternary content addressable memory with enhanced priority matching |
| CN1216473C (en) * | 2003-03-28 | 2005-08-24 | 清华大学 | TCAM high-speed search method and system supporting multiple nexthop |
-
2004
- 2004-07-28 CN CNB2004100710454A patent/CN100366023C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100466627C (en) * | 2006-06-01 | 2009-03-04 | 华为技术有限公司 | Method and device for searching address prefixion and message transfer method and system |
| CN100531140C (en) * | 2006-12-20 | 2009-08-19 | 中国科学院计算技术研究所 | A method and device for maximum prefix matching searching without retrospection |
| CN102663061A (en) * | 2012-03-30 | 2012-09-12 | Ut斯达康通讯有限公司 | Quick sorting and searching device for high-capacity lookup table and method for implementing quick sorting and searching device |
| CN102831235A (en) * | 2012-09-03 | 2012-12-19 | 苏州雄立科技有限公司 | Range match and lookup method |
| CN104539537A (en) * | 2014-12-25 | 2015-04-22 | 北京华为数字技术有限公司 | Routing lookup method and device |
| CN104539537B (en) * | 2014-12-25 | 2018-04-20 | 北京华为数字技术有限公司 | A kind of method for searching route and device |
| WO2022037571A1 (en) * | 2020-08-21 | 2022-02-24 | 深圳市中兴微电子技术有限公司 | Packet forwarding method and apparatus, and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100366023C (en) | 2008-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7885268B2 (en) | Method and system for hash table based routing via table and prefix aggregation | |
| US7418505B2 (en) | IP address lookup using either a hashing table or multiple hash functions | |
| US7031320B2 (en) | Apparatus and method for performing high-speed IP route lookup and managing routing/forwarding tables | |
| US7706375B2 (en) | System and method of fast adaptive TCAM sorting for IP longest prefix matching | |
| US7424468B2 (en) | Internet protocol address look-up device | |
| CN101035062A (en) | Rule update method for three-folded content addressable memory message classification | |
| EP2582096A1 (en) | Classification method and device for packets | |
| CN101068212A (en) | Network address switching retransmitting device and method | |
| CN1929447A (en) | Method and device for searching address prefixion and message transfer method and system | |
| CN1725761A (en) | Method of implementing link aggregation of network equipment | |
| CN1784678A (en) | System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size | |
| CN1905523A (en) | Method for implementing multi-area stream classifying | |
| CN1216473C (en) | TCAM high-speed search method and system supporting multiple nexthop | |
| CN1728676A (en) | Device for searching route | |
| CN114884877A (en) | IPv6 route searching method combining hash table and HOT | |
| CN1585358A (en) | Route searching method and system | |
| CN101515900B (en) | Binary IP route searching method based on prefix cover grade | |
| CN105959224A (en) | Bit vector-based high-speed routing lookup apparatus and method | |
| CN1753389A (en) | Method of real time soft seizing wave length route photo network | |
| CN1279716C (en) | Parallel route searching method and system for eliminating longest prefix match search | |
| CN106789668B (en) | Method and device for processing message | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| CN1852238A (en) | Fast indexing method | |
| TW200414033A (en) | Address search | |
| CN1571352A (en) | Method for processing five-membered stream group in network equipment |
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: 20080130 Termination date: 20160728 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |