CN100440859C - Bit-map aggregated recursive stream sorting method and its system - Google Patents
Bit-map aggregated recursive stream sorting method and its system Download PDFInfo
- Publication number
- CN100440859C CN100440859C CNB2005100749196A CN200510074919A CN100440859C CN 100440859 C CN100440859 C CN 100440859C CN B2005100749196 A CNB2005100749196 A CN B2005100749196A CN 200510074919 A CN200510074919 A CN 200510074919A CN 100440859 C CN100440859 C CN 100440859C
- Authority
- CN
- China
- Prior art keywords
- bitmap
- polymerization
- bit position
- polymerized form
- cbm
- 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 discloses a method and a system for sorting bitmap aggregated recursive stream. A value is firstly taken out from a regular field numeric range, and a bit-map BM is obtained by a transversal regular set; an aggregated form bitmap CBM comprising an aggregated bit part and a detail bit part is obtained by the aggregation; if the CBM does not exist in the bitmap set corresponding to an index block, a new EqID is generated and added to the bitmap set, or the same EqID is used; the mapping relationship of the EqID of the CBM and the regular field value is created in the index block; according to the same method, the index block of each value within the regular field numeric range is created to obtain an index table of 0 stage; according to the recursive structure, the index block of the previous level is treated with recursion to obtain the index block of the next level till an index block is formed by the recursion; after a data packet is received by a sorting system, the data packet is matched to the rule of the highest priority according to the index table. The present invention can reduce the storage space overhead and accelerate the speed for generating and finding bitmaps.
Description
Technical field
The present invention relates to a kind of recursive stream sorting method and system, relate in particular in the data communication field, will meet the method and system that the specific packet of pre-defined rule distinguishes from other packet according to a plurality of fields on the packet based on bitmap.
Background technology
IP network has entered the developing stage of " IP Telecommunication Network ", many technical new challenges have also been brought thus, many new business, such as: packet filtering, QoS, tactful route, NAT, flow based charging etc., traditional requirement of no longer having satisfied network operation and management based on the packet repeating process of destination address matched routings, based on entire I P head, even the IP of transport layer header bag (stream) classification transmission technology becomes one of core technology of these new business, the basis that wherein quick traffic classification system is the classification transmission technology and crucial.
The traffic classification system is the part of data communications equipment processing data packets flow process fast, there is a configurable rule collection in the traffic classification system fast, be some the set that the rule of priority is arranged, every rule is described the certain characteristics condition of cluster packet head, fast the traffic classification system exactly will be when packet arrives, and finds out the highest rule of priority from packet satisfies the several rules of its requirement.
But bag classification problem formalization is defined as: one have N regular grader Rk}, k=1 wherein, 2 ..., N; Rk comprises 2 entities:
1, the scope of a d unit [l1k, r1k], [l2k, r2k] ... [ldk, rdk].
2, the digital Pri (Rk) of priority in appointment grader;
To an arrival grader by a d tuple (P1, P2 ..., Pd) specify the packet P of corresponding field, d dimension grader problem is exactly to look for a specific value k, is called k
*, satisfy:
To any k ≠ k
*, pri (Rk
*)＞Pri (Rk); And, there is lik≤Pi≤rik flow classifier can not wait until after packet arrives and mates item by item again, to find the highest rule of priority to any i:1≤i≤d.Flow classifier is divided into two parts usually fast, and a part is the pretreatment module of control aspect according to classifying rules collection structural classification concordance list; Another part is that data plane matches the priority index module of high rule with actual data packet by the classified index table, can be with reference to Fig. 1.
In the period of 1999～2000, flow classification techniques had the climax of a research, some achievements have been obtained, emerged in large numbers based on Trie algorithm traffic classification system, recursive stream sorting (RFC, Recursive FlowClassification) system, based on the traffic classification system of stratification space segmentation (Hi-Cuts) algorithm, based on traffic classification system fast such as the traffic classification system of bit vector (BV) algorithm, respectively there is advantage in these systems, shortcoming is also respectively arranged, and some categorizing system classification speed is concentrated the increase of regular number along with classifying rules and is descended; Some system need dispose very big internal memory, and system cost is higher; It is longer that some categorizing system rule changes the response time.These algorithms all can only satisfy the demand of the application scenario of hundreds of classifying ruless, and wherein the recursive stream sorting system is very fast because of classification speed, and irrelevant with the classifying rules number, are the traffic classification systems that is most widely used.
The recursive stream sorting system is a traffic classification system of wrapping classification on the multiword section that is proposed by Pankaj Gupta and Nick McKeown in 1999, and the core of this system comprises: the 1) structure of a concordance list; 2) Preprocessing Algorithm unit by rule set structure concordance list; 3) Index Algorithm unit.The recursive stream sorting system does not have the incrementally updating algorithm, in case rule set changes, need re-execute the Preprocessing Algorithm unit.
Wherein, the concordance list structure as shown in Figure 2, concordance list is divided into some levels (phase), each level has plurality of indexes piece (Chunk) again, the structure of classification is exactly the recursion structure that adopts, and each grade concordance list comprises two fields, i.e. index value and corresponding eqID, the index value of the first order is the field value of packet, and the index value of each grade of back is the indexed results (being the weighted sum of eqID) of the two or several tables in front in the recursion structure.In Phase 0 concordance list, the corresponding index block of each field of rule; And each Chunk in Phase J (J＞0) concordance list to be several Chunk by the upper level concordance list merge obtains.The indexed results of each index block is called equivalence class sign (eqId, equal-class identification), and so-called equivalence class is exactly that m unit subspace (matches the subclass (not considering priority) of same rule among the m≤d).Bitmap is used for representing the match condition of equivalence class and rule set rule, and bitmap is the data of a N position, and wherein N is the regular number in the rule set, if equivalence class and i bar rule coupling, then the i position of bitmap is " 1 ", otherwise is " 0 ".Like this, the equivalence class index value just can be mapped to bitmap by equivalence class sign corresponding in the index block.
A packet is received in the Index Algorithm unit, each field by packet (packet) correspondence position, search a phase0 concordance list, by the operation values of the indexed results of some upper levels (as, weighted sum) index next stage table, up to the result who obtains the afterbody index, this result is exactly the sign (eqId) of packet equivalence class on d unit space, also just matched a bitmap, this bitmap table is understood this equivalence class and which rule match, therefrom can find out the highest rule of priority.What deserves to be explained is, because the bitmap of each eqId correspondence has just been determined at pretreatment stage, the corresponding the highest rule of priority is also determined, most of categorizing systems are just got up eqId and the corresponding the highest rule association of priority at pretreatment stage, thereby the highest rule of priority that directly obtains packet and met, the Index Algorithm unit does not need really to handle bitmap.
The classifying rules number has the trend of explosive increase in recent years.The recursive stream sorting system is the same with other traffic classification system to have exposed intrinsic weakness, recursive stream sorting system with Fig. 2 structure, when the regular number in the rule set reaches 2000 extended access list (ACL) regulations, equivalence class rule match bitmap (CBM, Equal Class Bitmap) table needs the above internal memory of 26M, and in the system that has adopted Pentium1.6GHz CPU, the time that equivalence class rule match bitmap rule of response changes reaches 2000 seconds.Easily it is to hinder the quick flow classification techniques that surpasses 2000 rules to enter practical key factor that tens of million memory cost and hundreds of seconds rule change the response time.
Summary of the invention
The technical problem to be solved in the present invention is to propose a kind of bit-map aggregated recursive stream sorting method, can reduce the memory space expense of equivalence class rule match bitmap table, accelerates the service speed that equivalence class rule match bitmap generates and searches.The present invention also will provide a kind of system for carrying out said process that realizes.
In order to solve the problems of the technologies described above, the invention provides a kind of bit-map aggregated recursive stream sorting method, be applied to the recursive stream sorting system, may further comprise the steps:
(a) at first construct an initial bitmap, make its each rule corresponding to regular collection, in a rule field span, take out a value then, the traversal rule set, if this value satisfies current rule, position that should the rule correspondence in the bitmap is set to 1, otherwise is set to 0, obtains a bitmap BM;
(b) bitmap BM is carried out the polymerization that the degree of polymerization is q, obtain comprising the polymerization bit position of fixed length and the polymerized form bitmap CBM of elongated details bit position, the i position of its polymerization bit position is corresponding to i the q tuple of bitmap BM, this q tuple is that 0 o'clock this position is set to 0 entirely, otherwise this position is set to 1, and it is to constitute after 0 the q tuple entirely that its details bit position is removed by bitmap BM;
(c) the polymerized form bitmap during relatively the affiliated bitmap of polymerized form bitmap CBM and this rule field manipulative indexing piece is gathered, check and whether have identical bitmap, if do not have, for bitmap CBM generates new equivalence class sign and it is joined this bitmap set, otherwise bitmap CBM uses the equivalence class sign of its identical bitmap correspondence; Then, in described index block, set up the equivalence class sign of bitmap CBM and the mapping relations of current rule field value;
(d) to each value in this rule field span, after (a) finishes dealing with to the method for (c) set by step, the index block structure of this rule field correspondence is finished, and goes out the index block of each rule field correspondence again by same method construct, forms the 0th grade of complete concordance list;
(e) according to the recursion structure of setting, index block to upper level carries out recursion, obtain the index block of its next stage, two bitmaps compare by its polymerized form during recursion, the AND operation of two bitmaps is finished with the AND operation method of polymerized form bitmap, so increase by degrees, become an index block until the last recursion of all index blocks;
(f) after a packet is received by the recursive stream sorting system, search a concordance list of the 0th grade according to this packet each field relevant with traffic classification, the index value that is obtained by the indexed results computing of some upper levels comes index next stage table, up to obtaining the afterbody indexed results, then will this data packet matched the highest rule of priority that meets the demands to it.
Further, said method also can have following characteristics: described step (b) is further divided into following steps:
(b1) by the degree of polymerization q that sets the bitmap BM of N position is divided into N/q q hyte, i q hyte is corresponding to the q*i in the bitmap～q*i+q-1 position, i=0,1, ..., N/q-1, its corresponding polymerized form bitmap CBM comprises the polymerization bit position of N/q position and elongated details bit position;
(b2) judge i the q hyte of bitmap BM one by one, i=0,1 ..., N/q-1, to each q hyte, judge whether its each position is 0 entirely, if the polymerization bit position i position of described polymerized form bitmap is set to 0, otherwise the i position of this polymerization bit position is set to 1, and the details bit position that copies polymerized form bitmap CBM to is appended in the corresponding position of this q hyte in bitmap BM;
(b3) all q hytes of bitmap BM are finished dealing with after, its corresponding polymerized form bitmap CBM structure is finished.
Further, said method also can have following characteristics: the polymerization bit position of described polymerized form bitmap adopts the alignment of q bit boundary, and insufficient section mends 0.
Further, said method also can have following characteristics: also comprise step after the described step (b3): the more elongated length of described polymerized form bitmap details bit position is written to the front of its polymerization bit position, as the elongated length part of described polymerized form bitmap.
Further, said method also can have following characteristics: the elongated length of described details bit position is to represent with the q hyte number that the details bit position comprises.
Further, said method also can have following characteristics: the comparison algorithm of described polymerized form bitmap is: the elongated length part, polymerization bit position and the details bit position that compare polymerized form bitmap CBM1 and CBM2 successively, as long as there is a part different, directly return two results that bitmap is different, finish; If three parts are all identical, then return two results that bitmap is identical.
Further, said method also can have following characteristics: the method for two polymerized form bitmap CBM1 and CBM2 being carried out obtaining with computing the CBM of bitmap as a result of polymerized form is:
Each identical bits that compares the polymerization bit position of CBM1 and CBM2 successively, when comparing at every turn:
Have at least one to be 0 if participate in two positions relatively, then the identical bits of CBM polymerization bit position is set to 0;
Be 1 if participate in two positions relatively, the step-by-step AND-operation is carried out in the q hyte of the details bit position correspondence of bitmap separately in these two positions, obtain q hyte Q, if Q is 0 entirely, the identical bits of CBM polymerization bit position is set to 0, otherwise the identical bits of CBM polymerization bit position is set to 1, and is Q with this corresponding q hyte assignment of CBM details bit position and its polymerization bit position.
Further, said method also can have following characteristics: in the described step (b3), also the elongated length of described polymerized form bitmap details bit position is write the front of its polymerization bit position, as the elongated length part of this polymerized form bitmap; And when carrying out the AND operation of bitmap CBM1 and CBM2, after all bit comparisons of both polymerization bit positions and handling, also the elongated length with the CBM details bit position that obtains is written to its elongated length part, obtains comprising the CBM of bitmap as a result of three parts.
Further, said method also can have following characteristics: when described step (e) obtains next stage index block Chunk 3 to two index block Chunk 1 of upper level and Chunk 2 recursion, two equivalence classes that adhere to two index block Chunk 1 and Chunk 2 separately are identified EqID1 and EqID2, carry out following steps:
(e1) the polymerized form bitmap with EqID1 and EqID2 correspondence carries out AND-operation, generates the bitmap CBM3 of a polymerized form that belongs to next stage index block Chunk 3;
(e2) checking in the bitmaps set of polymerized form bitmap CBM3 under Chunk 3 whether exist, if do not exist, is that it generates new equivalence class sign, and it is joined under the Chunk 3 in the bitmaps set; If exist, then bitmap CBM3 uses the equivalence class sign of the bitmap identical with it;
(e3) calculate EqID1 * (the equivalence class number of Chunk 2)+EqID2, as among the Chunk 3 corresponding to the index value of bitmap CBM3, then the equivalence class sign of bitmap CBM3 is inserted the position of this index value correspondence among the Chunk3, formed the mapping relations of field value to this equivalence class sign;
Any two equivalence classes sign among Chunk 1 and the Chunk 2 after finishing dealing with as stated above, obtains final recursion Chunk 3 as a result.
Further, said method also can have following characteristics: described degree of polymerization q is 8,16,32,64 or 128.
Bit-map aggregated recursive stream sorting system provided by the invention comprises and is used for matching the priority index module of high rule according to the pretreatment module of classifying rules collection structural classification concordance list with actual data packet by the classified index table, described pretreatment module comprises preliminary treatment Master Control Unit, the 0th grade of concordance list structural unit and J level concordance list structural unit, described index module comprises concordance list and bitmap memory cell, Index Algorithm unit, is characterized in:
Described the 0th grade of concordance list structural unit comprises polymerization operator unit and bitmap compares subelement, when the index block of each rule field correspondence of structure, described polymerization operator unit is used for the bitmap BM without polymerization is carried out the polymerization that the degree of polymerization is q, obtain comprising the polymerization bit position of fixed length and the polymerized form bitmap CBM of elongated details bit position, the i position of its polymerization bit position is corresponding to i the q tuple of bitmap BM, this q tuple is that 0 o'clock this position is set to 0 entirely, otherwise this position is set to 1, and it is to constitute after 0 the q tuple entirely that its details bit position is removed by bitmap BM; And described bitmap comparison subelement is finished the comparison of these two bitmaps by the polymerized form of two bitmaps;
Described J level concordance list structural unit comprises bitmap relatively subelement and AND operation subelement, in recursion structure according to setting, the upper level index block is carried out recursion when obtaining the next stage index block, the form of bitmap after with polymerization represented, described bitmap comparison subelement is finished the comparison of these two bitmaps by the polymerized form of two bitmaps, and described AND operation subelement is finished the AND operation of two bitmaps with the AND operation method of polymerized form bitmap;
Described index table stores unit is used to preserve the concordance lists at different levels that structure obtains.
Further, said system also can have following characteristics: described polymerization operator unit is done in such a manner the polymerization computing to bitmap:
(I) by the degree of polymerization q that sets the bitmap BM of N position is divided into N/q q hyte, i q hyte is corresponding to the q*i in the bitmap～q*i+q-1 position, i=0,1, ..., N/q-1, its corresponding polymerized form bitmap CBM comprises the polymerization bit position of N/q position and elongated details bit position;
(II) judge i the q hyte of bitmap BM one by one, i=0,1 ..., N/q-1, to each q hyte, judge whether its each position is 0 entirely, if the polymerization bit position i position of described polymerized form bitmap is set to 0, otherwise the i position of this polymerization bit position is set to 1, and the details bit position that copies polymerized form bitmap CBM to is appended in the corresponding position of this q hyte in bitmap BM;
(III) all q hytes of bitmap BM are finished dealing with after, its corresponding polymerized form bitmap CBM structure is finished.
Further, said system also can have following characteristics: described polymerization operator unit is when the polymerization computing of carrying out bitmap, in described step (III), also the elongated length of the details bit position of described polymerized form bitmap CBM is written to the front of its polymerization bit position, as the elongated length part of described polymerized form bitmap CBM.
Further, said system also can have following characteristics: when described bitmap comparison subelement compares the bitmap of two polymerized forms, the elongated length part, polymerization bit position and the details bit position that compare these two bitmaps successively, as long as there is a part different, just directly return two results that bitmap is different, finish; If three parts are all identical, then return two results that bitmap is identical.
Further, said system also can have following characteristics: described AND operation subelement carries out the method that AND operation obtains the CBM of bitmap as a result of polymerized form to two polymerized form bitmap CBM1 and CBM2 and is:
Each identical bits that compares the polymerization bit position of CBM1 and CBM2 successively, when comparing at every turn:
Have at least one to be 0 if participate in two positions relatively, then the identical bits of CBM polymerization bit position is set to 0;
Be 1 if participate in two positions relatively, the step-by-step AND-operation is carried out in the q hyte of the details bit position correspondence of bitmap separately in these two positions, obtain q hyte Q, if Q is 0 entirely, the identical bits of CBM polymerization bit position is set to 0, otherwise the identical bits of CBM polymerization bit position is set to 1, and is Q with this corresponding q hyte assignment of CBM details bit position and its polymerization bit position.
Further, said system also can have following characteristics: when described bitmap comparison subelement carries out the comparison of the bitmap represented with polymerized form, in step (III), also the elongated length of the details bit position of polymerized form bitmap CBM is write the front of its polymerization bit position, as its elongated length part; Correspondingly, when described AND operation subelement carries out with the AND operation of polymerized form bitmap, with after all bit comparisons of bitmap CBM1 and CBM2 polymerization bit position and handling, also the elongated length of the details bit position of polymerized form bitmap CBM is written to the elongated length part of this CBM.
As from the foregoing, the present invention is by the polymerization to rule-like coupling bitmap of equal value in the recursive stream sorting algorithm, reduced the memory space expense of recursive stream sorting system in rule set preliminary treatment generation concordance list stage equivalence class rule match bitmap table, also reduced the CPU time expense that equivalence class rule match bitmap generating run (step-by-step and computing) and equivalence class rule match bitmap table are searched, thereby the shortening pretreatment time is accelerated rule and is changed response speed.
Description of drawings
Fig. 1 is the bit-map aggregated recursive stream sorting system architecture diagram of the embodiment of the invention;
Fig. 2 is the recursion structure chart of typical recursion IP traffic classification system;
Fig. 3 is the bit-map aggregated schematic diagram of the embodiment of the invention;
Fig. 4 is the structure flow chart of the bit-map aggregated Phase of recursive stream sorting system 0 concordance list of the embodiment of the invention;
Fig. 5 is the flow chart of the bitmap AND-operation of embodiment of the invention polymerized form;
Fig. 6 is the flow chart of the bitmap compare operation of embodiment of the invention polymerized form;
Fig. 7 is the structure flow chart of the bit-map aggregated Phase J of recursive stream sorting system (J＞0) concordance list of the embodiment of the invention.
Embodiment
Bitmap is the data of N position, has stored a large amount of bitmaps in pretreatment module, and most of time all carry out bitmap " with " reach " comparison " operation.By a large amount of researching and analysing, the inventor finds that in fact " 1 " position is seldom in the bitmap, equivalence class often only with few rule match.That is to say that bitmap is sparse, therefore, the present invention is by carrying out aggregation processing to sparse bitmap list item, express the entrained information of bitmap with the shorter data of length, thereby reduce the shared memory headroom of storage of message bit pattern, and reduce bitmap " with " reach " comparison " and operate the time that is spent, just response time.
As shown in Figure 1, the described bit-map aggregated recursive stream sorting system of present embodiment mainly is made up of following control aspect and data plane two parts:
The control aspect is that this module further comprises according to the pretreatment module of classifying rules collection structural classification concordance list:
The preliminary treatment Master Control Unit is used to control each index block (chunk) that Phase 0 concordance list constructing module is constructed Phase 0, controls Phase J (J＞0) concordance list constructing module each chunk of recursion structure PhaseJ (J＞0) successively then.
Phase J (J＞0) concordance list structural unit is used for according to the recursion structure of setting upper level Chunk being carried out the Chunk that recursion calculates next stage, so increases by degrees until finally obtaining a Chunk.It comprises bitmap relatively subelement and AND operation subelement, when recursion, the form of bitmap after with polymerization represented, described bitmap comparison subelement is finished the comparison of these two bitmaps by the polymerized form of two bitmaps, and described AND operation subelement is finished the AND operation of two bitmaps with the AND operation method of polymerized form bitmap.
Data plane is that actual data packet is matched the priority index module of high rule by the classified index table, and this unit comprises concordance list and bitmap memory cell, and the Index Algorithm unit, wherein:
Concordance list and bitmap memory cell have been preserved the index blocks at different levels that structure obtains, and each index block comprises concordance list and the corresponding bitmap of representing with polymerized form.In another embodiment, the bitmap of polymerized form can only generate at the concordance list construction phase, can not preserve the bitmap of polymerized form, as long as there is concordance list just passable, certainly, needs the direct in advance EqID with afterbody to correspond to the highest rule of priority.
After a packet is received in the Index Algorithm unit, each field by packet (packet), search the concordance list of phase 0, according to identical recursion structure, weighted sum by the indexed results (being EqID) of upper level is come index next stage table as index value, up to the result who obtains the afterbody index, be the sign (eqId) of packet equivalence class on d unit space, find the corresponding the highest rule of priority of this sign at last, can get up eqId and the corresponding the highest regular direct correlation of priority at pretreatment stage.
The bit-map aggregated form that does not change the index block of recursion categorizing system of the present invention, so index module of the present invention is identical with traditional recursion categorizing system, just the form after the bitmap employing polymerization is represented.But because the polymerization of bitmap, corresponding improvement is done in the structure requirements of process of Phase 0 concordance list structural unit and Phase J (J＞0) concordance list structural unit.
Rule field of Phase 0 concordance list constructing module structure (in general be 8～16bits) corresponding Chunk method as shown in Figure 4, may further comprise the steps:
Step 120, from this rule field span (1, take out a value successively in 2B-1), B is the width of certain field in the rule;
Step 130, according to sequencing traversal rule set, if this value satisfies current rule, then bit position that should the rule correspondence in the bitmap is set to 1, otherwise is set to 0, obtains current bitmap BM;
Step 140, bitmap BM is carried out the polymerization that the degree of polymerization is q, the polymerized form that obtains this bitmap is represented CBM, hereinafter be also referred to as polymerized form bitmap CBM, the i position of its polymerization bit position is corresponding to i the q tuple of bitmap BM, this q tuple is that 0 o'clock this position is set to 0 entirely, otherwise this position is set to 1, and it is to constitute after 0 the q tuple entirely that its details bit position is removed by bitmap BM;
Step 150, bitmap (also being polymerized form) in the bitmap set under polymerized form bitmap CBM and this rule field manipulative indexing piece is compared, whether check has identical bitmap, if do not have, then generate new EqID (equivalence class sign) and it is joined during this bitmap gathers for bitmap CBM, otherwise bitmap CBM uses the EqID of its identical bitmap correspondence;
Step 160, the position with the EqID of bitmap CBM inserts current rule field value correspondence among the Chunk forms the mapping relations of field value to EqID;
Step 170 judges whether all values in this rule field span disposes, if do not have, returns step 120, if dispose, then the Chunk of this rule field correspondence structure is finished.
By the Chunk with each rule field correspondence of same method construct, Phase 0 concordance list constructing module finally constructs the concordance list of complete Phase 0.
To discuss bit-map aggregated operation method in detail with an example below.
We carry out the polymeric compressing of q Bits to the sparse bitmap of N Bits.Q is called the degree of polymerization, can get 8,16,32,64,128 equivalences so that CPU handles.Fig. 3 is that a degree of polymerization is a bit-map aggregated example of 8.
Bitmap after the polymerization is made up of three parts: first is elongated length part, is used to represent the elongated length of polymerized form bitmap details bit position, i.e. its q tuple number that comprises.This elongated length partly is redundant information, but this field is to contain abundant message bit pattern, is the feature of the deposit of faith, helps to accelerate the speed of comparison, further improves systematic function; Second portion is polymerization bit position (the q bit boundary alignment of N/q position, insufficient section mends 0), the i position of polymerization bit position is the result without the i*q in the bitmap of polymerization～i*q+1 position inclusive-OR operation, this position is that 0 its corresponding q hyte of expression is 0 entirely, and this position is that 1 its corresponding q hyte of expression has one " 1 " position at least; Third part is elongated details bit position, remove by bitmap and to equal 0 q hyte and form without polymerization, k q hyte of details bit position (the k*q～k*q+q-1 position) is corresponding to k " 1 " position of polymerization bit position, if the k of polymerization bit position " 1 " position appears on the i position, then k q hyte of details bit position equates with i q hyte (the i*q～i*q+q-1 position) without the polymerization bitmap.
The method of polymerization is as follows: successively i q hyte without the bitmap of polymerization handled (i.e. the q*i～q*i+q-1 position, i=0,1, ...), if this q hyte is not 0 entirely, then the i position of the bitmap second portion after the polymerization is set to 1, and append the third part (details bit position) that copies the bitmap after the polymerization to without this part of non-0 (the q*i～q*i+q-1 position) of the bitmap of polymerization.Otherwise the i position of the second portion of polymerized form bitmap (polymerization bit position) is set to 0.Third part is equivalent to ignore form after complete 0 the q hyte without the bitmap of polymerization.After finishing dealing with without all q hytes of the bitmap of polymerization, the first's (elongated length part) that adjusts the polymerized form bitmap again is for writing the q hyte number of third part (details bit position).
Fig. 3 be in the grader of 30 rules certain equivalence class the polymerization schematic diagram of corresponding bitmap, { 0,1,2, the 20} coupling is got degree of polymerization q=8 for this equivalence class and rule.Because " 1 " position is arranged without among 0～8,16～23 of the bitmap of polymerization, so the 1st, 3 of the polymerization bit position of polymerized form bitmap is " 1 ", other position is " 0 ", has comprised the q hyte without non-complete 0 in the bitmap of polymerization in its details bit position, promptly 0～8 and 16～23.
Need the polymerized form bitmap is done two kinds of operations in bit-map aggregated recursive stream sorting system, first kind is the AND operation of two polymerized form bitmaps, and in the hope of the bitmap (polymerized form) of two equivalence classes common factors (new equivalence class), its flow process is referring to Fig. 5.Second kind is the compare operation of two polymerized form bitmaps, is used to judge whether two equivalence classes can merge, and its flow process is referring to Fig. 6.
The flow process of Fig. 5 is used for two polymerized form bitmap CBM1 and CBM2 are carried out and computing, obtains the CBM of bitmap as a result of polymerized form, comprises the steps:
Step 220 judges whether participate in two bit positions relatively has at least one to be 0, if, carry out next step, otherwise, execution in step 240;
Step 240 with carrying out the step-by-step AND operation with " polymerization bit position " these two corresponding q hytes separately among CBM1 and the CBM2 " details bit position ", obtains q hyte Q;
Step 250 judges whether this q hyte Q is 0 entirely, if, execution in step 230, otherwise, next step carried out;
Step 270 judges whether all positions of CBM1 and CBM2 " polymerization bit position " dispose, if, carry out next step, otherwise, step 210 returned;
Fig. 6 shows the flow process that two polymerized form bitmap CBM1 and CBM2 is compared operation, may further comprise the steps:
Step 340 is returned the two identical result, finishes;
Step 350 is returned the two different result, finishes.
As can be seen, compare bitmap in the traditional recursive stream sorting system " with " reach " comparison " operation, data bitmap length after the polymerization is shorter, " with " to reach " comparison " operation spended time also short, so the bit-map aggregated recursive stream sorting system pretreatment module processing time is short, the response time reduces.
Phase J (J＞0) concordance list constructing module carries out recursion by the Chunk that previous stage is generated and calculates, and obtains the concordance list of its next stage, and this process goes on (J constantly increases) always, becomes a Chunk up to the last recursion of all Chunk.
To two Chunk 1 and Chunk 2 carry out recursion obtain recursion as a result Chunk 3 method as shown in Figure 7, may further comprise the steps:
Step 410 is taken out two equivalence classes that adhere to Chunk 1 and Chunk 2 separately and is identified EqID1 and EqID2, and polymerized form bitmap CBM1 and CBM2 that it is corresponding carry out AND-operation, generate the CBM3 of bitmap as a result of a polymerized form that belongs to Chunk 3;
Step 420 checks in the bitmap set of polymerized form bitmap CBM3 under Chunk 3 whether exist, if do not exist, carry out next step, if there is execution in step 440;
Step 430 is that bitmap CBM3 generates new EqID, and it is joined in the bitmaps set under the Chunk 3 execution in step 450;
Step 450 is calculated equivalence class number+EqID2 of EqID1 * Chunk 2, the result as among the Chunk3 corresponding to the index value of bitmap CBM3;
Step 470 judges whether the combination of any two equivalence classes sign among Chunk 1 and the Chunk 2 all disposes, if be untreated, returns step 410, if finish dealing with, has then obtained recursion Chunk 3 as a result, finishes.
For the categorizing system with Fig. 2 recursion structure, the bit-map aggregated recursion categorizing system emulation on Pentium M1.6GHz computer of traditional recursion categorizing system and employing the present invention contrasts as follows:
Article one, 1000, the grader of standard acl classifying rules, traditional recursion classifier algorithm and bit-map aggregated recursion grader (degree of polymerization 32) relatively see Table 1.
Table 1:1000 bar standard acl rule-based classification relatively
| EMS memory occupation | Response time | |
| Tradition recursion categorizing system | 13,173,102 | ＜1s |
| Bit-map aggregated recursion categorizing system | 1,654,800 | ＜1s |
Article two, 1000, the grader of expansion acl classifying rules, traditional recursion classifier algorithm and bit-map aggregated recursion grader (degree of polymerization 32) relatively see Table 2.
Table 2:1000 bar expansion acl rule-based classification relatively
| EMS memory occupation | Response time | |
| Tradition recursion categorizing system | 13,173,102 | 157s |
| Bit-map aggregated recursion categorizing system | 7,526,704 | ＜1s |
Article three, 2000, the grader of expansion acl classifying rules, traditional recursion classifier algorithm and bit-map aggregated recursion grader (degree of polymerization 32) relatively see Table 3.
Table 3:2000 bar expansion acl rule-based classification relatively
| EMS memory occupation | Response time | |
| Tradition recursion categorizing system | 26,728,467 | ?2,052s |
| Bit-map aggregated recursion categorizing system | 18,032,924 | ?4s |
Facts have proved that improved rule changes the response time and optimized 10～100 times, space expense has been optimized 2～10 times.As seen improvement has obtained goodish effect, and its internal memory and response time expense can satisfy the requirement of the grader of expansion acl rule more than 2000 fully.
Claims (15)
1, a kind of bit-map aggregated recursive stream sorting method is applied to the recursive stream sorting system, may further comprise the steps:
(a) at first construct an initial bitmap, make its each rule corresponding to regular collection, in a rule field span, take out a value then, the traversal rule set, if this value satisfies current rule, position that should the rule correspondence in the bitmap is set to 1, otherwise puts 0, obtains a bitmap BM;
(b) bitmap BM is carried out the polymerization that the degree of polymerization is q, obtain comprising the polymerization bit position of fixed length and the polymerized form bitmap CBM of elongated details bit position, the i position of its polymerization bit position is corresponding to i the q tuple of bitmap BM, this q tuple is that 0 o'clock this position is set to 0 entirely, otherwise this position is set to 1, and it is to constitute after 0 the q tuple entirely that its details bit position is removed by bitmap BM;
(c) the polymerized form bitmap during relatively the affiliated bitmap of polymerized form bitmap CBM and this rule field manipulative indexing piece is gathered, check and whether have identical bitmap, if do not have, for bitmap CBM generates new equivalence class sign and it is joined this bitmap set, otherwise bitmap CBM uses the equivalence class sign of its identical bitmap correspondence; Then, in described index block, set up the equivalence class sign of bitmap CBM and the mapping relations of current rule field value;
(d) to each value in this rule field span, after (a) finishes dealing with to the method for (c) set by step, the index block structure of this rule field correspondence is finished, and goes out the index block of each rule field correspondence again by same method construct, forms the 0th grade of complete concordance list;
(e) according to the recursion structure of setting, index block to upper level carries out recursion, obtain the index block of its next stage, two bitmaps compare by its polymerized form during recursion, the AND operation of two bitmaps is finished with the AND operation method of polymerized form bitmap, so increase by degrees, become an index block until the last recursion of all index blocks;
(f) after a packet is received by the recursive stream sorting system, search a concordance list of the 0th grade according to this packet each field relevant with traffic classification, the index value that is obtained by the indexed results computing of some upper levels comes index next stage table, up to obtaining the afterbody indexed results, then will this data packet matched the highest rule of priority that meets the demands to it.
2, the method for claim 1 is characterized in that, described step (b) is further divided into following steps:
(b1) by the degree of polymerization q that sets the bitmap BM of N position is divided into N/q q hyte, i q hyte is corresponding to the q*i in the bitmap～q*i+q-1 position, i=0,1, ..., N/q-1, its corresponding polymerized form bitmap CBM comprises the polymerization bit position of N/q position and elongated details bit position;
(b2) judge i the q hyte of bitmap BM one by one, i=0,1 ..., N/q-1, to each q hyte, judge whether its each position is 0 entirely, if the polymerization bit position i position of described polymerized form bitmap is set to 0, otherwise the i position of this polymerization bit position is set to 1, and the details bit position that copies polymerized form bitmap CBM to is appended in the corresponding position of this q hyte in bitmap BM;
(b3) all q hytes of bitmap BM are finished dealing with after, its corresponding polymerized form bitmap CBM structure is finished.
3, method as claimed in claim 2 is characterized in that, the polymerization bit position of described polymerized form bitmap adopts the alignment of q bit boundary, and insufficient section mends 0.
4, method as claimed in claim 2, it is characterized in that, also comprise step after the described step (b3): again the q hyte number of described polymerized form bitmap details bit position is written to the front of its polymerization bit position, as the elongated length part of described polymerized form bitmap.
5, method as claimed in claim 4, it is characterized in that, the comparison algorithm of described polymerized form bitmap is: the elongated length part, polymerization bit position and the details bit position that compare polymerized form bitmap CBM1 and CBM2 successively, as long as there is a part different, directly return two results that bitmap is different, finish; If three parts are all identical, then return two results that bitmap is identical.
6, method as claimed in claim 2 is characterized in that, the method for two polymerized form bitmap CBM1 and CBM2 being carried out obtaining with computing the CBM of bitmap as a result of polymerized form is:
Each identical bits that compares the polymerization bit position of CBM1 and CBM2 successively, when comparing at every turn:
Have at least one to be 0 if participate in two positions relatively, then the identical bits of CBM polymerization bit position is set to 0;
Be 1 if participate in two positions relatively, the step-by-step AND-operation is carried out in the q hyte of the details bit position correspondence of bitmap separately in these two positions, obtain q hyte Q, if Q is 0 entirely, the identical bits of CBM polymerization bit position is set to 0, otherwise the identical bits of CBM polymerization bit position is set to 1, and is Q with this corresponding q hyte assignment of CBM details bit position and its polymerization bit position.
7, method as claimed in claim 6 is characterized in that, in the described step (b3), also the q hyte number of described polymerized form bitmap details bit position is write the front of its polymerization bit position, as the elongated length part of this polymerized form bitmap; And when carrying out the AND operation of bitmap CBM1 and CBM2, after all bit comparisons of both polymerization bit positions and handling, also the elongated length with the CBM details bit position that obtains is written to its elongated length part, obtains comprising the CBM of bitmap as a result of three parts.
8, as the described method of arbitrary claim in the claim 1 to 7, it is characterized in that, when described step (e) obtains next stage index block Chunk3 to two index block Chunk1 of upper level and Chunk2 recursion, two equivalence classes that adhere to two index block Chunk1 and Chunk2 separately are identified EqID1 and EqID2, carry out following steps:
(e1) the polymerized form bitmap with EqID1 and EqID2 correspondence carries out AND-operation, generates the bitmap CBM3 of a polymerized form that belongs to next stage index block Chunk3;
(e2) checking in the bitmap set of polymerized form bitmap CBM3 under Chunk3 whether exist, if do not exist, is that it generates new equivalence class sign, and it is joined under the Chunk3 in the bitmap set; If exist, then bitmap CBM3 uses the equivalence class sign of the bitmap identical with it;
(e3) calculate EqID1 * (the equivalence class number of Chunk2)+EqID2, as among the Chunk3 corresponding to the index value of bitmap CBM3, then the equivalence class sign of bitmap CBM3 is inserted the position of this index value correspondence among the Chunk3, formed the mapping relations of field value to this equivalence class sign;
Any two equivalence classes sign among Chunk1 and the Chunk2 after finishing dealing with as stated above, obtains final recursion Chunk3 as a result.
9, the method for claim 1 is characterized in that, described degree of polymerization q is 8,16,32,64 or 128.
10, a kind of bit-map aggregated recursive stream sorting system, comprise and be used for matching the priority index module of high rule by the classified index table according to the pretreatment module of classifying rules collection structural classification concordance list with actual data packet, described pretreatment module comprises preliminary treatment Master Control Unit, the 0th grade of concordance list structural unit and J level concordance list structural unit, described index module comprises concordance list and bitmap memory cell, Index Algorithm unit, it is characterized in that:
Described preliminary treatment Master Control Unit is used to control each index block that the 0th grade of concordance list structural unit constructed the 0th grade, control then J level concordance list structural unit successively recursion construct each index block of J level;
Described the 0th grade of concordance list structural unit comprises polymerization operator unit and bitmap compares subelement, when the index block of each rule field correspondence of structure, described polymerization operator unit is used for the bitmap BM without polymerization is carried out the polymerization that the degree of polymerization is q, obtain comprising the polymerization bit position of fixed length and the polymerized form bitmap CBM of elongated details bit position, the i position of its polymerization bit position is corresponding to i the q tuple of bitmap BM, this q tuple is that 0 o'clock this position is set to 0 entirely, otherwise this position is set to 1, and it is to constitute after 0 the q tuple entirely that its details bit position is removed by bitmap BM; And described bitmap comparison subelement is finished the comparison of these two bitmaps by the polymerized form of two bitmaps;
Described J level concordance list structural unit comprises bitmap relatively subelement and AND operation subelement, in recursion structure according to setting, the upper level index block is carried out recursion when obtaining the next stage index block, the form of bitmap after with polymerization represented, described bitmap comparison subelement is finished the comparison of these two bitmaps by the polymerized form of two bitmaps, and described AND operation subelement is finished the AND operation of two bitmaps with the AND operation method of polymerized form bitmap;
Described concordance list and bitmap memory cell are used to preserve the concordance lists at different levels that structure obtains;
After described Index Algorithm unit is used to receive a packet, each field by packet, search a concordance list of the 0th grade, according to identical recursion structure, weighted sum by the indexed results of upper level is come index next stage table as index value, up to the result who obtains the afterbody index, find the corresponding the highest rule of priority of this sign at last, at pretreatment stage this sign and the corresponding the highest regular direct correlation of priority are got up.
11, system as claimed in claim 10 is characterized in that, described polymerization operator unit is done in such a manner the polymerization computing to bitmap:
(I) by the degree of polymerization q that sets the bitmap BM of N position is divided into N/q q hyte, i q hyte is corresponding to the q*i in the bitmap～q*i+q-1 position, i=0,1, ..., N/q-1, its corresponding polymerized form bitmap CBM comprises the polymerization bit position of N/q position and elongated details bit position;
(II) judge i the q hyte of bitmap BM one by one, i=0,1 ..., N/q-1, to each q hyte, judge whether its each position is 0 entirely, if the polymerization bit position i position of described polymerized form bitmap is set to 0, otherwise the i position of this polymerization bit position is set to 1, and the details bit position that copies polymerized form bitmap CBM to is appended in the corresponding position of this q hyte in bitmap BM;
(III) all q hytes of bitmap BM are finished dealing with after, its corresponding polymerized form bitmap CBM structure is finished.
12, system as claimed in claim 11, it is characterized in that, described polymerization operator unit is when the polymerization computing of carrying out bitmap, in described step (III), also the q hyte number of the details bit position of described polymerized form bitmap CBM is written to the front of its polymerization bit position, as the elongated length part of described polymerized form bitmap CBM.
13, system as claimed in claim 12, it is characterized in that, when described bitmap comparison subelement compares the bitmap of two polymerized forms, the elongated length part, polymerization bit position and the details bit position that compare these two bitmaps successively, as long as there is a part different, just directly return two results that bitmap is different, finish; If three parts are all identical, then return two results that bitmap is identical.
14, system as claimed in claim 10 is characterized in that, described AND operation subelement carries out the method that AND operation obtains the CBM of bitmap as a result of polymerized form to two polymerized form bitmap CBM1 and CBM2 and is:
Each identical bits that compares the polymerization bit position of CBM1 and CBM2 successively, when comparing at every turn:
Have at least one to be 0 if participate in two positions relatively, then the identical bits of CBM polymerization bit position is set to 0;
Be 1 if participate in two positions relatively, the step-by-step AND-operation is carried out in the q hyte of the details bit position correspondence of bitmap separately in these two positions, obtain q hyte Q, if Q is 0 entirely, the identical bits of CBM polymerization bit position is set to 0, otherwise the identical bits of CBM polymerization bit position is set to 1, and is Q with this corresponding q hyte assignment of CBM details bit position and its polymerization bit position.
15, system as claimed in claim 14, it is characterized in that, when described bitmap comparison subelement carries out the comparison of the bitmap represented with polymerized form, in step (III), also the elongated length of the details bit position of polymerized form bitmap CBM is write the front of its polymerization bit position, as its elongated length part; Correspondingly, when described AND operation subelement carries out with the AND operation of polymerized form bitmap, with after all bit comparisons of bitmap CBM1 and CBM2 polymerization bit position and handling, also the elongated length of the details bit position of polymerized form bitmap CBM is written to the elongated length part of this CBM.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100749196A CN100440859C (en) | 2005-06-06 | 2005-06-06 | Bit-map aggregated recursive stream sorting method and its system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100749196A CN100440859C (en) | 2005-06-06 | 2005-06-06 | Bit-map aggregated recursive stream sorting method and its system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1878123A CN1878123A (en) | 2006-12-13 |
| CN100440859C true CN100440859C (en) | 2008-12-03 |
Family
ID=37510425
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100749196A Expired - Fee Related CN100440859C (en) | 2005-06-06 | 2005-06-06 | Bit-map aggregated recursive stream sorting method and its system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100440859C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9832259B2 (en) | 2013-06-28 | 2017-11-28 | Huawei Technologies Co., Ltd. | Method and apparatus for cell configuration |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571531B (en) * | 2010-12-16 | 2016-08-24 | 上海博达数据通信有限公司 | A kind of classified matching method accessing control list |
| CN103065084B (en) * | 2012-12-27 | 2015-10-21 | 武汉大学 | In the windows hidden process detection method that external machine of virtual machine is carried out |
| TWI672666B (en) * | 2017-08-09 | 2019-09-21 | 宏碁股份有限公司 | Method of processing image data and related device |
| CN109995813B (en) * | 2017-12-29 | 2021-02-26 | 华为技术有限公司 | Partition expansion method, data storage method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6147976A (en) * | 1996-06-24 | 2000-11-14 | Cabletron Systems, Inc. | Fast network layer packet filter |
| WO2002015488A1 (en) * | 2000-08-17 | 2002-02-21 | Redback Networks Inc. | Methods and apparatus for packet classification with multiple answer sets |
| CN1477494A (en) * | 2002-08-20 | 2004-02-25 | 深圳市中兴通讯股份有限公司上海第二 | Data packet recursive flow sorting method |
| CN1545254A (en) * | 2003-11-13 | 2004-11-10 | 中兴通讯股份有限公司 | A method of fast data packet filtering |
| CN1622521A (en) * | 2003-11-25 | 2005-06-01 | 华为技术有限公司 | A method for implementing IP message stream classification |
-
2005
- 2005-06-06 CN CNB2005100749196A patent/CN100440859C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6147976A (en) * | 1996-06-24 | 2000-11-14 | Cabletron Systems, Inc. | Fast network layer packet filter |
| WO2002015488A1 (en) * | 2000-08-17 | 2002-02-21 | Redback Networks Inc. | Methods and apparatus for packet classification with multiple answer sets |
| CN1477494A (en) * | 2002-08-20 | 2004-02-25 | 深圳市中兴通讯股份有限公司上海第二 | Data packet recursive flow sorting method |
| CN1545254A (en) * | 2003-11-13 | 2004-11-10 | 中兴通讯股份有限公司 | A method of fast data packet filtering |
| CN1622521A (en) * | 2003-11-25 | 2005-06-01 | 华为技术有限公司 | A method for implementing IP message stream classification |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9832259B2 (en) | 2013-06-28 | 2017-11-28 | Huawei Technologies Co., Ltd. | Method and apparatus for cell configuration |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1878123A (en) | 2006-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3485262B2 (en) | Method and means for classifying data packets | |
| EP1227630B1 (en) | Method, system and computer program product for classifying packet flows with a bit mask | |
| CN1881950B (en) | Packet classification acceleration using spectral analysis | |
| CN100385880C (en) | Packet classification apparatus and method using field level tries | |
| CN100440859C (en) | Bit-map aggregated recursive stream sorting method and its system | |
| CN112463774B (en) | Text data duplication eliminating method, equipment and storage medium | |
| CN108287840A (en) | A kind of data storage and query method based on matrix Hash | |
| CN107656978B (en) | Function dependence-based diverse data restoration method | |
| Saha et al. | Correlation clustering with same-cluster queries bounded by optimal cost | |
| CN103678583A (en) | Method and system for comparing structural data | |
| CN107145516A (en) | A kind of Text Clustering Method and system | |
| CN112131356B (en) | Message keyword matching method and device based on TCAM | |
| CN105827603A (en) | Inexplicit protocol feature library establishment method and device and inexplicit message classification method and device | |
| Gulzar et al. | Optimizing skyline query processing in incomplete data | |
| CN104125146B (en) | A kind of method for processing business and device | |
| CN110334104A (en) | A kind of list update method, device, electronic equipment and storage medium | |
| CN112435032A (en) | Bit currency address incremental clustering method based on multi-input address clustering | |
| Zhang et al. | Logistics service supply chain order allocation mixed K-Means and Qos matching | |
| CN116204647A (en) | Method and device for establishing target comparison learning model and text clustering | |
| Gulzar et al. | IDSA: An efficient algorithm for skyline queries computation on dynamic and incomplete data with changing states | |
| US11025650B2 (en) | Multi-pattern policy detection system and method | |
| WO2020048145A1 (en) | Method and device for data retrieval | |
| US20190243821A1 (en) | Method and system for high performance data matching and match set grouping | |
| Choi et al. | Optimization of Dominance Testing in Skyline Queries Using Decision Trees | |
| CN115687599B (en) | Service data processing method and device, electronic equipment and storage medium |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: NANJING CHUANGMA TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: ZTE CORPORATION Effective date: 20140409 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518057 SHENZHEN, GUANGDONG PROVINCE TO: 210012 NANJING, JIANGSU PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20140409 Address after: Yuhuatai District of Nanjing City, Jiangsu province 210012 Bauhinia Road No. 68 Patentee after: Nanjing creates a code science and technology limited liability company Address before: 518057 Nanshan District, Guangdong high tech Industrial Park, science and Technology Industrial Park, ZTE building, block A, layer 6, layer Patentee before: ZTE Corporation |
|
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081203 Termination date: 20140606 |