CN100433009C - Method for managing and maintaining tatic range matching table - Google Patents
Method for managing and maintaining tatic range matching table Download PDFInfo
- Publication number
- CN100433009C CN100433009C CNB2005101239190A CN200510123919A CN100433009C CN 100433009 C CN100433009 C CN 100433009C CN B2005101239190 A CNB2005101239190 A CN B2005101239190A CN 200510123919 A CN200510123919 A CN 200510123919A CN 100433009 C CN100433009 C CN 100433009C
- Authority
- CN
- China
- Prior art keywords
- rule
- new
- priority
- management
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a method for managing and maintaining a static range matching table, which mainly comprises the following steps: firstly, a corresponding management structure and a corresponding maintenance structure are respectively created for rules contained in the static range matching table, wherein the maintenance structure is used for managing and maintaining every rule of the static range matching table, and the management structure and the maintenance structure meet the requirement for associated relationship between the range matching table and the rules; then, the saved static range matching table is managed and maintained according to the maintenance structure among management nodes and the maintenance method, including adding or deleting table items, etc. Accordingly, the method of the present invention solves the problem that the common static range matching table item in TCAM is managed randomly because of the lack of a ready maintenance algorithm of the common static range matching table in the TCAM.
Description
Technical field
The present invention relates to the memory management technique field, relate in particular to a kind of management and maintenance method of tatic range matching table.
Background technology
Tatic range matching table is meant the range matching table that possesses the priority characteristic.As a kind of typical range matching table, in the communications field that static ACL (Access Control List (ACL)) table is widely used in.In traditional commensurate in scope maintaining method, range matching tables such as ACL can be stored in the internal memory of main frame, generally adopt binary tree structure to safeguard and search.In this method, the search operation of his-and-hers watches need be carried out multistage searching in tree, can not accomplish to settle at one go when searching, and search efficiency is lower.
At present, released a kind of TCAM (Ternary Content Addressable Memory, Ternary Content Addressable Memory), what they were different with normal memory is: the addressing mode of normal memory is an Input Address, output content; And described Content Addressable Memory can obtain the address according to the content of input, that is to say, when importing a content when (being called comparand usually), TCAM can compare the data among comparand and the TCAM, if hit, then export the address of hitting list item, each storage unit of TCAM is except " 0 ", " 1 ", a kind of in addition " don ' t care " state promptly not only can but also can be " 1 " for " 0 ".
Because TCAM has the function of ternary storage, therefore, when comparand of input, the situation that content in a plurality of TCAM address and comparand hit may appear.Because TCAM has the list item of low physical address and has higher priority, under the situation that many list items of appearance hit, the address of the list item that output priority is the highest is the result who searches.
It is as follows to use TCAM to carry out the method that scope represents: the ternary storage mode of TCAM provides storage mode very easily for the data of band mask, and the data of band mask are actually a kind of special scope, such as from 2
n～2
N+1-1 scope; For general scope, can split into the union of several such special range, can prove that data bit width is that any range of the data segment of n can split into the individual scope that can directly leave the special data/mask form among the TCAM in of 2 (n-1) at most.Article one, after range matching table represents that according to the scope of TCAM table rule is split as one or more scopes interval, will deposit TCAM in through the TCAM list item that obtains after splitting.
TCAM has the characteristics of priority storage, and its low address position list item always has high priority.Therefore, the interpolation of list item and deletion attended operation must sort according to the following priority of forwarding list item and add and deletion, with guarantee TCAM list item storage order meet issue search the priority requirement.The commensurate in scope list item needs to split into the list item that can be stored in the middle of the device by software approach in the process of issuing, descend forwarding list item like this and be stored in list item among the TCAM at last and have the relation of one-to-many, the list item corresponded manner of this one-to-many has increased the difficulty of list item maintenance management.At present, also there is not a kind of management and maintenance method of good tatic range matching table can supply usefulness.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the purpose of this invention is to provide a kind of management and maintenance method of tatic range matching table, provide a kind of new thinking for improving current TCAM memory range matching list present situation difficult in maintenance.
The objective of the invention is to be achieved through the following technical solutions:
The invention provides a kind of management and maintenance method of tatic range matching table, comprising:
A, the rule that comprises according to tatic range matching table are created corresponding management maintenance structure respectively, described management maintenance structure satisfies the related requirement between the rule in range matching table and the table, and manages maintenance according to each rule of the described tatic range matching table of corresponding management maintenance structure; Described management maintenance structure rule of correspondence node, the commensurate in scope rule in the corresponding range matching table of described regular node;
B, when adopting ternary content can seek storer to preserve tatic range matching table, the corresponding management maintenance structure of each rule that comprises according to described tatic range matching table manages maintenance to each rule in the described tatic range matching table of preserving, and described management maintenance is for to add or deletion action each rule in the described tatic range matching table.Described steps A comprises:
Each regular node that the tatic range list of matches is comprised adopts binary tree structure, structure of arrays or list structure to manage.
Described steps A specifically comprises:
Adopt the balanced binary tree construction that each management maintenance structure of described tatic range matching table is managed.
The information of described management maintenance structure management comprises:
Regular node balance factor, regular priority, regular breakdown item number, front priority node, back priority node, rule decompose first list item pointer and/or rule is decomposed the tail list item, and when adopting the described management maintenance structure of balanced binary tree structure connection, the information of described management maintenance structure management also comprises left child's regular node pointer and right child's regular node pointer alternatively.
Described tatic range matching table is stored in the three-state content addressable memory TCAM or with the preservation of TCAM with search in the identical storer of feature.
Among the present invention, when increasing the tatic range matched rule, described step B comprises:
B1, search each management maintenance structure and determine that described tatic range matched rule is added to the position among the TCAM, and add described tatic range matched rule among the TCAM relevant position.
Described step B1 comprises:
Search each management maintenance structure, and determine that according to the precedence information of respectively storing physical location among the precedence information of one or many rules of the tatic range matched rule correspondence of new insertion and the TCAM tatic range matched rule needs of current new insertion add the physical location among the TCAM to.
Described step B1 comprises:
B11, described tatic range matched rule is split as corresponding TCAM list item, judges whether the idle list item of corresponding insertion position is enough, if, execution in step B12 then, otherwise, execution in step B13;
B12, the TCAM list item after splitting is added among the TCAM;
B13, search for idle list item to low address with to high address, after search obtains enough idle list items, these idle list items that search moved at the place, insertion position that determines, idle list item is moved the insertion position after, execution in step B12.
Described step B13 comprises:
B131, in the insertion position of determining along searching for clear position according to priority block to low address with to the high address both direction, in search procedure the record idle quantity, and record searching to clear position comprise the distance to add list item position priority block farthest;
B132, when the quantity of the clear position that finds is enough, to add list item priority block farthest from the distance that finds and begin the position of priority block among TCAM moved to the direction with new interpolation list item position opposite.
Described step B132 comprises:
Newly add the nearest list item in position of list item from this priority block middle distance, list item is moved to the free block middle distance adjacent with this priority block newly add list item position farthest.
Among the present invention, when deletion tatic range matched rule, described step B comprises:
B2, search the management maintenance structure that the corresponding management maintenance structure of each rule is determined described tatic range matched rule correspondence;
B3, according to all list items of this matched rule correspondence of preserving among the described management maintenance structural information deletion TCAM, and revise the corresponding management enclosed structure.
Described method also comprises:
C, need determine in proportion according to the storage physical location of the commensurate in scope rule of front and back priority for the storage physical location of one or more corresponding list item of the commensurate in scope of new insertion rule.
Described step C comprises:
When not existing priority to be higher or lower than any commensurate in scope rule of new insertion commensurate in scope rule in the table, the insertion position account form of new commensurate in scope rule is:
P
new/P
max＝L
new/L
max；
Wherein:
P
MaxBe the priority sum of estimating in showing;
P
NewBe the new regulation node priority;
L
NewInsertion position for new regulation node priority rule;
L
MaxBe list item sum in showing;
When having priority above and below the new commensurate in scope rule of inserting commensurate in scope rule priority node in the table, the insertion position account form of new commensurate in scope rule is:
(P
new-P
pre)/(P
next-P
new)＝(L
new-L
pre)/(L
next-L
new)；
Wherein:
P
PreThe high priority that new node is adjacent;
P
NextThe low priority that new node is adjacent;
L
PreThe tail position of the high priority rule that new node is adjacent;
L
NextPut the first place of the low priority rule that new node is adjacent;
In table, exist priority to be higher than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting the commensurate in scope rule for the minimum commensurate in scope rule of current priority, the insertion position account form of new commensurate in scope rule is:
(P
new-P
pre)/(P
max-P
new)＝(L
new-L
pre)/(L
max-L
new)；
In table, exist priority to be lower than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting the commensurate in scope rule for the highest commensurate in scope rule of current priority, the insertion position account form of new commensurate in scope rule is:
(P
new)/(P
next-P
new)＝(L
new)/(L
next-L
new)。
As seen from the above technical solution provided by the invention, the present invention is in the network equipment that adopts network processor architectures, tatic range matching table is stored among the TCAM, and provides the microcode in the network processing unit to carry out searching of commensurate in scope list item.List item search among the TCAM is finished by hardware, and the basic maintenance operation that the insertion of commensurate in scope list item, deletion etc. must be done by software, the attended operation that aging, renewal etc. generally undertaken by software is finished by corresponding maintenance software, among the present invention, search with maintenance process and divide and rule, improve the purpose of searching with maintenance efficiency thereby reach.
Therefore, the invention solves because of there not being normal static range matching table maintenance algorithm among the ready-made TCAM, and the problem of the unordered management of normal static commensurate in scope list item among the TCAM that causes, can be applicable to have larger tatic range matching table, and maintenance efficiency is required than in the higher network equipment.
Description of drawings
Fig. 1 is a regulation management enclosed structure synoptic diagram provided by the invention;
Fig. 2 is the process flow diagram of method of the present invention;
Fig. 3 is allocation scheme synoptic diagram between the existence branch that inserts list item among the present invention;
Fig. 4 moves process synoptic diagram one for list item among the present invention;
Fig. 5 moves process synoptic diagram two for list item among the present invention;
Fig. 6 moves process synoptic diagram three for list item among the present invention.
Embodiment
Realization of the present invention is in order to solve when maintenance is stored among the general TCAM commensurate in scope list item, and contents in table itself does not possess under the situation of priority tag, to the problem of the maintenance management difficulty of normal static range matching table.
Core of the present invention is when adopting TCAM to preserve tatic range matching table, be respectively each rule that comprises in the table and set up corresponding management maintenance structure, wherein writing down management maintenance information, be used for corresponding rule is managed maintenance, and also need to set up incidence relation between described each management maintenance structure, so that carry out the management of searching of the corresponding management maintenance structure of rule.
The present invention goes for the management maintenance of various static tables, is that example is set forth explanation with static ACL (Access Control List (ACL)) table only among the present invention, and the ACL table of further part is all to refer to static ACL table without specified otherwise.
To describe method provided by the invention below:
Because the priority that different acl rule is corresponding different, the tissue of data is divided according to priority block among the TCAM, and the piece that priority is high (i.e. rule) is placed on low physical address, i.e. top, the piece that priority is low is placed on higher physical address, promptly below.
Among the present invention, the characteristics of range matching algorithm are:
1, every acl rule a plurality of list items in can corresponding TCAM;
2, the maximum priority number of supporting is more, to ACL, how many acl rules is arranged, and what priority are range matching algorithm just need;
3, owing to need the user to specify the priority of a list item of new interpolation, when the user need have insert between two rules of continuous priority one new when regular, need to adjust the absolute figure of some regular priority, the priority relativeness is constant.
Realization of the present invention can be by commensurate in scope rule level and two levels of regular corresponding TCAM list item level.Management maintenance structure top layer be to tatic range matching table in the management maintenance structure that manages of strictly all rules, bottom then is the management maintenance structure to all corresponding TCAM list items of the rule in each tatic range matching table (being called the commensurate in scope rule), as shown in Figure 1.
For the commensurate in scope rule of each new interpolation,, its counter structure is added in the management maintenance structure at place at first according to described regular priority.Then, described rule is split as the TCAM list item, and adds in the TCAM table, so that it is carried out maintenance management.
To adopt the balanced binary tree construction to realize that the present invention is an example, commensurate in scope regulation management enclosed structure specifically includes, but are not limited to following content and form as shown in Figure 1:
1, regular node balance factor: the node that is used for writing down this rule correspondence is positioned at the balance factor of balanced binary tree;
2, regular priority: be used to write down this regular the priority level information;
3, regular breakdown item number: be used for writing down the list item number that this rule is stored in the TCAM table;
4, left child's regular node pointer: be used for writing down the left child nodes pointer of this rule in the node correspondence of binary tree;
5, right child's regular node pointer: be used for writing down the right child nodes pointer of this rule in the node correspondence of binary tree;
6, forward direction priority node pointer: be used for writing down the previous node pointer of this rule in the high priority direction of TCAM;
7, back to the priority node pointer: as to be used for writing down the back node pointer of this rule in the low priority direction of TCAM;
8, the first list item pointer of decomposition rule: be used for writing down the head node of the regular list item subclass that is stored in TCAM after node rule is decomposed, corresponding article one decomposition rule;
9, decomposition rule tail list item pointer: be used for writing down the tail node of the regular list item subclass that is stored in TCAM after node rule is decomposed, corresponding the last item decomposition rule.
Among the present invention, each bar commensurate in scope rule of maintained range matching table is all corresponding to a node in the binary tree structure, and this balanced binary tree feature is as follows:
The priority of each node is lower than the priority of all nodes on its left subtree in the tree, and is higher than the priority of all nodes on its right subtree.Certainly, the reverse maintenance of priority orders also can, but corresponding algorithm need be adjusted accordingly.
Among the present invention, carrying out list item when safeguarding, beginning to determine the node insertion position by priority relatively by the root node position of tree, or deleted node location, and be updated node location;
Be that example is done with general introduction TCAM list item attended operation implementation method below with the acl rule.
At first, the interpolation processing procedure of TCAM list item is described, as shown in Figure 2, specifically comprises:
Step 21: with the commensurate in scope rule, promptly the acl rule of range format is converted to the rule schemata of depositing in can TCAM;
In the transfer process, a commensurate in scope rule may be decomposed into many TCAM list items, and the new corresponding TCAM list item bar number of commensurate in scope rule that adds of hypothesis is N herein;
Step 22: judge the insertion of new list item of TCAM residual capacity whether enough, if then execution in step 23, otherwise process finishes;
Step 23: judge among the TCAM whether idle list item enough inserts new list item in the legal insertion position, if then execution in step 24, otherwise, execution in step 27;
Suppose to search balanced binary tree, find and new two adjacent node A of node, the B of adding;
Owing to writing down the initial sum final position of this priority block in each priority block node, therefore, with these information in adjacent two priority block can obtain two between the priority block the clear position number and the initial sum termination address of clear position, suppose that the free list item number between A, B is M;
At this moment, need to judge whether N is less than or equal to M, if N＜=M, then execution in step 24, otherwise, execution in step 27;
Step 24: the idle list item of search in legal insertion position (being in the internodal TCAM list item of new regulation priority adjacent two priority in the front and back scope);
Step 25: search for empty list item number and whether arrived the needed list item quantity of new regulation, if then execution in step 26, otherwise, continue execution in step 24;
Step 26: add new list item, process finishes;
Be specially: according to A, the priority of B and new priority of adding list item find the correct position of new interpolation list item interpolation, and add the rule of newly adding to TCAM, guarantee as far as possible that promptly TCAM list item position and its priority are proportional.
Step 27: the high address direction (two directions up and down) at the low address direction of the adjacent high priority rule of the new regulation priority rule adjacent with new regulation takes turns to search for clear position;
Step 28: judge whether the empty list item that searches has enough inserted new list item, if, execution in step 26, otherwise, execution in step 27 continued.That is to say: if N＞M, then the space between A, the B fails to lay down the rule of new interpolation, need do list item and move, so that newly added the space of list item;
Be specially: search for clear position according to priority block along upper and lower both direction, the idle quantity of record in search procedure, writing down the initial sum final position of this priority block in each priority block node, utilize these information in adjacent two priority block just can obtain two clear position numbers between the priority block, simultaneously, also need record searching to clear position comprise the distance to add list item position priority block farthest.When the quantity of the clear position that finds=(N-M), then search finishes.
Supposed to find and new N-M nearest clear position of point of addition, and mobile list item.With this N-M bar the idle list item that obtains of search outside the legal priority insertion scope move with new regulation before and after within the legal priority address realm between the adjacent two priority rule nodes.
For ease of the present invention there being further understanding, below will be to the memory allocation mode of the new insertion list item that relates among the present invention, and the idle list item that relates in the allocation space process is moved processing procedure and is described in detail.
Among the present invention, specifically as shown in Figure 3 for the memory allocation mode of new insertion list item:
One corresponding or many list items of the new commensurate in scope rule of inserting are divided definition in proportion according to priority rule position, front and back on the storage physical location.Like this, can sparse as much as possible insertion list item, reduce the new probability that list item is moved that inserts.
Specifically can follow the ratio inserted mode of following several types and carry out determining of insertion position:
(1) when not existed any priority to be higher or lower than any commensurate in scope rule of new insertion commensurate in scope rule in the storer, then the computing method of the insertion position of new range matched rule are as follows:
P
new/P
max＝L
new/L
max；
Wherein:
P
MaxBe the priority sum of estimating in showing;
P
NewBe the new regulation node priority;
L
NewInsertion position for new regulation node priority rule;
L
MaxBe list item sum in showing.
(2) when having had priority in the storer above and below the new commensurate in scope rule of inserting commensurate in scope rule priority node, priority and new range matched rule priority with the high priority commensurate in scope rule adjacent with new node, adjacent low priority commensurate in scope rule calculate new range matched rule insertion position, and concrete computing method are as follows:
(P
new-P
pre)/(P
next-P
new)＝(L
new-L
pre)/(L
next-L
new)；
Wherein:
P
PreThe high priority that new node is adjacent;
P
NextThe low priority that new node is adjacent;
L
PreThe tail position of the high priority rule that new node is adjacent;
L
NextPut the first place of the low priority rule that new node is adjacent;
Other meaning of parameters are described with the front.
(3) in storer, existed priority to be higher than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting commensurate in scope rule for the minimum commensurate in scope rule of current priority, use the high priority commensurate in scope rule adjacent with new node, new range matched rule priority and calculate new range matched rule insertion position according to the greatest priority number of list item scale and requirement definition, concrete computing method are as follows:
(P
new-P
pre)/(P
max-P
new)＝(L
new-L
pre)/(L
max-L
new)；
Wherein, each meaning of parameters is described with the front.
(4) in storer, existed priority to be lower than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting commensurate in scope rule for the highest commensurate in scope rule of current priority, priority and new range matched rule priority with the high priority commensurate in scope rule adjacent with new node, adjacent low priority commensurate in scope rule calculate new range matched rule insertion position, and concrete computing method are:
(P
New)/(P
Next-P
New)=(L
New)/(L
Next-L
New), wherein, each meaning of parameters is described with the front.
For example, as shown in Figure 3, suppose that P is a priority identifier, list item number identifier is N, new commensurate in scope rule of adding corresponding list item N=3 bar list item, list item number N=2 of adjacent high priority rule P=2 that issued, list item number N=2 of adjacent low priority rule P=6.Respectively with P=4, P=3, the commensurate in scope rule of P=5 is an example, and the empty list item between the adjacent height priority of the new regulation list item has 9, then the insertion position of new list item as shown in Figure 3, the rule that has provided different priorities among the figure is respectively inserted the example of diverse location in the list item, need determine to be inserted into particular location in the list item according to the precedence information of rule in a word when inserting the corresponding list item of new rule.
Among the present invention, list item is moved method specifically as Fig. 4, Fig. 5 and shown in Figure 6.
To moving as shown in Figure 4 of idle list item, specifically be that the list item exchange that the huge insertion position in the most contiguous priority block of free list and insertion position direction is nearest is moved.This compares the exchange number of times of moving with the method that the adjacent list item that industry generally adopts exchanges in turn a lot of less.
To be described as follows the concrete idle list item method of moving in conjunction with Fig. 5 and Fig. 6 more below:
From the list item that both direction search is up and down found, search distance and will add list item priority block farthest, and begin the position of corresponding priority level piece in TCAM moved to the direction with new interpolation list item position opposite;
The method that adopts when moving each priority block is:
Newly add the nearest list item in position of list item from this priority block middle distance, list item is moved to the free block middle distance adjacent with this priority block newly add list item position farthest, the benefit of doing like this is to guarantee that priority block is continuous in the process that moves, and can guarantee that again the list item that moves is minimum.
Corresponding mobile method example is as follows:
If add a rule corresponding to 6 list items among the TCAM, this regular priority is 11, at this moment, priority is to have only 2 clear positions between 10 and 12 the rule, therefore, need the search of both direction up and down clear position along the position that will add, be located at t=1 and search 4 clear positions constantly, wherein, three clear positions are positioned at the below of new point of addition, and three locus are not positioned at continuous position, and a clear position is positioned at the top of wanting point of addition.At this moment, concrete move mode will specifically be moved method with Fig. 5 and example explanation shown in Figure 6 respectively as shown in Figure 5 and Figure 6 below:
As shown in Figure 5, at t2 constantly, it with priority the clear position that content in the position of 2 clear positions tops between 10 and 12 the rule is moved the top that searches, t3 moves three clear positions that are not positioned at continuous position for being in three clear positions of continuous position constantly, afterwards, as shown in Figure 6, again respectively at t4, t5 and t6 constantly are that the content in three positions of 2 clear positions belows between 10 and 12 the rule is moved described three clear positions that are in continuous position successively with priority, so far, finish and move processing procedure, and obtained the clear position of enough insertion list items in the relevant position.
After having finished corresponding list item and moving operation, just can obtain the list item of enough free time, at this moment, just can carry out the interpolation operation of list item, thereby finish the processing of new regulation at place, corresponding new priority node insertion position.
Among the present invention, also provide the delet method of list item among the TCAM, specifically comprised:
The first step: along the balanced binary tree search, up to finding the node that to delete.
Second step: the start address and the termination address of this this priority block of record in the priority node, from TCAM, delete and get final product according to all list items that the start address and the termination address information of record should the rule correspondences.
In sum, the present invention proposes a kind of range matching table of normal static comparatively efficiently maintenance algorithm, solved because of there not being normal static range matching table maintenance algorithm among the ready-made TCAM, and the problem of the unordered management of normal static commensurate in scope list item among the TCAM that causes.
And the maximum mobile number of times of list item equal the sum of list item priority among the present invention, generally speaking will be much smaller than TCAM list item scale.Thereby make in the larger network equipment of commensurate in scope list item, can realize the interpolation operation of list item with less expense.
In addition, it is strong that the present invention also has the algorithm availability, is convenient to the advantage that code is realized.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.
Claims (13)
1, a kind of management and maintenance method of tatic range matching table is characterized in that, comprising:
A, the rule that comprises according to tatic range matching table are created corresponding management maintenance structure respectively, described management maintenance structure satisfies the related requirement between the rule in range matching table and the table, and according to corresponding management maintenance structure each rule of described tatic range matching table is managed maintenance; Described management maintenance structure rule of correspondence node, the commensurate in scope rule in the corresponding range matching table of described regular node;
B, when adopting ternary content can seek storer to preserve tatic range matching table, the corresponding management maintenance structure of each rule that comprises according to described tatic range matching table manages maintenance to each rule in the described tatic range matching table of preserving, and described management maintenance is for to add or deletion action each rule in the described tatic range matching table.
2, the management and maintenance method of tatic range matching table according to claim 1 is characterized in that, described steps A comprises:
Each regular node that the tatic range list of matches is comprised adopts binary tree structure, structure of arrays or list structure to manage.
3, the management and maintenance method of tatic range matching table according to claim 2 is characterized in that, described steps A specifically comprises:
Adopt the balanced binary tree construction that each management maintenance structure of described tatic range matching table is managed.
According to the management and maintenance method of claim 1,2 or 3 described tatic range matching tables, it is characterized in that 4, the information of described management maintenance structure management comprises:
Regular node balance factor, regular priority, regular breakdown item number, front priority node, back priority node, rule decompose first list item pointer and/or rule is decomposed the tail list item, and when adopting the described management maintenance structure of balanced binary tree structure connection, the information of described management maintenance structure management also comprises left child's regular node pointer and right child's regular node pointer alternatively.
5, the management and maintenance method of tatic range matching table according to claim 1 is characterized in that, described tatic range matching table is stored in the three-state content addressable memory TCAM or with the preservation of TCAM with search in the identical storer of feature.
According to the management and maintenance method of claim 1,2,3 or 5 described tatic range matching tables, it is characterized in that 6, when increasing the tatic range matched rule, described step B comprises:
B1, search each management maintenance structure and determine that described tatic range matched rule is added to the position among the TCAM, and add described tatic range matched rule among the TCAM relevant position.
7, the management and maintenance method of tatic range matching table according to claim 6 is characterized in that, described step B1 comprises:
Search each management maintenance structure, and determine that according to the precedence information of respectively storing physical location among the precedence information of one or many rules of the tatic range matched rule correspondence of new insertion and the TCAM tatic range matched rule needs of current new insertion add the physical location among the TCAM to.
8, the management and maintenance method of tatic range matching table according to claim 6 is characterized in that, described step B1 comprises:
B11, described tatic range matched rule is split as corresponding TCAM list item, judges whether the idle list item of corresponding insertion position is enough, if, execution in step B12 then, otherwise, execution in step B13;
B12, the TCAM list item after splitting is added among the TCAM;
B13, search for idle list item to low address with to high address, after search obtains enough idle list items, these idle list items that search moved at the place, insertion position that determines, idle list item is moved the insertion position after, execution in step B12.
9, the management and maintenance method of tatic range matching table according to claim 8 is characterized in that, described step B13 comprises:
B131, in the insertion position of determining along searching for clear position according to priority block to low address with to the high address both direction, in search procedure the record idle quantity, and record searching to clear position comprise the distance to add list item position priority block farthest;
B132, when the quantity of the clear position that finds is enough, to add list item priority block farthest from the distance that finds and begin the position of priority block among TCAM moved to the direction with new interpolation list item position opposite.
10, the management and maintenance method of tatic range matching table according to claim 9 is characterized in that, described step B132 comprises:
Newly add the nearest list item in position of list item from this priority block middle distance, list item is moved to the free block middle distance adjacent with this priority block newly add list item position farthest.
According to the management and maintenance method of claim 1,2,3 or 5 described tatic range matching tables, it is characterized in that 11, when deletion tatic range matched rule, described step B comprises:
B2, search the management maintenance structure that the corresponding management maintenance structure of each rule is determined described tatic range matched rule correspondence;
B3, according to all list items of this matched rule correspondence of preserving among the described management maintenance structural information deletion TCAM, and revise the corresponding management enclosed structure.
According to the management and maintenance method of claim 1,2,3 or 5 described tatic range matching tables, it is characterized in that 12, described method also comprises:
C, need determine in proportion according to the storage physical location of the commensurate in scope rule of front and back priority for the storage physical location of one or more corresponding list item of the commensurate in scope of new insertion rule.
13, the management and maintenance method of tatic range matching table according to claim 12 is characterized in that, described step C comprises:
When not existing priority to be higher or lower than any commensurate in scope rule of new insertion commensurate in scope rule in the table, the insertion position account form of new commensurate in scope rule is:
P
new/P
max＝L
new/L
max；
Wherein:
P
MaxBe the priority sum of estimating in showing;
P
NewBe the new regulation node priority;
L
NewInsertion position for new regulation node priority rule;
L
MaxBe list item sum in showing;
When having priority above and below the new commensurate in scope rule of inserting commensurate in scope rule priority node in the table, the insertion position account form of new commensurate in scope rule is:
(P
new-P
pre)/(P
next-P
new)＝(L
new-L
pre)/(L
next-L
new)；
Wherein:
P
PreThe high priority that new node is adjacent;
P
NextThe low priority that new node is adjacent;
L
PreThe tail position of the high priority rule that new node is adjacent;
L
NextPut the first place of the low priority rule that new node is adjacent;
In table, exist priority to be higher than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting the commensurate in scope rule for the minimum commensurate in scope rule of current priority, the insertion position account form of new commensurate in scope rule is:
(P
new-P
pre)/(P
max-P
new)＝(L
new-L
pre)/(L
max-L
new)；
In table, exist priority to be lower than the commensurate in scope rule of new insertion commensurate in scope rule priority node, and when newly inserting the commensurate in scope rule for the highest commensurate in scope rule of current priority, the insertion position account form of new commensurate in scope rule is:
(P
new)/(P
next-P
new)＝(L
new)/(L
next-L
new)。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101239190A CN100433009C (en) | 2005-11-24 | 2005-11-24 | Method for managing and maintaining tatic range matching table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101239190A CN100433009C (en) | 2005-11-24 | 2005-11-24 | Method for managing and maintaining tatic range matching table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1862534A CN1862534A (en) | 2006-11-15 |
| CN100433009C true CN100433009C (en) | 2008-11-12 |
Family
ID=37389965
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101239190A Expired - Fee Related CN100433009C (en) | 2005-11-24 | 2005-11-24 | Method for managing and maintaining tatic range matching table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100433009C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8527694B2 (en) | 2010-06-11 | 2013-09-03 | Beijing Star-Net Ruijie Networks Co., Ltd. | Method and apparatus for updating table entries of a ternary content addressable memory |
| CN102377664B (en) * | 2010-08-27 | 2015-06-10 | 武汉烽火网络有限责任公司 | TCAM (ternary content addressable memory)-based range matching device and method |
| CN101938486B (en) * | 2010-09-09 | 2013-06-12 | 东软集团股份有限公司 | Event rule relevance analysis method and device |
| CN102045262B (en) * | 2011-01-14 | 2012-05-30 | 福建星网锐捷网络有限公司 | Updating method, device and network equipment of media access control address table |
| CN103248575B (en) * | 2013-05-14 | 2016-09-14 | 盛科网络（苏州）有限公司 | A kind of distribution method of TCAM list item priority |
| WO2022042742A1 (en) * | 2020-08-31 | 2022-03-03 | 中兴通讯股份有限公司 | Acl rule processing method and apparatus, computer device, and readable medium |
| CN113392039B (en) * | 2021-06-09 | 2023-06-20 | 新华三信息安全技术有限公司 | Data storage and searching method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6658002B1 (en) * | 1998-06-30 | 2003-12-02 | Cisco Technology, Inc. | Logical operation unit for packet processing |
| CN1545285A (en) * | 2003-11-11 | 2004-11-10 | 中兴通讯股份有限公司 | Method of access control list or security policy database |
| EP1523138A2 (en) * | 2003-10-07 | 2005-04-13 | Alcatel | Access control mechanism for routers |
| CN1625149A (en) * | 2003-12-02 | 2005-06-08 | 四川南山之桥微电子有限公司 | Method for access control list |
-
2005
- 2005-11-24 CN CNB2005101239190A patent/CN100433009C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6658002B1 (en) * | 1998-06-30 | 2003-12-02 | Cisco Technology, Inc. | Logical operation unit for packet processing |
| EP1523138A2 (en) * | 2003-10-07 | 2005-04-13 | Alcatel | Access control mechanism for routers |
| CN1545285A (en) * | 2003-11-11 | 2004-11-10 | 中兴通讯股份有限公司 | Method of access control list or security policy database |
| CN1625149A (en) * | 2003-12-02 | 2005-06-08 | 四川南山之桥微电子有限公司 | Method for access control list |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1862534A (en) | 2006-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100433009C (en) | Method for managing and maintaining tatic range matching table | |
| CN108052514B (en) | Mixed space indexing method for processing geographic text Skyline query | |
| CN1552032B (en) | Database | |
| CN102262626B (en) | Method and device for storing data in database | |
| CN105975587B (en) | A kind of high performance memory database index organization and access method | |
| US10860561B2 (en) | Method and apparatus for providing efficient indexing and computer program included in computer readable medium therefor | |
| CN102521334B (en) | Data storage and query method based on classification characteristics and balanced binary tree | |
| CN100566281C (en) | The method and apparatus of virtual private network routing search | |
| CN100479436C (en) | Management and maintenance method for static multi-interface range matching table | |
| CN101335706B (en) | Route table space managing method, apparatus, switch and router | |
| CN101388842A (en) | Storage method and apparatus | |
| CN107153707A (en) | A kind of Hash table construction method and system for nonvolatile memory | |
| US20070094313A1 (en) | Architecture and method for efficient bulk loading of a PATRICIA trie | |
| Conway et al. | Optimal hashing in external memory | |
| CN108509505A (en) | A kind of character string retrieving method and device based on subregion even numbers group Trie | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| CN102654863A (en) | Real-time database history data organizational management method | |
| CN102591958B (en) | Matching method and matching device of deterministic finite automation based on ternary content addressable memory (TCAM) | |
| CN108134739A (en) | A kind of method for searching route and device based on index trie | |
| CN104462080B (en) | The index structure creation method and system of statistics are grouped for retrieval result | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| CN108780455B (en) | Compressed indexing method and device for character string sequence | |
| US20060015516A1 (en) | Method and apparatus for adding supplemental information to PATRICIA tries | |
| US9396286B2 (en) | Lookup with key sequence skip for radix trees | |
| CN104143152B (en) | A kind of business relations y-bend tree node pruning method and device |
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: 20081112 Termination date: 20161124 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |