CN105812258A - Method and device for data processing - Google Patents
Method and device for data processing Download PDFInfo
- Publication number
- CN105812258A CN105812258A CN201410851108.1A CN201410851108A CN105812258A CN 105812258 A CN105812258 A CN 105812258A CN 201410851108 A CN201410851108 A CN 201410851108A CN 105812258 A CN105812258 A CN 105812258A
- Authority
- CN
- China
- Prior art keywords
- prefix
- node
- trie
- tree
- multidigit
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a device for data processing. The method is applied to a multi-bit trie and comprises steps that at least one Trie node contained in the multi-bit trie and a corresponding Prefix node are acquired, the capacity of the Prefix node is smaller than a preset capacity, the Prefix node comprises PLPM, a routing prefix in the corresponding Trie node and the next-hop information of the routing prefix in the corresponding Trie node, and iterative operation is carried out till the total capacity of the multi-bit trie acquired after iteration is smaller than or equal to the preset capacity. According to the method, the multi-bit trie after iteration is more suitable for disposing in a cache, the PLPM and the next-hop information of the routing prefix in the corresponding Trie node are directly stored in the Prefix node, the corresponding next-hop information can be directly acquired when a matching result is acquired in a routing lookup process, the memory access times of routing lookup can be reduced, caching failure times can be further reduced, and lookup efficiency is directly improved.
Description
Technical field
The present invention relates to data processing field, particularly relate to a kind of data processing method and device.
Background technology
Route querying is the purpose IP address according to message, searches the routing table in router, obtains the process of message next hop information.Every route in routing table is all a route prefix.Route prefix can use ' 0 ', ' 1 ' the three value bits string representations formed with ' * '.As IPv4 prefix 192.168.1.0/24 can with three following value bits string representation: 110000001010100000000001********.' * ' expression is indifferent to, and both can mate with ' 1 ', it is also possible to mate with ' 0 '.So, 192.168.1.0/24 coupling is sewed in two IPv4 address 192.168.1.1 and 192.168.1.2 all fronts.When having multiple ' * ' when below, generally only write one ' * '.Such as ' 01* ', represents that the value of front two is " 01 ", and position below is all ' * '.Route querying is longest prefix match (LPMLongestPrefixMatch) problem.When there being a plurality of prefix with the IP address coupling of input, next hop information corresponding to the longest coupling prefix of mask is only final lookup result.The length assuming IP address is 9, if routing table has two prefixes " 01* " and " 010* ", then IP address 010100101 is all mated with the two prefix, but because prefix " 010* " is longer than " 01* ", so, " 010* " is only the longest coupling prefix, and the next hop information of its correspondence is only final lookup result.
Routing Algorithm conventional in prior art mainly uses multidigit tree (Multi-BitTrie), tree can be understood as multidigit, a binary tree is set up according to the bit string in route prefix, in binary tree, if the value of present bit is ' 0 ', make a move to the left, if for ' 1 ', made a move to the right.The figure place every time considered is usually fixing multidigit, and described figure place is it can be appreciated that the step-length of long number.As it is shown in figure 1, Fig. 1 is the structural representation of multidigit tree in prior art.Wherein the prefix of p0 is *, the prefix of p1 is 0*, the prefix of p2 is the prefix that prefix is 111*, p4 of 10*, p3 is 0000*, the prefix of p5 is 1001*, the prefix of p6 is the prefix that prefix is 11111*, p8 of 11101*, p7 is 000011*, the prefix of p9 is the prefix of 0000100*, p10 is 1110100*.Assuming that step-length is 3, binary tree is divided into 7 sub-Trie, respectively T1 to T7 as shown in Figure 1.Multidigit tree is considered as, by step-length, one y-bend Trie is divided into many sub-Trie, and is that every sub-Trie creates a Trie node (TrieNode).If certain sub-Trie has prefix, to be also that this sub-Trie creates a Prefix node (PrefixNode).Drop on this prefix within sub-Trie to be all saved in Prefix node.Next hop information corresponding to every prefix is called RE (REsult).It is typically in multidigit tree and only preserves REIndex, namely point to the pointer of next hop information.For every middle sub-Trie, it is required for calculating a current longest prefix match (PresentLongestPrefixMatch, PLPM) into it.Such as, for sub-T2, the longest-prefix owing to covering it is p1, so PLPM corresponding to T2 is prefix p1.REIndex corresponding for PLPM is typically maintained in first position of REIndex array, and whether has the PLPM of correspondence in Trie node or Prefix node with the 1 current sub-Trie of bit-identify.The PLPM being positioned at each node of Level2 and Level3 in Fig. 1 corresponding marks on the right side of REIndex array.Trie node has two class child nodes, respectively Trie child node and Prefix child node, for instance the Trie node T1 in Fig. 1 has 3 child nodes to be Trie node, namely T2, T3 and T4；Having a child node is Prefix node, namely with the Prefix node of T1 association.Each Trie node has an association KEY, the route prefix that namely starting point of subtree is corresponding.The association KEY of Trie node is considered as the prefix formed of each segmentation KEY from the root node of Trie to current Trie node.Such as in FIG, the association KEY of T1 is ' * ', and the association KEY of T2 is ' 000* ', and the association KEY of T3 is ' 010* '.Trie node to preserve the pointer pointing to Trie child node.The Trie child node of one Trie node is typically all deposits (being considered as an array) continuously, so having only to preserve the original position of Trie child node.In such as Fig. 1,3 Trie node T2, T3 and T4 are the child nodes of Trie node T1, and they are saved in an array, and the initial address only preserving array in Trie node T1 is just passable.Trie node also to preserve the pointer pointing to Prefix child node.In existing multidigit tree algorithm, the Prefix child node of a Trie node is only intended to preserve the prefix in the subtree that this Trie node is corresponding.It addition, also to preserve the bitmap for indexing child node in Trie node, the figure place of bitmap is 2Step-length.Bitmap have several 1 meant that several Trie child node.In the example in fig 1, because step-length is 3, for child node index bitmap have only to 8.Segmentation KEY corresponding to three Trie child node T2, T3 and the T4 of Trie node T1 respectively 000,100 and 111, so preserving in T1 is 10001001 for indexing the bitmap of child node.
In order to process the message received with reaching linear speed, route querying is typically all and realizes with hardware.Lookup structure in hardware is usually a multistage streamline.Based on Trie algorithm can Trie at different levels leave in hardware pipeline at different levels in.Based on Fig. 1, Fig. 2 is multidigit tree lookup structural representation within hardware in prior art.Being divided into 5 grades, first 3 grades preserve 3 layers of Trie node, and the 4th grade preserves the Prefix node that 7 Trie nodes are corresponding, the RE pointer that the 5th grade of prefix preserved in each Prefix node is corresponding.During lookup, input KEY gets off along streamline one-level one-level, finally gives lookup result.The length assuming IP address is 9, and the process searching IP address 111010011 is as follows:
Step1: enter the first order of streamline, accesses Trie node T1, and extracts the highest 3 ' 111 ' in secondary IP address.Because T1 has the Prefix node of correspondence, so recording the pointer of this Prefix node.
Step2: access the child node T4 of Trie node T1 according to segmentation KEY ' 111 ', and extract ensuing 3 ' 010 ' in secondary IP address.Because T4 also has the Prefix node of correspondence, so the pointer that the Prefix node pointer updating lookup is Prefix node corresponding for T4.
Step3: access the child node T7 of Trie node T4 according to segmentation KEY ' 010 ', and extract ensuing 3 ' 011 ' in secondary IP address.Because T7 also has the Prefix node of correspondence, so the pointer that the Prefix node pointer updating lookup is Prefix node corresponding for T7.
Step4: owing to T7 does not have Trie child node, so using the Prefix node pointer of the last time preservation to access Prefix node.Prefix node namely corresponding for T7 in this example.Prefix node saves the prefix p10 in subtree T7.Input KEY, namely sew p10 " 1110100* " in front of IP address 111010011 to mate (herein, have only to compare 011 just passable with ' 0* '), and this subtree has the PLPM of correspondence, so REindex corresponding to p10 is saved in second position (array index is 1) of REindex array.
Step5: obtain REIndex corresponding to p10 according to the REindex obtained in Step4 position in REindex array.Next hop information can be obtained by the REIndex returned.
Visible, the progression of traditional multidigit tree is relatively more, when routing capacity is relatively big, when tree all cannot be placed in buffer memory (cache), when carrying out route querying, need repeatedly to access internal memory, updating the content in cache, cause the cache number of times lost efficacy more, waste system resource also directly contributes lookup speed decline.
Summary of the invention
In order to solve above-mentioned technical problem, embodiments provide a kind of data processing method and device, Prefix node after iteration saves the next hop information of route prefix in PLPM and corresponding Trie node, effectively reduces the memory access number of times when searching route.
First aspect, embodiments provides a kind of data processing method, is applied to multidigit tree, and described multidigit tree includes multiple route prefix, and described method includes:
nullThe structure obtaining described multidigit tree includes at least one Trie node and corresponding Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node；
It is iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
In the first possible implementation of first aspect, also include:
Obtain routing address to be found；
Proceeding by LPM according to the multidigit tree that described routing address to be found obtains from last iteration, the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree；
It is circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration；
If described matching result is the Prefix node in the multidigit tree before matching non-iteration, then using next hop information as described routing address to be found of the next hop information of route prefix that mates with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration；
If described matching result is for occurring without coupling prefix, then will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node of nothing coupling prefix as the next hop information of described routing address to be found.
In the implementation that the second of first aspect is possible, also include:
Using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
In the third possible implementation of first aspect, also include:
Described Prefix node stores the route prefix in PLPM, corresponding Trie node and the next hop information of route prefix, described PCL and Trie node one_to_one corresponding in corresponding Trie node by least one PCL.
In conjunction with the first or the second or the third possible implementation of first aspect or first aspect, in the 4th kind of possible implementation,
Described preset capacity determines according to the cache size of the system of process.
Second aspect, embodiments provides a kind of data processing equipment, is applied to multidigit tree, and described multidigit tree includes multiple route prefix, and described data processing equipment includes:
nullAcquiring unit，Structure for obtaining described multidigit tree includes at least one Trie node and corresponding Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node；
Iteration unit, is used for being iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
In the first possible implementation of second aspect, also include:
Receive unit, be used for obtaining routing address to be found；
Matching unit, multidigit tree for obtaining from last iteration according to described routing address to be found proceeds by LPM, and the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree；
Described matching unit is additionally operable to be circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration；
If the described matching result of described matching unit is the Prefix node in the multidigit tree before matching non-iteration, determine unit, for next hop information as described routing address to be found of the next hop information of route prefix that will mate with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration；
If the described matching result of described matching unit is for occurring without coupling prefix, described determine that unit is additionally operable to will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node without coupling prefix as the next hop information of described routing address to be found.
In the implementation that the second of second aspect is possible, also include:
Processing unit, for using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
In the third possible implementation of second aspect,
Described Prefix node stores the route prefix in PLPM, corresponding Trie node and the next hop information of route prefix, described PCL and Trie node one_to_one corresponding in corresponding Trie node by least one PCL.
In conjunction with the first or the second or the third possible implementation of second aspect or second aspect, in the 4th kind of possible implementation,
Described preset capacity determines according to the cache size of the system of process.
Be can be seen that by technique scheme, by the iterative operation to multidigit tree, make the total capacity of the multidigit tree after iteration less than or equal to preset capacity, it is more suitable for depositing in buffer memory, and the Prefix node of the multidigit tree after iteration directly saves the next hop information of route prefix in PLPM and corresponding Trie node, make to directly obtain when obtaining matching result the next hop information of correspondence in the process of route querying, reduce and also need to memory access again to obtain the process of next hop information originally when searching, thereby reduce the memory access number of times of route querying, decrease the cache number of times lost efficacy, directly enhance search efficiency.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the premise not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the structural representation of multidigit tree in prior art；
Fig. 2 is multidigit tree lookup structural representation within hardware in prior art；
The method flow diagram of a kind of data processing method that Fig. 3 provides for the embodiment of the present invention；
The structural representation of a kind of multidigit tree that Fig. 4 a provides for the embodiment of the present invention；
The structural representation that the Trie node of a kind of multidigit tree that Fig. 4 b provides for the embodiment of the present invention creates；
The associated prefixes schematic diagram of the Prefix node before a kind of iterative operation that Fig. 4 c provides for the embodiment of the present invention；
The structural representation of the multidigit tree after a kind of iterative operation that Fig. 5 a provides for the embodiment of the present invention；
The structural representation that Trie node after a kind of iterative operation that Fig. 5 b provides for the embodiment of the present invention creates；
A kind of route querying structural representation that Fig. 5 c provides for the embodiment of the present invention；
The method flow diagram of a kind of method for searching route that Fig. 6 provides for the embodiment of the present invention；
The structural representation of a kind of Skip node that Fig. 7 provides for the embodiment of the present invention；
The schematic diagram of the coded method of a kind of Prefix node that Fig. 8 provides for the embodiment of the present invention；
The node structure schematic diagram of a kind of Prefix node that Fig. 9 provides for the embodiment of the present invention；
The structure drawing of device of a kind of data processing equipment that Figure 10 provides for the embodiment of the present invention；
The structure drawing of device of a kind of device for searching route that Figure 11 provides for the embodiment of the present invention；
The structure drawing of device of a kind of data processing equipment that Figure 12 provides for the embodiment of the present invention.
Detailed description of the invention
In prior art, when preserving route prefix, can be split into multistage according to the multidigit tree that route prefix is formed, such as shown in Figure 2, it is divided into 5 grades, first 3 grades preserve 3 layers of Trie node, and the 4th grade preserves the Prefix node that 7 Trie nodes are corresponding, the RE pointer that the 5th grade of prefix preserved in each Prefix node is corresponding.During lookup, input KEY gets off along streamline one-level one-level, finally gives lookup result.The RE pointer next hop information in other words that in Prefix node, prefix is corresponding is kept separately in one-level, so in the process of routing inquiry, it is likely to need repeatedly to access internal memory, update the content in cache, causing the cache number of times lost efficacy more, waste system resource also directly contributes lookup speed decline.
For the problems of the prior art, embodiments provide a kind of data processing method and device, by the iterative operation to multidigit tree, make the total capacity of the multidigit tree after iteration less than or equal to preset capacity, it is more suitable for depositing in buffer memory, and the Prefix node of the multidigit tree after iteration directly saves the next hop information of route prefix in current longest prefix match PLPM and corresponding Trie node, make to directly obtain when obtaining matching result the next hop information of correspondence in the process of route querying, reduce and also need to memory access again to obtain the process of next hop information originally when searching, thereby reduce the memory access number of times of route querying, decrease the cache number of times lost efficacy, directly enhance search efficiency.
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete description, it is clear that described embodiment is only a part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of protection of the invention.
Embodiment one
The method flow diagram of a kind of data processing method that Fig. 3 provides for the embodiment of the present invention, is applied to multidigit tree Trie, and described multidigit tree includes multiple route prefix, and described method includes:
nullS301: the structure obtaining described multidigit tree includes at least one Trie node and corresponding Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes current longest prefix match PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node.
The accompanying drawings present invention executes the relation between the direct Prefix node described in example and non-immediate Prefix node and Trie node, the structural representation of a kind of multidigit tree that Fig. 4 a provides for the embodiment of the present invention, wherein the prefix of p0 is 00*, the prefix of p1 is 000*, the prefix of p2 is 0010*, the prefix of p3 is 00111*, the prefix of p4 is 000000*, the prefix of p5 is 001001*, the prefix of p6 is the prefix that prefix is 0011111*, p8 of 0011101*, p7 is 00000011*, the prefix of p9 is the prefix of 000000100*, p10 is 001110100*.Under the linear list (DirectTable) that length is 4,00 front two consuming p1 to p10 prefix, when step-length is 3, it is possible to be divided into 7 Trie nodes, respectively T1 to T7 as shown in fig. 4 a.Structure according to multidigit tree as shown in fig. 4 a obtains at least one Trie node and corresponding prefix Prefix node, specifically can as shown in Figure 4 b, the structural representation that the Trie node of a kind of multidigit tree that Fig. 4 b provides for the embodiment of the present invention creates.Wherein, T1 has two Prefix nodes, respectively P1 and P3, and wherein P1 belongs to the direct Prefix node of T1, is used for preserving in T1 route prefix p0, p1 and p2.P3 belongs to the non-immediate Prefix node of T1, for preserving the PLPM of the information of the Trie node connected under T1, corresponding next hop information and P1.In embodiments of the present invention, it is assumed that owing to capacity is excessive, the capacity of P3 more than described preset capacity, therefore can not can only preserve the information in T3, including the PLPM of the prefix of p5, corresponding next hop information and P3.In like manner, P4 is the direct Prefix node of T4, and P7 is the non-immediate Prefix node of T4, and P2 is the direct Prefix node of T2, and P5 and P6 is the non-immediate Prefix node of T2.The Trie child node of one Trie node is up to 2Step-lengthIndividual；And Prefix child node can have up to 2Step-length+ 1.
It should be noted that each Trie node has an associated prefixes.In the same manner, each Prefix node also has an associated prefixes.The associated prefixes of the direct Prefix node of one Trie node is identical with the associated prefixes of this Trie node；The associated prefixes of the non-immediate Prefix node of one Trie node, the associated prefixes with corresponding Trie node is identical.The associated prefixes of the associated prefixes of the Trie child node of one Trie node and its non-immediate Prefix node is different.In such as Fig. 4 b, two associated prefixes corresponding for Trie child node T2 and T4 of T1 are ' 00000* ' and ' 00111* ', and two associated prefixes corresponding for Prefix child node P1 and P3 are ' 00* ' and ' 00100* ', namely corresponding for Trie node T1 and T3 associated prefixes.
S302: be iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
In conjunction with accompanying drawing, described iterative operation is illustrated, based on Fig. 4 b, the associated prefixes schematic diagram of the Prefix node before a kind of iterative operation that Fig. 4 c provides for the embodiment of the present invention.As illustrated in fig. 4 c, Fig. 4 b includes 7 Prefix nodes altogether, obtain the associated prefixes of these 7 Prefix nodes, respectively 00*, 00100*, 00000*, 00111*, 00111010*, 00000011* and 00000010*, these 7 associated prefixes are utilized to be iterated operation, build the multidigit tree made new advances, as shown in Figure 5 a, the structural representation of the multidigit tree after a kind of iterative operation that Fig. 5 a provides for the embodiment of the present invention, first, the length of the linear list of this multidigit tree becomes 1, be equivalent to without linear list, relative to prior art, be equivalent to decrease the quantity of multidigit tree.In the tree of multidigit as shown in Figure 5 a that second time iteration creates, all of prefix all just drops on the bottommost of respective place Trie node.So can improve the efficiency of Prefix nodes encoding.Structure according to multidigit tree as shown in Figure 5 a obtains Trie node and corresponding prefix Prefix node, Trie node as shown in Figure 5 b and Prefix node can be obtained, the structural representation that Trie node after a kind of iterative operation that Fig. 5 b provides for the embodiment of the present invention creates, by the multidigit tree shown in Fig. 5 a, obtain a Trie node T21 and three Prefix node P21, P22 and P23, wherein P21 preserves the prefix in T21, is the direct Prefix node of T21.P22 preserves the prefix in T22 and T24；P23 preserves the prefix in T23 and T25, the non-immediate Prefix node of P22 and P23 respectively T21.In structure as shown in Figure 5 b, it is assumed that the multidigit tree of establishment is smaller, the total capacity of multidigit tree, less than or equal to described preset capacity, stops iterative operation.Multidigit tree and the prefix node of first time iteration establishment that final lookup structure is created by second filial generation iteration form.Can as shown in Figure 5 c, a kind of route querying structural representation that Fig. 5 c provides for the embodiment of the present invention.Visible, multidigit tree as shown in Figure 1, prior art needs to use 5 grades to search structure, in the concrete example lifted in reality embodiment of the present invention, when many two of prefix, pass through iterative operation, finally give 3 grades and search structure, so can reduce the number of times of required memory access in route querying process, simultaneously, the next hop information of correspondence is also directly provided in the Prefix node provided in the embodiment of the present invention, further decreases memory access number of times.
It should be noted that Fig. 5 b is a concrete example.The present invention does not limit an iterative operation once.The method identical with first multidigit tree can be adopted similarly, for second multidigit tree, using all of Prefix node as the one-level searching streamline, and their associated prefixes is inserted in the 3rd multidigit tree as new prefix.The rest may be inferred, by creating many multidigit trees, namely carries out successive ignition, and to the last a multidigit tree is smaller, it is possible to till being placed in cache.Final lookup structure is made up of last Trie node and multistage Prefix node.
For described preset capacity it should be noted that described preset capacity determines according to the cache size of the system of process.In general, if the cacheline of CPU is 512, then the maximum of Prefix node can be set to 512, to improve memory access efficiency.
As can be seen from the above-described embodiment, by the iterative operation to multidigit tree, make the total capacity of the multidigit tree after iteration less than or equal to preset capacity, it is more suitable for depositing in buffer memory, and the Prefix node of the multidigit tree after iteration directly saves the next hop information of route prefix in current longest prefix match PLPM and corresponding Trie node, make to directly obtain when obtaining matching result the next hop information of correspondence in the process of route querying, reduce and also need to memory access again to obtain the process of next hop information originally when searching, thereby reduce the memory access number of times of route querying, decrease the cache number of times lost efficacy, directly enhance search efficiency.
Next by how using the route querying structure that embodiment is set up as shown in Figure 3 to carry out route querying.On the basis of embodiment corresponding to Fig. 3, the method flow diagram of a kind of method for searching route that Fig. 6 provides for the embodiment of the present invention, described method includes:
S601: obtain routing address to be found.
S602: proceed by longest prefix match LPM according to the multidigit tree that described routing address to be found obtains from last iteration, the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree.
Illustrating, when making a look up, the multidigit tree that last iterative operation obtains from S302 begins look for, for Fig. 5 c, it is possible to directly proceed by lookup from T21.
S603: be circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration.
Illustrate, owing to passing through iterative operation, it is possible to obtain multistage route querying structure as shown in Figure 5 c, the circulation coupling of S603 can be understood as, according to classification, from the Trie node of the most upper level of described multistage route querying structure, the process searched step by step from top to bottom.By the bitmap preserved in Prefix node and routing address to be found, it may be determined that search which Prefix node in next stage.
S604: if described matching result is the Prefix node in the multidigit tree before matching non-iteration, then using next hop information as described routing address to be found of the next hop information of route prefix that mates with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration.
S605: if described matching result is for occurring without coupling prefix, then will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node of nothing coupling prefix as the next hop information of described routing address to be found.
For Fig. 5 c, the situation in S604 and S605 is illustrated.Assume that routing address to be found is 00111010011, search multidigit tree shown in Fig. 5 c, from first order T21, finding PLPM is 00*, according to the T21 bitmap preserved and this routing address to be found, determine second level P23, the PLPM found in P23 is 00111010*, according to the P23 bitmap preserved and described routing address to be found, determine third level P7, the PLPM found out in P7 is 001110100*, corresponding prefix p10, using the p10 next hop information of preservation as the next hop information of described routing address to be found.This lookup situation is similar to S604.
If described routing address to be found is 00111010111.In search procedure, the determined second level is also P23, the PLPM found in P23 is 00111010*, according to the P23 bitmap preserved and described routing address to be found, determine third level P7, but the matching result in third level P7 is five coupling prefixes, therefore by the PLPM of P7, namely in P23 the next hop information of the prefix of p27 as the next hop information of described routing address to be found.This lookup situation is similar to S605.
Next, further describe a kind of method simplifying multidigit tree construction that the embodiment of the present invention provides, optionally, using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
Illustrate, when Trie structure is relatively simple, can be in same single connection structure Trie node preserve multiple accordingly as a node, when Trie node be list connect time, it is possible to be a Skip node by multistage Trie Node compression.One Skip node can have maximum 2Step-lengthIndividual Trie child node and maximum 1 Prefix child node.Described by accompanying drawing, the structural representation of a kind of Skip node that Fig. 7 provides for the embodiment of the present invention.As it is shown in fig. 7, the broken box of triangle has four Trie nodes, there are 4 grades of Trie node lists to connect, and the subtree in every one-level Trie node has prefix.In such a case, it is possible to the Trie node that multistage list is connected is placed in a Skip node, and all of prefix is compressed in 1 Prefix child node.For Skip node, the structure for indexing Trie child node is identical with general T rie node；And the structure for indexing Prefix child node has only to the address of 1 bitmap and child node.
It follows that the embodiment of the present invention additionally provides the mode of the next hop information of route prefix in a kind of preferred route prefix preserved in PLPM, corresponding Trie node and corresponding Trie node.Optionally, described Prefix node passes through at least one prefix bunch (PrefixCLuster, PCL) next hop information of route prefix, described PCL and Trie node one_to_one corresponding in storage PLPM, route prefix in corresponding Trie node and corresponding Trie node.
Each PCL is made up of 3 parts: the number of (1) preposition segmentation；(2) bitmap of prefix is represented；(3) preposition segmentation.Wherein, (1) and the figure place shared by (2) are fixing, form PCLHeader.The length of the number by preposition segmentation of the figure place shared by preposition segmentation and each segmentation, namely step-length determines.Illustrated by accompanying drawing, the schematic diagram of the coded method of a kind of Prefix node that Fig. 8 provides for the embodiment of the present invention.Wherein, Trie node shown in Fig. 8 includes 4 Trie nodes, respectively T1, T2, T3 and T4, including 6 route prefix, respectively the prefix of p1 is the prefix of 1*, p2 is 00101*, the prefix of p3 is 10101*, the prefix of p4 is the prefix that prefix is 0010011*, p6 of 10111*, p5 is 00100101*.The each Trie node comprised has a PCL1 corresponding for corresponding PCL, T1 and includes PCL2 corresponding to p1, T2 and include PCL3 corresponding to p2, the T3 PCL4 including p3 and p4, T4 corresponding and include p5 and p6.The form of PCL can be as shown in table 1:
| PCL1:0000100 |
| PCL2:001,0010000 |
| PCL3:101,1010000 |
| PCL4:001,001,0010100 |
Table 1
7 bit digital in table 1 are the bitmap of correspondence.3 bit digital are corresponding prefix.
Assume that Prefix node is 256, each down hop confidence (REIndex) accounts for 20, then comprise the structure of the Prefix node of 6 prefixes in example as shown in Figure 8 as it is shown in figure 9, the node structure schematic diagram of a kind of Prefix node that provides for the embodiment of the present invention of Fig. 9.Wherein, SegNum is for identifying the number of preposition segmentation in this PCL；PrefixBitmap is for representing in this PCL, which prefix is to exist；Seg0～segn preserves the preposition segmentation of PCL.
Embodiment two
The structure drawing of device of a kind of data processing equipment that Figure 10 provides for the embodiment of the present invention, is applied to multidigit tree, and described multidigit tree includes multiple route prefix, and described data processing equipment 1000 includes:
nullAcquiring unit 1001，Structure for obtaining described multidigit tree includes at least one tree Trie node and corresponding prefix Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes current longest prefix match PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node.
It should be noted that each Trie node has an associated prefixes.In the same manner, each Prefix node also has an associated prefixes.The associated prefixes of the direct Prefix node of one Trie node is identical with the associated prefixes of this Trie node；The associated prefixes of the non-immediate Prefix node of one Trie node, the associated prefixes with corresponding Trie node is identical.The associated prefixes of the associated prefixes of the Trie child node of one Trie node and its non-immediate Prefix node is different.Described acquiring unit 1001 can be implemented in embodiment one such as the method for S301.Here repeat no more.
Iteration unit 1002, is used for being iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
Described iteration unit 1002 can be implemented in embodiment one such as the method for S302.Here repeat no more.
The next hop information of correspondence is also directly provided in the Prefix node provided in the embodiment of the present invention, further decreases memory access number of times.
The method identical with first multidigit tree can be adopted for second multidigit tree, using all of Prefix node as the one-level searching streamline, and their associated prefixes is inserted in the 3rd multidigit tree as new prefix.The rest may be inferred, by creating many multidigit trees, namely carries out successive ignition, and to the last a multidigit tree is smaller, it is possible to till being placed in cache.Final lookup structure is made up of last Trie node and multistage Prefix node.
For described preset capacity it should be noted that described preset capacity determines according to the cache size of the system of process.In general, if the cacheline of CPU is 512, then the maximum of Prefix node can be set to 512, to improve memory access efficiency.
As can be seen from the above-described embodiment, by the iterative operation to multidigit tree, make the total capacity of the multidigit tree after iteration less than or equal to preset capacity, it is more suitable for depositing in buffer memory, and the Prefix node of the multidigit tree after iteration directly saves the next hop information of route prefix in current longest prefix match PLPM and corresponding Trie node, make to directly obtain when obtaining matching result the next hop information of correspondence in the process of route querying, reduce and also need to memory access again to obtain the process of next hop information originally when searching, thereby reduce the memory access number of times of route querying, decrease the cache number of times lost efficacy, directly enhance search efficiency.
Next by how using the route querying structure that embodiment is set up as shown in Figure 10 to carry out route querying.On the basis of embodiment corresponding to Figure 10, the structure drawing of device of a kind of device for searching route that Figure 11 provides for the embodiment of the present invention, described device for searching route 1100 includes:
Receive unit 1101, be used for obtaining routing address to be found.
Matching unit 1102, multidigit tree for obtaining from last iteration according to described routing address to be found proceeds by longest prefix match LPM, and the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree；
Described matching unit is additionally operable to be circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration；
If the described matching result of described matching unit 1102 is the Prefix node in the multidigit tree before matching non-iteration, determine unit 1103, for next hop information as described routing address to be found of the next hop information of route prefix that will mate with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration；
If the described matching result of described matching unit 1102 is for occurring without coupling prefix, described determine that unit 1103 is additionally operable to will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node without coupling prefix as the next hop information of described routing address to be found.
Determine that unit 1103 illustrates for Fig. 5 c to described.Assume that routing address to be found is 00111010011, search multidigit tree shown in Fig. 5 c, from first order T21, finding PLPM is 00*, according to the T21 bitmap preserved and this routing address to be found, determine second level P23, the PLPM found in P23 is 00111010*, according to the P23 bitmap preserved and described routing address to be found, determine third level P7, the PLPM found out in P7 is 001110100*, corresponding prefix p10, using the p10 next hop information of preservation as the next hop information of described routing address to be found.This lookup situation is similar to the operation of described matching unit 1102 when Prefix node in the multidigit tree that the described matching result of described matching unit 1102 is before matching non-iteration.
If described routing address to be found is 00111010111.In search procedure, the determined second level is also P23, the PLPM found in P23 is 00111010*, according to the P23 bitmap preserved and described routing address to be found, determine third level P7, but the matching result in third level P7 is five coupling prefixes, therefore by the PLPM of P7, namely in P23 the next hop information of the prefix of p27 as the next hop information of described routing address to be found.This lookup situation is similar to the operation of described matching unit 1102 when the described matching result of described matching unit 1102 is for occurring without coupling prefix.
Next, further describe a kind of device simplifying multidigit tree construction that the embodiment of the present invention provides, optionally, on the basis of embodiment corresponding to Figure 10, the structure drawing of device of a kind of data processing equipment that Figure 12 provides for the embodiment of the present invention, described data processing equipment 1000 also includes:
Processing unit 1003, for using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
Illustrate, when Trie structure is relatively simple, can be in same single connection structure Trie node preserve multiple accordingly as a node, when Trie node be list connect time, it is possible to be a Skip node by multistage Trie Node compression.One Skip node can have maximum 2Step-lengthIndividual Trie child node and maximum 1 Prefix child node.For Skip node, the structure for indexing Trie child node is identical with general T rie node；And the structure for indexing Prefix child node has only to the address of 1 bitmap and child node.
It follows that the embodiment of the present invention additionally provides the mode of the next hop information of route prefix in a kind of preferred route prefix preserved in PLPM, corresponding Trie node and corresponding Trie node.Optionally, described Prefix node stores the route prefix in PLPM, corresponding Trie node and the next hop information of route prefix, described PCL and Trie node one_to_one corresponding in corresponding Trie node by least one PCL.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can be completed by the hardware that programmed instruction is relevant, foregoing routine can be stored in a computer read/write memory medium, this program upon execution, performs to include the step of said method embodiment；And aforesaid storage medium can be at least one in following medium: the various media that can store program code such as read only memory (Read-OnlyMemory, ROM), RAM, magnetic disc or CDs.
It should be noted that each embodiment in this specification all adopts the mode gone forward one by one to describe, between each embodiment identical similar part mutually referring to, what each embodiment stressed is the difference with other embodiments.Especially for equipment and system embodiment, owing to it is substantially similar to embodiment of the method, so describing fairly simple, relevant part illustrates referring to the part of embodiment of the method.Equipment described above and system embodiment are merely schematic, the unit wherein illustrated as separating component can be or may not be physically separate, the parts shown as unit can be or may not be physical location, namely may be located at a place, or can also be distributed on multiple NE.Some or all of module therein can be selected according to the actual needs to realize the purpose of the present embodiment scheme.Those of ordinary skill in the art, when not paying creative work, are namely appreciated that and implement.
The above is only the preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.It should be pointed out that, for those skilled in the art, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications also should be regarded as protection scope of the present invention.
Claims (10)
1. a data processing method, it is characterised in that being applied to multidigit tree, described multidigit tree includes multiple route prefix, and described method includes:
nullThe structure obtaining described multidigit tree includes at least one tree Trie node and corresponding prefix Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes current longest prefix match PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node；
It is iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
2. method according to claim 1.It is characterized in that, also include:
Obtain routing address to be found；
Proceeding by longest prefix match LPM according to the multidigit tree that described routing address to be found obtains from last iteration, the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree；
It is circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration；
If described matching result is the Prefix node in the multidigit tree before matching non-iteration, then using next hop information as described routing address to be found of the next hop information of route prefix that mates with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration；
If described matching result is for occurring without coupling prefix, then will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node of nothing coupling prefix as the next hop information of described routing address to be found.
3. method according to claim 1, it is characterised in that also include:
Using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
4. method according to claim 1, it is characterised in that also include:
Described Prefix node stores the route prefix in PLPM, corresponding Trie node and the next hop information of route prefix, described PCL and Trie node one_to_one corresponding in corresponding Trie node by least one prefix bunch PCL.
5. the method according to any one of Claims 1-4, it is characterised in that
Described preset capacity determines according to the cache size of the system of process.
6. a data processing equipment, it is characterised in that being applied to multidigit tree, described multidigit tree includes multiple route prefix, and described data processing equipment includes:
nullAcquiring unit，Structure for obtaining described multidigit tree includes at least one tree Trie node and corresponding prefix Prefix node，The capacity of described Prefix node is less than or equal to preset capacity，Described Prefix node includes current longest prefix match PLPM、Route prefix in corresponding Trie node and the next hop information of route prefix in corresponding Trie node，Oneth Trie node is the arbitrary Trie node at least one Trie node described，A described Trie node includes the bitmap of correspondence，The Prefix node that a described Trie node is corresponding includes direct Prefix node and non-immediate Prefix node，Described direct Prefix node includes the route prefix in a described Trie node、The next hop information of route prefix in the PLPM of described direct Prefix node and a described Trie node，Described non-immediate Prefix node includes the route prefix in the Trie node connected under a described Trie node、The next hop information of route prefix in the Trie node connected under the PLPM of described non-immediate Prefix and a described Trie node；
Iteration unit, is used for being iterated operation, until the total capacity of the multidigit tree obtained after iteration is less than or equal to described preset capacity；
Once described iterative operation particularly as follows:
The associated prefixes of the Prefix node that utilization obtains sets up new multidigit tree, obtains Trie node and corresponding Prefix node corresponding bitmap before corresponding preservation current iteration according to the structure of described new multidigit tree.
7. device according to claim 6.It is characterized in that, also include:
Receive unit, be used for obtaining routing address to be found；
Matching unit, multidigit tree for obtaining from last iteration according to described routing address to be found proceeds by longest prefix match LPM, and the bitmap comprised according to the Prefix node matched and described routing address to be found determine the Prefix node in last iteration in multidigit tree；
Described matching unit is additionally operable to be circulated coupling, until matching result is the Prefix node in the multidigit tree before matching non-iteration or occurs without coupling prefix；
Described circulation coupling particularly as follows:
Bitmap and described routing address to be found that the Prefix node that multidigit tree coupling according to acquisition in iv-th iteration obtains comprises determine the Prefix node in the multidigit tree obtained in the N-1 time iteration；
If the described matching result of described matching unit is the Prefix node in the multidigit tree before matching non-iteration, determine unit, for next hop information as described routing address to be found of the next hop information of route prefix that will mate with described routing address to be found in the Prefix node in the multidigit tree before described non-iteration；
If the described matching result of described matching unit is for occurring without coupling prefix, described determine that unit is additionally operable to will appear from the next hop information of route prefix corresponding to the PLPM of the Prefix node without coupling prefix as the next hop information of described routing address to be found.
8. device according to claim 6, it is characterised in that also include:
Processing unit, for using the multiple Trie nodes in same single connection structure in multidigit tree as a Trie node processing, described single connection structure is specifically included in the attachment structure of described multidigit tree lower of Trie node and connects the structure of a Trie node.
9. device according to claim 6, it is characterised in that
Described Prefix node stores the route prefix in PLPM, corresponding Trie node and the next hop information of route prefix, described PCL and Trie node one_to_one corresponding in corresponding Trie node by least one prefix bunch PCL.
10. the device according to any one of claim 6 to 9, it is characterised in that
Described preset capacity determines according to the cache size of the system of process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851108.1A CN105812258B (en) | 2014-12-31 | 2014-12-31 | A kind of data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851108.1A CN105812258B (en) | 2014-12-31 | 2014-12-31 | A kind of data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105812258A true CN105812258A (en) | 2016-07-27 |
| CN105812258B CN105812258B (en) | 2019-02-12 |
Family
ID=56421526
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410851108.1A Expired - Fee Related CN105812258B (en) | 2014-12-31 | 2014-12-31 | A kind of data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105812258B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111953606A (en) * | 2020-07-14 | 2020-11-17 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7212531B1 (en) * | 2001-11-27 | 2007-05-01 | Marvell Semiconductor Israel Ltd. | Apparatus and method for efficient longest prefix match lookup |
| CN101459569A (en) * | 2008-12-12 | 2009-06-17 | 华为技术有限公司 | Method, apparatus for establishing route index tree and method, apparatus for searching route index tree |
| CN103051543A (en) * | 2012-11-01 | 2013-04-17 | 广州微仕科信息技术有限公司 | Route prefix processing, lookup, adding and deleting method |
-
2014
- 2014-12-31 CN CN201410851108.1A patent/CN105812258B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7212531B1 (en) * | 2001-11-27 | 2007-05-01 | Marvell Semiconductor Israel Ltd. | Apparatus and method for efficient longest prefix match lookup |
| CN101459569A (en) * | 2008-12-12 | 2009-06-17 | 华为技术有限公司 | Method, apparatus for establishing route index tree and method, apparatus for searching route index tree |
| CN103051543A (en) * | 2012-11-01 | 2013-04-17 | 广州微仕科信息技术有限公司 | Route prefix processing, lookup, adding and deleting method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111953606A (en) * | 2020-07-14 | 2020-11-17 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
| CN111953606B (en) * | 2020-07-14 | 2022-06-21 | 锐捷网络股份有限公司 | Routing iteration loop detection method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105812258B (en) | 2019-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102484610B (en) | Routing table construction method and device and routing table lookup method and device | |
| CN101577662B (en) | Method and device for matching longest prefix based on tree form data structure | |
| CN108446376B (en) | Data storage method and device | |
| CN111190904B (en) | Method and device for hybrid storage of graph-relational database | |
| US20140188885A1 (en) | Utilization and Power Efficient Hashing | |
| JP4669067B2 (en) | Dynamic fragment mapping | |
| CN102122285B (en) | Data cache system and data inquiry method | |
| US7697518B1 (en) | Integrated search engine devices and methods of updating same using node splitting and merging operations | |
| CN103561133B (en) | A kind of IP address attribution information index method and method for quickly querying | |
| US7747599B1 (en) | Integrated search engine devices that utilize hierarchical memories containing b-trees and span prefix masks to support longest prefix match search operations | |
| CN102333036B (en) | Method and system for realizing high-speed routing lookup | |
| CN103051543A (en) | Route prefix processing, lookup, adding and deleting method | |
| US7162481B2 (en) | Method for increasing storage capacity in a multi-bit trie-based hardware storage engine by compressing the representation of single-length prefixes | |
| CN105677683A (en) | Batch data query method and device | |
| CN101667958A (en) | Method for selecting hash function, and method and device for storing and searching routing table | |
| JP2008015872A5 (en) | ||
| CN104866502A (en) | Data matching method and device | |
| US20050083937A1 (en) | IP address lookup method using pipeline binary tree, hardware architecture, and recording medium | |
| CN105975587A (en) | Method for organizing and accessing memory database index with high performance | |
| CN106156070A (en) | A kind of querying method, Piece file mergence method and relevant apparatus | |
| CN106503186A (en) | A kind of data managing method, client and system | |
| WO2015192742A1 (en) | Lookup device, lookup method and configuration method | |
| CN109325022A (en) | A kind of data processing method and device | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| CN105812258A (en) | Method and device for data processing |
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 | ||
| 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: 20190212 Termination date: 20201231 |