CN1148929C - Quick modification method for IP search - Google Patents
Quick modification method for IP search Download PDFInfo
- Publication number
- CN1148929C CN1148929C CNB001063081A CN00106308A CN1148929C CN 1148929 C CN1148929 C CN 1148929C CN B001063081 A CNB001063081 A CN B001063081A CN 00106308 A CN00106308 A CN 00106308A CN 1148929 C CN1148929 C CN 1148929C
- Authority
- CN
- China
- Prior art keywords
- prefix
- mask
- length
- network address
- present node
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The prefix expanding method can not well solve the problem of the modification of a route item. Aiming at the problem that the route is difficult to modify, the present invention puts forward the concept of a prefix covering code on the basis of the prefix expanding method. The present invention well solves the problem of the modification of the route item.
Description
Technical field
The present invention relates to the IP route on the network router, relate in particular to the quick modification method that a kind of IP that realizes searches on network router.
Background technology
In the prior art, the IP in the network router searches common use control prefix and expands CPE (control prefix expansion) method.The CPE method is a kind of fast searching method that is proposed by Srinivasan, the paper name is called " Faster IP Lookups usingControlled Prefix Expansion " and (comes from proc.ACM sigmetrics ' 98conf., madison, WI, the 1-11 page or leaf), this method is utilized the time complexity of the thought minimizing method of segmentation compression, makes seek rate increase greatly, according to different configurations, can between 3～32 steps, search and finish.Simply introduce the CPE method below.
Since adopting CIDR (CIDR agreement) agreement in 1993, the IP route just comprises two parts＜IP prefix, the length of prefix 〉, the length range of prefix is between 0～32.For each input bag, IP searches the IP prefix sets that engine need find out coupling, and finds out the prefix of long coupling from the prefix sets of coupling.The indicated address of prefix of long coupling is exactly the address of next jumping of finding out.About the detailed content of CIDR as seen: RFC1519 Classless Inter-Domain Routing (CIDR): anAddress Assinment and Aggregation Strategy.V.Fuller, T.Li, J.Yu ， ﹠amp; K.Varadhan.September 1993. and RFC1817 CIDR stabilize Classful Routing.Y.Rekhter.August 1995.
Rule in the routing table can be expressed as the form of prefix, and the length of prefix changes between 8 and 32, and the IP lookup method is promptly found out the prefix of long coupling, because the diversity of prefix length is a key factor that causes the lookup method time complexity high.For the prefix maximum length is W, NetBSD (a kind of unix operating system of standard, this operating system has realized the ICP/IP protocol stack, wherein comprise the realization that IP searches) in the method complexity of binary tree be O (W), (L＜W), then the method complexity will be reduced to O (L) if the prefix maximum length is reduced to L.Obviously, the maximum length of minimizing prefix will improve the speed of method.The basic thought of control prefix extending method is to increase the step-length of method by the diversity that reduces prefix length, thereby has reduced the complexity of method, reaches the purpose of searching fast.
Any prefix can be extended for the prefix sets of designated length, as for prefix 10
*, can be extended for length and be 4 prefix sets { 1000
*, 1001
*, 1010
*, 1011
*, by expanding the length of prefix to appointment, length that can the normalization prefix, thus reduced the diversity of prefix length.Expanding the prefix method can be divided into what expanding the normalized prefix length in back, and the length of each grade prefix is the same, just can find other node of this level by array indexing.
Expand prefix tries tree 32 grades of original 1-bit tree boil down to 3 level structures as a result, search number of times and shorten to 3 times, the time complexity of method is O (3).Thereby reach the purpose of searching fast.Suppose P5=0
*, P1=10
*, P2=111
*, P3=11001
*, P4=1
*, P6=1000
*, P7=100000
*, P8=1000000
*, the structure that then typically expands prefix trees as shown in Figure 1.
But, in the CPE method, when carrying out the route modification, need judge the length of original prefix and modification prefix by auxiliary 1-bit tree as shown in Figure 2, when inserting a prefix item, if original prefix length greater than the prefix length that inserts, this prefix can not cover original prefix, if original prefix length less than existing prefix length, then needs to cover this prefix.
And auxiliary 1-bit tree needs committed memory, when 40,000 route entries, approximately need take the space of 1.5M.In addition, carry out needing complicated traversal and read-write operation when route is revised in the mode that adopts auxiliary 1-bit tree, thereby need a large amount of memory bandwidth of waste.
Summary of the invention
Purpose of the present invention is exactly when solving that route is revised in the CPE method need be by one " the auxiliary tree of 1-bit ", and need carry out the complicated traversal and the problem of read-write operation when revising route.
In order to realize above purpose, the present invention proposes a kind ofly by utilizing prefix mask to judge the route amending method of covering relation, comprise step:
The prefix mask of the prefix that calculating will be inserted or delete;
Prefix mask and the prefix mask in the present node calculated are compared; And
According to the prefix in the comparative result modification present node, wherein
When inserting, if the prefix mask of inserting then covers original prefix more than or equal to the prefix mask of present node; If the prefix mask of inserting less than the prefix mask of present node, then keeps the prefix of present node;
When deletion,, otherwise do not delete if the prefix mask of deletion then deletes when equaling the mask of present node.
Utilize method of the present invention, the data structure that when carrying out the modification of route entry, does not need auxiliary 1-bit tree, only need be when revising route entry prefix mask be judged and get final product, the prefix mask data can be placed in the route entry node structure, also can deposit separately, and corresponding one by one with the routing node item, read very convenient.
Description of drawings
Below with reference to accompanying drawings the present invention is carried out more detailed description.
Fig. 1 is the structure that typically expands prefix trees;
Fig. 2 is the auxiliary 1-bit tree that comprises 6 prefixes;
Fig. 3 is a kind of implementation-network address mask level code of prefix mask;
Fig. 4 inserts flow chart according to prefix of the present invention; And
Fig. 5 is according to prefix deletion flow chart of the present invention.
Embodiment
Before describing embodiments of the invention, the difference of two terms among the present invention once is described earlier.One is rank length, the length of a level.In this manual, rank length refers to first bit of this grade and the distance between last bit, and the length of level is the distance between the beginning bit of last bit of this grade and the first order.
Fig. 2 is the auxiliary 1-bit tree that comprises 6 prefixes.With reference to Fig. 2, the prefix in (1)～(6) the expression 1-bit tree.For the convenience that illustrates, suppose that the insertion sequence of prefix is consistent with sequence number (1)～(6).In the auxiliary 1-bit tree of Fig. 2, the node with prefix represents do not have the node of prefix to represent with hollow dots with solid dot.The left sibling of 1-bit tree represents 0, and right node represents 1, for prefix (3), represents that with the 1-bit tree its prefix is 11001
*1-bit tree among Fig. 2 is divided into 2 grades, and wherein rank 1 comprises 2 bits, and rank 2 comprises 3 bits.Principle of the present invention for convenience of explanation, we carry out corresponding with auxiliary 1-bit the classification among the present invention.In a preferred embodiment of the invention, classification refers to the classification in the CPE method, and hypothesis is divided into 2 grades with prefix in Fig. 2.Can find out with reference to Fig. 2, the prefix of the prefix in the rank 1 in always can not cover grade 2, on the contrary the prefix of the prefix in the rank 2 in always can cover grade 1 is because the length of the prefix in the rank 1 is shorter than the length of the prefix of rank 2.What will solve like this, in the present invention is exactly the covering relation of the prefix in the same rank of interpretation how.Notice that principle of the present invention for convenience of explanation and quoted auxiliary 1-bit tree just here realizes that in practice the present invention is need be by the 1-bit tree.
Fig. 3 is a kind of implementation-network address mask level code according to the prefix mask of preferred implementation of the present invention.In an embodiment of the present invention, the expression mode of prefix mask is the length of prefix, for example, for prefix (3), comprises 5 bits altogether, and its length is 5, so its prefix mask value of representing with length is 5.In like manner, the prefix mask of prefix (6) is 3.Because the length of prefix (6) is shorter than the length of prefix (3), so when inserting (6) this node, just can not cover the unit at downstream site (3) place of (6).In a word, if the length of the prefix of inserting than original length, then covers; Than original weak point or equally long, then do not cover.
In another embodiment of the present invention, represent prefix mask with the relative length of prefix.The relative length of prefix is the length of prefix in current rank, just prefix length is deducted other length of upper level, and for example, for prefix (6), its relative length in rank 2 is 3-2=1; The relative length of prefix (3) in rank 2 is 5-2=3, and the length that can draw prefix (6) equally is shorter than the length of prefix (3).As seen, the relative length of prefix does not change the relativeness between the prefix length.Adopt the relative length of prefix, can reduce the prefix mask occupation space, thereby reach the purpose that reduces EMS memory occupation.One of a same embodiment is if the relative length of the prefix of inserting than original length or equally long, then covers; Weak point than original does not then cover.
Prefix in the router uses " network address " and " network address mask " to represent usually, if calculate the length of prefix, a kind of method of calculating prefix length is that the network address mask to prefix shifts left, whenever move then once a counter is added 1, finish zero the time when arriving first.Value in the counter is exactly the length of prefix.The relative length of prefix also can calculate with similar way.Those skilled in the art are easy to design the additive method of computational length.
In other preferred embodiment of the present invention, represent prefix mask by the data of intercepting certain-length from the mask of the network address, and judge covering relation by the size that compares prefix mask.
Noted earlier as this specification, only need in same rank, judge the covering relation of prefix, so as long as the length that intercepts can be more than or equal to the length of prefix at appropriate level.Therefore, the longest a kind of form is the length of the whole network address of intercepting mask, promptly directly represents prefix mask with network address mask.Then by will when judging covering relation, the size to prefix mask comparing.For example, according to this method, the prefix mask of prefix (3) is 11111000 ..., the prefix mask of prefix (6) is 111000, obviously the prefix mask of prefix (6) is less than the prefix mask of prefix (3), so can not cover.But obviously oversize owing to directly representing with network address mask, committed memory is too many, so in other interception way, we carry out brachymemma to network address mask.A kind of brachymemma mode is to adopt the fixedly mode of prefix length, and promptly the length of all prefix mask is the same, according to the principle of front, obviously needs only the length of intercepting more than or equal to the longest rank length.In a preferred embodiment, select the length of prefix mask to equal the longest other length of level.Another kind of mode is to adopt the mode of elongated prefix length, be prefix mask length to the prefix of different stage length be different, according to principle of the present invention, as long as the length of prefix mask is more than or equal to the length of this prefix at appropriate level.In the present invention, select the length of prefix mask to equal the length of prefix, and claim the prefix mask of this form to be " network address mask level code " at appropriate level.For example, for the prefix among Fig. 1 (3), its prefix value is 11001
*, its network address mask is 11111000 ..., prefix (3) on rank 2, can the intercept network address mask in rank 2 pairing values as prefix mask, promptly " 111 " are as prefix mask.As shown in Figure 3.Equally, the prefix mask that can draw prefix (6) is " 100 ".Like this, size that just can be by " 111 " and " 100 " relatively judge covering relation.100 is obviously little than 111, so prefix (6) can not cover prefix (3).
Above execution mode in, it is all very familiar how the prefix mask of representing about length and relative length generates those skilled in the art, just is not described in detail here.Directly with network address mask represent also very simple, the preferred implementation when generating prefix mask with network address mask once is described below.
First kind of mode is to produce by moving to left earlier afterwards to move to right.Suppose that prefix is divided into the L level, take out prefix in other length of M level, then can move to left earlier, the length that moves to left moves to right then for the length of level M-1, and the length that moves to right deducts the rank length of rank M for the length of level L.For example, L is 3, and length overall is 8, and rank length is respectively 2,3,3 (length of respective stages is 2,5,8).The network address mask of supposing prefix is 1111000, and then the procurement process of prefix mask is as follows:
| Rank 1 | Rank 2 | Rank 3 | |
| | 11 | 111 | 000 |
| Move to left after 2 | 11 100 000 00 000 111 | ||
| Move to right 5 | |||
Shifting function is obviously relatively taken time, and can carry out the method for " position with " dextroposition then for this reason by using with a mask value and carry out.Can be earlier the different different mask values of level definition, for rank M, the constituting of mask value F (M) " position of corresponding appropriate level is 1, and all the other positions are 0 ".Like this, in as above example, F (1)=11000000, F (2)=00111000, F (3)=00000111.
The network address mask of prefix and other mask value of level can be obtained prefix mask with moving to right then like this, the figure place that moves to right is that the length of afterbody deducts the length when prime.For example, computational process is as follows:
| Rank 1 | Rank 2 | Rank 3 | |
| | 11 | 111 | 000 |
| | 00 111 000 00 111 000 | ||
| Xiang Yuhou | |||
| After the | 00 000 111 | ||
The generating mode of network address mask level code also has a lot, basic principle with above-described be the same.For example, also adding " 1 " in front forms prefix mask can also directly to get the value of prefix in appropriate level.For example, under the situation of the prefix 3 in Fig. 2, its prefix mask will be " 1+001 "=" 1001 ".For prefix 6, prefix mask will be " 10 ".
Fig. 4 is the insertion operating process of prefix overlay code.After the various prefix mask of above introduction have been arranged, when carrying out the prefix modification, can can remove original data structure " auxiliary 1-bit tree " like this by judging that prefix mask determines whether carrying out the overlapping operation of prefix, and the operation of complicated judgement covering.
When sewing mask before use, need increase the space of preserving prefix mask in the data structure of CPE, the data structure of CPE is based on node.Each node is represented a route entry, and each node all needs to increase the space of preserving prefix mask.When actual treatment, can put the data structure of node and prefix mask together, also can separate, when separate processes, need the data structure of node and prefix mask to keep index relative one to one.In a preferred embodiment of the invention, the data structure of prefix mask and node is put together.And, in the following description, suppose that prefix mask is a network address mask level code.
The flow process of Fig. 4 arrives the prefix mask that square frame 402 calculates the prefix that will insert from square frame 401.The method of calculating prefix mask comprises length, relative length and network address mask level code etc. as mentioned above.If for example the prefix that will insert in Fig. 1 is P9=1111
*, then the prefix mask of representing with network address mask level code is " 110 ".Flow process proceeds to square frame 403 after calculating prefix mask, searches the starting position that prefix is inserted.According to method well-known to those skilled in the art, the starting position of finding the insertion of prefix is " 110 " among the node S.Then flow process arrives square frame 404, calculates prefix and inserts end position.The end position of prefix calculates like this, and promptly the starting position of prefix adds 2
K, wherein K is the residue length of prefix in this rank, because the residue length of prefix P9 in rank 2 is 1, so K=1, then end position equals 110+001=111.Then flow process arrival square frame 405 begins expansion prefix node is inserted in the prefix circulation.The beginning flow process of circulation obviously can not finish, so flow process arrives the prefix mask that square frame 406 is got present node, and when square frame 407, the mask of the prefix P9 that will the insert prefix mask with the present node of being got is compared, present node is P2, its prefix mask is " 100 ", because 110 greater than 100, so P2 is covered by P9.Then flow process arrives square frame 408 and inserts the expansion prefix, promptly writes P9.Then, the prefix mask of flow process arrival square frame 409 modification present nodes is " 110 ".In like manner, at circulation time next time the P2 of 111 positions is replaced with P9, and the prefix mask of present node is revised as 110.Arrive circulation time for the third time, judge circulation at square frame 405 and finish, then flow process arrival square frame 410 withdraws from.In a word, when judging the covering relation of prefix,, then can directly insert if original node is empty (being that prefix mask is 000); If originally the prefix mask value of node is littler or equal than present, then directly cover; If node mask value originally is bigger than present, then keep original node.
In addition, those skilled in the art can understand, and the starting position and the end position that insert prefix can form when carrying out the prefix expansion in practice naturally.For example prefix P9 is 11110 after expanding
*With 11111
*So, can obtain beginning and end position naturally and be respectively 110 and 111.Certainly, those skilled in the art also can use other method that obtains beginning and end position.
As can be seen, the insertion of prefix operation is very simple, only need judge the size of prefix mask, just can determine whether can insert, and has avoided the situation that original prefix is inserted needs to pass through the 1-bit tree from the prefix insertion flow chart of Fig. 4.By prefix mask, significantly reduced the computation complexity that prefix is inserted.
Fig. 5 is the flow chart of route deletion action according to a preferred embodiment of the invention.
Equally can be by judging that prefix mask determine whether deleting present node during the deletion of prefix, but after deleting present node, need back to suck and find an adjacent prefix, be filled into the node place of deletion.This adjacent prefix can't obtain by original structure, also can't obtain this prefix in the prefix mask.This is a key issue of deletion action.
In router, a Routing Protocol processing unit is often arranged, the Routing Protocol processing unit produces the prefix that needs modification, and the Routing Protocol processing unit is often independent with forward processing unit.Keep a structure that is similar to the 1-bit tree in the Routing Protocol processing unit, so the Routing Protocol processing unit is can return to suck to obtain an adjacent prefix when generating the prefix that needs modification.So use for reference this structure here, when initiating the prefix deletion action, need be simultaneously with the structure that goes up adjacent prefix.The data structure of deletion prefix is as follows:
struct DEL_ROUTE
{
Prefix cur_prefix；
Prefix up_prefix；
}；
In actual router design, also can adopt a 1-bit tree to produce this DEL_R0UTE structure, the DEL_ROUTE structure can be at master control borad, interface board, network management platforms etc. are local to be generated, and also can adopt other the class 1-bit tree or the mode of the data structure of quasi-protocol processing unit to produce.
Prefix is the data structure of prefix in the DEL_ROUTE structure, comprises the value of prefix, the value of network address mask, and routing iinformation.Cur_prefix represents the prefix of needs deletion, and up_prefix needs a last adjacent prefix of filling after being deletion cur_prefix.For example, 11
*A last adjacent prefix be 1
*, 1110
*A last adjacent prefix be 111
*This structure is that the Routing Protocol processing unit produces when producing a deletion route messages, this structure has been arranged after, in conjunction with the notion of prefix mask, can finish the deletion action of route easily, the flow chart of route deletion action as shown in Figure 5.
The flow process of Fig. 5 is from square frame 501.Then calculate the prefix mask of the prefix that will delete at square frame 502.That suppose will to delete now is the P9 that inserts in the description at Fig. 4 in the above, and the prefix mask of P9 is " 110 ".Information from the data structure DEL_ROUTE that the comes up_prefix of prefix P9 as can be known is P2.So flow process calculates the prefix of up_prefix in square frame 503 be " 100 ".Then, flow process is calculated prefix deletion original position at square frame 504.With the same principle of describing among Fig. 4, calculating original position is 110.In like manner, calculating end position at square frame 505 is 111.Then arrive square frame 506 and judge whether to enter loop body.Obviously, current judged result is not for withdrawing from circulation, so follow the prefix mask of getting present node at square frame 507.Take out and be " 110 ".Compare two prefix mask at square frame 508 then, the result is identical, so deletion.Then change P9 into P2, and then change the prefix mask of present node into " 100 " at square frame 510 at square frame 509.At square frame 508, if find to delete present node through judging, then flow process is got back to square frame 506.If finish through judging circulation, then withdraw from the circulation back and finish at square frame 511 at square frame 506.
From prefix deletion flow chart as can be seen, after increasing the DEL_ROUTE structure, the deletion action of prefix also is and simply, and both prefix mask values relatively wherein refer to the size of the prefix mask value of the prefix mask value of relatively deleting prefix and present node prefix.If the prefix mask value of deletion prefix will equal the prefix mask value of present node, then delete present node.Otherwise do not delete present node.If the deletion present node is inserted into present node to a last adjacent prefix (up_prefix) in fact exactly, and the prefix mask of modification present node is the prefix mask of up_prefix.If up_prefix is empty, then putting present node and prefix mask is 0.
When deletion prefix node, need to obtain the value of a last adjacent prefix, here use the result of Routing Protocol processing unit, when the Routing Protocol processing unit generates prefix, produce the value of an adjacent prefix, when deletion of node, adopt the structure of DEL_ROUTE, solved the problem of deletion of node, made the knot removal operation same simple, can satisfy the processing requirements of high speed router with node insertion operation.
Top reference preferred implementation of the present invention has been described the present invention, obviously, in disclosed principle of the present invention and essential scope, can do various replacements, conversion or equivalence to the disclosed embodiments.In addition, the present invention can use jointly with other method of saving internal memory, and for example leaf moves down (LeafPush) technology, and this technology mainly is that leaf node is moved down into root node, accelerates searching speed.
Claims (13)
1, the amending method searched of a kind of improved IP is characterized in that comprising the following steps:
The prefix mask of the prefix that calculating will be inserted or delete;
Prefix mask and the prefix mask in the present node calculated are compared; And
According to the prefix in the comparative result modification present node, wherein
When inserting, if the prefix mask of inserting then covers original prefix more than or equal to the prefix mask of present node; If the prefix mask of inserting less than the prefix mask of present node, then keeps the prefix of present node;
When deletion,, otherwise do not delete if the prefix mask of deletion then deletes when equaling the mask of present node.
2, the method for claim 1 is characterized in that:
Described prefix mask is the length of prefix.
3, the method for claim 1 is characterized in that:
Described prefix mask is the relative length of prefix in current rank.
4, the method for claim 1 is characterized in that:
Described prefix mask is " network address mask level code " of network address mask in current rank of prefix.
5, the method for claim 1 is characterized in that:
Described prefix mask is the value of " 1 " prefixing in appropriate level.
6, the method for claim 1 is characterized in that:
When the deletion prefix, the data structure of coming from the Routing Protocol processing unit comprises a last adjacent prefix.
7, the method for claim 1 is characterized in that:
The step of revising the prefix in the present node also comprises the step of revising corresponding prefix mask value simultaneously.
8, method as claimed in claim 4 is characterized in that:
The calculation procedure of described prefix mask comprises the step that the network address mask to prefix moves to left earlier and afterwards moves to right, the described length that moves to left is current other length of other previous stage of level, and the length that the described length that moves to right is afterbody deducts deserves other rank length of prime.
9, method as claimed in claim 4 is characterized in that:
The calculation procedure of described prefix mask comprises that the length that the described length that moves to right is afterbody deducts current other length of level with the network address mask elder generation and a mask and the step that moves to right again of prefix.
10, as claim 4 or 5 described methods, it is characterized in that:
Described prefix mask is all identical to all prefix lengths.
11, as claim 4 or 5 described methods, it is characterized in that:
The length of described prefix mask equals the length of prefix in appropriate level.
12, as claim 2 or 3 described methods, it is characterized in that:
The step of calculating prefix mask comprises that the network address mask to prefix shifts left, and whenever moves once counter is added 1, obtains the length that count value is prefix zero the time when arriving first.
13, method as claimed in claim 8 or 9 is characterized in that described rank length refers to first bit of this grade and the distance between last bit, and the length of described level refers to the distance between the beginning bit of last bit of this grade and the first order.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB001063081A CN1148929C (en) | 2000-03-29 | 2000-03-29 | Quick modification method for IP search |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB001063081A CN1148929C (en) | 2000-03-29 | 2000-03-29 | Quick modification method for IP search |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1315798A CN1315798A (en) | 2001-10-03 |
| CN1148929C true CN1148929C (en) | 2004-05-05 |
Family
ID=4578273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB001063081A Expired - Fee Related CN1148929C (en) | 2000-03-29 | 2000-03-29 | Quick modification method for IP search |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1148929C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101043421B (en) * | 2006-03-21 | 2010-05-12 | 上海激动通信有限公司 | Memory based method for searching quickly the longest matching of IP address |
| US8320374B2 (en) * | 2006-12-28 | 2012-11-27 | Alcatel Lucent | Method and apparatus for improved multicast routing |
| CN105591915A (en) * | 2014-10-22 | 2016-05-18 | 中兴通讯股份有限公司 | Maintenance method and apparatus of routing table |
| CN109376272A (en) * | 2018-09-03 | 2019-02-22 | 中新网络信息安全股份有限公司 | A kind of ip matching process based on dictionary tree |
-
2000
- 2000-03-29 CN CNB001063081A patent/CN1148929C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1315798A (en) | 2001-10-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7349415B2 (en) | Method and apparatus for generating and using enhanced tree bitmap data structures in determining a longest prefix match | |
| CN102484610B (en) | Routing table construction method and device and routing table lookup method and device | |
| Waldvogel et al. | Scalable high-speed prefix matching | |
| 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 | |
| CN101655861B (en) | Hashing method based on double-counting bloom filter and hashing device | |
| CN101345707A (en) | Method and apparatus for implementing IPv6 packet classification | |
| US6691171B1 (en) | Method and system for address lookup in data communication | |
| DE60032674T2 (en) | Method for searching for addresses | |
| CN1543150A (en) | Packet classification apparatus and method using field level tries | |
| CN100496019C (en) | A method to quickly search and update IPv6 routing list | |
| CN1148929C (en) | Quick modification method for IP search | |
| CN1859208A (en) | Method and system for managing TCAM route list | |
| CN109754021B (en) | Online packet classification method based on range tuple search | |
| KR100999408B1 (en) | Method for searching an ??? using hash tree | |
| WO2015192742A1 (en) | Lookup device, lookup method and configuration method | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| US20060200581A1 (en) | Prefix processing technique for faster IP routing | |
| CN1147102C (en) | Method and device for modifying routing term | |
| CN1136709C (en) | Method for recovering internal storage of IP search | |
| CN1630247A (en) | A method for maintaining routing table in storage capable of content-address mapping | |
| CN112804153A (en) | Updating method and system for accelerating IP (Internet protocol) search facing GPU (graphics processing Unit) | |
| Ioannidis | Algorithms and data structures for IP lookups | |
| Ehliar et al. | Flexible route lookup using range search. | |
| Wang et al. | Routing Table Compaction for TCAM-Based IP Address Lookup |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: HUAWEI DIGITAL TECHNOLOGY CO. Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO., LTD. Effective date: 20091023 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20091023 Address after: No. 3, information road, Haidian District, Beijing Patentee after: Huawei Digit Technology Co., Ltd. Address before: Shenzhen province HUAWEI science and Technology Park Guangdong branch User Service Center Building Patentee before: Huawei Technologies Co., Ltd. |
|
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20040505 Termination date: 20120329 |