CN101094179A - Method and device for looking up route indexed in multiple stages - Google Patents
Method and device for looking up route indexed in multiple stages Download PDFInfo
- Publication number
- CN101094179A CN101094179A CNA2007101191307A CN200710119130A CN101094179A CN 101094179 A CN101094179 A CN 101094179A CN A2007101191307 A CNA2007101191307 A CN A2007101191307A CN 200710119130 A CN200710119130 A CN 200710119130A CN 101094179 A CN101094179 A CN 101094179A
- Authority
- CN
- China
- Prior art keywords
- index
- flag bit
- route
- block
- routing table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The method comprises: 1) according to the routing table with fixed capacity, selecting the index step number and the index step length in order to determine a minimum index table; according to the destination address in routing table, getting the offset of index block; 2) according to the flag bit, deciding the index value is a route series number or a secondary index; if it is route series number, then outputting the route; otherwise, keeping the search in next stage index; wherein, said multi stage index uses a index multiplexing form; the flag bit corresponding to the index in the index table uses a flag bit block form in order to be continuously saved; said index block and said flag bit block are separately saved.
Description
Technical field
The present invention relates to be used in the data communication field method for searching route of the communication transmission equipment that router, three-tier switch and IP make up, particularly a kind of communication transmission equipment is saved the looking up route indexed in multiple stages method and the device of memory cost.
Background technology
In the communication Packet Based Network that makes up in the IP network transmission or with IP, route querying is an extremely important part.Prior art discloses a kind of multi-branched tire tree finding algorithm (as: P.Gupta, S.Lin, andN.McKeown, " Routing lookups in hardware at memory access speeds ", inProceedings of INFOCOM Mar.1998), is a kind of route querying algorithm rapidly and efficiently, it is a concordance list of searching a tire tree structure by a certain section bit of IP address successively, finds corresponding route.Though this algorithm search efficiency is high, memory cost is bigger.Disclosed a kind of improvement algorithm (as: the Nen-Fu Huang of prior art, Shi-Ming Zhao, " A novel IP-routing lookup schemeand hardware architecture for multigigabit switching routers " .IEEE Journal onSelected Areas in Communications June 1999:1093-1104) is to have added index compression mechanism, is called two layers of multi-branched compression tire tree algorithm.Index after the compression has reduced memory cost to a certain extent, but its memory cost is still very big, simultaneously because the index item number is relevant with the features such as route mask-length of interpolation, the feasible memory size that can not predict concordance list is difficult to be applicable to the memory management mode of memory pool collection.
Summary of the invention
Technical problem to be solved by this invention is, a kind of communication transmission equipment looking up route indexed in multiple stages method and device are provided, be applicable to the network equipment that memory configurations is less but need to transmit fast, it is keeping reducing the memory cost of concordance list under its prerequisite of efficiently searching.
For achieving the above object, looking up route indexed in multiple stages method provided by the invention is used for searching of IP network transmission equipment route, it is characterized in that, comprising:
According to the routing table of fixed capacity, choose index progression and index step-length, determining minimum concordance list, and obtain step in the index block skew by destination address in the routing table;
Judge that by flag bit index value is the route sequence number or the step of secondary index,, otherwise in the next stage index, continue to search if judge it is that the route sequence number is then exported route;
Wherein, adopt the multiplexing form of index between described multiple index, the flag bit corresponding with index in the described index block stored continuously with the form of flag bit piece, and described index block and described flag bit piece are stored respectively.
Above-mentioned method for searching route is characterized in that, the index entry maximum number of described concordance list is calculated by following formula and obtained:
Wherein, n is an index progression, and M is a routing list capacity, x
1, x
2X
iX
nBe followed successively by the 1st, 2 ... i ... the index step-length of n index level, and x
1+ x
2+ ... + x
i+ x
n=IP address size, x
i＜32, i＜n＜32.
Above-mentioned method for searching route is characterized in that, the array that described index block is made up of index, in the described index progression, except that first order index, all there is at least one described index block in every grade of index, and described each index block all has unique numbering in index at the corresponding levels.
Above-mentioned method for searching route is characterized in that, in the described index progression, index step-lengths at different levels except that first order index equate, the index block number of described every grade of index is less than the item number of described routing table, if described index step-length is x, then the described index block of this grade index has 2
xEntry index.
Above-mentioned method for searching route is characterized in that, in the described index progression, except that the afterbody index, each index block all has an index marker position piece corresponding with it, an index entry in the corresponding described index block of a bit in the wherein said flag bit piece.
Above-mentioned method for searching route is characterized in that, each described index entry accounts for 16 bits, and described index entry is used to write down the numbering of routing table sequence number or secondary index piece, by with the corresponding flag bit piece of described index block in a bit distinguish.
Above-mentioned method for searching route is characterized in that, is storing the routing table sequence number in the described index entry of mark position bit representation in the described flag bit piece, otherwise the numbering that the secondary index table is being stored in expression.
Above-mentioned method for searching route is characterized in that, multiplexing usefulness 1 bit of described index is represented.
Above-mentioned method for searching route is characterized in that, the described step of obtaining in the index block skew by destination address further comprises:
Step-length L1 according to first order index takes out preceding L1 bit of described destination address as following target step;
Described subscript is obtained the step of the flag bit of index value and correspondence thereof in described index block as skew.
Above-mentioned method for searching route, it is characterized in that, describedly judge that by flag bit index value is that the route sequence number or the step of secondary index further comprise: judge that whether described flag bit is zero step, if zero, then described index value is the route sequence number, otherwise described index value is a secondary index, takes out the index block circulation searching until finding the route sequence number in the next stage index.
Further, the present invention also provides a kind of looking up route indexed in multiple stages device that utilizes above-mentioned method for searching route, is used for the IP network transmission equipment, and this device comprises:
Routing table is used for the routing table according to fixed capacity, chooses index progression and index step-length, determining minimum concordance list, and obtains at index block by destination address in this routing table and to be offset;
The multiple index module comprises flag bit piece and index block, is used for judging that by flag bit index value is the route sequence number or the step of secondary index, if judge it is that the route sequence number is then exported route, otherwise continues to search in the next stage index;
Wherein, adopt the multiplexing form of index between described multiple index, the flag bit corresponding with index in the described index block stored continuously with the form of flag bit piece, and described index block and described flag bit piece are stored respectively.
Compared with prior art, because adopted index structure flexibly, adopt multiplexing form of index and the flag bit method of storage continuously simultaneously, greatly reduced the technology of the memory consumption of concordance list, new Index Algorithm had both kept the search efficiency of multi-branched tires tree concordance list, greatly saved the memory consumption of concordance list again, for the routing table of equivalent, the new memory consumption of Index Algorithm under the poorest situation be original algorithm 50% or still less.
Description of drawings
Fig. 1 is the corresponding relation figure of index block and flag bit piece;
Fig. 2 is a looking up route indexed in multiple stages flow chart of the present invention;
Fig. 3 is an embodiment of the invention looking up route indexed in multiple stages schematic diagram;
Embodiment
Describing the present invention below in conjunction with drawings and Examples, with purpose, scheme and the effect of further understanding the present invention, but is not as the restriction to claims of the present invention.
Looking up route indexed in multiple stages method of the present invention is the multilayer multi-branched tire tree that a kind of form by the concordance list cascade is shone upon route, is made of multiple index, and is equal with the step-length of one-level index, but the index step-length between not at the same level does not require equal.The list item of multiple index table is called index entry, and the array of being made up of index entry is called index block, and each node of tire tree is an index block.
In the present invention, at first provided the computing formula of the minimum memory consumption of concordance list, made the routing table designer index sum of series concordance list size to be set flexibly according to routing list capacity; Next has adopted multiplexing form of index and the flag bit method of storage continuously, has greatly reduced the memory consumption of concordance list.Be implemented as follows:
Index sum of series index step-length can be set flexibly according to routing list capacity, only needs to guarantee that the step-length summation of index at different levels is IP address size (the total step-length as IPv4 routing index table is 32).So-called step-length is meant the figure place of the IP address that index can characterize.If index progression is n, the index step-length is x, and then the index block of this grade index has 2 x power entry index, and step-length is followed successively by x
1, x
2..., x
n, routing list capacity is M, then required index entry maximum number is:
Wherein, x
1+ x
2+ ... x
i+ x
n=32 (x
i＜32, i＜n＜32)
Under the certain prerequisite of routing list capacity, can calculate minimum concordance list by choosing suitable index progression and index step-length.Do not require that index step-lengths at different levels equate, but the at different levels index step-lengths of suggestion except that first order index are equal, can make data structure simple like this.The suggestion step-length is not less than 3.
In multiple index, except that first order index, all might there be a plurality of index blocks in every grade of index.An index block all has unique numbering in index at the corresponding levels.The index block number of each grade can not surpass the item number of routing table.Except that the afterbody index, each index block all has an index marker position piece corresponding with it.An index in the bit position manipulative indexing piece in the flag bit piece is used for distinguishing the implication that this index characterizes.That is to say that the pairing flag bit of all index entries is stored in the continuous memory headroom in the index block, is referred to as the flag bit piece.Each index entry is the sequence number of one 16 bit, be used for writing down the numbering of routing table sequence number or secondary index piece, because the sequence number of index entry is multiplexing, thus need by with the corresponding flag bit piece of index block in a bit flag bit distinguish the implication of index entry.Storing the routing table sequence number in the bit representation index entry of mark position, otherwise the numbering that the secondary index table is being stored in expression.The algorithm maximum that proposes among the present invention can be supported 65536 routes.
If flag bit is stored in index, because the problem by bytes store and byte-aligned of internal memory can cause flag bit in fact will take 2 bytes but not 1bit, so introduced the notion of flag bit piece, each flag bit is stored continuously, and promptly flag bit piece and index block are stored respectively.Fig. 1 is the corresponding relation figure of index block and flag bit piece, and with reference to figure 1, each bit of flag bit piece 100 is logically corresponding one by one with each of index block 200, in order to distinguish the content that index entry characterizes.Index block 200 has 8 entry indexs among Fig. 1, and corresponding flag bit piece 100 just has 8bits, i.e. a byte.Every entry index is corresponding with a sign bit position, if this bit is 0, represents that then the index implication is routing table sequence number (routing table is an array, and every route has unique number in routing table, be called the routing table sequence number); Otherwise, the numbering of expression secondary index piece in secondary index.If the item number of index block 200 surpasses 8, so corresponding flag bit piece 100 is a byte not only.In m/8 the byte of the flag bit of m entry index correspondence in flag bit piece 100.Owing to can adopt shift operation, so the cost of this division arithmetic is very little.
Wherein, the corresponding relation of index entry and flag bit can leave in the array in advance, like this in the time will obtaining the pairing flag bit of index entry, only needs the index entry subscript as array index, the mapping relations of taking out and flag bit is done with computing getting final product.
Route querying process of the present invention and original Index Algorithm are similar, mainly be by waiting to look into one section bits calculating skew in index block of address, judge whether and in the next stage concordance list, to search by flag bit, if do not need then illustrate that index is exactly the route sequence number, then finds out the next stage index block according to index if desired, in the next stage index, continue to search, so repeatedly, till finding route, with reference to figure 2, describe route querying flow process of the present invention in detail, it comprises:
Step S201, the step-length of supposing first order index is L1, preceding L1 the bit that takes out destination address is as subscript.
Step S202 as skew, obtains index value with subscript in index block, obtain the flag bit corresponding with index value in the flag bit piece.
Step S203, whether is the position zero in the judgement symbol position? as be zero execution in step S204, otherwise execution in step S205.
Step S204, flag bit are zero, and then index value is the route sequence number, export after the taking-up route in routing table.
Step S205, flag bit be position zero not, and then index value precedence level index number is taken out index block in secondary index.
Step S206, the step-length of supposing index at the corresponding levels is Lx, following Lx the bit that takes out destination address as subscript after circulation execution in step S202 till finding route.
Fig. 3 is the embodiment that the present invention uses, and as shown in Figure 3, has shown the route querying signal of three grades of concordance list structures among the figure, and step-length is followed successively by 16,8,8; Having a prefix addresses in the routing table is 0x01000000, and mask-length is 20 route.Because the route mask-length less than the summation 24 of preceding two-stage index step-length, needs two-stage index so express this route greater than the step-length 16 of first order index, so the third level index that do not draw among the figure.If search the pairing route of address 0x01020304, main flow process is as follows:
(1) because the step-length of first order index is 16, wait to look into the pairing preceding 16bits of address 0x01020304 so get, be about to the side-play amount of 0x0102 as first order index block, find index and corresponding flag bit thereof.
(2) flag bit is 1, and index entry is 26.Because flag bit is 1,, take out the concordance list of numbering 26 in the index of the second level so the numbering of secondary index table represented in index 26.
(3) because the step-length of second level index is 8, be 0x03 so intercepting waits to look into inferior 8bits of address 0x01020304, as the skew of second level index block, find the flag bit and the index entry of correspondence.
(4) flag bit is 0, and index entry is 29.Because corresponding flag bit is 0, so this index entry storage is the routing table sequence number, promptly the route of IP address 0x01020304 correspondence leaves the 29th of routing table, the so just route that finally finds route to search in.
The present invention also provides a kind of device for searching route of using above-mentioned method for searching route, be used for the IP network transmission equipment, as shown in Figure 3, this device comprises: routing table 300, be used for routing table according to fixed capacity, choose index progression and index step-length, determining minimum concordance list, and obtain at index block by destination address in this routing table and to be offset; Multiple index module 301 comprises flag bit piece 100 and index block 200, is used for judging that by flag bit index value is the route sequence number or the step of secondary index, if judge it is that the route sequence number is then exported route, otherwise continues to search in the next stage index; Wherein, adopt the multiplexing form of index between described multiple index, the flag bit corresponding with index in the described index block stored continuously with the form of flag bit piece, and described index block and described flag bit piece are stored respectively.
Though the present invention discloses as above with a preferred embodiment; right its is not in order to limit the present invention; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.
Claims (11)
1, a kind of looking up route indexed in multiple stages method is used for searching of IP network transmission equipment route, it is characterized in that: comprising:
According to the routing table of fixed capacity, choose index progression and index step-length, determining minimum concordance list, and obtain step in the index block skew by destination address in the routing table;
Judge that by flag bit index value is the route sequence number or the step of secondary index,, otherwise in the next stage index, continue to search if judge it is that the route sequence number is then exported route;
Wherein, adopt the multiplexing form of index between described multiple index, the flag bit corresponding with index in the described index block stored continuously with the form of flag bit piece, and described index block and described flag bit piece are stored respectively.
2, method for searching route according to claim 1 is characterized in that, the index entry maximum number of described concordance list is calculated by following formula and obtained:
Wherein, n is an index progression, and M is a routing list capacity, x
1, x
2X
iX
nBe followed successively by the 1st, 2 ... i ... the index step-length of n index level, and x
1+ x
2+ ... + x
i+ x
n=IP address size, x
i＜32, i＜n＜32.
3, method for searching route according to claim 1, it is characterized in that, the array that described index block is made up of index, in the described index progression, except that first order index, all there is at least one described index block in every grade of index, and described each index block all has unique numbering in index at the corresponding levels.
4, method for searching route according to claim 3, it is characterized in that, in the described index progression, index step-lengths at different levels except that first order index equate, the index block number of described every grade of index is less than the item number of described routing table, if described index step-length is x, then the described index block of this grade index has 2
xEntry index.
5, method for searching route according to claim 4, it is characterized in that, in the described index progression, except that the afterbody index, each index block all has an index marker position piece corresponding with it, an index entry in the corresponding described index block of a bit in the wherein said flag bit piece.
6, method for searching route according to claim 5, it is characterized in that, each described index entry accounts for 16 bits, and described index entry is used to write down the numbering of routing table sequence number or secondary index piece, by with the corresponding flag bit piece of described index block in a bit distinguish.
7, method for searching route according to claim 6 is characterized in that, is storing the routing table sequence number in the described index entry of mark position bit representation in the described flag bit piece, otherwise the numbering that the secondary index table is being stored in expression.
8, method for searching route according to claim 1 is characterized in that, multiplexing usefulness 1 bit of described index is represented.
9, method for searching route according to claim 1 is characterized in that, the described step of obtaining in the index block skew by destination address further comprises:
Step-length L1 according to first order index takes out preceding L1 bit of described destination address as following target step;
Described subscript is obtained the step of the flag bit of index value and correspondence thereof in described index block as skew.
10, method for searching route according to claim 1, it is characterized in that, describedly judge that by flag bit index value is that the route sequence number or the step of secondary index further comprise: judge that whether described flag bit is zero step, if zero, then described index value is the route sequence number, otherwise described index value is a secondary index, takes out the index block circulation searching until finding the route sequence number in the next stage index.
11, a kind of looking up route indexed in multiple stages device that utilizes any described method among the claim 1-10 is used for the IP network transmission equipment, and this device comprises:
Routing table is used for the routing table according to fixed capacity, chooses index progression and index step-length, determining minimum concordance list, and obtains at index block by destination address in this routing table and to be offset;
The multiple index module comprises flag bit piece and index block, is used for judging that by flag bit index value is the route sequence number or the step of secondary index, if judge it is that the route sequence number is then exported route, otherwise continues to search in the next stage index;
Wherein, adopt the multiplexing form of index between described multiple index, the flag bit corresponding with index in the described index block stored continuously with the form of flag bit piece, and described index block and described flag bit piece are stored respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101191307A CN101094179A (en) | 2007-07-16 | 2007-07-16 | Method and device for looking up route indexed in multiple stages |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101191307A CN101094179A (en) | 2007-07-16 | 2007-07-16 | Method and device for looking up route indexed in multiple stages |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101094179A true CN101094179A (en) | 2007-12-26 |
Family
ID=38992213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101191307A Pending CN101094179A (en) | 2007-07-16 | 2007-07-16 | Method and device for looking up route indexed in multiple stages |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101094179A (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009103225A1 (en) * | 2008-02-18 | 2009-08-27 | 华为技术有限公司 | A packet forwarding method and equipment |
| CN101692252A (en) * | 2009-08-31 | 2010-04-07 | 上海宝信软件股份有限公司 | Method for distributing and reclaiming idle blocks of file |
| CN101295323B (en) * | 2008-06-30 | 2011-11-02 | 腾讯科技（深圳）有限公司 | Processing method and system for index updating |
| CN101599910B (en) * | 2009-07-15 | 2012-01-04 | 杭州华三通信技术有限公司 | Method and device for sending messages |
| WO2016173241A1 (en) * | 2015-04-30 | 2016-11-03 | 深圳市中兴微电子技术有限公司 | Routing control method, apparatus and system, and storage medium |
| CN106302172A (en) * | 2015-05-18 | 2017-01-04 | 深圳市中兴微电子技术有限公司 | Support Hash lookup and the storage of route querying, lookup method and device simultaneously |
| CN108549061A (en) * | 2018-04-24 | 2018-09-18 | 扬州健行电子科技有限公司 | A kind of clustering method of signal |
| CN108718277A (en) * | 2018-04-11 | 2018-10-30 | 新华三技术有限公司 | Message forwarding method based on routing table and routing table maintenance method and relevant apparatus |
| CN109992701A (en) * | 2019-04-11 | 2019-07-09 | 苏州浪潮智能科技有限公司 | A kind of chained list implementation method, device, equipment and readable storage medium storing program for executing |
| CN110516432A (en) * | 2019-08-30 | 2019-11-29 | 招商华软信息有限公司 | A kind of determination method, apparatus, equipment and the storage medium of vehicle permission |
| CN112817966A (en) * | 2020-07-24 | 2021-05-18 | 腾讯科技（深圳）有限公司 | Data retrieval method, data retrieval device, electronic equipment and storage medium |
| CN114338528A (en) * | 2021-12-23 | 2022-04-12 | 锐捷网络股份有限公司 | Method and device for querying table items |
-
2007
- 2007-07-16 CN CNA2007101191307A patent/CN101094179A/en active Pending
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247337B (en) * | 2008-02-18 | 2012-11-21 | 华为技术有限公司 | Packet forwarding method and equipment |
| WO2009103225A1 (en) * | 2008-02-18 | 2009-08-27 | 华为技术有限公司 | A packet forwarding method and equipment |
| CN101295323B (en) * | 2008-06-30 | 2011-11-02 | 腾讯科技（深圳）有限公司 | Processing method and system for index updating |
| CN101599910B (en) * | 2009-07-15 | 2012-01-04 | 杭州华三通信技术有限公司 | Method and device for sending messages |
| CN101692252A (en) * | 2009-08-31 | 2010-04-07 | 上海宝信软件股份有限公司 | Method for distributing and reclaiming idle blocks of file |
| CN101692252B (en) * | 2009-08-31 | 2014-03-26 | 上海宝信软件股份有限公司 | Method for distributing and reclaiming idle blocks of file |
| WO2016173241A1 (en) * | 2015-04-30 | 2016-11-03 | 深圳市中兴微电子技术有限公司 | Routing control method, apparatus and system, and storage medium |
| CN106302172A (en) * | 2015-05-18 | 2017-01-04 | 深圳市中兴微电子技术有限公司 | Support Hash lookup and the storage of route querying, lookup method and device simultaneously |
| CN108718277B (en) * | 2018-04-11 | 2021-11-09 | 新华三技术有限公司 | Message forwarding method based on routing table, routing table maintenance method and related device |
| CN108718277A (en) * | 2018-04-11 | 2018-10-30 | 新华三技术有限公司 | Message forwarding method based on routing table and routing table maintenance method and relevant apparatus |
| CN108549061A (en) * | 2018-04-24 | 2018-09-18 | 扬州健行电子科技有限公司 | A kind of clustering method of signal |
| CN108549061B (en) * | 2018-04-24 | 2022-02-11 | 扬州健行电子科技有限公司 | Signal clustering method |
| CN109992701A (en) * | 2019-04-11 | 2019-07-09 | 苏州浪潮智能科技有限公司 | A kind of chained list implementation method, device, equipment and readable storage medium storing program for executing |
| CN110516432A (en) * | 2019-08-30 | 2019-11-29 | 招商华软信息有限公司 | A kind of determination method, apparatus, equipment and the storage medium of vehicle permission |
| CN112817966A (en) * | 2020-07-24 | 2021-05-18 | 腾讯科技（深圳）有限公司 | Data retrieval method, data retrieval device, electronic equipment and storage medium |
| CN112817966B (en) * | 2020-07-24 | 2023-10-13 | 腾讯科技（深圳）有限公司 | Data retrieval method, device, electronic equipment and storage medium |
| CN114338528A (en) * | 2021-12-23 | 2022-04-12 | 锐捷网络股份有限公司 | Method and device for querying table items |
| CN114338528B (en) * | 2021-12-23 | 2023-06-16 | 锐捷网络股份有限公司 | Method and device for inquiring table items |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101094179A (en) | Method and device for looking up route indexed in multiple stages | |
| CN102484610B (en) | Routing table construction method and device and routing table lookup method and device | |
| Jain | A comparison of hashing schemes for address lookup in computer networks | |
| EP2159708B1 (en) | Method for selecting hash function, method for storing and searching routing table and devices thereof | |
| CN101594319B (en) | Entry lookup method and entry lookup device | |
| US6922410B1 (en) | Organization of databases in network switches for packet-based data communications networks | |
| US20060083247A1 (en) | Prefix lookup using address-directed hash tables | |
| EP1485827A2 (en) | Efficient ipv4/ipv6 best matching prefix method and apparatus | |
| CN106549872A (en) | The spaceborne fast routing lookups system combined with accurately mate by longest prefix match | |
| CN1319325C (en) | Method of finding route table item using ltsh chain table | |
| CN101505279A (en) | Route searching method and apparatus | |
| CN106330716B (en) | IP route searching method and device | |
| CN103404092A (en) | Route prefix storage method and device and route address searching method and device | |
| CN100426791C (en) | Engine apparatus for route forwarding table address searching | |
| GB2350534A (en) | Packet-based network device with forwarding database having a trie search facility | |
| CN114884877B (en) | IPv6 route searching method combining hash table and HOT | |
| US6917954B2 (en) | Load balancing in IP address lookup | |
| CN100477644C (en) | Route storage method and apparatus | |
| US7564841B2 (en) | Apparatus and method for performing forwarding table searches using consecutive symbols tables | |
| Hsieh et al. | A classified multisuffix trie for IP lookup and update | |
| CN112818185A (en) | Method for searching longest prefix matching hardware system based on SRAM | |
| TWI239476B (en) | Address search | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| EP1025678A2 (en) | A lookup device and a method for classification and forwarding of packets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20071226 |