CN1507229A - Route list organizing and searching method - Google Patents
Route list organizing and searching method Download PDFInfo
- Publication number
- CN1507229A CN1507229A CNA02155157XA CN02155157A CN1507229A CN 1507229 A CN1507229 A CN 1507229A CN A02155157X A CNA02155157X A CN A02155157XA CN 02155157 A CN02155157 A CN 02155157A CN 1507229 A CN1507229 A CN 1507229A
- Authority
- CN
- China
- Prior art keywords
- address
- correspondence
- network prefix
- sublist
- prefix length
- 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
Abstract
The present invention provides one kind of route list organizing and searching method for IPv6 network. The route list organizing method includes: determining the N value for multiple list to express the front N places of IP address; establishing multiple list to contain all the route list items of IP addresses with network prefix length not greater than N based on the N value and the network prefix of IP address, with each layer of the list being corresponding to one of the different fields of IP address; and linking Patricia tree to express the excessive places of IP address following the multiple list in case of network prefix of IP address with length greater than N. The present invention constitutes new route list organizing and searching method by means of the two advantages of relatively fast searching speed of multiple list method and saving in space of Patricia tree method.
Description
Technical field
The present invention relates to IP network, specifically, relate to the tissue and the lookup method of the routing table of router in the network that adopts the IPv6 agreement.
Background technology
In computer network, as the Internet Internet or Intranet Intranet, in order to distinguish each computer of forming network, each computer all has been endowed an address as the sign that is different from other computers.Connect each computer by router in the IP network, realize transmission of Information between the computer.When communicating between the computer, source host joins the address (destination address) of destination host in the packet of transmission, the router in the network according to packet with destination address transmit, finally arrive destination host, thereby finish communication.
The function of router is to determine the next path of the current packet of receiving and transmit packet in the network, so each router all should know the topological structure of current network, thereby finds the path that leads to arbitrary destination address, promptly determines next jumping.Come the topology information of awareness network between the router by periodical exchange information, thereby according to the variation of network new routing information more.
A routing table is all arranged in each router, be used for storage purpose address, gateway address, outer outgoing interface and routing state etc.Destination address carries out because the route in the packet is based on, and is that key for searching is searched in routing table with the destination address therefore, can obtain corresponding route table items.The information that comprises a lot of relevant routes in the route table items is wherein most importantly about determining the information of next jumping.The search procedure of routing table is relevant with the organizational form of IP address structure and routing table.For example, for the address that is no more than eight, can adopt the form routing table of array, the pairing signless integer in address is as the index of corresponding route table items.When searching, obtain index, thereby find corresponding route entry according to the address that will search.If but the address is 32, then represent that with array routing table can be a significant wastage or even impracticable, because need the 4Gb internal memory to deposit routing table this moment; As 128 bit address, then needing to design more efficiently, data structure could satisfy the needs of using for longer address.
The method that a lot of support IP route querying has been arranged at present.As G.R.Wright and W.R.Stevens nineteen ninety-five Addison-Wesley Publishing Company " TCP/IP Illustrated; vol.2; " in introduced a class special Radix tree be called the Patricia tree, in Net/3, FreeBSD and most of high-end router, be used to organize routing table.Patricia tree method is all regarded the address of searching as bit sequence with the address in the tree, and search procedure center-stage from the address bit sequence begins, and compares with node bit-by-bit in the tree.The value of a corresponding bit guides search procedure to search for to left subtree or right subtree, repeats this process up to searching corresponding route entry.In Patricia tree method, the longest figure place of search time and address is proportional, and the difference of average search time and worst case search time is little.
United States Patent (USP) 6,061 has proposed a kind of Hash-Radix tree method that is called among 712 " the Method for IP routing table look-up " and has organized and searched IP route table.This method is a Hash table with the preceding k organized of X bit IP address, and the preceding k bit of IP address is as hash index, and this index is corresponding to the pointer that points to radix tree root node; Each radix tree is the remaining X-k bit of expression only, and littler than the radix tree of expression entire I P address, its level mostly is X-k most, thereby its search efficiency is compared when whole address adopts the radix tree to organize and wanted high.
In addition, propose network routing device during Chinese patent application 00804339.6 " is used the network router search engine of compressed tree forwarding table " and use the multilayer data tree structure in central routing table with in transmitting, this is transmitted and comprises three layers of table altogether: the entry of ground floor table is by the first field direct addressin of the address bit of grouping address field, and the entry of second layer table is by the second field associating addressing of the address bit of grouping address field; The ground floor table effectively provides next jumping index of representing the next-hop network address for some groupings, and first field of the address bit of these grouping addresses is enough to determine next hop address; Be provided to a pointer of second layer table simultaneously for other groupings, the address bit of these grouping addresses is not enough to determine next hop address; Second layer table effectively provides next jumping index representing the next-hop network address for some groupings, and first and second fields of the address bit of these grouping addresses are enough to determine next hop address; The entry of the 3rd layer of table is by the 3rd field associating addressing of address bit from the grouping address field, and wherein second layer table effectively provides a pointer of the 3rd layer for some groupings, first and second fields of the address bit of these grouping addresses are not enough to determine the address of next jumping, and the 3rd layer of table provides next jumping index representing next hop address effectively for other groupings, and first, second of the address bit of these grouping addresses and the 3rd field are enough to determine the address of next jumping.Because at every turn can more a plurality of bits, thus the search efficiency of this method than Radix tree method height, but the memory space that takies simultaneously is also bigger.
Said method all has higher efficient when 32 bit address of IPv4, but when the IP address was increased to 128 of IPv6 by 32 of IPv4, the shortcoming of said method came out gradually.The memory space that the data structure of multilayer tree method takies is too big, and then become longer the search time of Patricia tree; Hash-radix tree method represents to chain then the radix tree with the preceding k position of address with Hash table, but the figure place of representing with Hash table very limited (generally being no more than 16), for 128 IPv6 addresses, and its efficient and similar when adopting the Patricia method.
Summary of the invention
Technical problem to be solved by this invention is to propose a kind of tissue and lookup method of routing table, and is particularly about the tissue and the lookup method of the routing table of IPv6 network, big or search long problem of time to solve in the prior art memory space.
The method for organizing of routing table of the present invention may further comprise the steps:
One, determine to utilize multilist to represent the N value of N position before the IP address;
Two, set up multilist according to the N value of step 1 and the network prefix of IP address, the route table items that the all-network prefix length is not more than the IP address correspondence of N all is organized in this table, each layer table is corresponding with the different field of IP address, and the length sum of the IP address field of each layer table correspondence is not more than N; When the network prefix length of IP address during more than or equal to N, the length sum of the IP address field that each layer table is corresponding equals N;
If the network prefix length of three IP addresses is greater than N, then the Patricia of remaining figure place sets in chained representation IP address, multilist back.
The value of determining N in the described step 1 is 48.
Described step 2 further comprises:
1) whether the network prefix length H that judges the IP address is greater than the expression position L of ground floor table, if then go to step 3); If not, then carry out step 2);
2) get the preceding H position of this layer table corresponding field in the IP address, the signless integer of this H position correspondence is U, is designated as U+2 under then in this layer table
HItem point to the route entry of this IP address correspondence;
Whether network prefix length that 3) will this moment reduces the L position, gets the preceding L position of this layer table corresponding field in the IP address, and the signless integer of this L position correspondence is V, judge each layer table expression position this moment and less than N, if then go to step 4); If not, then the table under be designated as V+2
LItem point to the stem of a Patricia tree, go to step 3;
4) be designated as V+2 under in the table
LList item point to a sublist, if this sublist does not exist, then according to the expression position of this sublist for this sublist storage allocation and make above-mentioned list item point to this sublist;
5) judge that the remaining network prefix length in IP address is whether greater than the expression position of this sublist, if then go to step 3); If not, then carry out step 2).
Setting up the Patricia tree in the described step 3 comprises:
1) root node of Patricia tree is corresponding to the N+1 position of IP address;
2) set up the Patricia tree with the figure place of IP address remainder, its leafy node points to the route entry of IP address correspondence.
Routing table finding method of the present invention may further comprise the steps:
One, whether the network prefix length H that judges the IP address represents a L greater than the ground floor table, if then go to step 3; If not, then carry out step 2;
Two, get the preceding H position of the corresponding IP address field of this layer table, the signless integer of this H position correspondence is U, is designated as U+2 under obtaining in the table
HItem, this list item points to the route entry of this IP address correspondence; Finish this search procedure;
Three, network prefix length H is reduced L, get the L position of this layer table corresponding address field, the signless integer of this L position correspondence is V, if be designated as V+2 under in this layer table
LItem point to a sublist, then go to step 4; If be designated as V+2 under in the table
LList item point to Patricia tree stem, then go to step 5;
Four, judge that IP address remaining network prefix length H-L is whether greater than the expression position of sublist, if then go to step 3; If not, then carry out step 2;
Five, utilize the figure place of IP address remainder in the Patricia tree, to search.
The present invention is called multilist-Patricia again and sets method, the present invention utilizes multilist can search a plurality of bits thereby seek rate structure very fast and Patricia tree method at every turn can not waste these two advantages of too many space, has constructed new routing table tissue and lookup method.The present invention compares with the multilist method, and memory space is less, and taking memory space with a list item is unit, supposes that each table has 8 list items, if adopt the multilist method, will take 512 units; If employing the present invention establishes N=32, then multilist only takies 128 units, and the Patricia tree only takies a small amount of unit.When adopting the present invention to search, because much the prefix length of destination addresses is smaller or equal to N, the route table items of at this moment searching the destination address correspondence is equivalent to directly to be searched in multilist; Seek rate have only those prefix lengths just need in the Patricia tree, further search, and number of times relatively also lack than Patricia tree method, so can improve much than the big address of N.Generally, the shared memory space of the present invention is far smaller than and adopts the shared space of multilist method, simultaneously its seek rate also than adopt Patricia tree method fast again more than.
Description of drawings
Fig. 1 is the flow chart that the present invention sets up the routing table of multilist-Patricia structure.
Fig. 2 is the flow chart that the present invention searches in the routing table of multilist-Patricia structure.
Fig. 3 is the embodiment that uses the double table of the present invention's foundation.
Fig. 4 is the schematic diagram of the routing table of multilist-Patricia structure.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in further detail.
At first introduce IPv4 address and netmask thereof and IPv6 address and network prefix thereof.The address of supposing IPv4 is 10.40.45.27, and its netmask is 255.255.255.0; And the address of IPv6 is 51fb:df00:ce3e:e200 ∷ 1234/64, and then preceding 64 of 64 of this back, address expression IPv6 address 51fb:df00:ce3e:e200 ∷ 1234 is network prefix, and promptly its (network) prefix length is 64.Netmask and prefix length can exchange, and promptly in the netmask are that the length of 1 bit is exactly prefix length continuously from a left side; Otherwise continuous prefix length position is 1 to the prefix length correspondence from a left side, the back is 0 netmask entirely.In above-mentioned example, the prefix length of IPv4 address is 24, and its network prefix is 10.40.45.Netmask and network prefix all identify the network portion of IP address, and network portion also is a most important parts when searching route.The present invention just is being based on this, utilizes multilist partly to organize routing table as far as possible, and for the oversize address of network portion, its corresponding route table items is organized in Patricia tree part, has so not only improved seek rate but also has saved memory space.
Because the expression position of a table is many more, its list item is just many more, and the list item of waste this moment is just more, so the expression position of every layer of table can not be too big, simultaneously, if the expression position is too little, each figure place of handling is just few when searching, and efficient just reduces, thereby the expression position of table generally is taken as 8.The structure of multilist is to determine according to the position or the concrete condition of router in IP network, and is relevant with the length and the hierarchical structure of IP address; For 32 bit address of IPv4, can all represent by multilist, be 8 if get the expression position of every layer of table, then only need 4 heavily to show just to represent that the memory headroom that takies is also not too large.Because if the N of multilist correspondence increases, the tuple of table also will increase, the memory headroom that needs also is multiplied thereupon, for the IPv6 address, because its address has hierarchical structure, preceding 48 corresponding to website external network part, ensuing 16 bit flag website internal network parts are so N preferably is chosen for 48.
And each layer table of multilist is corresponding with the different field of IP address, and the length L of this field is called the expression position of this layer table, and the table length of each unpressed this layer table is 2
L+1Certainly the expression position of each layer table can be different, but need the expression position of every layer of table of record this moment.First field of the corresponding IP of ground floor table address, second field of the corresponding IP of second layer table address, by that analogy, the n layer is shown the n field of corresponding IP address; The length sum of the IP address field that each of multilist layer table is corresponding is not more than N, and when the prefix length of IP address during more than or equal to N, the length sum of each of multilist layer IP address field that table is corresponding is N.
Fig. 1 has described the organization flow of routing table of the present invention, promptly sets up the flow process of multilist-Patricia structure.Setting up multilist needs at first to determine the value of N before.As mentioned above, N preferably is chosen for 48.Suppose that the IP address is p, its network prefix length is plen, and meter pointer is t, is used for the side-play amount off of expression table corresponding address p position, and the expression position of table is 1.
The initial value of side-play amount off is made as 0, and the leftmost position of expression secondary IP address begins to handle.Judge side-play amount off with the table t expression position 1 and whether less than N, if, then find address p corresponding index v in table t, get x and deduct medium and small one of value behind the side-play amount off for the table expression position I of t and network prefix length plen, if the IP address is V since the signless integer of the x position correspondence of off+1 position, then index v=V+2
xIf plen is less than 1 for network prefix length, then list item t[v] point to the route table items of address p correspondence.If plen is greater than 1 for network prefix length, expression need be set up sublist, make list item t[v] the sensing sublist, upgrade side-play amount off simultaneously, make the original position among its sensing sublist corresponding address p, network prefix length plen is for beginning the length of remaining prefix part, antithetical phrase matrix section then from off, judge new side-play amount off and this sublist expression position 1 and whether less than N, repeat above-mentioned steps up to handling all sublists.
That if side-play amount off and table t represent position 1 and equal N, then find address p equally as stated above at the index v of table among the t.If prefix length equals 1, list item t[v then] point to the route table items of address p correspondence.If prefix length is greater than 1, then expression need be set up the Patricia tree, makes meter pointer t point to the stem of Patricia tree, is key assignments with address p since the part of N+1 position, and route table items is added in the Patricia tree.
So far, the routing table with multilist-Patricia structure has been organized and has been finished.
Fig. 2 has described the flow process of searching in the routing table of setting up good multilist-Patricia structure.If the IP address that need search is p, its network prefix length is plen, and meter pointer is t, is used for the side-play amount off of expression table corresponding address p position, and the expression position of table is 1.
The initial value of side-play amount off is made as 0, and the leftmost position of expression secondary IP address begins to handle.Find the index v of address p in table t then.If network prefix length plen then checks t[v less than the expression position 1 of table] whether corresponding list item is invalid or do not exist, if then check its father node t[v/2] corresponding list item; If father node t[v/2] corresponding route table items is effective, t[v/2 then] route for finding, search end; Otherwise make v=v/2, repeat above-mentioned steps, continue to search.
If network prefix length plen is greater than the expression position 1 of table, and if t[v] corresponding list item points to the stem of Patricia tree, is that key for searching is searched the Patricia tree with the IP address part that begins from side-play amount off then.Otherwise t[v] the sensing sublist, expression needs to search in sublist, make t point to sublist, upgrade side-play amount off simultaneously, make the original position among its sensing sublist corresponding address p, prefix length plen searches the index of address p in sublist then again for begin the length of remaining prefix part from off, repeats above-mentioned steps.
Fig. 3 utilizes the present invention to set up the embodiment of double table.The expression position of supposing parent table is 2, and the expression position of sublist is 3, and the list item of parent table [6] points to sublist.IPv6 address 8200 ∷ 1234/4 set up route table items in multilist-Patricia structure as follows, learnt by above-mentioned IP v6 address, and its network prefix length is 4.Because parent table is represented position 2 less than prefix length 4, and two of IP address Far Lefts are 10, then obtaining index is 2+2
2=6, obtain t[6], list item t[6] the sensing sublist; This moment, side-play amount off became 2, and prefix length becomes 2 and represents position 3 less than sublist, and the dibit that this moment, the IP address began from skew is 00, and then obtaining index is 0+2
2=4, set up route table items, and make t[4] point to this route table items.
Fig. 4 uses the embodiment that the present invention sets up the routing table of multilist-Patricia structure, is table above, and its expression position is 3, and its list item [9] and [14] are pointed to the stem of two Patricia trees respectively.When getting N=3, the route table items that the IPv6 address is respectively 2F3D ∷ 1357/64 and CED2 ∷ 1375/64 correspondence is respectively in Patricia tree pointed of list item [9] and [14].Because the network prefix of 2F3D ∷ 1357/64 is greater than 3, and the front three of address is 001, obtain index 1+2
3=9 because multilist the expression position of (herein be heavily table) with 3 equal N, the prefix length of IP address is greater than N simultaneously, so list item [9] should point to Patricia tree, the route table items of 2F3D ∷ 1357/64 correspondence is organized in this tree.To the analysis classes of address CED2 ∷ 1375/64 seemingly.
Fig. 3 and Fig. 4 have enumerated two comparatively simple example, and when the N value is bigger, when simultaneously the network prefix of IPv6 address is bigger than N, multilist-Patricia structure will chain the Patricia tree by multilist and constitute.
In the present invention, if N is taken as 0, then the institutional framework of routing table becomes the Patricia tree structure; If get the maximum length that N is the IP address, then the institutional framework of routing table deteriorates to multilist.
Following surface analysis is when N changes, and multilist-Patricia tree takies the variation of memory space.Might as well establish original N is increased to N+4, the prefix length of 1/4th IPv6 address is longer than N in multilist originally-Patricia tree.Because N is increased to N+4, so will link some sublists, establish these sublists and represent that the position is 4, then shared memory space increase original 2
5/ 4=8 doubly.Even have only the prefix length of 1/10th IPv6 address longer than N, shared memory space also will increase original 3 times.The multilist method is 128 o'clock multilist-Patricia trees corresponding to N, thereby the memory space that the multilist method takies is too many.
In addition, if the prefix length of IPv6 address less than N, only needs search route in the multilist in front, its speed also will be fast doubly a lot of when adopting the Patricia tree structure.Have only the address of those prefix lengths greater than N, need search for the Patricia tree of multilist-Patricia tree when searching route, the speed of this moment is also fast when adopting the Patricia tree structure.
By on know that adopt multilist-Patricia tree to organize routing table, particularly IPv6 routing table, it is few and search efficiency is high to take memory space.
Claims (6)
1, a kind of method for organizing of routing table may further comprise the steps:
One, determine to utilize multilist to represent the N value of N position before the IP address;
Two, set up multilist according to the N value of step 1 and the network prefix of IP address, the route table items that the all-network prefix length is not more than the IP address correspondence of N all is organized in this table, each layer table is corresponding with the different field of IP address, and the length sum of the IP address field of each layer table correspondence is not more than N; When the network prefix length of IP address during more than or equal to N, the length sum of the IP address field that each layer table is corresponding equals N;
If the network prefix length of three IP addresses is greater than N, then the Patricia of remaining figure place sets in chained representation IP address, multilist back.
2, the method for organizing of routing table according to claim 1 is characterized in that, determines in the described step 1 that the value of N is 48.
3, the method for organizing of routing table according to claim 1 is characterized in that, described step 2 further comprises:
1) whether the network prefix length H that judges the IP address is greater than the expression position L of ground floor table, if then go to step 3); If not, then carry out step 2);
2) get the preceding H position of this layer table corresponding field in the IP address, the signless integer of this H position correspondence is U, is designated as U+2 under then in this layer table
HItem point to the route entry of this IP address correspondence;
Whether network prefix length that 3) will this moment reduces the L position, gets the preceding L position of this layer table corresponding field in the IP address, and the signless integer of this L position correspondence is V, judge each layer table expression position this moment and less than N, if then go to step 4); If not, then the table under be designated as V+2
LItem point to the stem of a Patricia tree, go to step 3;
4) be designated as V+2 under in the table
LList item point to a sublist, if this sublist does not exist, then according to the expression position of this sublist for this sublist storage allocation and make above-mentioned list item point to this sublist;
5) judge that the remaining network prefix length in IP address is whether greater than the expression position of this sublist, if then go to step 3); If not, then carry out step 2).
4, the method for organizing of routing table according to claim 1 is characterized in that, sets up the Patricia tree in the described step 3 and further comprises:
1) root node of Patricia tree is corresponding to the N+1 position of IP address;
2) set up the Patricia tree with the figure place of IP address remainder, its leafy node points to the route entry of IP address correspondence.
5, a kind of routing table finding method may further comprise the steps:
One, whether the network prefix length H that judges the IP address represents a L greater than the ground floor table, if then go to step 3; If not, then carry out step 2;
Two, get the preceding H position of the corresponding IP address field of this layer table, the signless integer of this H position correspondence is U, is designated as U+2 under obtaining in the table
HItem, this list item points to the route entry of this IP address correspondence; Finish this search procedure;
Three, network prefix length H is reduced L, get the L position of this layer table corresponding address field, the signless integer of this L position correspondence is V, if be designated as V+2 under in this layer table
LItem point to a sublist, then go to step 4; If be designated as V+2 under in the table
LList item point to Patricia tree stem, then go to step 5;
Four, judge that IP address remaining network prefix length H-L is whether greater than the expression position of sublist, if go to step 3; If not, go to step 2;
Five, utilize the figure place of IP address remainder in the Patricia tree, to search.
6, routing table finding method according to claim 5 is characterized in that, described step 2 further comprises, is designated as U+2 under in obtaining table
HItem after, check that this list item is whether invalid or do not exist, if effectively, then the route table items of this list item correspondence is the item that finds; Otherwise, check its father node (U+2
HWhether the list item of)/2 correspondence is effective, if the list item of father node correspondence is effective, then the route table items of this list item correspondence is the route that finds, and searches end; Otherwise continue to search the father node of father node, until finding required route table items.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB02155157XA CN100352233C (en) | 2002-12-10 | 2002-12-10 | Route list organizing and searching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB02155157XA CN100352233C (en) | 2002-12-10 | 2002-12-10 | Route list organizing and searching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1507229A true CN1507229A (en) | 2004-06-23 |
| CN100352233C CN100352233C (en) | 2007-11-28 |
Family
ID=34235750
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB02155157XA Expired - Fee Related CN100352233C (en) | 2002-12-10 | 2002-12-10 | Route list organizing and searching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100352233C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100496019C (en) * | 2005-11-10 | 2009-06-03 | 中国科学院计算技术研究所 | A method to quickly search and update IPv6 routing list |
| WO2011124030A1 (en) * | 2010-04-08 | 2011-10-13 | 华为技术有限公司 | Method and device for storing routing table entry |
| CN101437016B (en) * | 2007-11-16 | 2012-06-06 | 北京乾坤化物数字技术有限公司 | Method for building IP address structure tree |
| CN102904812A (en) * | 2012-09-29 | 2013-01-30 | 华为技术有限公司 | Storage method, search method, device and system of routing table entries |
| CN103561133A (en) * | 2013-11-19 | 2014-02-05 | 中国科学院计算机网络信息中心 | IP address ownership information indexing and fast querying method |
| CN103841027A (en) * | 2012-11-26 | 2014-06-04 | 中兴通讯股份有限公司 | Hash mapping plane mapping information registration and search method, device and system |
| CN117221224A (en) * | 2023-11-09 | 2023-12-12 | 格创通信(浙江)有限公司 | Table item construction and search method and device, network equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6266706B1 (en) * | 1997-09-15 | 2001-07-24 | Effnet Group Ab | Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams |
| US6061712A (en) * | 1998-01-07 | 2000-05-09 | Lucent Technologies, Inc. | Method for IP routing table look-up |
| US6192051B1 (en) * | 1999-02-26 | 2001-02-20 | Redstone Communications, Inc. | Network router search engine using compressed tree forwarding table |
-
2002
- 2002-12-10 CN CNB02155157XA patent/CN100352233C/en not_active Expired - Fee Related
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100496019C (en) * | 2005-11-10 | 2009-06-03 | 中国科学院计算技术研究所 | A method to quickly search and update IPv6 routing list |
| CN101437016B (en) * | 2007-11-16 | 2012-06-06 | 北京乾坤化物数字技术有限公司 | Method for building IP address structure tree |
| WO2011124030A1 (en) * | 2010-04-08 | 2011-10-13 | 华为技术有限公司 | Method and device for storing routing table entry |
| CN102904812A (en) * | 2012-09-29 | 2013-01-30 | 华为技术有限公司 | Storage method, search method, device and system of routing table entries |
| CN102904812B (en) * | 2012-09-29 | 2015-07-29 | 华为技术有限公司 | The storage means of route table items, lookup method, Apparatus and system |
| CN103841027A (en) * | 2012-11-26 | 2014-06-04 | 中兴通讯股份有限公司 | Hash mapping plane mapping information registration and search method, device and system |
| CN103841027B (en) * | 2012-11-26 | 2018-08-14 | 中兴通讯股份有限公司 | The map information of Hash mapping plane is registered and lookup method, equipment and system |
| CN103561133A (en) * | 2013-11-19 | 2014-02-05 | 中国科学院计算机网络信息中心 | IP address ownership information indexing and fast querying method |
| CN103561133B (en) * | 2013-11-19 | 2016-08-24 | 中国科学院计算机网络信息中心 | A kind of IP address attribution information index method and method for quickly querying |
| CN117221224A (en) * | 2023-11-09 | 2023-12-12 | 格创通信(浙江)有限公司 | Table item construction and search method and device, network equipment and storage medium |
| CN117221224B (en) * | 2023-11-09 | 2024-02-06 | 格创通信(浙江)有限公司 | Table item construction and search method and device, network equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100352233C (en) | 2007-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7418505B2 (en) | IP address lookup using either a hashing table or multiple hash functions | |
| CN101594319B (en) | Entry lookup method and entry lookup device | |
| CN1270487C (en) | Method and apparatus for ternary content addressable meomry (TCAM) table management | |
| Bando et al. | Flashtrie: Hash-based prefix-compressed trie for IP route lookup beyond 100Gbps | |
| CN1655533A (en) | Filter based on longest prefix match algorithm | |
| CN1255975C (en) | Method for selecting route for grouping in route apparatus | |
| CN103428093A (en) | Route prefix storing, matching and updating method and device based on names | |
| CN1216473C (en) | TCAM high-speed search method and system supporting multiple nexthop | |
| CN102045412B (en) | Method and equipment for carrying out compressed storage on internet protocol version (IPv)6 address prefix | |
| EP1063827A2 (en) | Method for address lookup | |
| CN100352233C (en) | Route list organizing and searching method | |
| CN1878164A (en) | E.164 number domain name storing and searching method | |
| CN1897560A (en) | Method for improving routing list capacity | |
| CN1187933C (en) | Establishment of IP address of route device, finding method and its equipment | |
| CN1885820A (en) | Engine apparatus for route forwarding table address searching | |
| Han et al. | A novel routing algorithm for IoT cloud based on hash offset tree | |
| CN1152516C (en) | Method for finding out IP network node | |
| CN114884877A (en) | IPv6 route searching method combining hash table and HOT | |
| Sahni et al. | O (log n) dynamic packet routing | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| Hsieh et al. | A classified multisuffix trie for IP lookup and update | |
| Tang et al. | A lightweight multidimensional index for complex queries over dhts | |
| CN1585358A (en) | Route searching method and system | |
| CN100358288C (en) | Method for processing five-membered stream group in network equipment | |
| CN1333616A (en) | Routing search system and method thereof, its used router |
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: 20071128 Termination date: 20141210 |
|
| EXPY | Termination of patent right or utility model |