CN101335706A - Route table space managing method, apparatus, switch and router - Google Patents
Route table space managing method, apparatus, switch and router Download PDFInfo
- Publication number
- CN101335706A CN101335706A CNA2008101169219A CN200810116921A CN101335706A CN 101335706 A CN101335706 A CN 101335706A CN A2008101169219 A CNA2008101169219 A CN A2008101169219A CN 200810116921 A CN200810116921 A CN 200810116921A CN 101335706 A CN101335706 A CN 101335706A
- Authority
- CN
- China
- Prior art keywords
- space management
- management unit
- space
- mask
- list item
- 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
Images
Abstract
The invention relates to a method, a device, a switch and a router for space management of a routing table. Distribution management to the space of the routing table is carried out by the space management unit in a space management link table so as to lead the entries of layer 3 switches or routers inserted in the routing table to be arranged by the mask (prefix) length in a long-to-short order, ensure that the routing entry with the longest prefix can be matched with the one with the longest mask from the start of the matching, avoid repetitive depositing of the same entry in the routing table and the problem that the routing entry with the largest mask length can not be obtained until all entries in the routing table are matched and greatly increase the search speed of the routing table; besides, arrangement of entries in the routing table by a certain order facilitates fast insertion and deletion of the entries, the space utilization rate of the routing table is significantly improved.
Description
Technical field
The present invention relates to data communication technology, relate in particular to a kind of can improve routing table lookup speed routing table is carried out the method and the device of space management.
Background technology
At present, during another main frame of a certain host access in the internet, (Internet Protocol, IP) address search routing table is routed to destination host according to the purpose Internet Protocol for router or three-tier switch.Routing table is the table that router or other internet networks (three-tier switch) are gone up storage, and in other words, routing table is the continuous space that a monoblock is deposited routing iinformation, and wherein, each bar routing iinformation is known as a route table items.There is the path that arrives the particular network terminal in this table.
In the prior art, when routing table need write a list item, to its space of distributing which piece, being written to which position of routing table, is that the space management unit by this routing table decides.Various routing space management method is arranged on various routers, the three-tier switch.Such as the technology of the leaf pushing that proposes by Srinvasan the earliest, use two trie of branch tree, finish the management of routing space and search by a complicated algorithm.It is exactly to have used tree-like expansion that a lot of space managements based on this method improvement all have characteristics.The purpose of the deposit method of these all routing tables all is to guarantee that routing space can deposit under the situation of route table items of certain entry number, accelerates to add, the speed of deletion route table items and longest prefix match.The simplest routing table model that obtains by said method as shown in Figure 1.Wherein, list item 1, list item 2 ..., the sequence arrangement of the mask-length of list item N and list item is irrelevant.
When searching routing table, router or three-tier switch are selected the route inlet by longest prefix match (Longest prefixmatch) algorithm, that is, mate, from the list item of coupling, select the longest list item of mask-length to enter the mouth as route by list item and purpose IP address.Mask-length is meant in the subnet mask (prefix), the number of the binary digit 1 that the left side is continuous.Such as:
Subnet mask 255.0.0.0 binary system is 11111111000000000000000000000000, and then mask-length is 8;
Subnet mask 255.255.0.0 binary system is 11111111111111111111111100000000, and then mask-length is 24.
As shown in Figure 2, suppose that computer 23 will visit the computer 21 that the IP address is 10.0.2.2, router/three-tier switch 24 finally will match it second list item in routing table, visits computer 21 by network B.This be since the IP address 10.0.2.2 that will visit and subnet mask 255.255.255.0 with after equal with purpose network address 10.0.2.0, and mask-length the longest (24).In like manner visiting the IP address is the computer 22 of 10.0.3.2, must match the 3rd list item of routing table, thereby visit computer 22 by network C.
Because list item sequence independence in each list item mask-length in the routing table and the routing table, therefore, when router or three-tier switch are searched the list item of coupling, by list items all in all routing tables is mated, determine the list item that mask-length is the longest and mate at last, cause routing table lookup efficient to be restricted, can't further improve; List item in the routing table is managed in tree-like mode, though making router or three-tier switch only mate one of them branch, tree-like way to manage just can obtain lookup result, but, use the routing table of tree-like way to manage often to duplicate the problem of depositing same list item, cause routing table to can not get abundant reasonable use.
Summary of the invention
The objective of the invention is to propose a kind of routing table is carried out method, device, switch and the router of space management,, further improve the list item seek rate with when improving the routing table space availability ratio.
For achieving the above object, the invention provides and a kind of routing table is carried out the method for space management, comprising:
Calculating is inserted into the mask-length of list item;
Space management unit in the traversal space management chained list; In the described space management chained list, each space management unit is corresponding one by one with mask-length, manages the list item identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking of correspondence;
Obtain and the described corresponding space management unit of mask-length that is inserted into list item, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into.
For achieving the above object, the present invention also provides a kind of routing table has been carried out the device of space management, comprising:
Computing unit is used to calculate the mask-length that is inserted into list item;
The space management chained list is used for the storage space management unit, and in the described space management chained list, corresponding one by one with mask-length between each space management unit, the list item of storage is identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking;
Travel through the unit, be used for traveling through the space management unit of described space management chained list;
Acquiring unit is used to obtain and the described corresponding space management unit of mask-length that is inserted into list item;
Insert the unit, be used for the space management unit that obtains according to described acquiring unit, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into.
For achieving the above object, the present invention also provides a kind of above-mentioned three-tier switch and router that routing table is carried out the device of space management that comprise.
In the technique scheme, three-tier switch or router carry out allocation manager by the space management unit in the space management chained list to the route table space, make the list item that inserts in the routing table arrange according to mask (prefix) length order from long to short, guaranteed that longest prefix match just can match the longest mask-length route table items at the beginning, avoided same list item repeating in routing table to deposit, and could obtain the longest mask-length route table items after all list items in the routing table are mated, improved routing table lookup speed greatly; Simultaneously the list item in the routing table also helps the quick insertion and the deletion of list item according to certain sequence arrangement, has improved the space availability ratio of routing table greatly.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Fig. 1 is a list item storage configuration schematic diagram for routing table model of the prior art;
Fig. 2 is the Internet architecture schematic diagram;
Fig. 3 carries out the structural representation of lpm_state_list among the method embodiment of space management to routing table for the present invention;
Fig. 4 carries out the flow chart of the method embodiment one of space management to routing table for the present invention;
Fig. 5 carries out the flow chart of the method embodiment two of space management to routing table for the present invention;
Fig. 6 carries out the flow chart that the space is adjusted among the method embodiment of space management for the present invention to routing table;
Fig. 7 carries out the flow chart of remove entries among the method embodiment of space management to routing table for the present invention;
Fig. 8 carries out the structural representation of the device embodiment of space management to routing table for the present invention.
Embodiment
In order to manage this part routing table, can be that the space management chained list writes down the operating position of each mask (prefix) length to routing table by a space management unit (lpm_state) array, promptly list item is left in the routing table by mask-length.
The length of this array can be 34, be that each IPV4 mask (prefix) length takies one for lpm_state, promptly, an all corresponding mask (prefix) length of each lpm_state, and IPV4 mask (prefix) length is from 0～32, corresponding lpm_state[0]～lpm_state[32], account for 33 lpm_state altogether, add a lpm_state[33 who is used to manage], account for 34 lpm_state altogether.
Each lpm_state can write down following information:
The start address of route table items in routing table of mask (prefix) length records of the current lpm_state correspondence of start;
The end address of route table items in routing table of mask (prefix) length records of the current lpm_state correspondence of end;
The mask-length of the previous lpm_state correspondence of prev;
The mask-length of a lpm_state correspondence behind the next;
The number of the route table items of the mask-length of this lpm_state correspondence in the vent routing table;
This lpm_state of fent free space under one's name, promptly the space of this lpm_state management can also write the number of list item.
The array (lpm_state_array) of whole space management unit can be regarded as a doubly linked list (lpm_state_list) in logic.The structure of whole lpm_state_list as shown in Figure 3, last space cell lpm_state[33] be head node.And the index of the next node of each node of lpm_state_list in lpm_state_array is recorded among the Next, and the index of previous node in lpm_state_array is recorded among the prev.And if the value of Next or prev is-1, so just explanation does not have next or previous node.
This lpm_state_list has write down the live part in the array of space management unit, and the space management unit among the lpm_state_list all must sort according to mask-length.
During system initialization, all are carried out following assignment corresponding to the data among the lpm_state of mask-length:
Start＝-1；
End ＝-1；
Prev ＝-1；
Next ＝-1
Vent ＝0；
Fent ＝0。
To the space management unit lpm_state[33 that is used to manage] data carry out following assignment:
Start?＝-1；
End ＝-1；
Prev ＝-1；
Next ＝-1；
Vent ＝0；
Fent=4096 (heap(ed) capacity of routing table).
Behind the system initialization, this lpm_state_list has only a node lpm_state[33].Because lpm_state[33] Fent of initialized value is 4096, so the space of logically all routing tables can be counted as all being occupied by this lpm_state.
The method embodiment that the present invention carries out space management to routing table comprises:
Calculating is inserted into the mask-length of list item;
Space management unit in the traversal space management chained list; In the described space management chained list, corresponding one by one with mask-length between each space management unit, the list item of storage is identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking;
Obtain and the described corresponding space management unit of mask-length that is inserted into list item, and determine the described deposit position of list item in the space management unit that obtains that be inserted into, insert the described list item that is inserted into.
In the present embodiment, routing table is carried out allocation manager by the space management unit in the space management chained list to the space, make the list item that inserts in the routing table arrange according to mask (prefix) length order from long to short, and, use the present embodiment method, the insertion of with good grounds this space management chained list and remove entries operation all can not destroy the order of routing table, guaranteed that longest prefix match just can match the longest mask-length route table items at the beginning, could obtain the longest mask-length route table items after having avoided all list items in the routing table are mated, improve routing table lookup speed greatly; Simultaneously the list item in the routing table also helps the quick insertion and the deletion of list item according to certain sequence arrangement, has improved the space availability ratio of routing table greatly.
Fig. 4 comprises for the present invention carries out the flow chart of the method embodiment one of space management to routing table:
Step 42, to search corresponding mask (prefix) length in lpm_state_list be the lpm_state of LENGTH, i.e. lpm_state[LENGTH], judge that whether lpm_state_list exists management length is the lpm_state[LENGTH of LENGTH list item]; If in lpm_state_list, there is lpm_state[LENGTH], show and give this lpm_state[LENGTH] allocation space, and inserted at least one list item.Therefore the vent value of this space management unit is not 0.As long as judge lpm_state[LENGTH] the vent value whether be 0, just lpm_state[LENGTH as can be known] whether be assigned with the space on the routing table.If be not 0, illustrate to it and distribute space on routing table, it is the list item of LENGTH that the space internal memory is placed with mask (prefix) length, is that new list item is put behind as long as will be inserted into list item, but concrete execution in step 44.If be 0, illustrate also not this lpm_state[LENGTH] adding lpm_state_list, simultaneously also not to the space on its distribution routing table, not having mask (prefix) length in the routing table is the list item of LENGTH, need earlier lpm_state[LENGTH] adding lpm_state_list, the reallocation space is placed on lpm_state[LENGTH to this list item then] first position in space of management, but concrete execution in step 43.
Traversal lpm_state_list, find two adjacent lpm_state, and the mask-length of one of them lpm_state correspondence is greater than LENGTH, the mask-length of another lpm_state correspondence is less than LENGTH, with lpm_state[LENGTH] insert between these two lpm_state, and revise the next value of previous node, the prev value of a back node, lpm_state[LENGTH is set] next and prev value.
Distribute the space of routing table for then this lpm_state.The criterion of allocation space can be used dichotomy, promptly obtains its half fent space to oneself under one's name from previous lpm_state, like this can be so that routing space is assigned on each mask-length fast.Concrete computational process is as follows:
The fent/2 of the previous node of new node fent=;
The end+1 of the previous node of fent/2+ of the previous node of new node start=;
The new node start that new node end=has just calculated;
The fent of the fent-new node that the fent=of previous node is original;
The mask-length of the previous node of prev=of new node;
The next of the previous node of next=of new node;
The mask-length of the next=new node of previous node;
The mask-length of the prev=new node of the node in back;
Remaining value is all constant.
As existing lpm_state[LENGTH] in fent value when being 0, show lpm_state[LENGTH] space of management has been filled with list item, at this moment, further execution in step 46 also: adjust the space that lpm_state manages among the lpm_state_list.
Fig. 5 in the present embodiment, after the supposing the system initialization, need insert a list item for the present invention carries out the flow chart of the method embodiment two of space management to routing table in the routing table of sky.At this moment, lpm_state[33 is only arranged among the lpm_state_list]:
Mask (prefix) length 33
start -1
end -1
next -1
prev -1
vent 0
fent 4096
This moment, next jumped A if insert list item＜destination address 10.0.0.0 mask (prefix) 255.0.0.0 〉; Specifically comprise:
It is 8 that step 51, calculating obtain its mask (prefix) length;
According to the calculating principle of allocation space in the foregoing description one, obtain mask-length and be 8 node lpm_state[8] each value:
Fent=4096 (the fent value of previous node)/2=2048;
Start=4096 (the fent value of previous node)/2+ (1) (the end value of previous node)+1=2048;
end＝start＝2048；
Next=-1 (the next value of previous node);
Prev=33 (mask-length of previous node);
According to above-mentioned calculating principle, obtain mask-length and be 33 node lpm_state[33] each value:
Fent=4096 (original fent)-2048 (the fent value of new node)=2048;
Next=8 (mask-length of new node);
Through above calculating, the space management unit among the lpm_state_list comprises:
Mask (prefix) length 33 8
start -1 2048
end -1 2048
next 4 -1
prev -1 33
vent 0 0
fent 2048 2048
vent＝vent+1＝0+1＝1；
fent＝fent-1＝2048-1＝2047。
At last, the result of lpm_state_list is as follows:
Mask (prefix) length 33 8
start -1 2048
end -1 2048
next 4 -1
prev -1 33
vent 0 1
fent 2048 2047
The result of routing table is as follows:
Next jumping of index destination address mask (prefix)
2048 10.0.0.0 255.0.0.0 A
Next jumps B to suppose to write in routing table list item＜destination address 10.0.0.0 mask (prefix) 255.255.0.0 again 〉.
Because the mask-length of this list item is 16, according to catching up with the algorithm of stating among the embodiment one, the result who successfully writes the lpm_state_list behind this list item is as follows:
Mask (prefix) length 33 16 8
start -1 1024 2048
end -1 1024 2048
next 8 4 -1
prev -1 33 8
vent 0 1 1
fent 1024 1023 2047
The result who writes the routing table behind this list item is as follows:
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
2048 10.0.0.0 255.0.0.0 A
Next jumps C to suppose to write list item＜destination address 20.0.0.0 mask (prefix) 255.0.0.0 to routing table again 〉.
Because this list item mask-length is 8, and corresponding mask-length has been arranged among the lpm_state_list is 8 space management unit, thereby, do not need to insert new node, only need to determine the writing position of this list item.According to catching up with the algorithm of stating among the embodiment one, insert this list item after, the result of lpm_state_list is as follows:
Mask (prefix) length 33 16 8
start 1 1024 2048
end 1 1024 2049
next 8 4 -1
prev -1 33 8
vent 0 1 2
fent 1024 1023 2046
After inserting this list item, the result of routing table is as follows:
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
2048 10.0.0.0 255.0.0.0 A
2049 20.0.0.0 255.0.0.0 C
Next jumps D to suppose to write at last a list item＜destination address 0.0.0.0 mask (prefix) 0.0.0.0 〉.
Because this list item mask-length is 0, according to the algorithm in the foregoing description one, it is as follows to insert behind this list item the result of lpm_state_list:
Mask (prefix) length 33 16 80
start -1 1024 2048 3073
end -1 1024 2049 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1 2 1
fent 1024 1023 1023 1022
It is as follows to insert behind this list item the result of routing table:
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
2048 10.0.0.0 255.0.0.0 A
2049 20.0.0.0 255.0.0.0 C
3073 0.0.0.0 0.0.0.0 D
Lpm_state_list is the chained list with the mask-length ordering, wherein with LPM_STATE[33] be head node, when determining the insertion position of list item, according to the mask-length traversal lpm_state_list that is inserted into list item, can safeguard the order of list item in lpm_state_list and the routing table, thereby guarantee that three-tier switch or router can find routing iinformation fast.
Fig. 6 carries out the flow chart that the space is adjusted among the method embodiment of space management for the present invention to routing table.Method in using said method embodiment is when routing table is frequently added list item; this situation of list item has all been deposited in the space that the lpm_state management of a certain mask-length correspondence usually can take place, but the space of the lpm_state of other mask-length correspondences management also has clear position.Need adjust this moment to the space of space management unit and management thereof, utilizes the routing table space with maximum.
Suppose that present case is:
Mask (prefix) length 33 16 80
start -1 1024 2048 3073
end -1 2047 3072 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1024 1025 1
fent 1024 0 0 1022
Current mask-length is that 16 lpm_state and mask-length are that the fent of 8 lpm_state is 0, shows that lpm_state does not have free space to use under one's name.But mask-length is 33 lpm_state, still also has 1024 free spaces.If also having mask-length this moment is 16 or 8 list item etc. when being inserted into, will find insufficient space, to carry out the adjustment of list item this moment, guarantee the routing table utilization of space.
The space of adjusting lpm_state and management thereof mainly comprises:
Seek earlier remaining space forward or backward, searching fent is not 0 lpm_state;
With the free space of this lpm_state, move to step by step under the lpm_state that needs free space.
Next jumps C to suppose to need to insert list item＜destination address 110.0.0.0 mask (prefix) 255.0.0.0 〉, the mask-length of this list item is 8, and mask-length is that the fent value of 8 lpm_state is 0 among the lpm_state_list, and the process that the list item in lpm_state_list and the routing table is adjusted is:
Step 61, earlier forward, promptly to mask-length greater than 8 direction, search idle space, find lpm_state[33] have the spaces of 1024 free time.
Earlier with lpm_state[33 among the lpm_state_list] fent deduct 1, again with lpm_state[16] start deduct 1, this moment lpm_state[16] actually have 1025 spaces, taken 1024, also idle one.This free space is from lpm_state[33] move and come, the index in routing table is 1023.
Then with position of the whole reach of the list item in the 1024th to 2047 in the routing table, this moment lpm_state[16] start in list item be copied to the position of the 1023rd list item, lpm_state[16] the end value in list item be copied to the position of the 2046th list item, be positioned at space free time of position of the index 2047 of routing table like this, simultaneously lpm_state[16] the end value subtract 1.Obtain lpm_state_list:
Mask (prefix) length 33 16 80
start -1 1023 2048 3073
end -1 2046 3072 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1024 1025 1
fent 1023 1 0 1022
Because needing the mask-length of the list item of insertion is 8, so also need to continue to do to move to adjust.
In like manner, with lpm_state[16] fent deduct 1, lpm_state[8] start also deduct 1, this moment lpm_state[16] actually have 1024 spaces, taken 1024, do not have free space.And lpm_state[8] actually have 1026 spaces, wherein, taken 1025, the another one space is from lpm_state[16] move and come, the index in routing table is 2047.
Then with position of the whole reach of the list item in the 2048th to 3072 in the routing table, this moment lpm_state[8] start in list item be copied to the position of the 2047th list item, lpm_state[8] the end value in list item be copied to the position of the 3071st list item, be positioned at space free time of position of the index 3072 of routing table like this, simultaneously lpm_state[16] the end value subtract 1.Obtain lpm_state_list:
Mask (prefix) length 33 16 80
start -1 1023 2047 3073
end -1 2046 3071 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1024 1025 1
fent 1023 0 1 1022
At this moment, new list item just can insert lpm_state[8 smoothly] free space that obtains, i.e. 3072 these positions in the routing table.Obtain following final result:
Mask (prefix) length 33 16 80
start -1 1023 2047 3073
end -1 2047 3073 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1024 1026 1
fent 1023 0 0 1022
Do not have free space if search forward, can search backward so, promptly search less than 8 direction to mask-length.Find operating process and said process behind the free space similar.
The mobile adjustment in space also can be searched earlier backward, if do not find between the free time, searches forward again, and method and said process are similar.
Routing table also may need to delete list item wherein after inserting list item sometimes.
Fig. 7 carries out the flow chart of remove entries among the method embodiment of space management to routing table for the present invention.
When step 71, list item of deletion, at first to obtain the index value and the mask-length of this list item.
Step 72, can know the position of this list item in routing table, delete this list item according to index value.
Step 73, safeguard the lpm_state of this list item mask-length correspondence, and its fent value is added 1, vent deducts 1, judges to subtract whether 1 back vent is 0; If VENT is not 0, execution in step 74; If vent is 0, execution in step 75.
Step 74, the list item of depositing in the end position of the lpm_state of this list item mask-length correspondence management is copied to the position of remove entries, then the end value is deducted 1, finish deletion action.
The institute that the lpm_state of this list item mask-length correspondence is distributed in step 75, recovery has living space, and previous lpm_state is all distributed in the whole spaces that will reclaim, lpm_state from this list item mask-length correspondence of lpm_state_list the inside deletion finishes deletion action.
Suppose that the situation as lpm_state_list is as follows:
Mask (prefix) length 33 16 80
start -1 1024 2048 3073
end -1 1024 2049 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1 2 1
fent 1024 1023 1023 1022
The situation of preceding routing table is as follows:
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
2048 10.0.0.0 255.0.0.0 A
2049 20.0.0.0 255.0.0.0 C
3073 0.0.0.0 0.0.0.0 D
At this moment, next jumping A of remove entries＜destination address 10.0.0.0 mask (prefix) 255.0.0.0 〉.
The index value that at first obtains this list item is 2048, and mask-length is 8.
Delete the list item that deposit the 2048th position in the routing table then, lpm_state[8] the fent value add 1, be 0 after vent deducts 1, so the list item of depositing in the 2049th position is copied to the position of the 2048th list item, then the end value is deducted 1, the lpm_state_list situation that obtains is as follows:
Mask (prefix) length 33 16 80
start -1 1024 2048 3073
end -1 1024 2048 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1 1 1
fent 1024 1023 1024 1022
The routing table situation that obtains is as follows:
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
2048 20.0.0.0 255.0.0.0 C
3073 0.0.0.0 0.0.0.0 D
Next jumps A if continue remove entries＜destination address 20.0.0.0 mask (prefix) 255.0.0.0 〉.
The index value of this list item is 2048, and mask-length is 8.
Delete after this list item lpm_state[8] the fent value add 1, be 0 after vent deducts 1, reclaim and to distribute to lpm_state[8] all spaces.
Situation before reclaiming is as follows:
Mask (prefix) length 33 16 80
start -1 1024 2048 3073
end -1 1024 2047 3073
next 8 4 0 -1
prev -1 33 8 0
vent 0 1 0 1
fent 1024 1023 1025 1022
Next jumping of index destination address mask (prefix)
1024 10.0.0.0 255.255.0.0 B
3073 0.0.0.0 0.0.0.0 D
During recovery, lpm_state[8] all free spaces, all distributing to previous lpm_state is lpm_state[16], and lpm_state[8] from lpm_state_list the inside deletion.And:
The fent+ of the last node of fent=of last node is recovered the fent of node, in the present embodiment, lpm_state[16] fent=lpm_state[16] fent+lpm_state[8] fent.
Result after the recovery is as follows:
Mask (prefix) length 33 16 0
start -1 1024 3073
end -1 1024 3073
next 8 0 -1
prev -1 33 0
vent 0 1 1
fent 1024 2048 1022
After deleting route table items in the routing table by above method embodiment, the information of the information of space management unit record and routing table reality is still corresponding, thereby has guaranteed that inserting operation can find correct insertion position next time.
Fig. 8 carries out the structural representation of the device embodiment of space management for the present invention to routing table, and the device that routing table is carried out space management comprises: computing unit 81, space management chained list 82, traversal unit 83, acquiring unit 84 and insert unit 85.Computing unit 81 is used to calculate the mask-length that is inserted into list item; Space management chained list 82 is used for the storage space management unit, and in the described space management chained list 82, corresponding one by one with mask-length between each space management unit, the list item of storage is identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking; Traversal unit 83 is used for traveling through the space management unit of described space management chained list 82; Acquiring unit 84 is used to obtain and the described corresponding space management unit of mask-length that is inserted into list item; Insert unit 85 and be used for the space management unit that obtains according to described acquiring unit 84, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into.
Inserting unit 85 can comprise: deposit subelement and computation subunit.Depositing subelement is used for the described list item that is inserted into is left in the end space that adds after 1; Computation subunit is used for the end value of the described space management unit that obtains is added 1; And the vent value in the described space management unit that obtains added 1.
The device that routing table is carried out space management also can comprise the unit is set, be used for not existing under the situation of the space management unit corresponding with the described mask-length that is inserted into list item at described space management chained list, the described space management unit that is inserted into the mask-length correspondence of list item is set in described space management chained list, distributes the routing table space; Described insertion unit 85 also can be used for determining the described deposit position that is inserted into list item according to the described space management unit that the unit setting is set, inserts the described list item that is inserted into.
The unit is set can be comprised: search subelement, distribute subelement and safeguard subelement.Search subelement and be used to find corresponding mask-length, and therefrom obtain the corresponding the shortest space management unit of mask-length greater than the described space management unit that is inserted into list item; The part free space that distributes subelement to be used for the space management Single Component Management that the mask-length of described correspondence is the shortest is distributed to space management unit to be provided with; Safeguard subelement, the start that is used for space management unit described to be provided with is set to the remaining free space of end++1 of the shortest space management unit of the mask-length of described correspondence; The end of space management unit described to be provided with is set to the value identical with the start of this space management unit; The prev of space management unit described to be provided with is set to the mask-length of the shortest space management unit correspondence of the mask-length of described correspondence; The next of space management unit described to be provided with is set to the value of next in the shortest space management unit of the mask-length of described correspondence; The fent of space management unit described to be provided with is set to described part free space.
The described subelement of safeguarding also can be used for the mask-length that next in the shortest space management unit of the mask-length of described correspondence is set to described insertion list item; The described subelement of searching also can be used for obtaining mask-length corresponding in the described space management chained list less than the described space management unit that is inserted into list item, and therefrom obtains the corresponding the longest space management unit of mask-length; The described prev that safeguards that subelement also can be used in the longest space management unit of the mask-length of described correspondence is set to the described mask-length that is inserted into list item.
When the space management unit that is inserted into list item mask-length correspondence newly added the space management chained list, described insertion unit also can be used for being inserted in the start space that list item leaves space management unit described to be provided with in described; Described maintenance unit also can be used for the fent value of space management unit described to be provided with is subtracted 1.
When no free space can insert in the space management unit of the described mask-length correspondence that is inserted into list item, the device that routing table is carried out space management can comprise that also the space searches unit and adjustment unit.The space search the unit be used for before or after the space managed, space management unit search free space; Adjustment unit is used for moving by integral body, will have the part free space of the space management Single Component Management of free space, distributes to the described space management unit that is inserted into the mask-length correspondence of list item.At this moment, described insertion unit also can be used for being inserted in the free space that list item insert to distribute described, and the end value of the space management unit of the described mask-length correspondence that is inserted into list item is added 1.
Described adjustment unit can comprise: mover unit and safeguard subelement.
The mover unit is used for list item that the described space management unit that is inserted into the mask-length correspondence of list item is managed, and and described space management unit with free space between the space management unit list item integral body of being managed move forward a space; Perhaps
The list item that is used for the space management unit between the space management unit of the described mask-length correspondence that is inserted into list item and the described space management unit with free space is managed, and the described space management unit list item integral body of being managed with free space move a space backward;
Safeguard that subelement is used for described fent value with space management unit of free space is subtracted 1.
When the list item in the deletion routing table, described acquiring unit 84 also can be used for obtaining the index value for the treatment of that remove entries is deposited; At this moment, the device that routing table is carried out space management also can further comprise: delete cells and maintenance unit.Delete cells is used to delete the described remove entries for the treatment of; Maintenance unit is used for the described fent value of the space management unit under the remove entries for the treatment of is added 1, and the vent value subtracts 1, and the list item in the end space is stored in the described address space for the treatment of remove entries, and the end value is subtracted 1.
Described delete cells also is used in describedly treats that vent value in the space management unit under the remove entries is after subtracting 1 at 0 o'clock, deletes the described space management unit for the treatment of under the remove entries from described space management chained list; Described adjustment unit also can be used for managing to previous space management unit described all allocation of space of the space management Single Component Management under the remove entries for the treatment of; Described maintenance unit also can be used for the fent value of described previous space management unit is added the above all space.
Three-tier switch or router can comprise that any one that provide among the said apparatus embodiment carries out the device of space management to routing table, to improve the routing table lookup speed of three-tier switch or router.
Three-tier switch or router are by said method and device embodiment, make the route table items in the routing table present a kind of orderly ordered state, list item in the routing table sorts from long to short according to mask-length and deposits, promptly, the long more list item of mask (prefix) length is in front more, the short more list item of mask (prefix) length is in back more, so as long as travel through one by one from top to bottom, skip empty list item, first matches is the list item of longest prefix match certainly, improve the matching speed of longest prefix match greatly, and be more suitable for the routing module of three-tier switch.And, this way to manage of routing table also make routing table maintenance and search also suitable fast, improved the space availability ratio of routing table simultaneously greatly.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (18)
1, a kind of routing table is carried out the method for space management, it is characterized in that, comprising:
Calculating is inserted into the mask-length of list item;
Space management unit in the traversal space management chained list; In the described space management chained list, each space management unit is corresponding one by one with mask-length, manages the list item identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking of correspondence;
Obtain and the described corresponding space management unit of mask-length that is inserted into list item, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into.
2, according to claim 1 routing table is carried out the method for space management, it is characterized in that, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into and comprise:
End value in the described space management unit that obtains is added 1;
The described list item that is inserted into is left in the end space that adds after 1, and the vent value in the described space management unit that obtains is added 1.
3, according to claim 1 routing table is carried out the method for space management, it is characterized in that,
Do not exist in the described space management chained list under the situation of the space management unit corresponding with the described mask-length that is inserted into list item, the described space management unit that is inserted into the mask-length correspondence of list item is set in described space management chained list, distribute the routing table space, and determine the described deposit position that is inserted into list item, insert the described list item that is inserted into.
4, according to claim 3 routing table is carried out the method for space management, it is characterized in that, the described space management unit that is inserted into the mask-length correspondence of list item is set in described space management chained list, distribute the routing table space to comprise:
Find corresponding mask-length greater than the described space management unit that is inserted into list item, and therefrom obtain the corresponding the shortest space management unit of mask-length;
The part free space of the space management Single Component Management that the mask-length of described correspondence is the shortest is distributed to space management unit to be provided with;
The start of space management unit described to be provided with is set to the remaining free space of end++1 of the shortest space management unit of the mask-length of described correspondence;
The end of space management unit described to be provided with is set to the value identical with the start of this space management unit;
The prev of space management unit described to be provided with is set to the mask-length of the shortest space management unit correspondence of the mask-length of described correspondence;
The next of space management unit described to be provided with is set to the value of next in the shortest space management unit of the mask-length of described correspondence;
The fent of space management unit described to be provided with is set to described part free space;
Next in the shortest space management unit of the mask-length of described correspondence is set to the mask-length of described insertion list item;
Obtain mask-length corresponding in the described space management chained list less than the described space management unit that is inserted into list item, and therefrom obtain the corresponding the longest space management unit of mask-length;
Prev in the longest space management unit of the mask-length of described correspondence is set to the described mask-length that is inserted into list item;
Determine the described deposit position that is inserted into list item, insert the described list item that is inserted into and comprise:
Be inserted in the start space that list item leaves space management unit described to be provided with in described;
The fent value of space management unit described to be provided with is subtracted 1.
5, according to each describedly carries out the method for space management to routing table among the claim 1-4, it is characterized in that, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into and comprise:
Search free space in the space that space management unit before or after the space management unit of the described mask-length correspondence that is inserted into list item is managed;
Move by integral body, will have the part free space of the space management Single Component Management of free space, distribute to the described space management unit that is inserted into the mask-length correspondence of list item;
Be inserted in the free space that list item insert to distribute described, and the end value of the space management unit of the described mask-length correspondence that is inserted into list item is added 1.
6, method of routing table being carried out space management according to claim 5, it is characterized in that, move by integral body, will have the part free space of the space management Single Component Management of free space, distribute to the described space management unit that is inserted into the mask-length correspondence of list item and comprise:
The list item that the described space management unit that is inserted into the mask-length correspondence of list item is managed, and and described space management unit with free space between the space management unit list item integral body of being managed move forward a space;
Described fent value with space management unit of free space is subtracted 1;
Perhaps comprise:
The list item that space management unit between the space management unit of the described mask-length correspondence that is inserted into list item and the described space management unit with free space is managed, and the described space management unit list item integral body of being managed with free space move a space backward;
Described fent value with space management unit of free space is subtracted 1.
7, according to each describedly carries out the method for space management to routing table among the claim 1-4, it is characterized in that, also comprise:
Obtain the index value for the treatment of that remove entries is deposited;
Delete the described remove entries for the treatment of;
Treat that with described fent value in the space management unit under the remove entries adds 1, the vent value subtracts 1, and the list item in the end space is stored in the described address space for the treatment of remove entries, and the end value is subtracted 1.
8, method of routing table being carried out space management according to claim 7, it is characterized in that, describedly treat that vent value in the space management unit under the remove entries is after subtracting 1 at 0 o'clock, from described space management chained list, delete the described space management unit for the treatment of under the remove entries;
Manage to previous space management unit described all allocation of space of the space management Single Component Management under the remove entries for the treatment of;
The fent value of described previous space management unit is added the above all space.
9, a kind of routing table is carried out the device of space management, it is characterized in that, comprising:
Computing unit is used to calculate the mask-length that is inserted into list item;
The space management chained list is used for the storage space management unit, and in the described space management chained list, corresponding one by one with mask-length between each space management unit, the list item of storage is identical with corresponding mask-length; Described each space management unit is provided with corresponding mask-length prev, the mask-length next of a back space management unit correspondence, the list item number vent of this space management unit storage and the free space fent in this space management unit of start address start, the end address end of list item storage, the storage of previous space management unit of list item storage according to the sequence arrangement of mask-length from growing to lacking;
Travel through the unit, be used for traveling through the space management unit of described space management chained list;
Acquiring unit is used to obtain and the described corresponding space management unit of mask-length that is inserted into list item;
Insert the unit, be used for the space management unit that obtains according to described acquiring unit, determine the described deposit position of list item in routing table that be inserted into, insert the described list item that is inserted into.
10, according to claim 9 routing table is carried out the device of space management, it is characterized in that described insertion unit comprises:
Deposit subelement, be used for the described list item that is inserted into is left in the end space that adds after 1;
Computation subunit is used for the end value of the described space management unit that obtains is added 1; And the vent value in the described space management unit that obtains added 1.
11, according to claim 9 routing table is carried out the device of space management, it is characterized in that, also comprise:
The unit is set, be used for not existing under the situation of the space management unit corresponding with the described mask-length that is inserted into list item at described space management chained list, the described space management unit that is inserted into the mask-length correspondence of list item is set in described space management chained list, distributes the routing table space;
Described insertion unit also is used for determining the described deposit position that is inserted into list item according to the described space management unit that the unit setting is set, inserts the described list item that is inserted into.
12, according to claim 11 routing table is carried out the device of space management, it is characterized in that the described unit that is provided with comprises:
Search subelement, be used to find corresponding mask-length greater than the described space management unit that is inserted into list item, and therefrom obtain the corresponding the shortest space management unit of mask-length;
Distribute subelement, the part free space that is used for the space management Single Component Management that the mask-length of described correspondence is the shortest is distributed to space management unit to be provided with; Obtain mask-length corresponding in the described space management chained list less than the described space management unit that is inserted into list item, and therefrom obtain the corresponding the longest space management unit of mask-length;
Safeguard subelement, be used for
The start of space management unit described to be provided with is set to the remaining free space of end++1 of the shortest space management unit of the mask-length of described correspondence;
The end of space management unit described to be provided with is set to the value identical with the start of this space management unit;
The prev of space management unit described to be provided with is set to the mask-length of the shortest space management unit correspondence of the mask-length of described correspondence;
The next of space management unit described to be provided with is set to the value of next in the shortest space management unit of the mask-length of described correspondence;
The fent of space management unit described to be provided with is set to described part free space;
Next in the shortest space management unit of the mask-length of described correspondence is set to the mask-length of described insertion list item;
Prev in the longest space management unit of the mask-length of described correspondence is set to the described mask-length that is inserted into list item;
Described insertion unit also is used for being inserted in the start space that list item leaves space management unit described to be provided with in described;
Described maintenance unit also is used for the fent value of space management unit described to be provided with is subtracted 1.
13, according to each describedly carries out the device of space management to routing table among the claim 9-12, it is characterized in that, also comprise:
The unit is searched in the space, and free space is searched in the space that is used for being managed the space management unit before or after the space management unit of the described mask-length correspondence that is inserted into list item;
Adjustment unit is used for moving by integral body, will have the part free space of the space management Single Component Management of free space, distributes to the described space management unit that is inserted into the mask-length correspondence of list item;
Described insertion unit also is used for being inserted in the free space that list item insert to distribute described, and the end value of the space management unit of the described mask-length correspondence that is inserted into list item is added 1.
14, according to claim 13 routing table is carried out the device of space management, it is characterized in that described adjustment unit comprises:
The mover unit is used for list item that the described space management unit that is inserted into the mask-length correspondence of list item is managed, and and described space management unit with free space between the space management unit list item integral body of being managed move forward a space; Perhaps
The list item that is used for the space management unit between the space management unit of the described mask-length correspondence that is inserted into list item and the described space management unit with free space is managed, and the described space management unit list item integral body of being managed with free space move a space backward;
Safeguard subelement, be used for described fent value with space management unit of free space is subtracted 1.
15, according to each describedly carries out the device of space management to routing table among the claim 9-12, it is characterized in that,
Described acquiring unit also is used to obtain the index value for the treatment of that remove entries is deposited;
Described device also comprises:
Delete cells is used to delete the described remove entries for the treatment of;
Maintenance unit is used for the described fent value of the space management unit under the remove entries for the treatment of is added 1, and the vent value subtracts 1, and the list item in the end space is stored in the described address space for the treatment of remove entries, and the end value is subtracted 1.
16, according to claim 15 routing table is carried out the device of space management, it is characterized in that,
It is 0 o'clock that described delete cells also is used for after the described vent value for the treatment of the space management unit under the remove entries subtracts 1, the described space management unit for the treatment of under the remove entries of deletion from described space management chained list;
Described adjustment unit also is used for managing to previous space management unit described all allocation of space of the space management Single Component Management under the remove entries for the treatment of;
Described maintenance unit also is used for the fent value of described previous space management unit is added the above all space.
17, a kind of three-tier switch is characterized in that, comprises each described device that routing table is carried out space management among the aforesaid right requirement 9-16.
18, a kind of router is characterized in that, comprises each described device that routing table is carried out space management among the aforesaid right requirement 9-16.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101169219A CN101335706B (en) | 2008-07-21 | 2008-07-21 | Route table space managing method, apparatus, switch and router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101169219A CN101335706B (en) | 2008-07-21 | 2008-07-21 | Route table space managing method, apparatus, switch and router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101335706A true CN101335706A (en) | 2008-12-31 |
| CN101335706B CN101335706B (en) | 2011-08-17 |
Family
ID=40198024
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101169219A Expired - Fee Related CN101335706B (en) | 2008-07-21 | 2008-07-21 | Route table space managing method, apparatus, switch and router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101335706B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010145295A1 (en) * | 2009-09-25 | 2010-12-23 | 中兴通讯股份有限公司 | Method and apparatus for managing a route table |
| CN102035727A (en) * | 2010-11-17 | 2011-04-27 | 杭州华三通信技术有限公司 | Method and equipment for processing routing |
| CN103559260A (en) * | 2013-11-05 | 2014-02-05 | 无锡云动科技发展有限公司 | Method for dynamically adjusting I node list on the basis of RAMDISK file system |
| CN105939264A (en) * | 2015-08-13 | 2016-09-14 | 杭州迪普科技有限公司 | Routing management method and device |
| CN106027419A (en) * | 2016-05-20 | 2016-10-12 | 曙光云计算技术有限公司 | Data structure management method and device |
| CN107682266A (en) * | 2017-09-12 | 2018-02-09 | 杭州迪普科技股份有限公司 | Matching process and device, the computer-readable recording medium of flow table item |
| CN111866212A (en) * | 2020-07-17 | 2020-10-30 | 芯河半导体科技(无锡)有限公司 | Method for automatically distributing IPV6PD prefix for drop-in router by gateway |
| CN112491722A (en) * | 2020-12-04 | 2021-03-12 | 锐捷网络股份有限公司 | Address table maintenance method, device and equipment |
| CN112600954A (en) * | 2021-03-04 | 2021-04-02 | 城云科技（中国）有限公司 | IPv4 address matching method, electronic device and storage medium |
| CN114024885A (en) * | 2021-10-13 | 2022-02-08 | 苏州裕太微电子有限公司 | IP routing table management system and method based on subnet mask division |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101005461B (en) * | 2007-01-16 | 2010-06-16 | 中兴通讯股份有限公司 | IPv6 route list checking and repeating method |
-
2008
- 2008-07-21 CN CN2008101169219A patent/CN101335706B/en not_active Expired - Fee Related
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101692653B (en) * | 2009-09-25 | 2012-04-04 | 中兴通讯股份有限公司 | Management method and management device for routing table |
| WO2010145295A1 (en) * | 2009-09-25 | 2010-12-23 | 中兴通讯股份有限公司 | Method and apparatus for managing a route table |
| CN102035727A (en) * | 2010-11-17 | 2011-04-27 | 杭州华三通信技术有限公司 | Method and equipment for processing routing |
| CN102035727B (en) * | 2010-11-17 | 2013-01-09 | 杭州华三通信技术有限公司 | Method and equipment for processing routing |
| CN103559260A (en) * | 2013-11-05 | 2014-02-05 | 无锡云动科技发展有限公司 | Method for dynamically adjusting I node list on the basis of RAMDISK file system |
| CN103559260B (en) * | 2013-11-05 | 2016-08-31 | 无锡云动科技发展有限公司 | The dynamic adjusting method of inode table based on RAMDISK file system |
| CN105939264A (en) * | 2015-08-13 | 2016-09-14 | 杭州迪普科技有限公司 | Routing management method and device |
| CN106027419B (en) * | 2016-05-20 | 2019-06-04 | 曙光云计算技术(日照)有限公司 | A kind of management method and device of data structure |
| CN106027419A (en) * | 2016-05-20 | 2016-10-12 | 曙光云计算技术有限公司 | Data structure management method and device |
| CN107682266A (en) * | 2017-09-12 | 2018-02-09 | 杭州迪普科技股份有限公司 | Matching process and device, the computer-readable recording medium of flow table item |
| CN111866212A (en) * | 2020-07-17 | 2020-10-30 | 芯河半导体科技(无锡)有限公司 | Method for automatically distributing IPV6PD prefix for drop-in router by gateway |
| CN111866212B (en) * | 2020-07-17 | 2023-08-15 | 芯河半导体科技(无锡)有限公司 | Method for automatically distributing IPV6PD prefix for down-hanging router by gateway |
| CN112491722A (en) * | 2020-12-04 | 2021-03-12 | 锐捷网络股份有限公司 | Address table maintenance method, device and equipment |
| CN112491722B (en) * | 2020-12-04 | 2022-05-20 | 锐捷网络股份有限公司 | Address table maintenance method, device and equipment |
| CN112600954A (en) * | 2021-03-04 | 2021-04-02 | 城云科技（中国）有限公司 | IPv4 address matching method, electronic device and storage medium |
| CN114024885A (en) * | 2021-10-13 | 2022-02-08 | 苏州裕太微电子有限公司 | IP routing table management system and method based on subnet mask division |
| CN114024885B (en) * | 2021-10-13 | 2023-07-14 | 裕太微电子股份有限公司 | IP routing table management system and method based on subnet mask division |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101335706B (en) | 2011-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101335706B (en) | Route table space managing method, apparatus, switch and router | |
| CN100574281C (en) | A kind of management method of switch routing table | |
| CN102307149B (en) | IP (internet protocol) lookup method and device and route updating method and device | |
| US6490592B1 (en) | Method of and apparatus for generating a tree data structure supporting longest match lookup | |
| CN103345472B (en) | De-redundant file system based on limited binary tree Bloom filter and construction method thereof | |
| CN105324765B (en) | Selection is used for the memory block of duplicate removal complex data | |
| US20090327316A1 (en) | Dynamic Tree Bitmap for IP Lookup and Update | |
| CN104462549A (en) | Data processing method and device | |
| CN103858125B (en) | Repeating data disposal route, device and memory controller and memory node | |
| CN104077239B (en) | IP hard disk, and memory system and data operation method thereof | |
| CN105357322B (en) | A kind of virtual machine distribution method based on Topology partition | |
| US20110282845A1 (en) | Efficient backup data retrieval | |
| CN101763415B (en) | Method and device for generating B tree index of database | |
| CN110147204A (en) | A kind of metadata rule method, apparatus, system and computer readable storage medium | |
| CN103780491A (en) | Method for realizing IPv6 fast route lookup | |
| CN100479436C (en) | Management and maintenance method for static multi-interface range matching table | |
| CN101582851B (en) | Method and system for realizing sharing route capacity on dual-stacker router | |
| CN104270424A (en) | Database synchronization method, server and system | |
| CN106095850A (en) | A kind of data processing method and equipment | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| Luo et al. | Towards TCAM-based scalable virtual routers | |
| CN101692653B (en) | Management method and management device for routing table | |
| CN106294191B (en) | The method for handling table, the method and apparatus for accessing table | |
| CN102970239A (en) | Flow processing method, flow processing device, router and flow processing system | |
| CN103530067B (en) | A kind of method and apparatus of data manipulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110817 Termination date: 20140721 |
|
| EXPY | Termination of patent right or utility model |