CN106656816A - Distributed ipv6 routing lookup method and distributed ipv6 routing lookup system - Google Patents
Distributed ipv6 routing lookup method and distributed ipv6 routing lookup system Download PDFInfo
- Publication number
- CN106656816A CN106656816A CN201610829157.4A CN201610829157A CN106656816A CN 106656816 A CN106656816 A CN 106656816A CN 201610829157 A CN201610829157 A CN 201610829157A CN 106656816 A CN106656816 A CN 106656816A
- Authority
- CN
- China
- Prior art keywords
- matching
- route
- route entry
- prefix length
- message
- 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
- H04L45/7453—Address table lookup; Address filtering using hashing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a distributed ipv6 routing lookup method and a distributed ipv6 routing lookup system. The method comprises the following steps: building a 32-bit prefix and 48-bit prefix multi-branch Tire tree; dividing all routing items except 32-bit prefix and 48-bit prefix routing items according to prefix length, and building a hash table; when a routing item is added, judging whether the prefix length of the routing item is 32 or 48 bits, adding the routing item to a corresponding position in the multi-branch Tire tree if the prefix length of the routing item is 32 or 48 bits, and adding the routing item to the hash table if the prefix length of the routing item is neither 32 nor 48 bits; and when a message is forwarded, forwarding the message according to the matching results of the message in the multi-branch Tire tree and in the hash table. The advantages are as follows: under the condition that 32-bit prefix and 48-bit prefix routings account for a large proportion, the lookup speed is increased greatly using the multi-branch Tire tree; and for routings of other prefix lengths which have a large length range and account for a small proportion, the lookup speed can be increased greatly through a lookup algorithm based on prefix length.
Description
Technical field
The present invention relates to interconnection path is by route technology field, and in particular to a kind of distributed ipv6 method for searching route and
System.
Background technology
Few for front 16 bit class in prior art and many with 0x2001 beginnings, by multi-level, the multistage progressively solves
The certainly excessive problem of ipv6 memory spaces.For example in TSB, binary tree, segment table and route barrel technology are combined, proposed a kind of
Multistage ipv6 Routing table lookup algorithm.But due to developing rapidly for ipv6, item number exponentially is route in existing backbone network and is increased,
It is extensive that front 16 bit distribution becomes so that not only only have 0x2001 to need segment table, the rapid growth of item number amount is route in backbone network
Also prevent route barrel technology is from being suitable for, and ipv6 storage scheme space requirements are excessive, search overlong time.
The content of the invention
It is contemplated that at least solving one of above-mentioned technical problem.
For this purpose, it is an object of the present invention to propose a kind of distributed ipv6 method for searching route, it is existing to solve
Ipv6 storage scheme space requirements are excessive, search the problem of overlong time.
To achieve these goals, embodiment of the invention discloses that a kind of distributed ipv6 method for searching route, including
Following steps：S110：Build the Multi-branch Trie Tree that prefix length is 32 and prefix length is 48；S120：By router
In all prefix lengths except 32 route entries with 48 are with prefix length division, and set up Hash table；S130：When addition road
During by item, judge it is described addition route entry prefix length whether as 32 or 48, if so, then by it is described addition route entry be added to
Correspondence position in the Multi-branch Trie Tree, if it is not, being then added in the Hash table；S140：When E-Packeting, root
According to the message, respectively matching result E-Packets in the Multi-branch Trie Tree and the Hash table.
Distributed ipv6 method for searching route according to embodiments of the present invention, by the route that prefix length is 32 and 48
What is accounted for is total larger, therefore uses Multi-branch Trie Tree, greatly improves lookup speed；The route length of other prefix lengths point
Cloth is wide, but sum is less, is realized searching with the algorithm based on prefix length, can be greatly enhanced lookup speed.
In addition, distributed ipv6 method for searching route according to the above embodiment of the present invention, can also have following additional
Technical characteristic：
Further, step S140 is further included：S141：When E-Packeting, from the Multi-branch Trie Tree
The route entry of matching is searched whether, if matching, record first matches the prefix length of route entry and the first matching route entry；
If the route entry not matched, into step S142；S142：Make a look up in the Hash table, if matching, record the
The prefix length of two matching route entries and the second matching route entry；S143：If the message in the Multi-branch Trie Tree and
Without occurrence in the Hash table, then lose and the message；If there is the first matching route entry or institute in the message
The second matching route entry is stated, then the message is forwarded with the described first matching route entry or the second matching route entry；If
There is the first matching route entry and the second matching route entry in the message, then when the prefix of the first matching route entry is long
When degree matches the prefix length of route entry more than second, the message is forwarded with the described first matching route entry；Then when first
It is described with the described second matching route entry forwarding when prefix length with route entry matches the prefix length of route entry less than second
Message.
Further, occurrence is searched from the Hash table using binary chop.
Further, in step S142, the prefix length that route entry is searched in the Hash table is 16 to 64.
For this purpose, it is an object of the present invention to propose that a kind of distributed ipv6 route looks into system, to solve existing ipv6
Storage scheme space requirement is excessive, searches the problem of overlong time.
To achieve these goals, embodiment of the invention discloses that a kind of distributed ipv6 routes look into system, including：Road
Module is built by forward table, it is 48 with prefix length that the route forwarding table build module to be used to build prefix length for 32
Multi-branch Trie Tree, the route forwarding table builds module and is additionally operable to all prefix lengths in router except 32 and 48
The route entry of position sets up Hash table with prefix length division, and the route forwarding table builds module and is additionally operable to when addition route
Xiang Shi, judge it is described addition route entry prefix length whether as 32 or 48, if so, then by it is described addition route entry be added to institute
The correspondence position in Multi-branch Trie Tree is stated, if it is not, being then added in the Hash table；Route forwarding table enquiry module, institute
Route forwarding table enquiry module is stated for respectively from matching result in the Multi-branch Trie Tree and the Hash table；Message is forwarded
Module, E-Packets for basis from matching result in the Multi-branch Trie Tree and the Hash table.
Distributed ipv6 routes according to embodiments of the present invention look into system, and the route that prefix length is 32 and 48 is accounted for
It is total larger, therefore use Multi-branch Trie Tree, greatly improve lookup speed；The route distribution of lengths of other prefix lengths
Extensively, it is but total less, realized searching with the algorithm based on prefix length, lookup speed can be greatly enhanced.
In addition, distributed ipv6 routes according to the above embodiment of the present invention look into system, can also have what is added as follows
Technical characteristic：
Further, the route forwarding table enquiry module is further used for：When E-Packeting, from the multiple-limb
Trie trees search whether the route entry of matching, if matching, record first is matched before route entry and the first matching route entry
Sew length, without occurrence such as in the Multi-branch Trie Tree, then make a look up in the Hash table, if matching, remembers
Record second matches the prefix length of route entry and the second matching route entry；The packet forwarding module is further used for：If institute
Message is stated in the Multi-branch Trie Tree and the Hash table without occurrence, is then lost and the message；If the message
There is the first matching route entry or the second matching route entry, then with the described first matching route entry or described second
The message is forwarded with route entry；If there is the first matching route entry and the second matching route entry in the message,
Then when the prefix length of the first matching route entry matches the prefix length of route entry more than second, it is route with the described first matching
The item forwarding message；Then when the prefix length of the first matching route entry matches the prefix length of route entry less than second, with
The second matching route entry forwards the message.
Further, the route forwarding table enquiry module searches matching using binary chop from the Hash table
.
Further, the prefix length that route entry is searched in the Hash table is 16 to 64.
The additional aspect and advantage of the present invention will be set forth in part in the description, and partly will become from the following description
Obtain substantially, or recognized by the practice of the present invention.
Description of the drawings
The above-mentioned and/or additional aspect and advantage of the present invention will become from the description with reference to accompanying drawings below to embodiment
It is substantially and easy to understand, wherein：
Fig. 1 is the flow chart of the distributed ipv6 method for searching route of one embodiment of the invention；
Fig. 2 is the structured flowchart of the distributed ipv6 route queryings system of one embodiment of the invention.
Specific embodiment
Embodiments of the invention are described below in detail, the example of the embodiment is shown in the drawings, wherein from start to finish
Same or similar label represents same or similar element or the element with same or like function.Below with reference to attached
The embodiment of figure description is exemplary, is only used for explaining the present invention, and is not considered as limiting the invention.
In describing the invention, it is to be understood that term " first ", " second " are only used for describing purpose, and can not
It is interpreted as indicating or implying relative importance.
With reference to explained below and accompanying drawing, it will be clear that these and other aspects of embodiments of the invention.In these descriptions
In accompanying drawing, specifically disclose some particular implementations in embodiments of the invention to represent the enforcement for implementing the present invention
Some modes of the principle of example, but it is to be understood that the scope of embodiments of the invention is not limited.Conversely, the present invention
Embodiment includes all changes, modification and the equivalent fallen into the range of the spirit and intension of attached claims.
Below in conjunction with the Description of Drawings present invention.
Fig. 1 is the flow chart of the distributed ipv6 method for searching route of one embodiment of the invention.As shown in figure 1, a kind of
Distributed ipv6 method for searching route, comprises the following steps：
S110：Build the Multi-branch Trie Tree that prefix length is 32 and prefix length is 48.
Specifically, the route entry for making 32 and 48 in router is X1.Construction Multi-branch Trie Tree, Multi-branch Trie Tree
Middle ground floor is the route entry that prefix length is 16, and the second layer is the route entry that prefix length is 32, and third layer is prefix
Length is the route entry of 48.16 bits of each layer of lookup.By X1In route entry be added in Trie trees.Make Trie trees
In except last layer node be X2, for X2In each node set up a size for 216Array, the array uses
In record child node information.The corresponding 16 number of bits values of child node will be searched, and recorded corresponding position in array.
S120：By all prefix lengths in router except 32 route entries with 48 are with prefix length division, and build
Vertical Hash table.
Specifically, in an example of the present invention, Hash (40) represents all route entries that prefix length is 40
Hash tables.The prefix length that i ＆ lt is searched is designated as into Si, marker bit is added (if S based on binary chopi<Si-1, then contrast in Si
～Si-1In prefix item, if having the route entry more matched than the node, in node addition marker bit if having.If Si>
Si-1, then contrast in Si～2Si-Si-1In prefix item, if having the route entry more matched than the node, in the section if having
Point addition marker bit), make it possible to carry out binary chop.
S130：When route entry is added, judge that the prefix length for adding route entry, whether as 32 or 48, if so, then will add
Plus route entry is added to the correspondence position in Multi-branch Trie Tree, if it is not, be then added in Hash table, and according to step S120
Add corresponding marker bit..
S140：When E-Packeting, according to message, respectively matching result forwarding is reported in Multi-branch Trie Tree and Hash table
Text.
In one embodiment of the invention, occurrence is searched from Hash table using binary chop, can be greatly carried
Height searches speed.
In one embodiment of the invention, step S140 is further included：
S141：When E-Packeting, the route entry of matching is searched whether from Multi-branch Trie Tree, if matching, records
The prefix length of the first matching route entry and the first matching route entry；If the route entry not matched, into step S142.
Specifically, the message of order forwarding is S.Search whether the route entry with S matchings in Trie trees first.If no
The route entry of matching, then directly carry out next step binary chop.If matching, records the route entry of matching, A is designated as, before A
Sew length for i.
S142：Make a look up in Hash table, if matching, record second matches route entry and second and matches route entry
Prefix length.
Specifically, binary chop is carried out in Hash table.If matching, records the route entry of matching, B is designated as, before B
Sew length for j.
S143：If message, without occurrence, is lost and message in Multi-branch Trie Tree and Hash table；
If message has first matches route entry or the second matching route entry, with the first matching route entry or second
E-Packet with route entry；
If message exist first match route entry and second matching route entry, when first matching route entry prefix it is long
When degree matches the prefix length of route entry more than second, E-Packeted with the first matching route entry；Then when first matches route entry
Prefix length less than second matching route entry prefix length when, with second matching route entry E-Packet.
Specifically, if in Trie trees with Hash tables in all without occurrence, dropping packets.If in Trie trees with Hash tables in
Have and only one matching, then E-Packeted with this route entry.If in Trie trees with have the route entry that matches in Hash tables,
Compare the prefix length of route entry.If i>J, E-Packets by occurrence of A.If i<J, E-Packets by occurrence of B.
In one embodiment of the invention, the prefix length that route entry is searched in Hash table is 16 to 64.
The distributed ipv6 method for searching route of the embodiment of the present invention, the route that prefix length is 32 and 48 is accounted for
Sum is larger, therefore uses Multi-branch Trie Tree, greatly improves lookup speed；The route distribution of lengths of other prefix lengths
Extensively, it is but total less, realized searching with the algorithm based on prefix length, lookup speed can be greatly enhanced.
Fig. 2 is the structured flowchart of the distributed ipv6 route queryings system of one embodiment of the invention.As shown in Fig. 2 one
Distributed ipv6 route queryings system is planted, including route forwarding table builds module 210, route forwarding table enquiry module 220 and report
Literary forwarding module 230.
Wherein, route forwarding table builds module 210 is used to building that prefix length to be 32 and prefix length is 48 many
Branch Trie trees.Route forwarding table build module 210 be additionally operable to by all prefix lengths in router except 32 with 48
Route entry sets up Hash table with prefix length division.Route forwarding table builds module 210 and is additionally operable to when route entry is added,
Whether the prefix length for adding route entry is judged as 32 or 48, if so, will then add route entry and be added in Multi-branch Trie Tree
Correspondence position, if it is not, being then added in Hash table
Route forwarding table enquiry module 220 is used for respectively from matching result in Multi-branch Trie Tree and Hash table.
Packet forwarding module 230 is used for basis and E-Packets from matching result in Multi-branch Trie Tree and Hash table.
In one embodiment of the invention, route forwarding table enquiry module 220 is further used for：When E-Packeting,
The route entry of matching is searched whether from Multi-branch Trie Tree, if matching, record first matches route entry and the first matching road
By the prefix length of item, without occurrence such as in Multi-branch Trie Tree, then make a look up in Hash table, if matching, remembers
Record second matches the prefix length of route entry and the second matching route entry.
Packet forwarding module 230 is further used for：If message in Multi-branch Trie Tree and Hash table without occurrence,
Then lose and message；If message has first matches route entry or the second matching route entry, with the first matching route entry or the
Two matching route entries E-Packet；If message has first matches route entry and the second matching route entry, when the first matching
When the prefix length of route entry matches the prefix length of route entry more than second, E-Packeted with the first matching route entry；Then when
When the prefix length of the first matching route entry matches the prefix length of route entry less than second, with the second matching route entry forwarding report
Text.
In one embodiment of the invention, route forwarding table enquiry module 220 uses binary chop from Hash table
Search occurrence.
In one embodiment of the invention, the prefix length that route entry is searched in Hash table is 16 to 64.
It should be noted that the specific embodiment of the distributed ipv6 route queryings system of the embodiment of the present invention with this
The specific embodiment of the distributed ipv6 method for searching route of bright embodiment is similar to, and specifically refers to method part, in order to compared with
Few redundancy, does not repeat.
In addition, the distributed ipv6 method for searching route of the embodiment of the present invention and system other constitute and act on for
All it is known for those skilled in the art, in order to reduce redundancy, does not repeat.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means to combine specific features, structure, material or spy that the embodiment or example are described
Point is contained at least one embodiment of the present invention or example.In this manual, to the schematic representation of above-mentioned term not
Necessarily refer to identical embodiment or example.And, the specific features of description, structure, material or feature can be any
One or more embodiments or example in combine in an appropriate manner.
Although an embodiment of the present invention has been shown and described, it will be understood by those skilled in the art that：Not
These embodiments can be carried out with various changes, modification, replacement and modification in the case of the principle and objective that depart from the present invention, this
The scope of invention is limited by claim and its equivalent.
Claims (8)
1. a kind of distributed ipv6 method for searching route, it is characterised in that comprise the following steps：
S110：Build the Multi-branch Trie Tree that prefix length is 32 and prefix length is 48；
S120：By all prefix lengths in router except 32 route entries with 48 are with prefix length division, and set up Kazakhstan
Uncommon table；
S130：When route entry is added, whether the prefix length of the addition route entry is judged as 32 or 48, if so, then by institute
The correspondence position that addition route entry is added in the Multi-branch Trie Tree is stated, if it is not, being then added in the Hash table；
S140：When E-Packeting, according to the message, respectively matching is tied in the Multi-branch Trie Tree and the Hash table
Fruit E-Packets.
2. distributed ipv6 method for searching route according to claim 1, it is characterised in that step S140 is further
Including：
S141：When E-Packeting, the route entry of matching is searched whether from the Multi-branch Trie Tree, if matching, records
The prefix length of the first matching route entry and the first matching route entry；If the route entry not matched, into step S142；
S142：Make a look up in the Hash table, if matching, record second matches route entry and second and matches route entry
Prefix length；
S143：If the message, without occurrence, is lost and the report in the Multi-branch Trie Tree and the Hash table
Text；
If there is the first matching route entry or the second matching route entry in the message, with the described first matching road
The message is forwarded by item or the second matching route entry；
If the message has the first matching route entry and the second matching route entry, when the first matching route entry
Prefix length more than the second matching route entry prefix length when, the message is forwarded with the described first matching route entry；Then
When the prefix length of the first matching route entry matches the prefix length of route entry less than second, with the described second matching route entry
Forward the message.
3. distributed ipv6 method for searching route according to claim 1 and 2, it is characterised in that use binary chop
Occurrence is searched from the Hash table.
4. distributed ipv6 method for searching route according to claim 2, it is characterised in that described in step S142
The prefix length that route entry is searched in Hash table is 16 to 64.
5. a kind of distributed ipv6 route queryings system, it is characterised in that include：
Route forwarding table builds module, and the route forwarding table builds module is used to build prefix length for 32 and prefix length
For the Multi-branch Trie Tree of 48, the route forwarding table builds module and is additionally operable to all prefix lengths in router except 32
Route entry of the position with 48 sets up Hash table with prefix length division, and the route forwarding table builds module and is additionally operable to work as and adds
Plus during route entry, judge it is described addition route entry prefix length whether as 32 or 48, if so, then by it is described addition route entry add
The correspondence position being added in the Multi-branch Trie Tree, if it is not, being then added in the Hash table；
Route forwarding table enquiry module, the route forwarding table enquiry module is used for respectively from the Multi-branch Trie Tree and described
Matching result in Hash table；
Packet forwarding module, E-Packets for basis from matching result in the Multi-branch Trie Tree and the Hash table.
6. distributed ipv6 route queryings system according to claim 5, it is characterised in that the route forwarding table inquiry
Module is further used for：
When E-Packeting, the route entry of matching is searched whether from the Multi-branch Trie Tree, if matching, record first
Prefix length with route entry and the first matching route entry, without occurrence such as in the Multi-branch Trie Tree, then described
Make a look up in Hash table, if matching, record second matches the prefix length of route entry and the second matching route entry；
The packet forwarding module is further used for：
If the message, without occurrence, is lost and the message in the Multi-branch Trie Tree and the Hash table；
If there is the first matching route entry or the second matching route entry in the message, with the described first matching road
The message is forwarded by item or the second matching route entry；
If the message has the first matching route entry and the second matching route entry, when the first matching route entry
Prefix length more than the second matching route entry prefix length when, the message is forwarded with the described first matching route entry；Then
When the prefix length of the first matching route entry matches the prefix length of route entry less than second, with the described second matching route entry
Forward the message.
7. the distributed ipv6 route queryings system according to claim 5 or 6, it is characterised in that the route forwarding table
Enquiry module searches occurrence using binary chop from the Hash table.
8. distributed ipv6 route queryings system according to claim 6, it is characterised in that search road in the Hash table
It it is 16 to 64 by the prefix length of item.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610829157.4A CN106656816B (en) | 2016-09-18 | 2016-09-18 | Distributed ipv6 method for searching route and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610829157.4A CN106656816B (en) | 2016-09-18 | 2016-09-18 | Distributed ipv6 method for searching route and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656816A true CN106656816A (en) | 2017-05-10 |
| CN106656816B CN106656816B (en) | 2019-09-24 |
Family
ID=58852068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610829157.4A Active CN106656816B (en) | 2016-09-18 | 2016-09-18 | Distributed ipv6 method for searching route and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656816B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896194A (en) * | 2018-01-02 | 2018-04-10 | 盛科网络（苏州）有限公司 | A kind of method for searching route, device and storage medium |
| CN109194574A (en) * | 2018-09-20 | 2019-01-11 | 南通科技职业学院 | A kind of IPv6 method for searching route |
| CN114884877A (en) * | 2022-06-14 | 2022-08-09 | 电子科技大学 | IPv6 route searching method combining hash table and HOT |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110128959A1 (en) * | 2009-12-01 | 2011-06-02 | Masanori Bando | Hash-based prefix-compressed trie for ip route lookup |
| CN103107945A (en) * | 2013-01-10 | 2013-05-15 | 中国科学院信息工程研究所 | System and method of quick searching Internet protocol version 6 (IPV6) route |
| CN103746919A (en) * | 2014-01-14 | 2014-04-23 | 浪潮电子信息产业股份有限公司 | Method for quickly classifying network packets through combining multi-way decision tree and Hash tables |
| CN104679854A (en) * | 2015-02-15 | 2015-06-03 | 中国科学院计算技术研究所 | Routing table storing and searching methods |
-
2016
- 2016-09-18 CN CN201610829157.4A patent/CN106656816B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110128959A1 (en) * | 2009-12-01 | 2011-06-02 | Masanori Bando | Hash-based prefix-compressed trie for ip route lookup |
| CN103107945A (en) * | 2013-01-10 | 2013-05-15 | 中国科学院信息工程研究所 | System and method of quick searching Internet protocol version 6 (IPV6) route |
| CN103746919A (en) * | 2014-01-14 | 2014-04-23 | 浪潮电子信息产业股份有限公司 | Method for quickly classifying network packets through combining multi-way decision tree and Hash tables |
| CN104679854A (en) * | 2015-02-15 | 2015-06-03 | 中国科学院计算技术研究所 | Routing table storing and searching methods |
Non-Patent Citations (3)
| Title |
|---|
| 华泽: "一种新的快速IPv6路由查找算法", 《研究与开发》 * |
| 杜飞等: "基于无冲突哈希表和多比特树的两级IPv6路由查找算法", 《计算机应用》 * |
| 高莹等: "采用分段哈希方法的IPv6路由查找算法研究", 《计算机工程与设计》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896194A (en) * | 2018-01-02 | 2018-04-10 | 盛科网络（苏州）有限公司 | A kind of method for searching route, device and storage medium |
| CN109194574A (en) * | 2018-09-20 | 2019-01-11 | 南通科技职业学院 | A kind of IPv6 method for searching route |
| CN109194574B (en) * | 2018-09-20 | 2020-09-18 | 南通科技职业学院 | IPv6 route searching method |
| CN114884877A (en) * | 2022-06-14 | 2022-08-09 | 电子科技大学 | IPv6 route searching method combining hash table and HOT |
| CN114884877B (en) * | 2022-06-14 | 2023-02-03 | 电子科技大学 | IPv6 route searching method combining hash table and HOT |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656816B (en) | 2019-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2560327B1 (en) | Routing table establishment method and device | |
| CN103780491B (en) | A kind of method for realizing IPv6 fast routing lookups | |
| US8325721B2 (en) | Method for selecting hash function, method for storing and searching routing table and devices thereof | |
| US7418505B2 (en) | IP address lookup using either a hashing table or multiple hash functions | |
| CN100496019C (en) | A method to quickly search and update IPv6 routing list | |
| US7774538B2 (en) | Method for ternary contents address memory table management | |
| US20060083247A1 (en) | Prefix lookup using address-directed hash tables | |
| CN1784678A (en) | System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size | |
| CN102405623B (en) | Method and device for storing routing table entry | |
| CA2434876A1 (en) | Method and apparatus for ternary content addressable memory (tcam) table management | |
| CN106656816A (en) | Distributed ipv6 routing lookup method and distributed ipv6 routing lookup system | |
| US20050083937A1 (en) | IP address lookup method using pipeline binary tree, hardware architecture, and recording medium | |
| CN106330716B (en) | IP route searching method and device | |
| CN103107945B (en) | A kind of system and method for fast finding IPV6 route | |
| CN106302172A (en) | Support Hash lookup and the storage of route querying, lookup method and device simultaneously | |
| CN108989209A (en) | BIER MPLS network equipment and its message forwarding method and medium | |
| CN107872388A (en) | For realizing the methods, devices and systems of message forwarding | |
| CN101626392A (en) | Methods and systems for storing and searching data | |
| US20040044868A1 (en) | Method and apparatus for high-speed longest prefix match of keys in a memory | |
| US10454825B2 (en) | Hybrid routing table for routing network traffic | |
| CN105227468B (en) | A kind of lookup device, lookup method and configuration method | |
| CN103581023A (en) | Method and device for realizing longest mask matching | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| CN111865804B (en) | Method and system for improving route issuing efficiency through hardware packet issuing mechanism | |
| Rojas-Cessa et al. | Parallel search trie-based scheme for fast IP lookup |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |