CN104780101A - FIB (Forward Information Base) table structure in named data networking forwarding plane and retrieval method thereof - Google Patents
FIB (Forward Information Base) table structure in named data networking forwarding plane and retrieval method thereof Download PDFInfo
- Publication number
- CN104780101A CN104780101A CN201510050543.9A CN201510050543A CN104780101A CN 104780101 A CN104780101 A CN 104780101A CN 201510050543 A CN201510050543 A CN 201510050543A CN 104780101 A CN104780101 A CN 104780101A
- Authority
- CN
- China
- Prior art keywords
- memory
- grand
- type cloth
- fib table
- location type
- 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
Abstract
The invention discloses an FIB (Forward Information Base) table structure in a named data networking forwarding plane. The FIB table structure comprises an on-chip storage unit and two off-chip storage units, wherein the on-chip storage unit is formed by mapping bloom filters, and the mapping bloom filters utilize a plurality of mapping bloom data structures as data indexes; one of the two off-chip storage units is formed by CBFs (Counter Bloom Filters), and the CBFs utilize a plurality of CBF data structures to implement updating operation of the FIB table; the other one of the two off-chip storage units is taken as an off-chip static memory, and the off-chip static memory utilizes a static storage structure so as to store forwarding information of an actual data message. According to the FIB table structure, the processing capacity of million-level messages of the named data networking forwarding plane is satisfied, meanwhile, highly-efficient routing information storage and quick message matching and updating operations of the FIB table based on a longest prefix matching principle are implemented, and the FIB table structure can be deployed under the current hardware environment.
Description
Technical field
The invention belongs to high-performance router field of structural design, especially for inquiry and the replacement problem of high-performance fib table in content center network (Named Data Networking) Forwarding plane.
Background technology
Along with Internet technology universal and application widely, original Internet architecture based on TCP/IP, can not meet the demand of people in all many-sides such as speed, energy consumption, safety, mobility, communication qualities, also obstruction brought to further developing of Future Internet technology simultaneously.Therefore, the novel Future Internet framework centered by content: content center network (Named Data Networking) was suggested in 2009, and was rapidly developed.
Content center network adopts data-centered communication pattern, by setting up brand-new Internet structure system, break original location-based communication pattern (Location-Based), namely do not consider that content stores the physical location at place, achieve network from " where " to the revolutionary change of " what ", its basic meaning is exactly that the demand of whole the Internet is adjusted to data content by main frame, it is advantageous that the shared rate greatly improving Internet resources, improve network performance.
Large quantity research shows, in order to realize this Novel Internet framework of content center network, requires that its Forwarding plane has high efficiency route storage organization, to support that message coupling more at a high speed and routing update operate.Wherein, this storage organization is under the link speed of 10Gbps to 20Gbps, its message processing capability should reach 1,000,000 ranks, can realize inquiring about based on the fib table of longest prefix match principle (Longest Prefix Matching), renewal rewards theory simultaneously; Secondly the new types of data naming method of variable length in this network and current hardware memory technical merit should be taken into full account.But the FIB storage organization based on Hash method, Bloom filter technology or the tree-like encoding scheme of Name Component Encoding conventional at present, all can not meet the demand completely.
Summary of the invention
For the problems referred to above, the present invention devises a kind of novel fib table storage organization for content center network Forwarding plane feature.This structure can while meeting content center network Forwarding plane 1,000,000 rank message processing capability, realize high efficiency routing iinformation to store, based on fib table rapid message coupling and the renewal rewards theory of longest prefix match principle, and under Current hardware environment can be deployed in.
In order to solve the problems of the technologies described above, a kind of content center network Forwarding plane fib table structure that the present invention proposes, comprises memory cell and two sheet external memory unit in a sheet; Described interior memory cell by can the grand memory set of location type cloth form, described can the grand memory set of location type cloth use multiple can the grand data structure of location type cloth as data directory; In two sheet external memory unit, a sheet external memory unit is made up of CBF memory set, described CBF memory set uses multiple CBF (Counter Bloom filter) data structure to realize fib table renewal rewards theory, another sheet external memory unit is made up of the outer static memory of a sheet, and described outer static memory uses static storage structure to store the forwarding information of real data message.
The one that the present invention proposes can the grand data structure of location type cloth, comprise an a universal Bloom filter array BF and location array MA, wherein said universal Bloom filter array BF is used for determining an element whether in set, described location array MA is one has the bit array of certain mapping relations with described universal Bloom filter array BF, according to the numerical value of described location array MA can determine described element this can the grand data structure of location type cloth map offset address in storage organization.
The search method of a kind of content center network Forwarding plane fib table structure that the present invention proposes is the foregoing central site network Forwarding plane fib table structure according to proposing in the present invention.Wherein, described can the grand memory set of location type cloth use propose in the present invention above-mentioned can the grand data structure of location type cloth as data directory; The search method of this content center network Forwarding plane fib table structure comprises fib table message matching inquiry, fib table upgrades and message name prefix can carry out longest prefix match inquiry in the grand data structure of location type cloth; Wherein:
The step of fib table message matching inquiry comprises:
Step 1-1, the message name based on hierarchy is input to described can in the grand memory set of location type cloth;
Step 1-2: parallelly in the grand memory set of location type cloth can carry out query manipulation described according to longest prefix match principle, thus judge that the forwarding information of this message name is whether in fib table,
If in the described message name that can there is coupling in the grand memory set of location type cloth, then perform step 1-3;
If in the described message name that can there is not coupling in the grand memory set of location type cloth, then perform step 1-4;
Step 1-3: read forwarding information in the outer static memory of sheet, according to can the Output rusults of the grand memory set of location type cloth, obtain the offset address of longest matching prefix in the static reservoir of sheet external memory, and in the outer static memory of sheet, read the down hop routing forwarding information corresponding to this longest matching prefix according to this offset address;
Step 1-4: return fib table Query Result to Forwarding plane, terminates fib table message matching inquiry;
The step that fib table upgrades comprises:
Step 2-1, by based in the message name prefix to be updated input CBF memory set of hierarchy.
Step 2-2, in the described CBF memory corresponding to this message name prefix to be updated, perform the renewal rewards theory of CBF memory according to longest prefix match principle, and judge whether this CBF memory bits bit value corresponding to message name prefix changes,
If the numerical value of the CBF memory bits that message name prefix is corresponding changes in described CBF memory set, namely become 1 or become 0 from 1 from 0, then perform step 2-3;
If the numerical value of the CBF memory bits that message name prefix is corresponding does not change in CBF memory set, then perform step 2-4;
Can the numerical value of the grand memory bits of location type cloth in memory cell in sheet corresponding to CBF memory in the outer CBF memory set of step 2-3, synchronous sheet;
Step 2-4, to return fib table to Forwarding plane and upgrade result, terminate fib table and upgrade;
The step that message name prefix can carry out longest prefix match inquiry in the grand data structure of location type cloth comprises:
Step 3-1, the numerical value of all bits in the array MA of location is all set to 0;
Step 3-2, to described this can input and the message name prefix corresponding to it in the grand memory of location type cloth, wherein correspond to can the numbering of the grand memory of location type cloth for the length of message name prefix;
Step 3-3, described message name prefix carried out to K Hash mapping operation, wherein, hash function selects MD5 or SHA1, meanwhile, adjusts code length and map number of times K value according to the concrete size of universal Bloom filter array BF;
Step 3-4, judge that K Hash mapping operates whether the universal Bloom filter array BF bit numerical value mapped is 1 entirely,
If mapping value is 1 entirely, then perform step 3-5; Otherwise, perform step 3-7;
Step 3-5, the mapping value operated according to K Hash mapping in universal Bloom filter array BF, the numerical value of compute location array MA;
Step 3-6, numerical value step 3-5 being calculated gained location array MA export in FIB system as the offset address of described message name prefix in the outer static memory of sheet;
Step 3-7, return Query Result to Forwarding plane, terminate longest prefix match inquiry.
Compared with prior art, the invention has the beneficial effects as follows:
Content center network Forwarding plane fib table structure of the present invention, based on can the grand data structure of location type cloth, can not only realize searching efficiently and renewal rewards theory, and have good deployable.Realizing the present invention can use SRAM to carry out sheet deploy, and meet current internet network error rate lower than 1% communication requirement.
Accompanying drawing explanation
Fig. 1 is the system construction drawing of content center network Forwarding plane fib table structure of the present invention;
Fig. 2 is that relate in the present invention a kind of can the schematic diagram of the grand data structure of location type cloth;
Fig. 3 is the FB(flow block) about fib table message matching inquiry in search method of the present invention;
Fig. 4 is the FB(flow block) about fib table renewal rewards theory in search method of the present invention;
Fig. 5 is about the FB(flow block) that can in location type cloth grand data structure carry out longest prefix match inquiry of message name prefix in its correspondence in search method of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, technical solution of the present invention is described in further detail.
As shown in Figure 1, a kind of content center network Forwarding plane of the present invention fib table structure, comprises memory cell and two sheet external memory unit in a sheet; Described interior memory cell is by can the grand memory set of location type cloth (Mapping Bloom filters) form, described can the grand memory set of location type cloth comprise W can the grand memory of location type cloth (in Fig. 1 by multiple can the grand memory of location type cloth be expressed as MBF (1), MBF (2), MBF (3) ..., MBF (W)), described can the grand memory set of location type cloth use multiple can the grand data structure of location type cloth as data directory; In two sheet external memory unit, a sheet external memory unit is made up of CBF memory set (Counter Bloom filters), described CBF memory set uses multiple CBF data structure to realize fib table renewal rewards theory, another sheet external memory unit is the outer static memory of a sheet, and described outer static memory uses static storage structure to store the forwarding information of real data message.
As shown in Figure 2, can the grand data structure of location type cloth described in the present invention, comprise an a universal Bloom filter array BF and location array MA, wherein said universal Bloom filter array BF is used for determining an element whether in set, described location array MA is one has the bit array of certain mapping relations with described universal Bloom filter array BF, according to the numerical value of described location array MA determine described element can the grand data structure of location type cloth map offset address in storage organization.
As shown in Figure 2, a concrete example to element can be increased in the grand data structure of location type cloth is provided.Can in the grand data structure of location type cloth at this, use K=3 hash function, the size of BF (i.e. universal Bloom filter array BF) is set to 32 bits, and meanwhile, BF is divided into 8 parts by equalization.The location array MA corresponded is set to 8 bits, therefore, this can the grand data structure of location type cloth can at sheet external memory wherein index 2
8individual element.Can in the grand data structure of location type cloth at this, three elements X, Y, Z are inputted successively, and before every minor element input, MA array all can be initialized to full 0 state.When X inputs, the 1st in BF, 6,11 bits by Hash mapping, that is BF the 1st, 2, there is Hash mapping in 3 parts, therefore MA locate array the 1st, 2, the numerical value of 3 bits will be set to 1, other position numerical value are 0.The value finally obtaining MA location array is 11100000, and namely the offset address of X element in chip external memory is 11100000.When Y inputs, the 6th in BF, 14,22 bits by Hash mapping, that is BF the 2nd, 4, there is Hash mapping in 6 parts, therefore MA locate array the 2nd, 4, the numerical value of 6 bits will be set to 1, other position numerical value are 0.The value finally obtaining MA location array is 01010100, and namely the offset address of Y element in chip external memory is 01010100.When Z inputs, the 17th in BF, 22,27 bits by Hash mapping, that is BF the 5th, 6, there is Hash mapping in 7 parts, therefore MA locate array the 5th, 6, the numerical value of 7 bits will be set to 1, other position numerical value are 0.The value finally obtaining MA location array is 00001110, and namely the offset address of Z element in chip external memory is 00001110.
The search method of content center network Forwarding plane fib table structure of the present invention, according to above-mentioned content center network Forwarding plane fib table structure (as shown in Figure 1), wherein said can the grand memory set of location type cloth use above-mentioned can the grand data structure of location type cloth (as shown in Figure 2) as data directory, the search method of content center network Forwarding plane fib table structure comprises fib table message matching inquiry, fib table upgrades and message name prefix can carry out longest prefix match inquiry in the grand data structure of location type cloth.
When the content center network Forwarding plane fib table structure proposed when utilizing the present invention carries out fib table message matching inquiry, as shown in Figure 3, it specifically comprises the following steps:
Step 1-1, incoming message title.First message name based on hierarchy is input to described can in the grand memory set of location type cloth;
Step 1-2: judge that the forwarding information of this message is whether in fib table, parallelly in the grand memory set of location type cloth can carry out query manipulation according to longest prefix match principle described.
If in the described message name that can there is coupling in the grand memory set of location type cloth, then show the longest-prefix forwarding information that there is this message in fib table, and perform step 1-3;
If in the described message name that can there is not coupling in the grand memory set of location type cloth, then show the longest-prefix forwarding information that there is not this message in fib table, and perform step 1-4;
Step 1-3: read forwarding information in the outer static memory of sheet.According to can the Output rusults of the grand memory set of location type cloth, obtain the offset address of longest matching prefix in the static reservoir of sheet external memory, and in the outer static memory of sheet, read the down hop routing forwarding information corresponding to this longest matching prefix according to this offset address;
Step 1-4: return fib table Query Result to Forwarding plane, terminates fib table message matching inquiry.
Such as, as shown in figures 1 and 3, first, the message name inputted is divided into W prefix according to content center network message hierarchical approaches, the corresponding MBF from 1 to W numbering of the prefix of each length (can the grand data structure of location type cloth).Next, parallelly in W prefix MBF corresponding to it carry out query manipulation, as shown in Figure 1.If have any one or several MBF to there is coupling prefix in W MBF, then show the down hop routing forwarding information that there is this message in fib table.Finally, the Output rusults of numbering MBF corresponding to maximum coupling prefix using by system as the offset address of message in the outer static memory of sheet, to read down hop routing iinformation.
When the content center network Forwarding plane fib table structure proposed when utilizing the present invention carries out fib table renewal rewards theory, as shown in Figure 4, comprise the following steps:
Step 2-1, input message name prefix to be updated.Message name prefix to be updated based on hierarchy is inputted in CBF memory set.
Step 2-2, in described CBF memory set, carry out renewal rewards theory.In the described CBF memory corresponding to this message name prefix to be updated, perform the renewal rewards theory of CBF memory according to longest prefix match principle, and judge whether the CBF memory bits bit value corresponding to message name prefix changes.
If the numerical value of the CBF memory bits that message name prefix is corresponding changes in described CBF memory set, namely become 1 or become 0 from 1 from 0, then perform step 2-3;
If the numerical value of the CBF memory bits that message name prefix is corresponding does not change in CBF memory set, then without the need to carrying out renewal rewards theory, directly perform step 2-4;
Step 2-3, synchronous CBF memory and corresponding to it can the grand memory of location type cloth.Can the numerical value of the grand memory bits of location type cloth in memory cell in sheet corresponding to CBF memory in the outer CBF memory set of synchronous sheet, namely complete the renewal rewards theory of fib table.
Step 2-4, to return fib table to Forwarding plane and upgrade result, terminate fib table and upgrade;
The content center network Forwarding plane fib table structure proposed when utilizing the present invention carries out message name prefix when carrying out longest prefix match inquiry in the grand data structure of location type cloth, as shown in Figure 5, comprises the following steps:
Step 3-1, location array MA initialization.The numerical value of all bits in the array MA of location is all set to 0;
Step 3-2, incoming message title prefix.To described this can input and the message name prefix corresponding to it in the grand memory of location type cloth, wherein correspond to can the numbering of the grand memory of location type cloth for the length of message name prefix;
Step 3-3, described message name prefix carried out to K Hash mapping operation.Wherein, hash function selects MD5 or SHA1, meanwhile, adjusts code length and map number of times K value according to the concrete size of universal Bloom filter array BF;
Step 3-4, judge that K Hash mapping operates whether the universal Bloom filter array BF bit numerical value mapped is 1 entirely.
If mapping value is 1 entirely, then this message name prefix is present in this and can in the prefix sets corresponding to the grand memory of location type cloth, and continues to perform step 3-5; Otherwise this message name prefix is not present in this in prefix sets corresponding to grand memory of location type cloth, and can perform step 3-7;
Step 3-5, calculating MA locate the numerical value of array.The mapping value in universal Bloom filter array BF is operated in, the numerical value of compute location array MA according to K Hash mapping;
Step 3-6, output offset address.Numerical value step 3-5 being calculated gained location array MA exports in FIB system as the offset address of described message name prefix in the outer static memory of sheet;
Step 3-7, return Query Result to Forwarding plane, terminate longest prefix match inquiry.
Such as, as shown in Figure 2 and Figure 5, in order to realize by the map operation of BF (universal Bloom filter array BF) to MA (locator data MA) with the numerical value of compute location array MA, first, BF is equally divided into the part that J size is identical, the size definition of MA array is J bit simultaneously.Each part of BF is corresponding in turn to a bit of MA array.When carrying out prefix matching, if i-th in BF (i=1,2 ..., J-1, J) and there is Hash mapping in individual part, then and the value of i-th bit of corresponding MA array will be set to 1, otherwise the value of this bit is 0.Finally show that J bit MA locates the numerical value of array.
Experimental example:
By using C Plus Plus, content center network Forwarding plane fib table structure of the present invention has carried out software test deployment on the PC that is configured to Intel Core i3-3220 3.30GHz, DDR3 4GB SDRAM.Consider the designing requirement of content center network Forwarding plane fib table, 2,000,000 messages from DMOZ and ALEXA are input in this content center network Forwarding plane fib table.Experimental result shows, this content center network Forwarding plane fib table can use SRAM to carry out sheet deploy, and can meet current internet network error rate lower than 1% communication requirement.Show thus, the content center network Forwarding plane fib table structure that the present invention proposes can not only realize searching efficiently and renewal rewards theory, and has good deployable.
Although invention has been described by reference to the accompanying drawings above; but the present invention is not limited to above-mentioned embodiment; above-mentioned embodiment is only schematic; instead of it is restrictive; those of ordinary skill in the art is under enlightenment of the present invention; when not departing from present inventive concept, can also make a lot of distortion, these all belong within protection of the present invention.
Claims (3)
1. a content center network Forwarding plane fib table structure, is characterized in that:
Comprise memory cell and two sheet external memory unit in a sheet;
Described interior memory cell by can the grand memory set of location type cloth form, described can the grand memory set of location type cloth use multiple can the grand data structure of location type cloth as data directory;
In two sheet external memory unit, a sheet external memory unit is made up of CBF memory set, described CBF memory set uses multiple CBF data structure to realize fib table renewal rewards theory, another sheet external memory unit is the outer static memory of sheet, and described outer static memory uses static storage structure to store the forwarding information of real data message.
2. one kind can the grand data structure of location type cloth, it is characterized in that, comprise an a universal Bloom filter array BF and location array MA, wherein said universal Bloom filter array BF is used for determining an element whether in set, described location array MA is one has certain mapping relations bit array with described universal Bloom filter array BF, determines that described element is can offset address in location type cloth grand data structure institute mapping memory according to the numerical value of described location array MA.
3. the search method of a content center network Forwarding plane fib table structure, it is characterized in that: content center network Forwarding plane fib table structure according to claim 1, wherein, described can the grand memory set of location type cloth use as claimed in claim 2 can the grand data structure of location type cloth as data directory, this search method comprise fib table message matching inquiry, fib table upgrade and message name prefix can carry out longest prefix match inquiry in the grand data structure of location type cloth; Wherein:
The step of fib table message matching inquiry comprises:
Step 1-1, the message name based on hierarchy is input to described can in the grand memory set of location type cloth;
Step 1-2, parallelly in the grand memory set of location type cloth can carry out query manipulation according to longest prefix match principle described, to judge that the forwarding information of this message name is whether in fib table,
If in the described message name that can there is coupling in the grand memory set of location type cloth, then perform step 1-3;
If in the described message name that can there is not coupling in the grand memory set of location type cloth, then perform step 1-4;
Step 1-3, in the outer static memory of sheet, read forwarding information, according to can the Output rusults of the grand memory set of location type cloth, obtain the offset address of longest matching prefix in the static reservoir of sheet external memory, and in the outer static memory of sheet, read the down hop routing forwarding information corresponding to this longest matching prefix according to this offset address;
Step 1-4, return fib table Query Result to Forwarding plane, terminate fib table message matching inquiry;
The step that fib table upgrades comprises:
Step 2-1, by based in the message name prefix to be updated input CBF memory set of hierarchy;
Step 2-2, in the described CBF memory corresponding to this message name prefix to be updated, perform the renewal rewards theory of CBF memory according to longest prefix match principle, and judge whether this CBF memory bits bit value corresponding to message name prefix changes,
If the numerical value of the CBF memory bits that message name prefix is corresponding changes in described CBF memory set, namely become 1 or become 0 from 1 from 0, then perform step 2-3;
If the numerical value of the CBF memory bits that message name prefix is corresponding does not change in CBF memory set, then perform step 2-4;
Can the numerical value of the grand memory bits of location type cloth in memory cell in sheet corresponding to CBF memory in the outer CBF memory set of step 2-3, synchronous sheet;
Step 2-4, to return fib table to Forwarding plane and upgrade result, terminate fib table and upgrade;
The step that message name prefix can carry out longest prefix match inquiry in the grand data structure of location type cloth comprises:
Step 3-1, the numerical value of all bits in the array MA of location is all set to 0;
Step 3-2, to described this can input and the message name prefix corresponding to it in the grand memory of location type cloth, wherein correspond to can the numbering of the grand memory of location type cloth for the length of message name prefix;
Step 3-3, described message name prefix carried out to K Hash mapping operation, wherein, hash function selects MD5 or SHA1, meanwhile, adjusts code length and map number of times K value according to the concrete size of universal Bloom filter array BF;
Step 3-4, judge that K Hash mapping operates whether the universal Bloom filter array BF bit numerical value mapped is 1 entirely,
If mapping value is 1 entirely, then perform step 3-5; Otherwise, perform step 3-7;
Step 3-5, the mapping value operated according to K Hash mapping in universal Bloom filter array BF, the numerical value of compute location array MA;
Step 3-6, numerical value step 3-5 being calculated gained location array MA export in FIB system as the offset address of described message name prefix in the outer static memory of sheet;
Step 3-7, return Query Result to Forwarding plane, terminate longest prefix match inquiry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510050543.9A CN104780101B (en) | 2015-01-30 | 2015-01-30 | Content center network Forwarding plane fib table structure and its search method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510050543.9A CN104780101B (en) | 2015-01-30 | 2015-01-30 | Content center network Forwarding plane fib table structure and its search method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104780101A true CN104780101A (en) | 2015-07-15 |
| CN104780101B CN104780101B (en) | 2018-02-27 |
Family
ID=53621352
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510050543.9A Expired - Fee Related CN104780101B (en) | 2015-01-30 | 2015-01-30 | Content center network Forwarding plane fib table structure and its search method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104780101B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105471750A (en) * | 2016-01-21 | 2016-04-06 | 清华大学深圳研究生院 | Method of improving PIT (Pending Interest Table) performance under content-centric networking |
| CN110196938A (en) * | 2019-04-02 | 2019-09-03 | 天津大学 | Named data network content storage pool data insertion method based on neural network |
| CN110460529A (en) * | 2019-06-28 | 2019-11-15 | 天津大学 | Content router FIB storage organization and its data processing method |
| CN108075978B (en) * | 2016-11-17 | 2021-03-30 | 华为技术有限公司 | Message sending method, node configuration method and related equipment |
| CN113220679A (en) * | 2021-04-29 | 2021-08-06 | 天津大学 | Mixed FIB storage structure facing multi-mode network and data processing method thereof |
| US11184240B2 (en) | 2015-07-10 | 2021-11-23 | Idac Holdings, Inc. | Path information updates in information-centric networking |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103141060A (en) * | 2010-10-04 | 2013-06-05 | 华为技术有限公司 | Content router forwarding plane architecture |
| CN103559215A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Content name storage structure oriented design method in content network |
-
2015
- 2015-01-30 CN CN201510050543.9A patent/CN104780101B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103141060A (en) * | 2010-10-04 | 2013-06-05 | 华为技术有限公司 | Content router forwarding plane architecture |
| CN103559215A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Content name storage structure oriented design method in content network |
Non-Patent Citations (2)
| Title |
|---|
| SARANA DHARMAAURIKAR等: "Longest Prefix Matching using Bloom Filter", 《IN PROCEEDINGS OF 2003 CONFERENCE ON ACM》 * |
| 李卓等: "MaPIT: An Enhanced Pending Interest Table for NDN With Mapping Bloom Filter", 《IEEE COMMUNICATIONS LETTERS》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11184240B2 (en) | 2015-07-10 | 2021-11-23 | Idac Holdings, Inc. | Path information updates in information-centric networking |
| CN105471750A (en) * | 2016-01-21 | 2016-04-06 | 清华大学深圳研究生院 | Method of improving PIT (Pending Interest Table) performance under content-centric networking |
| CN108075978B (en) * | 2016-11-17 | 2021-03-30 | 华为技术有限公司 | Message sending method, node configuration method and related equipment |
| CN110196938A (en) * | 2019-04-02 | 2019-09-03 | 天津大学 | Named data network content storage pool data insertion method based on neural network |
| CN110460529A (en) * | 2019-06-28 | 2019-11-15 | 天津大学 | Content router FIB storage organization and its data processing method |
| CN110460529B (en) * | 2019-06-28 | 2021-06-08 | 天津大学 | Data processing method and chip for forwarding information base storage structure of content router |
| CN113220679A (en) * | 2021-04-29 | 2021-08-06 | 天津大学 | Mixed FIB storage structure facing multi-mode network and data processing method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104780101B (en) | 2018-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104780101A (en) | FIB (Forward Information Base) table structure in named data networking forwarding plane and retrieval method thereof | |
| CN101594319B (en) | Entry lookup method and entry lookup device | |
| CN103051543B (en) | A kind of process of route prefix, search, increase and delet method | |
| CN102945249B (en) | A kind of policing rule matching inquiry tree generation method, matching process and device | |
| Huang et al. | Green datapath for TCAM-based software-defined networks | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| CN105119834B (en) | A kind of source address destination address joint lookup method based on compound trie tree constructions | |
| CN104298541A (en) | Data distribution algorithm and data distribution device for cloud storage system | |
| CN110460529B (en) | Data processing method and chip for forwarding information base storage structure of content router | |
| CN103107945B (en) | A kind of system and method for fast finding IPV6 route | |
| CN107948060A (en) | A kind of new routing table is established and IP method for searching route and device | |
| CN102045412B (en) | Method and equipment for carrying out compressed storage on internet protocol version (IPv)6 address prefix | |
| CN106302172A (en) | Support Hash lookup and the storage of route querying, lookup method and device simultaneously | |
| CN105141525A (en) | IPv6 routing lookup method and IPv6 routing lookup device | |
| US9485179B2 (en) | Apparatus and method for scalable and flexible table search in a network switch | |
| US11652744B1 (en) | Multi-stage prefix matching enhancements | |
| Le et al. | Memory-efficient and scalable virtual routers using FPGA | |
| CN109921995A (en) | A kind of network equipment of the method for configuration address table, the FPGA and application FPGA | |
| CN104283966A (en) | Data distribution algorithm and device of cloud storage system | |
| CN103457855B (en) | Classless inter-domain routing table is established and the method and apparatus of message forwarding | |
| CN106020724A (en) | Neighbor storage method based on data mapping algorithm | |
| Veeramani et al. | Efficient IP lookup using hybrid trie-based partitioning of TCAM-based open flow switches | |
| Pietracaprina et al. | Constructive deterministic PRAM simulation on a mesh-connected computer | |
| Cao et al. | An ant colony optimization algorithm for virtual network embedding | |
| CN102739550A (en) | Multi-memory flow routing architecture based on random duplication allocation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180227 Termination date: 20210130 |