CN105827530A - IP binary searching method and apparatus with compatibility with IPV4/IPV6 - Google Patents
IP binary searching method and apparatus with compatibility with IPV4/IPV6 Download PDFInfo
- Publication number
- CN105827530A CN105827530A CN201610140469.4A CN201610140469A CN105827530A CN 105827530 A CN105827530 A CN 105827530A CN 201610140469 A CN201610140469 A CN 201610140469A CN 105827530 A CN105827530 A CN 105827530A
- Authority
- CN
- China
- Prior art keywords
- ipv6
- ipv4
- list item
- address
- lookup
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to an IP binary searching method and apparatus with compatibility with IPV4/IPV6. The method comprises: (1), a searching table structure is established for IP addresses of an IPV4 and an IPV6, wherein an IPV4 entry is formed by on basic unit corresponding to a 32-bit IP addresses of the IPV4 and an IPV6 entry is formed by four basic units corresponding to four 32-bit addresses of the IPV6 from a high order to a low order; and (2), on the basis of the searching table structure established at the step (1), IP comparison is carried out by using a 32-bit step length each time, and IP searching is carried out by using a binary searching method. According to the invention, an IP searching method with a simple entry structure is provided; only binary searching is needed; and compatibility with the IPV4 and the IPV6 is realized.
Description
Technical field
The invention belongs to networking technology area, be specifically related to the IP binary chop method and device of a kind of compatible IPV4/IPV6.
Background technology
It is the network equipment and the basic module in network software that IP searches, and it needs to realize longest prefix match LPM (LongestPrefixMatching).The difficult point of longest prefix match is not only to need to compare the bit value of address prefix, in addition it is also necessary to consider the length of address prefix.Use due to CIDR CIDR (ClasslessInter-DomainRouting) Yu IPV6 so that the complexity carrying out longest prefix match is greatly increased.
The IP lookup technology that presently, there are substantially can be divided into scheme based on common memory device and scheme based on specific store device.
Scheme based on common memory device, is to accelerate to search by the special data structure of design.The most the more commonly used has method based on trie tree and binary chop based on address prefix length.
Binary system trie tree utilizes each bit in address prefix to construct the branch of tree, is in the address space that the node of L layer represents that L bit is the most identical before address.For IPV6, binary system trie tree searches the degree of depth can increase at double.A kind of optimization method is multiple-limb trie tree, and it uses the multiple bit in address prefix to construct branch, by checking that multiple bits accelerate to search every time.It can be fixing for searching step width, it is also possible to be variable.The multiple-limb trie of variable step width realizes more complex, but can save certain memory space.For IPV6, owing to the range of choice of step width is relatively big, realizing of variable step width is increasingly complex.
Binary chop based on address prefix length, then be combined into one group by the list item of varying prefix length, carries out hash lookup, and prefix length carries out binary chop in group, makes a look up the guiding in path by adding marker list item simultaneously.The major defect of this class algorithm is that hash function is relatively time-consuming with the calculating of marker list item.
The representative of lookup scheme based on specific store device is TCAM (TernaryContentAddressingMemory), different from CAM, and TCAM can cross the mode of preservation key mask and make it can preserve the keyword list item of random length.This improvement overcomes the shortcoming that CAM is only capable of accurately mating, and is especially suitable for carrying out longest prefix matching.The weak point of TCAM is costly, and power consumption is bigger.And use TCAM to carry out the lookup of IPV6 address, need multistage TCAM to carry out cascading and just can complete especially.
Summary of the invention
Present invention aim at providing the IP lookup method of a kind of list item simple in construction, only need to carry out binary chop, and can compatible IPV4 and IPV6.
For achieving the above object, the technical solution used in the present invention is as follows:
A kind of IP binary chop method of compatible IPV4/IPV6, comprises the following steps:
1) being that look-up table configuration is set up in the IP address of IPV4 and IPV6, wherein the list item of IPV4 is made up of 1 elementary cell, the 32bitIP address of corresponding IPV4；The list item of IPV6 is made up of 4 grades of elementary cells, 4 32bit addresses of the big-endian of the most corresponding IPV6；
2) step 1 is utilized) look-up table configuration set up, carry out IP with the step-length of each 32bit and compare, carry out IP lookup by binary chop method.
Further, in described look-up table configuration, each elementary cell includes following functional domain:
IP:32bitIP address；
SL:5bit shift length, its value is SL=32-Target IP mask-length, and mask scope is [1:32], and SL scope is [31:0]；SL is for indicating the number of significant digit of current basic unit IP；
V:1bit effective marker, is 1 for IPV4；For IPV6, calculate according to mask-length；Effective marker position V is for indicating for IPV6, and current basic unit is the most effective；
HE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the upper bound being the same from list item when the prefix of prime；
LE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the lower bound being the same from list item when the prefix of prime；
FUNC: function field, user configures according to concrete function, output after the match is successful.
Further, described look-up table configuration is used to carry out the method for IP lookup as follows:
1) bound of binary chop is initialized；
2) when the lower bound of binary chop is more than the upper bound, lookup terminates, and otherwise calculates binary chop address and compares the IP list item when prime and IP to be checked；
If it does, and effective marker V effective, then compare end, hit current entry IP；
If it does, and effective marker V invalid, then compare end if afterbody, miss；Otherwise entering next stage to compare, update the upper bound is HE simultaneously, and lower bound is LE；
If do not mated, and effective marker V is effective, then compare end, miss any IP；
Do not mate as crossed, and effective marker V is invalid, the most still carries out binary chop in this level.
A kind of IP binary chop device of compatible IPV4/IPV6, including look-up table configuration unit and binary chop unit, described look-up table configuration unit sets up look-up table configuration for the IP address for IPV4 and IPV6, and wherein the list item of IPV4 is made up of 1 elementary cell, the 32bitIP address of corresponding IPV4；The list item of IPV6 is made up of 4 grades of elementary cells, 4 32bit addresses of the big-endian of the most corresponding IPV6；Described binary chop unit utilizes the look-up table configuration set up, and carries out IP with the step-length of each 32bit and compares, carries out IP lookup by binary chop method.
Compared with prior art, beneficial effects of the present invention is as follows:
1) list item simple in construction, only need to split and sort, it is not necessary to carrying out the calculating of HASH function；
2) the list item structure that the IP of IPV4/IPV6 searches is identical, searches with fixing 32bit as step-length, carries out IP with the step-length of each 32bit and compare, IPV4 Yu IPV6 can use identical lookup logic, such that it is able to share memory space；
3) can cross and precalculate HE, LE so that the most only need to carry out the comparison of 32bitIP, but IPV6 remains to there is identical lookup speed with IPV4.
Accompanying drawing explanation
Fig. 1 is the elementary cell schematic diagram of IP look-up table configuration.
Fig. 2 is 4 grades of elementary cell schematic diagrams of IPV6 list item.
Fig. 3 is the flow chart that application look-up table configuration carries out binary chop.
Fig. 4 is that in embodiment, IPV4 Yu IPV6 shares a lookup state machine and the schematic diagram of 4 road parallel queries.
Detailed description of the invention
Understandable for enabling the above-mentioned purpose of the present invention, feature and advantage to become apparent from, below by specific embodiments and the drawings, the present invention will be further described.
The present invention realizes the elementary cell of the list item structure that IP searches as shown in Figure 1.IPV4 list item is made up of 1 elementary cell, and IPV6 list item is made up of 4 grades of elementary cells, as in figure 2 it is shown, 4 32bit addresses of the big-endian of the most corresponding IPV6.Look-up table is deposited by the nonoverlapping list item in a plurality of IP address order and is formed, IPV4 with IPV6 can not mix placement.
Each functional domain in Fig. 1, Fig. 2 is described as follows:
IP:32bitIP address, the address for IPV6,128bit is left in 4 grades of elementary cells.
SL:5bit shift length, its value is SL=32-Target IP mask-length, mask scope [1:32], SL scope [31:0].SL is for indicating the number of significant digit of current basic unit IP.
V:1bit effective marker.It is 1 for IPV4；For IPV6, calculate according to mask-length.Effective marker position V is for indicating for IPV6, and current basic unit is the most effective.
HE: for IPV4, for reserved field, it is necessary to be configured to 0；
For IPV6, labelling and current entry from 0 grade to the upper bound being the same from list item when the prefix of prime.
LE: for IPV4, for reserved field, it is necessary to be configured to 0；
For IPV6, labelling and current entry from 0 grade to the lower bound being the same from list item when the prefix of prime.
FUNC: function field, user configures according to concrete function, output after the match is successful.
The calculating process of list item is:
1) IP is ranked up after mask XOR, if target configuration exists IP section and overlaps situation, then cannot be carried out sequence, the part that IP section is bigger need to be split.
2) SL and the V field of each elementary cell is calculated.
For IPv6 mask-length M=p*32+q, wherein 0≤p≤3；1≤q≤32；1≤M≤128.
Wherein n is the progression of elementary cell of list item structure.
3) for IPV6, according to Structure Calculation HE after sequence and LE field.
Above-mentioned list item structure is used to carry out the process of IP lookup as it is shown on figure 3, comprise the steps:
1) binary chop bound is initialized.
2) when binary chop lower bound is more than the upper bound, lookup terminates, and otherwise calculates binary chop address and compares the IP list item when prime and IP to be checked.
If it does, and effective marker V effective, then compare end, hit current entry IP；
If it does, and effective marker V invalid, then compare end if afterbody, miss；Otherwise entering next stage to compare, update the upper bound is HE simultaneously, and lower bound is LE；
If do not mated, and effective marker V is effective, then compare end, miss any IP；
Do not mate as crossed, and effective marker V is invalid, the most still carries out binary chop in this level.
The key point of the present invention includes following aspects:
1) carrying out IP with the step-length of each 32bit to compare, enabling IPV4 Yu IPV6 has identical list item structure, uses identical lookup logic, such that it is able to share memory space.
2) can cross and precalculate HE, LE so that the most only need to carry out the comparison of 32bitIP, but IPV6 remains to there is identical lookup speed with IPV4.
3) by address prefix is split so that there is not inclusion relation between each prefix.
Provide below a specific embodiment.The present embodiment is to realize IP in FPGA (Field-ProgrammableGateArray, field programmable gate array) to search, and structure is as shown in Figure 4.
IPV4 Yu IPV6 list item shares one piece of BRAM (Blockrandomaccessmemory, block random access memory), and IPV4 list item is positioned over low address, and IPV6 is positioned over high address, and 4 grades of list items of IPV6 are deposited continuously.The space size of IPV4 Yu IPV6 can be distributed the most dynamically.
IPV4 Yu IPV6 shares same lookup state machine, carries out flowing water lookup by 4 road parallel queries.Query script is:
1) parameter initialization is carried out according to query type
Binary chop bound: for IPV4, upper bound up_bound=ipv4_bd, lower bound low_bound=0；For IPV6, up_bound=n/4, low_bound=ipv6_bd/4.Wherein, ipv4_bd and ipv6_bd represents ipv4 Yu ipv6 list item stored boundary in BRAM respectively, as shown in Figure 4.
Current lookup level: level=0.
Total progression: for IPV4, total_level=1；For IPV6, total_level=4.
2) as binary chop low_bound > up_bound, lookup terminates, otherwise calculate lookup address ckaddr=((up_bound+low_bound)/2) the * total_level+level when prime, and compare the IP list item when prime and IP to be checked:
A) if it does, and effective marker V effective, then compare end, hit current entry IP；
B) if it does, and effective marker V invalid, then compare end, miss any IP if afterbody；Otherwise enter next stage to compare, up_bound=HE, low_bound=LE, level=level+1；
If c) do not mated, and effective marker V is effective, then compare end, miss any IP；
D) not mating as crossed, and effective marker V is invalid, the most still proceeds binary chop in this level:
When list item IP is less than IP to be checked, up_bound=(up_bound+low_bound)/2；
When list item IP is more than IP to be checked, low_bound=(up_bound+low_bound)/2；
The functions such as lookup sends the value in FUNC territory to judging module when mating, it is possible to achieve black and white lists, speed limit.
The present embodiment uses the BRAM within FPGA, and this module is on 200M system clock, so that it may realizes the 10G linear speed to up to ten thousand IP sections and searches.
Above example is only limited in order to technical scheme to be described; technical scheme can be modified or equivalent by those of ordinary skill in the art; without departing from the spirit and scope of the present invention, protection scope of the present invention should be as the criterion with described in claims.
Claims (10)
1. the IP binary chop method of a compatible IPV4/IPV6, it is characterised in that comprise the following steps:
1) being that look-up table configuration is set up in the IP address of IPV4 and IPV6, wherein the list item of IPV4 is made up of 1 elementary cell, the 32bitIP address of corresponding IPV4；The list item of IPV6 is made up of 4 grades of elementary cells, 4 32bit addresses of the big-endian of the most corresponding IPV6；
2) step 1 is utilized) look-up table configuration set up, carry out IP with the step-length of each 32bit and compare, carry out IP lookup by binary chop method.
2. the method for claim 1, it is characterised in that in described look-up table configuration, each elementary cell includes following functional domain:
IP:32bitIP address；
SL:5bit shift length, its value is SL=32-Target IP mask-length, and mask scope is [1:32], and SL scope is [31:0]；SL is for indicating the number of significant digit of current basic unit IP；
V:1bit effective marker, is 1 for IPV4；For IPV6, calculate according to mask-length；Effective marker position V is for indicating for IPV6, and current basic unit is the most effective；
HE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the upper bound being the same from list item when the prefix of prime；
LE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the lower bound being the same from list item when the prefix of prime；
FUNC: function field, user configures according to concrete function, output after the match is successful.
3. method as claimed in claim 2, it is characterised in that in described look-up table configuration, the calculating process of list item is as follows:
A) IP is ranked up after mask XOR；If target configuration exists IP section and overlaps situation, then cannot be carried out sequence, the part that IP section is bigger need to be split；
B) SL and the V field of each elementary cell is calculated；For IPv6 mask-length M=p*32+q, wherein 0≤p≤3,1≤q≤32,1≤M≤128, the computational methods of SL and V field are as follows, and wherein n is the progression of elementary cell:
C) for IPV6, according to Structure Calculation HE after sequence and LE field.
4. as claimed in claim 2 or claim 3 method, it is characterised in that use described look-up table configuration to carry out the method for IP lookup as follows:
1) bound of binary chop is initialized；
2) when the lower bound of binary chop is more than the upper bound, lookup terminates, and otherwise calculates binary chop address and compares the IP list item when prime and IP to be checked；
If it does, and effective marker V effective, then compare end, hit current entry IP；
If it does, and effective marker V invalid, then compare end if afterbody, miss；Otherwise entering next stage to compare, update the upper bound is HE simultaneously, and lower bound is LE；
If do not mated, and effective marker V is effective, then compare end, miss any IP；
Do not mate as crossed, and effective marker V is invalid, the most still carries out binary chop in this level.
5. the method for claim 1, it is characterized in that, in FPGA, realize IP search, IPV4 Yu IPV6 list item shares one piece of bram memory, IPV4 list item is positioned over low address, IPV6 is positioned over high address, and 4 grades of list items of IPV6 are deposited continuously, distributes the space size of IPV4 Yu IPV6 the most dynamically.
6. method as claimed in claim 5, it is characterised in that IPV4 Yu IPV6 shares a lookup state machine, carries out flowing water lookup by 4 road parallel queries.
7. the IP binary chop device of a compatible IPV4/IPV6, it is characterized in that, including look-up table configuration unit and binary chop unit, described look-up table configuration unit sets up look-up table configuration for the IP address for IPV4 and IPV6, wherein the list item of IPV4 is made up of 1 elementary cell, the 32bitIP address of corresponding IPV4；The list item of IPV6 is made up of 4 grades of elementary cells, 4 32bit addresses of the big-endian of the most corresponding IPV6；Described binary chop unit utilizes the look-up table configuration set up, and carries out IP with the step-length of each 32bit and compares, carries out IP lookup by binary chop method.
8. device as claimed in claim 7, it is characterised in that in described look-up table configuration, each elementary cell includes following functional domain:
IP:32bitIP address；
SL:5bit shift length, its value is SL=32-Target IP mask-length, and mask scope is [1:32], and SL scope is [31:0]；SL is for indicating the number of significant digit of current basic unit IP；
V:1bit effective marker, is 1 for IPV4；For IPV6, calculate according to mask-length；Effective marker position V is for indicating for IPV6, and current basic unit is the most effective；
HE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the upper bound being the same from list item when the prefix of prime；
LE: for IPV4, for reserved field, it is necessary to be configured to 0；For IPV6, labelling and current entry from 0 grade to the lower bound being the same from list item when the prefix of prime；
FUNC: function field, user configures according to concrete function, output after the match is successful.
9. device as claimed in claim 7 or 8, it is characterized in that, use FPGA to realize IP to search, IPV4 Yu IPV6 list item shares one piece of bram memory, IPV4 list item is positioned over low address, IPV6 is positioned over high address, and 4 grades of list items of IPV6 are deposited continuously, distributes the space size of IPV4 Yu IPV6 the most dynamically.
10. device as claimed in claim 9, it is characterised in that IPV4 Yu IPV6 shares a lookup state machine, carries out flowing water lookup by 4 road parallel queries.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140469.4A CN105827530B (en) | 2016-03-11 | 2016-03-11 | A kind of IP binary chop method and device of compatible IPV4/IPV6 |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610140469.4A CN105827530B (en) | 2016-03-11 | 2016-03-11 | A kind of IP binary chop method and device of compatible IPV4/IPV6 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105827530A true CN105827530A (en) | 2016-08-03 |
| CN105827530B CN105827530B (en) | 2019-04-16 |
Family
ID=56987647
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610140469.4A Active CN105827530B (en) | 2016-03-11 | 2016-03-11 | A kind of IP binary chop method and device of compatible IPV4/IPV6 |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105827530B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107547407A (en) * | 2017-09-15 | 2018-01-05 | 新华三技术有限公司 | Message transmitting method, device and realization device |
| CN110012124A (en) * | 2019-03-29 | 2019-07-12 | 新华三信息安全技术有限公司 | The method and device that a kind of pair of network address range section is split |
| CN110769079A (en) * | 2019-10-30 | 2020-02-07 | 杭州迪普科技股份有限公司 | Method and device for retrieving geographic position corresponding to IP |
| CN111131049A (en) * | 2019-12-31 | 2020-05-08 | 盛科网络（苏州）有限公司 | Method and device for processing routing table entry |
| CN111935021A (en) * | 2020-09-27 | 2020-11-13 | 翱捷智能科技(上海)有限公司 | Method and system for quickly matching network data packets |
| CN113343034A (en) * | 2021-06-08 | 2021-09-03 | 湖南大学 | IP searching method, system and storage medium |
| CN114615195A (en) * | 2022-02-25 | 2022-06-10 | 阳光凯讯(北京)科技有限公司 | Ethernet five-tuple fast matching and searching method and device for FPGA |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1964311A (en) * | 2005-11-10 | 2007-05-16 | 中国科学院计算技术研究所 | A method to quickly search and update IPv6 routing list |
| US20080056262A1 (en) * | 2006-09-01 | 2008-03-06 | Dheeraj Singh | Approach for fast ip address lookups |
| CN103297554A (en) * | 2012-03-02 | 2013-09-11 | 中兴通讯股份有限公司 | Method and device for compatibility processing of IPv4 and IPv6 |
-
2016
- 2016-03-11 CN CN201610140469.4A patent/CN105827530B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1964311A (en) * | 2005-11-10 | 2007-05-16 | 中国科学院计算技术研究所 | A method to quickly search and update IPv6 routing list |
| US20080056262A1 (en) * | 2006-09-01 | 2008-03-06 | Dheeraj Singh | Approach for fast ip address lookups |
| CN103297554A (en) * | 2012-03-02 | 2013-09-11 | 中兴通讯股份有限公司 | Method and device for compatibility processing of IPv4 and IPv6 |
Non-Patent Citations (2)
| Title |
|---|
| 王振兴等: "《基于二分搜索Trie的IPv4/IPv6路由快速查找算法》", 《计算机工程》 * |
| 雷升平: "《基于分割多分枝Trie树的并行路由查找算法》", 《光通信研究》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107547407A (en) * | 2017-09-15 | 2018-01-05 | 新华三技术有限公司 | Message transmitting method, device and realization device |
| CN107547407B (en) * | 2017-09-15 | 2021-03-09 | 新华三技术有限公司 | Message transmission method, device and implementation device |
| CN110012124A (en) * | 2019-03-29 | 2019-07-12 | 新华三信息安全技术有限公司 | The method and device that a kind of pair of network address range section is split |
| CN110012124B (en) * | 2019-03-29 | 2021-10-29 | 新华三信息安全技术有限公司 | Method and device for splitting network address range segment |
| CN110769079A (en) * | 2019-10-30 | 2020-02-07 | 杭州迪普科技股份有限公司 | Method and device for retrieving geographic position corresponding to IP |
| CN111131049A (en) * | 2019-12-31 | 2020-05-08 | 盛科网络（苏州）有限公司 | Method and device for processing routing table entry |
| CN111131049B (en) * | 2019-12-31 | 2021-08-27 | 苏州盛科通信股份有限公司 | Method and device for processing routing table entry |
| CN111935021A (en) * | 2020-09-27 | 2020-11-13 | 翱捷智能科技(上海)有限公司 | Method and system for quickly matching network data packets |
| CN111935021B (en) * | 2020-09-27 | 2020-12-25 | 翱捷智能科技(上海)有限公司 | Method and system for quickly matching network data packets |
| CN113343034A (en) * | 2021-06-08 | 2021-09-03 | 湖南大学 | IP searching method, system and storage medium |
| CN114615195A (en) * | 2022-02-25 | 2022-06-10 | 阳光凯讯(北京)科技有限公司 | Ethernet five-tuple fast matching and searching method and device for FPGA |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105827530B (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105827530A (en) | IP binary searching method and apparatus with compatibility with IPV4/IPV6 | |
| CN102945249B (en) | A kind of policing rule matching inquiry tree generation method, matching process and device | |
| CN105635343A (en) | IP address list storage and query method applied to DNS query | |
| CN105141525B (en) | IPv6 method for searching route and device | |
| CN102045412B (en) | Method and equipment for carrying out compressed storage on internet protocol version (IPv)6 address prefix | |
| CN112425131B (en) | ACL rule classification method, ACL rule search method and ACL rule classification device | |
| CN103107945B (en) | A kind of system and method for fast finding IPV6 route | |
| CN101848248B (en) | Rule searching method and device | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| Yang et al. | Constant IP lookup with FIB explosion | |
| CN105119834A (en) | Source address and destination address combined searching method based on composite trie tree structure | |
| Pao et al. | A multi-pipeline architecture for high-speed packet classification | |
| CN104253754A (en) | ACL (access control list) fast matching method and equipment | |
| Pandey et al. | A comparison and selection on basic type of searching algorithm in data structure | |
| CN104580202A (en) | Message matching method and device | |
| Pao et al. | IP address lookup using bit-shuffled trie | |
| CN106469218A (en) | A kind of Boolean expression storage based on bitmap, matching process and system | |
| CN106020724A (en) | Neighbor storage method based on data mapping algorithm | |
| CN102243657A (en) | Expandable Bloom Filter method | |
| CN113726660B (en) | Route finder and method based on perfect hash algorithm | |
| Byun et al. | Vectored-bloom filter implemented on FPGA for IP address lookup | |
| Thinh et al. | Massively parallel cuckoo pattern matching applied for NIDS/NIPS | |
| Behdadfar et al. | Scalar prefix search: A new route lookup algorithm for next generation internet | |
| Sarbishei et al. | Scalable memory-less architecture for string matching with FPGAs | |
| CN112769703A (en) | Efficient TCAM implementation method based on SRAM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |