CN106789727A - Packet classification method and device - Google Patents

Packet classification method and device Download PDF

Info

Publication number
CN106789727A
CN106789727A CN201611229592.XA CN201611229592A CN106789727A CN 106789727 A CN106789727 A CN 106789727A CN 201611229592 A CN201611229592 A CN 201611229592A CN 106789727 A CN106789727 A CN 106789727A
Authority
CN
China
Prior art keywords
bit
tables
matching domain
searches
list item
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201611229592.XA
Other languages
Chinese (zh)
Other versions
CN106789727B (en
Inventor
任岚晖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ruijie Networks Co Ltd
Original Assignee
Ruijie Networks Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ruijie Networks Co Ltd filed Critical Ruijie Networks Co Ltd
Priority to CN201611229592.XA priority Critical patent/CN106789727B/en
Publication of CN106789727A publication Critical patent/CN106789727A/en
Application granted granted Critical
Publication of CN106789727B publication Critical patent/CN106789727B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers

Abstract

The invention discloses a kind of packet classification method and device, it is related to the communications field, for realizing that rapid message is classified.Packet classification method includes：In the stage of lookup, the matching domain lookup according to message obtains corresponding ground floor and searches the IT table list items of structure, and obtains the ET table table item index values stored in the IT table list items；The ET table table item index values for searching structure according to the preceding layer for obtaining are calculated the index value that current layer searches the IT table list items of structure, and obtain the ET table table item index values stored in the IT table list items of corresponding current layer lookup structure, if it is that last layer searches structure that current layer searches structure, the ET table table item indexes stored in the IT table list items that structure is then searched according to the current layer for obtaining are worth to the ET table list items that current layer searches structure, wherein, the rule come into force corresponding to bit of the bit map for being stored in the ET table list items is the goal rule of the affiliated type of message.The embodiment of the present invention is applied to message classification.

Description

Packet classification method and device
Technical field
The present invention relates to the communications field, more particularly to a kind of packet classification method and device.
Background technology
In the network equipments such as router, fire wall, the priority generally according to regular collection carries out message classification, so that Realize corresponding business function.Wherein, regular collection include IP (internet protocol, Internet protocol) routing table, ACL (access control list, accesses control list) filter table, Filter (filtering) table etc., they are all by many rules and regulations Then constitute, generally comprise multiple different thresholdings (also referred to as matching domain) per rule, such as MAC (media access control, Media access control) address, IP address, port numbers, protocol number etc., priority and corresponding is also corresponded to per rule Action.Message classification, i.e., search the rule of all matching messages in above-mentioned regular collection, and selects the one of highest priority Rule, according to the regular corresponding action, is disposed to the message, for example, forward, abandon, change header field Deng.
Current existing message classifying algorithm, mainly there is Hash (Hash), Hi-Cuts, TSS (tuple space Search, tuple space search), TCAM (ternary content addressable memory, three-state content addressing storage Device), RFC (recursive flow classification) etc..But with the continuous popularization and development of SDN technologies, wherein Forward table in the middle of southbound interface defined in extensive adopted OpenFlow (open flows) agreement, it is desirable to which message classifying algorithm exists Rapid message is classified simultaneously, also to support dynamic renewal.
Hash algorithm is particularly well-suited to accurately mate, supports big dimension, the message classification of Large Copacity, when all of rule When being all accurate Value Types with domain, hash algorithm is optimal selection.But most message classification is not simple accurate Matching problem, therefore applicability is not wide.
Hi-Cuts algorithms build a tree-like lookup structure by the way of the cutting per domain, and one tree includes two types Node composition：Leaf node and internal node.Leaf node stores a rule or a best match regular collection, interior Portion's node not storage rule but storage selection branch Rule of judgment.In order to carry out message classification, according to the matching domain of message It is built into and finds key value.Before leaf node is not reached, will find key value compared with branch's Rule of judgment of internal node Compared with selecting branch.If leaf node only include a rule, be taken as best match rule, but if leaf node Store multiple rules, in addition it is also necessary to carry out small-scale linear sweep.There is the matching that a large amount of all-pass are matched somebody with somebody in regular in the algorithm During thresholding, there are a large amount of rules and replicate, not only memory cost is big, and can largely reduce lookup speed, while by In rule on each leaf node by massive duplication, therefore do not possess dynamic more New function, be only capable of by rebuild tree realize rule Increase and deletion then.
TSS algorithms, its basic idea is the index that classified index value is divided into several accurately mates by Hash table Value problem, can apply in the multi-dimensional Packet Classification problem with prefix rule.With in IPv4<SIP+DIP>Classification problem be , all there are many different prefix lengths in SIP and DIP, in theory in example<SIP+DIP>Prefix length combination variety be 32* 32 kinds, the combination of each prefix length all corresponds to a tuple, is searched using hash algorithm in each tuple, therefore each Rule searching speed in tuple is exceedingly fast.But due in header field and not comprising characterize prefix length information, because This needs all to must search for all of tuple for every message, therefore query performance is relatively low.
RFC may be considered the BV algorithms of modified version to a certain extent, by should be done in query process Initial phase is advanceed to by bit and computing, certain pretreatment energy is sacrificed, speed is searched in lifting.Algorithm lookup property Can be exceedingly fast, but pre-treating speed and storage overhead are larger, while belonging to state algorithm, but when needing a newly-increased rule, need Searching data structure is reconstructed, it is time-consuming to receive, therefore it is applicable only to the scene for hardly updating.
There is the message classifying algorithm realized based on TCAM using more algorithm at present, compared with regular software algorithm, TCAM Belong to hardware realization, therefore its query performance is exceedingly fast, but TCAM capacity is constrained to, while also have updating slow, power consumption pole Big the shortcomings of.
The content of the invention
Embodiments of the invention provide a kind of packet classification method and device, for realizing that rapid message is classified.
To reach above-mentioned purpose, embodiments of the invention are adopted the following technical scheme that：
A kind of first aspect, there is provided packet classification method, including：
In the stage of lookup, the matching domain lookup according to message obtains the IT table list items that corresponding ground floor searches structure, and The ET table table item index values stored in the IT table list items for obtaining the corresponding ground floor lookup structure；
The ET table table item index values for searching structure according to the preceding layer for obtaining are calculated the IT tables that current layer searches structure The index value of list item, and the ET table table item index values stored in the IT table list items of corresponding current layer lookup structure are obtained, if It is that last layer searches structure that current layer searches structure, then stored in the IT table list items according to the current layer lookup structure for obtaining ET table table item indexes are worth to the ET table list items that current layer searches structure, wherein, the current layer for obtaining searches the ET table tables of structure The rule come into force corresponding to bit of the bit map stored in is the goal rule of the affiliated type of the message.
A kind of second aspect, there is provided message classification device, including：
Searching unit, for obtaining the IT table list items that corresponding ground floor searches structure according to the matching domain lookup of message, And obtain the ET table table item index values stored in the IT table list items of the corresponding ground floor lookup structure；
The searching unit, is additionally operable to be calculated according to the ET table table item index values of the preceding layer lookup structure for obtaining and works as Front layer searches the index value of the IT table list items of structure, and obtains the ET stored in the IT table list items of corresponding current layer lookup structure Table table item index value, if it is that last layer searches structure that current layer searches structure, structure is searched according to the current layer for obtaining IT table list items in store ET table table item indexes be worth to current layer search structure ET table list items, wherein, what is obtained is current The rule come into force corresponding to bit of the bit map stored in the ET table list items of layer lookup structure is the affiliated class of the message The goal rule of type.
Packet classification method provided in an embodiment of the present invention and device, in search procedure, according to the matching domain pair of message Answer ground floor to search the IT table table item indexes of structure, obtain the ET table table item indexes stored in IT table list items, then successively basis The ET table table item index values that preceding layer searches structure are calculated the index value that current layer searches the IT table list items of structure, if worked as It is that last layer searches structure that front layer searches structure, then the ET table table item index values that can obtain being stored in the IT table list items are corresponding ET table list items, the rule come into force corresponding to bit of the bit map stored in the ET table list items is goal rule, by right The matching domain of message successively searches matched rule according to index value, constantly reduces seeking scope, it is possible to achieve message is quickly divided Class.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing The accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with Other accompanying drawings are obtained according to these accompanying drawings.
The schematic flow sheet of the packet classification method that Fig. 1 is provided for embodiments of the invention；
The schematic diagram of the lookup structure that Fig. 2 is provided for embodiments of the invention；
The schematic diagram of the hierarchical block pressure texture that Fig. 3 is provided for embodiments of the invention；
Fig. 4 is searched for what embodiments of the invention were provided according to the matching domain generation ground floor that each is regular in regular collection The schematic flow sheet of structure；
Fig. 5 searches the schematic diagram for including even number lookup structure in structure for the preceding layer that embodiments of the invention are provided；
Fig. 6 searches the schematic diagram for including odd number lookup structure in structure for the preceding layer that embodiments of the invention are provided；
The index and bit map of the ET table list items according to preceding layer lookup structure that Fig. 7 is provided for embodiments of the invention Generation current layer searches the schematic flow sheet of structure；
The index and bit map of the ET table list items according to preceding layer lookup structure that Fig. 8 is provided for embodiments of the invention Generation current layer searches the schematic diagram of structure；
The renewal plan of bit map in the ET tables of structure is searched ground floor in the determination that Fig. 9 is provided for embodiments of the invention Schematic flow sheet slightly；
Figure 10 belongs to the signal of the first situation for newly-increased matching domain that embodiments of the invention are provided with existing matching domain Figure；
Figure 11 belongs to second signal of situation for the newly-increased matching domain that embodiments of the invention are provided with existing matching domain Figure；
Figure 12 belongs to the signal of the third situation for newly-increased matching domain that embodiments of the invention are provided with existing matching domain Figure；
Figure 13 belongs to the 4th kind of signal of situation for the newly-increased matching domain that embodiments of the invention are provided with existing matching domain Figure；
A kind of schematic diagram for searching ground floor topology update that Figure 14 is provided for embodiments of the invention；
A kind of schematic diagram for searching non-ground floor topology update that Figure 15 is provided for embodiments of the invention；
Figure 16 another schematic diagrames for searching non-ground floor topology update for embodiments of the invention are provided；
Figure 17 is the structural representation of message classification device provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made Embodiment, belongs to the scope of protection of the invention.
One message classification device C is by T rule composition rule set R, R={ Rj|1<=j<=T }, T is also referred to as message Classification capacity, rule is made up of the content of three aspects：1) rule RjIn each single item Rj[i], wherein 1<=i<=d, and report D domain in literary head is corresponding, and wherein d is also referred to as the dimension of message classification problem；2) with a number Pri (Rj) display rule Priority in grader；3) one action Action (R of rule correspondencej)。
For a message P, the d-tuple (P in and if only if heading1,P2,…Pd) and rule RjCentral Rj[i] (meet R when matching one by onejDuring the restriction scope of [i]), then claim message P matched rules Rj, wherein 1<=i<=d；Rj[i's] Concrete form has accurately mate, scope, prefix (matching most long, match somebody with somebody comprising all-pass), the matching of non-domain etc., each Rj[i] is referred to as Matching domain.
In the last strictly all rules set matched from message P, the regular R with limit priority is foundj, both hit rule Then Rj。
Packet classification method provided in an embodiment of the present invention, is divided into initial phase, lookup stage and more new stage, reference Shown in Fig. 1, including：
S101, in initial phase, structure is searched according to the matching domain generation ground floor that each is regular in regular collection (lookup structure, LS).
Exemplary, it is assumed that a rule is included in regular collection：[SP：(0,1024)DP：(18,18) priority：X is moved Make：Y], wherein, SP (source port, source port) one matching domain of correspondence, the span of the SP matching domains be [0, 1024]；DP (destination port, destination interface) corresponds to another matching domain, and the span of the DP matching domains is [18,18]。
Storage mode provided in an embodiment of the present invention presses functional stratification, and it includes that at least one of which searches structure, every layer of lookup Structure includes that at least one searches structure.The embodiment of the present invention unless otherwise instructed, search structure and refer to this by T layers for referring to A T layers of lookup structure of lookup structure, T >=1.No matter being located at which layer searches structure, each searches structure includes IT (index table, concordance list) table and ET (extended bit vector table, extended bit vector table) table.It is exemplary , shown in reference picture 2, LS therein11Represent that ground floor searches first lookup structure in structure, similar LS21Represent The second layer searches first lookup structure in structure.It should be noted that the embodiment of the present invention is unless otherwise instructed, IT tables pair Corresponding ET tables list item of ET tables or IT table list items answered etc. discusses the IT tables and ET tables referred both in same lookup structure.
Each matching domain correspondence ground floor searches at least one of structure and searches structure.Specifically, for certain matching For domain, different spans are had according to its different bit wide, it is therefore desirable to which the bit wide according to each matching domain determines first Search the length in the IT tables of structure.Common matching domain includes IP (internet protocol, Internet protocol) address (accounting for 32bit), port numbers (accounting for 16bit), protocol number (accounting for 8bit), identifier (accounting for 8bit) etc., it is assumed that wide on the basis of 16bit Degree determines an IT table length for lookup structure, then it is 2 that the maximum table of the IT tables of each ground floor lookup structure is long16=65536, That is the index of IT tables list item may correspond to the value that matching domain is 0-65535.Now, when header Lookup Field is more than 16bit When, it is necessary to split to it, the 32bit of such as source IP address needs to split into two and searches structure SIP-LO (source IP Low, source IP low byte) and SIP-HI (source IP high, source IP high byte)；When header Lookup Field width is less than During 16bit, can select to combine or do not combine, such as protocol number 8bit and identifier 8bit can be combined into the one of 16bit Individual lookup structure；Or distinguish when not combining corresponding IT tables it is long be respectively 28=256.It is exemplary in Fig. 2 to show first The bit wide of individual matching domain is 16bit, and corresponding ground floor searches structure LS11IT tables it is long by 65536.
In ground floor searches structure, the index a of IT table list items a is corresponding when being a with the matching domain value, that is, work as matching When domain value is a, the IT table list item a assignment of structure is searched to ground floor.Exemplary, shown in reference picture 2, it is assumed that LS11Table Show that the corresponding ground floor of source port matching domain searches structure.Assuming that the span of source port matching domain is 0-65535, when this Correspond to the IT tables list item 0 that ground floor searches structure when with domain value being 0 (IT table indexs are 0).Is stored in IT table list items a One layer of index b of the ET table list items b of lookup structure, it is exemplary, shown in reference picture 2, it is assumed that storage value in list item 0 in IT tables It is 1, then corresponding to the index (ET table indexs are 1) of the list item 1 in ET tables.The value of the bit map in ET table list items b is used for Whether the regular matching domain for identifying the correspondence position in the regular collection includes value a, wherein, a >=0, b >=0.It is exemplary , shown in reference picture 2, it is assumed that the bit in ET tables list item 1 is 0011000, from left to right each bit corresponds to rule A rule in then gathering, first bit corresponds to rule 0, and second bit corresponds to rule 1, and the rest may be inferred, Represented when putting 1 during comprising value a, then the source port matching domain of the rule 2 and 3 in 0011000 expression regular collection is included and taken Value 0, the source port matching domain of rule 0,1,4,5 and 6 does not include value 0, and the bit that now comes into force refers to the bit for putting 1.Ability Field technique personnel be contemplated that, it is also possible to which setting represents that comprising value a the bit that now comes into force refers to the bit for setting to 0 when setting to 0 Position, the embodiment of the present invention is only illustrated with being represented when putting 1 comprising value a.
When the bit map of each list item in regular collection capacity hour ET tables directly can use Bit String long (for example 001110101... etc.) stored, bit map length is consistent with regular collection capacity, the 0th delegate rules 0, the 1st generation Table rule 1, so corresponds, and when putting 1, expression can find the rule by matching domain, otherwise cannot find the rule, specifically As shown in Figure 2.
And if when rule capacity is big still using Bit String form long, not only memory space expense is big, and largely Time to expend with computing on because by experiment, finding there are the bits that a large amount of continuous values are for 0 in bit map Position.So above-mentioned bit map can use hierarchical block pressure texture, the number of plies of hierarchical block pressure texture and every layer of bit map Length is determined by the capacity of regular collection.Hierarchical block pressure texture can include S layers of Bit String, wherein, s layers of Bit String Each corresponds to s+1 layers of a Bit String, and when a Bit String is all 0 in s layers, this is all 0 Bit String and right The Bit String of s+1 layers for answering is not stored, and the length for each Bit String is not defined, and 0<s<S.Exemplary, reference Shown in Fig. 3, it is assumed that the hierarchical block pressure texture can include three layers, each bit-string length of layer 1 is 64bit, layer 2 it is every Individual bit-string length is 128bit, and each bit-string length of layer 3 is 128bit, now, a bit respective layer in layer 1 128 bitmap structures in 2, while 128*128 Bit String in respective layer 3, therefore the structure maximum can support 1M rules and regulations Then.Dashed lines shown in part, when a Bit String 128bit in layer 2 is 0, the Bit String and the Bit String exist Corresponding 128 Bit Strings are not stored in layer 3.Using such hierarchy, memory space will be greatly compressed, while by It is not involved in calculating the number of times that can also reduce with computing in a large amount of 0.
Specifically, shown in reference picture 4, step S101 includes：
S1011, temporal bit bitmap is created, wherein, the storage form of temporal bit bitmap and the storage form phase of ET tables Together.
Temporal bit bitmap can be Bit String long as described above or hierarchical block pressure texture, need to only ensure and ET tables Storage form it is consistent.
Whether value a is included in each regular matching domain in S1012, judgment rule set, if comprising by temporarily The bit position 1 corresponding with the position of each rule in regular collection, otherwise sets to 0 in bit map.
Traversal rule set, the matching domain of every rule is converted into the representation of closure scope, it is assumed for example that rule 1 Source port matching domain span be 0-65535, then the corresponding closure scope of the matching domain be [0,65535].
The traversal first that starts anew searches the IT tables in structure, for each IT index value a, in traversal rule set Strictly all rules, judges whether corresponding matching thresholding includes the IT index value a per rule, if comprising in temporal bit It is marked by putting bit in bitmap, is not marked if not comprising if.
S1013, judge whether to have existed in each list items of ET tables with temporal bit bitmap identical bit map, such as Fruit is present, then in the index of correspondence list item being inserted into IT table list items a, if it does not exist, then temporal bit bitmap is stored to ET First idle list item in table, and the index of this first idle list item inserted into IT table list items a.
Determine in ET tables with the presence or absence of temporal bit bitmap in order to quick, it is to avoid traversal ET tables, the embodiment of the present invention can be with Hash algorithm is introduced, the cryptographic Hash of current bit bitmap is calculated so that a Hash table structure is included in ET tables, if there is Kazakhstan Uncommon value is identical, then need to compare bit map in detail, if comparative result is all completely the same, illustrates to be had existed in ET tables The temporal bit bitmap.
It should be noted that in many cases, doing step-by-step and computing in two ET tables that preceding layer is searched structure, often Full 0 bit map can be obtained (i.e. not comprising any rule).Therefore in order to further improve initialization speed, the embodiment of the present invention In, first list item (ET indexes be 0) in each ET table can be initialized as the bit map of full 0, so when quoting ET tables need not be again searched during full 0 bit map.
S102, according to preceding layer search structure ET table list items index and bit map generation current layer search structure, Lookup structure number in current layer searches structure is 1.
Wherein, current layer searches the index of the IT table list items k of structure and the T rope of ET table list items of preceding layer lookup structure Draw after increase updates allowance and be calculated, this T ET table list item be belonging respectively to preceding layer search T of structure lookup structure it One, the index that current layer searches the ET table list items f of structure is stored in the IT table list items k of current layer lookup structure, current layer is searched Bit map in the ET table list items f of structure be bit map step-by-step in above-mentioned T ET table list items and result, k >=0, f >= 0, T >=2.
The value of T can be 2,3,4, it is preferred that shown in reference picture 5 and Fig. 6, T values are 2, are looked into equivalent to preceding layer 2 lookup structures in structure are looked for correspond to the lookup structure that current layer is searched in structure, wherein, it is previous shown in Fig. 5 Layer search structure in comprising even number search structure when, shown in Fig. 6 for preceding layer search structure in comprising odd number search knot During structure.
Specifically, as T=2, shown in reference picture 7, step S102 includes：
S1021, according to preceding layer search structure in the 2i-1 lookup structure ET table list item c and the 2i lookup tie The ET table list item d of structure, determine current layer search structure in i-th lookup structure IT tables in a table item index be c* (D+ Δ D)+d, wherein, i >=1,0≤c≤C+ Δs C, 0≤d≤D+ Δs D, C is that preceding layer searches the 2i-1 lookup structure in structure ET table tables it is long, D be preceding layer search structure in the 2i search structure ET table tables it is long, Δ C >=0, Δ D >=0.
Current layer searches i-th a length of (D+ Δ D) * (C+ Δ C) of IT table tables of lookup structure in structure.
Shown in reference picture 8, Δ C and Δ D represent renewal allowance, and when Δ C and Δ D are 0, the current layer for being generated is looked into IT tables and ET tables are looked for Structured cured, so not supporting to update；When Δ C and Δ D are not all 0, the current layer for being generated is searched Structure has reserved IT tables and ET tables, so supporting to update.
S1022, by preceding layer search structure in the 2i-1 search structure ET table list items c bit map and 2i It is individual search structure ET table list items d bit map carry out with operation, obtain the second temporal bit bitmap.
S1023, judge current layer search structure ET tables each list item in whether existed and the second temporal bit Bitmap identical bit map, if it is present the index of correspondence list item is inserted into the IT table list items c* that current layer searches structure In (D+ Δ D)+d, if it does not exist, then the second temporal bit bitmap is stored to current layer first in the ET tables for searching structure Idle list item, and the index of this first idle list item inserted into IT table list items c* (D+ Δ D)+d of current layer lookup structure.
S103, in the stage of lookup, the matching domain lookup according to message obtains the IT table tables of corresponding ground floor lookup structure , and obtain the ET table table item index values stored in the IT table list items of corresponding ground floor lookup structure.
Exemplary, the field information in Corresponding matching domain, such as source IP field, purpose IP words are taken out from header Section, peer-port field etc., when it is 16bit to search structure bit wide, need to be torn open according to bit wide for the field more than 16bit Point, the 32bit correspondences two of source IP address are for example searched into structure SIP-LO and SIP-HI.
In searching structure from the corresponding ground floors of SIP-LO, SIP-LO field values are used as matching domain, and the matching domain is corresponding The IT table table item index values that ground floor searches structure are the corresponding IT tables list item of hit, and then obtain the corresponding IT tables list item The ET table table item index values of storage.In searching structure from the corresponding ground floors of SIP-HI, SIP-HI field values, should used as matching domain The IT table table item index values that the corresponding ground floor of matching domain searches structure are the corresponding IT tables list item of hit, and then obtain the correspondence IT table list items in store ET table table item index values.
S104, the ET table table item index values for searching structure according to the preceding layer for obtaining are calculated current layer and search structure The index value of IT table list items, and the ET table table item index values stored in the IT table list items of corresponding current layer lookup structure are obtained, If it is that last layer searches structure that the current layer searches structure, the IT table list items of structure are searched according to the current layer for obtaining The ET table table item indexes of middle storage are worth to the ET table list items that current layer searches structure, wherein, the current layer for obtaining searches structure ET table list items in store bit map the rule come into force corresponding to bit for the affiliated type of message goal rule.
Specifically, other layers in addition to for searching structure except ground floor, are all the ET that structure is searched according to preceding layer Table index value is calculated the IT table table item index values that this layer searches structure.Specifically, it is corresponding with process shown in Fig. 7, The IT table table item index values that current layer searches structure are obtained according to c* (D+ Δ D)+d.
When it is that last layer searches structure that current layer searches structure, the IT table tables of structure are searched according to the current layer for obtaining The ET table table item indexes stored in are worth to the ET table list items of current lookup structure, the bit map stored in the ET table list items If the rule come into force corresponding to bit be when being sorted from high to low according to priority for goal rule each rule, The corresponding rule of first non-zero bit is the rule of hit in the bit map.
S105, in the more new stage, the scope of the public matching domain being had according to newly-increased matching domain and existing matching domain, it is determined that The more new strategy of bit map in the ET tables of structure is searched ground floor.
Renewal described in the embodiment of the present invention refers to increases rule in regular collection, it is assumed that increased newly in current rule set conjunction One rule as follows：[SP：(1000,2000)DP：(21,21) priority：X is acted：Y].
For the above-mentioned rule for newly increasing, it is necessary first to update respectively corresponding with source port SP and destination interface DP fields Ground floor searches the IT tables in structure, and wherein the corresponding ground floor of source port SP matching domains searches structure I T table more new ranges is [1000,2000], it is [21,21] that the corresponding ground floor of destination interface DP matching domains searches structure I T table more new ranges, and IT tables are more The renewal bit of the bit map in ET table list items cited in new range is accordingly also carried out updating, but due to ET table list items Generally cited in multiple IT tables list items, therefore simply can not be put to updating bit in the bit map in ET table list items 1 operation is, it is necessary to judge whether to share.On the other hand, when ground floor searches structure to change, other layers search structure It is also required to update, therefore renewal process is substantially the process of the progressive updating backward since ground floor searches structure.The present invention Renewal bit described in embodiment refer to ET tables bit map in it is newly-increased rule in regular collection position it is corresponding Bit.
Structure is searched for ground floor, shown in reference picture 9, including：
S1051, first determine whether whether newly-increased matching domain has public matching domain and public matching domain model with existing matching domain Enclose, if newly-increased matching domain includes existing matching domain (being existing matching domain i.e. equivalent to public matching domain), jump procedure S1052；If newly-increased matching domain is contained in existing matching domain (being newly-increased matching domain i.e. equivalent to public matching domain), redirect Step S1053；If newly-increased matching domain partly overlaps with existing matching domain, jump procedure S1054；If newly-increased matching domain with Existing matching domain does not have public matching domain, then jump procedure S1055.
Exemplary, it is assumed that an only rule in preceding regular collection is not updated, the rule is：[SP：(0,1024)DP： (18,18) priority：X is acted：Y].There it can be seen that the rule two matching domains of correspondence：Source port SP matching domains and purpose Port DP matching domains, it is [0,1024] that the rule corresponds to source port SP matching domains, is corresponding to destination interface DP matching domains [18,18], position of the rule in regular collection is 1.For ease of description, illustrated only for source port SP matching domains.
The first situation：Assuming that newly-increased rule is：[SP：(0,1500)DP：(18,18) priority：X is acted：Y], for It is [0,1500] to increase matching domain for source port SP matching domains newly, the newly-increased matching domain [0,1500] and existing matching domain [0, 1024] with public matching domain [0,1024], the situation that newly-increased matching domain includes existing matching domain, therefore jump procedure are belonged to S1052。
Second situation：Assuming that newly-increased rule is：[SP：(100,1000)DP：(18,18) priority：X is acted：Y], it is right It is [100,1000], the newly-increased matching domain [100,1000] and existing matching domain to increase matching domain newly for source port SP matching domains [0,1024] belongs to the situation that newly-increased matching domain is contained in existing matching domain with public matching domain [100,1000], therefore Jump procedure S1053.
The third situation：Assuming that newly-increased rule is：[SP：(1000,2000)DP：(18,18) priority：X is acted：Y], it is right For source port SP matching domains increase newly matching domain be [1000,2000], the newly-increased matching domain [1000,2000] with matched Domain [0,1024] belongs to newly-increased matching domain and the partly overlapping situation of existing matching domain with public matching domain [1000,1024], Therefore jump procedure S1054.
4th kind of situation：Assuming that newly-increased rule is：[SP：(2000,3500)DP：(18,18) priority：X is acted：Y], it is right For source port SP matching domains increase newly matching domain be [2000,3500], the newly-increased matching domain [2000,3500] with matched Domain [0,1024] is without public matching domain, therefore jump procedure S1055.
S1052, the renewal ratio by the bit map in the ET table list items cited in the corresponding IT tables list item of public matching domain Special position 1, newly-built full 0 temporal bit bitmap by the renewal bit position 1 of temporal bit bitmap, and temporal bit bitmap is deposited First idle list item in the ET tables for searching structure is stored up to ground floor, and the index of this first idle list item is inserted into ground floor In the corresponding list item of not common matching domain of the IT tables for searching structure, not common matching domain has been matched for newly-increased matching domain is subtracted Remaining matching domain behind domain.
Shown in reference picture 10, for the first situation, the corresponding IT tables list item of public matching domain [0,1024] is drawn With the 2nd bit position 1 (being turned into 1100000 from 1000000) in the bit map of ET tables list item 1, by the interim ratio of full 0 2nd bit position 1 (being turned into 0100000 from 0000000) of special bitmap, then stores to ET tables the temporal bit bitmap In in first idle list item 2, while will be during index 2 inserts the corresponding list item of not common matching domain [1025,1500] of IT tables.
Bit map in S1053, the ET table list items for replicating cited in the existing corresponding IT tables list item of matching domain is used as facing When bit map, by the renewal bit position 1 of temporal bit bitmap, and by temporal bit bitmap store to ground floor search structure ET tables in first idle list item, and the index of this first idle list item is inserted ground floor lookup structure IT tables with In the corresponding list item of public matching domain.
Shown in reference picture 11, for second situation, the ET cited in the corresponding IT tables list item of existing matching domain is replicated Bit map (1000000) in table list item as temporal bit bitmap, by the 2nd bit position 1 of temporal bit bitmap (i.e. from 1100000) 1000000 be turned into, during the temporal bit bitmap then stored into ET tables into first idle list item 2, while Will be during index 2 inserts the corresponding list item of public matching domain [100,1000] of IT tables.
S1054, duplication have the bit map of matching domain as the first temporal bit bitmap, by the first temporal bit bitmap Renewal bit position 1, and by the first temporal bit bitmap store to ground floor search structure ET tables in first free list , and the index of this first idle list item is inserted into the list item corresponding with public matching domain that ground floor searches the IT tables of structure In；Newly-built full 0 the second temporal bit bitmap, by the renewal bit position 1 of the second temporal bit bitmap, and by the second temporal bit Bitmap stores to ground floor first idle list item in the ET tables for searching structure, and the index of this first idle list item is inserted Ground floor is searched in the IT tables list item corresponding with not common matching domain of structure.
Shown in reference picture 12, for the third situation, the ET cited in the corresponding IT tables list item of existing matching domain is replicated Bit map (1000000) in table list item as the first temporal bit bitmap, by the 2nd bit of the first temporal bit bitmap 1 (being turned into 1100000 from 1000000) is put, the first temporal bit bitmap is then stored into ET tables first free time In list item 2, while will be during index 2 inserts the corresponding list item of public matching domain [1000,1024] of IT tables；Newly-built full 0 second is faced When bit map, by the 2nd bit position 1 (being turned into 0100000 from 0000000) of the second temporal bit bitmap, and by Two temporal bit bitmaps are stored to ground floor in the ET tables for searching structure in first idle list item 3, and by first free time The IT tables that the index 3 of list item inserts ground floor lookup structure subtract public matching domain with newly-increased matching domain [1000,2000] [1000,1024] in the corresponding list item of matching domain [1025,2000] after.
S1055, newly-built full 0 temporal bit bitmap, by the renewal bit position 1 of temporal bit bitmap, and by temporal bit Bitmap stores to ground floor first idle list item in the ET tables for searching structure, and the index of this first idle list item is inserted Ground floor is searched in the list item corresponding with not common matching domain of the IT tables of structure.
Shown in reference picture 13, for the 4th kind of situation, by the 2nd bit position 1 of full 0 temporal bit bitmap (i.e. from 0100000) 0000000 be turned into, during the temporal bit bitmap then stored into ET tables into first idle list item 2, while Will be during index 2 inserts the corresponding list item of not common matching domain [2000,3500] of IT tables.
S106, the IT tables and ET tables of searching current layer structure according to the bit map updated in preceding layer lookup structure enter Row updates.
Ground floor search structure renewal cause ground floor search all of ET tables of structure all produce change, due to Δ C with It is long that Δ D in initial phase has reserved sufficiently large ET table tables when being not zero, therefore at no point in the update process and need not Reinitialize the whole ET tables that other layers search structure, it is only necessary to which newly-increased list item is inserted the idle list item of ET tables.
Illustrated by taking the renewal embodiment shown in Figure 14 as an example, first lookup structure of structure is searched in ground floor LS11As shown in (1), increased after an ET table list item as shown in (2), second lookup structure of structure is searched in ground floor LS12As shown in (3), increased an ET tables list item and become as shown in (4), before the update as next layer of lookup structure ET table table The LS of item11&LS12Step-by-step and (LS11&LS12) result such as shown in (5), LS after renewal11&LS12Step-by-step and (LS11&LS12) result As shown in (6), it is seen that the list item 0,2 that next layer is searched in structure ET table list items after renewal remains unchanged and uses the ET table tables before updating , therefore this feature can be utilized to reduce by the next layer of renewal amount of calculation for searching structure I T tables and ET tables.
Counted according to practical application, in each renewal process, for this layer searches structure, last layer searches structure In the ET tables that do not update be in the great majority, the ET tables that current layer searches structure be by preceding layer the step-by-step of two ET tables with.
Shown in reference picture 15, it is assumed that two ET tables that preceding layer searches structure are respectively ET tables 1 and ET tables 2, in ET tables 1 In, increasing list item G newly, it updates the list item g from same ET tables；In ET tables 2, list item H is increased newly, it is updated from same ET tables List item h.For the ET tables that current layer searches structure, there is the bit map=list item of list item p and newly-increased list item P, list item p The bit map of the bit map ＆ list items h of g, the bit map of the bit map ＆ list items H of the bit map=list item G of list item P； During the list item of list item G and list item H is new renewal that and if only if, after respective renewal bit carries out step-by-step and operation, list item P Renewal bit just need to put 1, all set to 0 in the case of other.
Can be that ET tables list item increases by two index values, the first index value when the ET tables of last layer lookup structure are updated The index of the renewal source list item of this list item, the second index value is indicated to indicate the index of the renewal purpose list item of this list item, for example, When updating list item G, the index of list item g is inserted in first index value of list item G, table is inserted in second index value of list item g The index of item G；When list item H is updated, the index of list item h is inserted in first index value of list item H, in second rope of list item h Draw the index that list item H is inserted in value.
Assuming that after the ET tables of preceding layer lookup structure update, in the IT tables and ET tables of this layer of lookup structure of renewal, no All IT tables and ET tables according to preceding layer lookup structure are needed to try to achieve IT tables list item and ET tables that this layer searches topology update List item, before the bit map for calculating the bit map list item H of bit map=list item G of list item P, it is only necessary to according to preceding One layer of first index value for searching two ET table list items in structure finds the renewal source list item p that this layer searches the ET tables of structure, right The bit map of list item p copies as temporal bit bitmap, and structure is searched to inserting this layer behind the renewal bit position 1 of bit map The idle list item of first, ET tables (index is 17 in figure), then inserts corresponding IT by the index of this first idle list item In table list item.Quick renewal can so be realized.
Furthermore it is also possible to the index (17) for updating purpose list item P is write in the second index value for updating source list item p, this If sample is when next update updates source list item and is exactly p, renewal purpose list item P can be directly found by the second index value, Without updating again again, renewal amount of calculation can be so substantially reduced.
Further, found by analysis, update current layer search structure when, no matter preceding layer search topology update after It is more than ET table list item numbers or few, will searching loop preceding layer search during two ET tables of structure, i.e. current layer search structure Each searches the update complexity of structure for preceding layer searches two ET table tables of structure product long, but actually due to preceding layer Major part ET table list items do not update in searching two ET tables of structure, and corresponding layer searches the IT tables list item and ET table tables of structure Item need not update, therefore the mode of embodiment of the present invention introducing piecemeal market bit position is marked, and looks into for one layer before the update When looking for structure, determine that this layer searches IT tables list item and ET table list items that structure needs to update in advance.Structure is searched for preceding layer In carry out step-by-step with operation an ET tables and the 2nd ET tables, an ET tables correspondence the first group echo bit, the 2nd ET tables pair Second group echo bit is answered, is a product that ET table tables are long and the 2nd ET table tables are long per the length of group echo bit.
Shown in reference picture 16, in the more new stage, when preceding layer lookup structure is updated, if an ET table list item g quilts Update, then put 1 on the bit [LEN2*g, LEN2* (g+1)] of first group of bit mark to mark, wherein, LEN2 is the Two ET table tables are long；If the 2nd ET table list items h is updated, in second group of bit h, h+LEN2*1, h+ of bit mark LEN2*2, h+LEN2*3 ..., put 1 on h+LEN2* (LEN1-1) to mark, wherein, LEN1 is that an ET table tables are long；When complete After paired preceding layer searches the renewal of structure, by the first group echo bit and second group echo bit press bit phase and, Result is that IT table indexs as this layer of 1 corresponding layer lookup structure of marker bit searches the IT table indexs that structure needs to update (dash area in figure).
Renewal process provided in an embodiment of the present invention can also include deletion rule, similar with rule is newly increased, uniquely not Be to become i.e. clear 0 operation of reset by putting 1 operation, renewal process and step with newly increase rule simultaneously indifference, herein not Repeat again.
Packet classification method provided in an embodiment of the present invention, in initialization procedure, generation multilayer searches structure, and every layer is looked into Looking for structure includes IT tables and ET tables, and the list item a indexes that ground floor searches the IT tables of structure are corresponding with the matching domain a of rule, ET table table item indexes are stored in IT tables, stored bits bitmap in ET table list items, the value of bit map is identified in regular collection Whether the regular matching domain of correspondence position includes value a；For other layers search structure, this layer searches the IT tables of structure Generated by the ET tables list item of preceding layer with ET tables, wherein, the IT table indexs that this layer searches structure search structure ET by preceding layer Table index is calculated after increasing renewal allowance, and this layer searches the ET tables of structure by bit map in preceding layer lookup structure ET tables Step-by-step with obtain, support update tolerance in dynamically update regular collection.In search procedure, according to the matching domain of message Correspondence ground floor searches the IT table table item indexes of structure, obtains the ET table table item indexes stored in IT table list items, then successively root The ET table table item index values for searching structure according to preceding layer are calculated the index value that current layer searches the IT table list items of structure, if It is that last layer searches structure that current layer searches structure, then can obtain the ET table table item indexes value correspondence stored in the IT table list items ET table list items, in the ET table list items store bit map the rule come into force corresponding to bit be goal rule, pass through Matching domain to message successively searches matched rule according to index value, constantly reduces seeking scope, it is possible to achieve quick to message Classification.
A kind of message classification device 10 is the embodiment of the invention provides, shown in reference picture 17, including：
Generation unit 101, in initial phase, ground floor being generated according to the matching domain that each is regular in regular collection Structure is searched, wherein, each matching domain correspondence ground floor searches at least one of structure and searches structure, and each searches structure bag Concordance list IT tables and extended bit vector table ET tables are included, when matching domain value is a, ground floor corresponding with matching domain searches knot Store the index that ground floor searches the ET table list items b of structure in the IT table list items a of structure, bit map in ET table list items b takes Whether it is worth for the regular matching domain for identifying the correspondence position in regular collection comprising value a, a >=0, b >=0；
Generation unit 101, the ET tables list item generation current layer for being additionally operable to search structure according to preceding layer searches structure, until Current layer search structure in lookup structure number be 1, wherein, current layer search structure IT table list items k index with it is previous The index of T ET table list item of layer lookup structure is calculated after increasing renewal allowance, and T ET table list item is belonging respectively to preceding layer One of T lookup structure of structure is searched, the ET tables that current layer searches structure are stored in the IT table list items k of current layer lookup structure The index of list item f, the bit map that current layer searches in the ET table list items f of structure is that the bit map in T ET table list item is pressed Position and result, k >=0, f >=0, T >=2；
Searching unit 102, for obtaining the IT table tables that corresponding ground floor searches structure according to the matching domain lookup of message , and obtain the ET table table item index values stored in the IT table list items of the corresponding ground floor lookup structure；
Searching unit 102, is additionally operable to be calculated according to the ET table table item index values of the preceding layer lookup structure for obtaining and works as Front layer searches the index value of the IT table list items of structure, and obtains the ET stored in the IT table list items of corresponding current layer lookup structure Table table item index value, if it is that last layer searches structure that current layer searches structure, structure is searched according to the current layer for obtaining IT table list items in store ET table table item indexes be worth to current layer search structure ET table list items, wherein, what is obtained is current The rule come into force corresponding to bit of the bit map stored in the ET table list items of layer lookup structure is the affiliated type of message Goal rule；
Updating block 103, in the more new stage, according to the public matching domain that newly-increased matching domain and existing matching domain have Scope, it is determined that to ground floor search structure ET tables in bit map more new strategy；According to preceding layer search structure in more The IT tables and ET tables that new bit map searches current layer structure are updated.
In a kind of possible design, generation unit 101, specifically for：
Temporal bit bitmap is created, wherein, storage form and the ground floor of temporal bit bitmap search the ET tables of structure Storage form is identical；
Whether value a is included in each regular matching domain in judgment rule set, if comprising by temporal bit position The corresponding bit position 1 in position in figure with each rule in regular collection, otherwise sets to 0；
Judge ground floor search structure ET tables each list item in whether existed and temporal bit bitmap identical Bit map, if it is present by correspondence list item index insert ground floor lookup structure IT table list items a in, if do not deposited , then temporal bit bitmap is stored into ground floor first idle list item in the ET tables for searching structure, and by first free time The index of list item is inserted in the IT table list items a that ground floor searches structure.
In a kind of possible design, generation unit 101, specifically for：
According to the 2i-1 ET table list item c and the 2i ET of lookup structure of lookup structure in preceding layer lookup structure Table list item d, determines that current layer searches a table item index in structure in i-th IT table of lookup structure for c* (D+ Δ D)+d, Wherein, i >=1,0≤c≤C+ Δs C, 0≤d≤D+ Δs D, C is that preceding layer searches the 2i-1 ET table table of lookup structure in structure Long, D is that the 2i ET table table for searching structure is long during preceding layer searches structure, Δ C >=0, Δ D >=0；
By preceding layer search structure in the 2i-1 lookup structure ET table list items c bit map and the 2i search The bit map of the ET table list items d of structure carry out with operation, obtain the second temporal bit bitmap；
Judge current layer search structure ET tables each list item in whether existed and the second temporal bit bitmap phase Same bit map, if it is present the index of correspondence list item is inserted into IT table list items c* (D+ Δ D) that current layer searches structure In+d, if it does not exist, then the second temporal bit bitmap to be stored to current layer first free list in the ET tables for searching structure , and the index of first idle list item inserted into IT table list items c* (D+ Δ D)+d of current layer lookup structure.
In a kind of possible design, searching unit 102, specifically for：
The index value that current layer searches the IT table list items of structure is obtained according to c* (D+ Δ D)+d.
In a kind of possible design, updating block 103, specifically for：
If newly-increased matching domain includes existing matching domain, by the ET table tables cited in the corresponding IT tables list item of public matching domain The renewal bit position 1 of the bit map in, newly-built full 0 temporal bit bitmap, by the renewal bit of temporal bit bitmap Put 1, and temporal bit bitmap is stored to ground floor first idle list item in the ET tables for searching structure, and by first free time The index of list item is inserted in the corresponding list item of not common matching domain of the IT tables that ground floor searches structure, and not common matching domain is new Increase matching domain and subtract remaining matching domain after existing matching domain；
If newly-increased matching domain is contained in existing matching domain, replicate cited in the corresponding IT tables list item of existing matching domain Bit map in ET table list items by the renewal bit position 1 of temporal bit bitmap, and will compare temporarily as temporal bit bitmap Special bitmap stores to ground floor first idle list item in the ET tables for searching structure, and the index of first idle list item is inserted Ground floor is searched in the list item corresponding with public matching domain of the IT tables of structure
If newly-increased matching domain partly overlaps with existing matching domain, the bit map for replicating existing matching domain is faced as first When bit map, by the renewal bit position 1 of the first temporal bit bitmap, and the first temporal bit bitmap is stored to ground floor First idle list item in the ET tables of structure is searched, and the index of first idle list item is inserted into the IT that ground floor searches structure In the list item corresponding with public matching domain of table；Newly-built full 0 the second temporal bit bitmap, by the renewal of the second temporal bit bitmap Bit position 1, and the second temporal bit bitmap is stored to ground floor first idle list item in the ET tables for searching structure, and will The index of first idle list item is inserted in the IT tables list item corresponding with not common matching domain that ground floor searches structure
If newly-increased matching domain does not have public matching domain with existing matching domain, newly-built full 0 temporal bit bitmap will be interim The renewal bit position 1 of bit map, and temporal bit bitmap is stored to ground floor first sky in the ET tables for searching structure Not busy list item, and the index of first idle list item is inserted ground floor lookup structure IT tables it is corresponding with not common matching domain In list item.
In a kind of possible design, step-by-step is carried out with the ET tables and second for operating in searching structure for preceding layer ET tables, an ET tables the first group echo bit of correspondence, the 2nd ET tables correspondence second group echo bit, per group echo bit Length be a product that ET table tables are long and the 2nd ET table tables are long, the updating block 103 is additionally operable to：
In the more new stage, when preceding layer lookup structure is updated, if an ET table list items g is updated, at first group 1 is put on the bit [LEN2*g, LEN2* (g+1)] of bit mark to mark, wherein, LEN2 is that the 2nd ET table tables are long；If 2nd ET table list items h is updated, then in second group of bit h, h+LEN2*1, h+LEN2*2, h+LEN2* of bit mark 3rd ..., on h+LEN2* (LEN1-1) 1 is put to mark, wherein, LEN1 is that an ET table tables are long；
After completing to search the renewal of structure to preceding layer, the first group echo bit and second group echo bit are pressed Bit phase is with as a result the corresponding layer of marker bit for 1 searches the IT table indexs of structure and be this layer and search structure and need more New IT table indexs.
In a kind of possible design, bit map is Bit String or hierarchical block pressure texture, the hierarchical block compression knot Structure includes S layer of Bit String, each of s layers of Bit String corresponding to s+1 layers of a Bit String, when one in s layers It is described to be all 0 Bit String and corresponding s+1 layers Bit String is not stored when Bit String is all 0, wherein, 0<s<S.
Because the message classification device in the embodiment of the present invention can apply to above-mentioned packet classification method, therefore, its institute Obtainable technique effect also refers to above method embodiment, and the embodiment of the present invention will not be repeated here.
It should be noted that generation unit, searching unit, updating block can be the processor individually set up, it is also possible to Realization in some processor of controller is integrated in, in addition it is also possible to be stored in depositing for controller in the form of program code In reservoir, the function of above generation unit, searching unit, updating block is called by some processor of controller and performed. Processor described here can be a central processing unit (English full name：Central processing unit, English letter Claim：), or specific integrated circuit (English full name CPU：Application specific integrated circuit, English abbreviation：ASIC), or be arranged to implement the embodiment of the present invention one or more integrated circuits.
It should be understood that in various embodiments of the present invention, the size of the sequence number of above-mentioned each process is not meant to that execution is suitable The priority of sequence, the execution sequence of each process should be determined with its function and internal logic, without the implementation of the reply embodiment of the present invention Process constitutes any restriction.
Those of ordinary skill in the art are it is to be appreciated that the list of each example described with reference to the embodiments described herein Unit and algorithm steps, can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually Performed with hardware or software mode, depending on the application-specific and design constraint of technical scheme.Professional and technical personnel Described function, but this realization can be realized it is not considered that exceeding using distinct methods to each specific application The scope of the present invention.
It is apparent to those skilled in the art that, for convenience and simplicity of description, the system of foregoing description, The specific work process of device and unit, may be referred to the corresponding process in preceding method embodiment, will not be repeated here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method, can be with Realize by another way.For example, apparatus embodiments described above are only schematical, for example, the unit Divide, only a kind of division of logic function there can be other dividing mode when actually realizing, for example multiple units or component Can combine or be desirably integrated into another system, or some features can be ignored, or do not perform.It is another, it is shown or The coupling each other for discussing or direct-coupling or communication connection can be the indirect couplings of equipment or unit by some interfaces Close or communicate to connect, can be electrical, mechanical or other forms.
The unit that is illustrated as separating component can be or may not be it is physically separate, it is aobvious as unit The part for showing can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple On NE.Some or all of unit therein can be according to the actual needs selected to realize the mesh of this embodiment scheme 's.
In addition, during each functional unit in each embodiment of the invention can be integrated in a processing unit, it is also possible to It is that unit is individually physically present, it is also possible to which two or more units are integrated in a unit.
If the function is to realize in the form of SFU software functional unit and as independent production marketing or when using, can be with Storage is in a computer read/write memory medium.Based on such understanding, technical scheme is substantially in other words The part contributed to prior art or the part of the technical scheme can be embodied in the form of software product, the meter Calculation machine software product is stored in a storage medium, including some instructions are used to so that a computer equipment (can be individual People's computer, server, or network equipment etc.) perform all or part of step of each embodiment methods described of the invention. And foregoing storage medium includes：USB flash disk, mobile hard disk, read-only storage (English full name:Read-only memory, English letter Claim：ROM), random access memory (English full name：Random access memory, English abbreviation：RAM), magnetic disc or light Disk etc. is various can be with the medium of store program codes.
The above, specific embodiment only of the invention, but protection scope of the present invention is not limited thereto, and it is any Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all contain Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.

Claims (12)

1. a kind of packet classification method, it is characterised in that including：
In the stage of lookup, the matching domain lookup according to message obtains corresponding ground floor and searches the IT table list items of structure, and obtains The ET table table item index values stored in the IT table list items of the corresponding ground floor lookup structure；
The ET table table item index values for searching structure according to the preceding layer for obtaining are calculated the IT table list items that current layer searches structure Index value, and obtain corresponding current layer and search the ET table table item index values stored in the IT table list items of structure, if currently It is that last layer searches structure that layer searches structure, then the ET tables stored in the IT table list items of structure are searched according to the current layer for obtaining Table item index is worth to the ET table list items that current layer searches structure, wherein, the current layer for obtaining is searched in the ET table list items of structure The rule come into force corresponding to bit of the bit map of storage is the goal rule of the affiliated type of the message.
2. method according to claim 1, it is characterised in that before the lookup stage, methods described also includes：
In initial phase, structure is searched according to the matching domain generation ground floor that each is regular in regular collection, wherein, each At least one of structure being searched with the domain correspondence ground floor and searching structure, each searches structure includes concordance list IT tables and expansion Exhibition bit vectors table ET tables, when the matching domain value is a, ground floor corresponding with the matching domain searches the IT tables of structure The index that the ground floor searches the ET table list items b of structure is stored in list item a, bit map in the ET tables list item b takes Whether it is worth for the regular matching domain for identifying the correspondence position in the regular collection comprising value a, a >=0, b >=0；
Structure is searched according to the ET tables list item generation current layer that preceding layer searches structure, the lookup in current layer searches structure Structure number is 1, wherein, the index that current layer searches the IT table list items k of structure is T ET table list item of preceding layer lookup structure Index increase renewal allowance respectively after be calculated, the T ET table list items are belonging respectively to preceding layer to be searched the T of structure and individual looks into Structure is looked for, the index that current layer searches the ET table list items f of structure, current layer are stored in the IT table list items k of current layer lookup structure Search the bit map in the ET table list items f of structure be bit map step-by-step in the T ET table list items and result, k >= 0, f >=0, T >=2；
Wherein, it is described that structure is searched according to the matching domain generation ground floor that each is regular in regular collection, including：
Temporal bit bitmap is created, wherein, the storage form of the temporal bit bitmap searches the ET of structure with the ground floor The storage form of table is identical；
Whether judge in the regular collection in each regular matching domain comprising value a, if comprising by the interim ratio The corresponding bit position 1 in position in special bitmap with described each rule in regular collection, otherwise sets to 0；
Judge whether the ground floor has existed and the temporal bit bitmap phase in searching each list items of the ET tables of structure With bit map, if it is present during the index of correspondence list item inserted into the IT table list items a of ground floor lookup structure, If it does not exist, then the temporal bit bitmap to be stored to the ground floor first free list in the ET tables for searching structure , and the index of described first idle list item inserted into the IT table list items a of the ground floor lookup structure.
3. method according to claim 1, it is characterised in that methods described also includes：
In the more new stage, the scope of the public matching domain being had according to newly-increased matching domain and existing matching domain, it is determined that to described The more new strategy of bit map in one layer of ET table of lookup structure；The bit map updated in structure is searched to working as according to preceding layer The IT tables and ET tables that front layer searches structure are updated；
Wherein, the scope of the public matching domain that the newly-increased matching domain of the basis has with existing matching domain, it is determined that to described first The more new strategy of bit map in the ET tables of layer lookup structure, including：
If newly-increased matching domain includes existing matching domain, by the ET table list items cited in the corresponding IT tables list item of public matching domain Bit map renewal bit position 1, newly-built full 0 temporal bit bitmap, by the renewal bit position 1 of temporal bit bitmap, And temporal bit bitmap stores to ground floor first idle list item in the ET tables for searching structure, and by first idle list item Index insert the corresponding list item of not common matching domain of the IT tables that ground floor searches structure, not common matching domain is newly-increased Remaining matching domain after existing matching domain is subtracted with domain；
If newly-increased matching domain is contained in existing matching domain, the ET tables cited in the corresponding IT tables list item of existing matching domain are replicated Bit map in list item as temporal bit bitmap, by the renewal bit position 1 of temporal bit bitmap, and by temporal bit position Figure stores to ground floor first idle list item in the ET tables for searching structure, and the index of first idle list item is inserted into first Layer is searched in the list item corresponding with public matching domain of the IT tables of structure；
If newly-increased matching domain partly overlaps with existing matching domain, the bit map of existing matching domain is replicated as the first interim ratio Special bitmap, by the renewal bit position 1 of the first temporal bit bitmap, and the first temporal bit bitmap is stored to ground floor lookup First idle list item in the ET tables of structure, and the index of first idle list item is inserted the IT tables of ground floor lookup structure In list item corresponding with public matching domain；Newly-built full 0 the second temporal bit bitmap, by the renewal bit of the second temporal bit bitmap Position 1, and the second temporal bit bitmap is stored to ground floor first idle list item in the ET tables for searching structure, and by first The index of individual idle list item is inserted in the IT tables list item corresponding with not common matching domain that ground floor searches structure；
If newly-increased matching domain does not have public matching domain, newly-built full 0 temporal bit bitmap, by temporal bit with existing matching domain The renewal bit position 1 of bitmap, and temporal bit bitmap is stored to ground floor first free list in the ET tables for searching structure , and the index of first idle list item is inserted into the list item corresponding with not common matching domain that ground floor searches the IT tables of structure In.
4. method according to claim 2, it is characterised in that T=2,
The ET tables list item generation current layer for searching structure according to preceding layer searches structure, including：
According to the 2i-1 ET table list item c and the 2i ET of lookup structure of lookup structure in preceding layer lookup structure Table list item d, determines that current layer searches a table item index in structure in i-th IT table of lookup structure for c* (D+ Δ D)+d, Wherein, i >=1,0≤c≤C+ Δs C, 0≤d≤D+ Δs D, C is that preceding layer searches the 2i-1 ET table table of lookup structure in structure Long, D is that the 2i ET table table for searching structure is long during preceding layer searches structure, Δ C >=0, Δ D >=0；
By the 2i-1 bit map and the 2i lookup structure of the ET table list items c of lookup structure in preceding layer lookup structure ET table list items d bit map carry out with operation, obtain the second temporal bit bitmap；
Judge current layer search structure ET tables each list item in whether existed and the second temporal bit bitmap identical Bit map, if it is present the index of correspondence list item is inserted into IT table list items c* (D+ Δ D)+d that current layer searches structure In, if it does not exist, then the second temporal bit bitmap to be stored to current layer first free time in the ET tables for searching structure List item, and the index of described first idle list item inserted into IT table list items c* (D+ Δ D)+d of current layer lookup structure；
The ET table table item index values that the preceding layer that the basis is obtained searches structure are calculated the IT tables that current layer searches structure The index value of list item, including：
The index value that current layer searches the IT table list items of structure is obtained according to c* (D+ Δ D)+d.
5. method according to claim 3, it is characterised in that carry out step-by-step with operation in searching structure for preceding layer First ET tables and the 2nd ET tables, an ET tables the first group echo bit of correspondence, the 2nd ET tables correspondence second group echo bit, It is a product that ET table tables are long and the 2nd ET table tables are long per the length of group echo bit, methods described also includes：
In the more new stage, when preceding layer lookup structure is updated, if an ET table list items g is updated, in first group of bit 1 is put on the bit [LEN2*g, LEN2* (g+1)] of position mark to mark, wherein, LEN2 is that the 2nd ET table tables are long；If second ET table list items h is updated, then in second group of bit h, h+LEN2*1, h+LEN2*2, h+LEN2* of bit mark 3rd ..., on h+LEN2* (LEN1-1) 1 is put to mark, wherein, LEN1 is that an ET table tables are long；
After completing to search the renewal of structure to preceding layer, the first group echo bit and second group echo bit are pressed into bit Position is with as a result the corresponding layer of marker bit for 1 searches the IT table indexs of structure and be this layer and search structure and need renewal IT table indexs.
6. the method according to claim any one of 1-5, it is characterised in that the bit map is Bit String or hierarchical block Pressure texture, the hierarchical block pressure texture includes S layers of Bit String, and each of s layers of Bit String corresponds to s+1 layers One Bit String, it is described to be all 0 Bit String and corresponding s+1 layers Bit String is equal when a Bit String is all 0 in s layers Do not store, wherein, 0<s<S.
7. a kind of message classification device, it is characterised in that including：
Searching unit, for obtaining the IT table list items that corresponding ground floor searches structure according to the matching domain lookup of message, and obtains The ET table table item index values stored in the IT table list items for searching structure to the corresponding ground floor；
The searching unit, the ET table table item index values for being additionally operable to search structure according to the preceding layer for obtaining are calculated current layer The index value of the IT table list items of structure is searched, and obtains the ET table tables stored in the IT table list items of corresponding current layer lookup structure Entry index value, if it is that last layer searches structure that current layer searches structure, the IT of structure is searched according to the current layer for obtaining The ET table table item indexes stored in table list item are worth to the ET table list items that current layer searches structure, wherein, the current layer for obtaining is looked into The rule come into force corresponding to bit for looking for the bit map stored in the ET table list items of structure is goal rule.
8. device according to claim 7, it is characterised in that described device also includes：
Generation unit, for before the lookup stage, in initial phase, according to the matching of each rule in regular collection Domain generation ground floor searches structure, wherein, each matching domain correspondence ground floor searches at least one of structure and searches knot Structure, each searches structure includes concordance list IT tables and extended bit vector table ET tables, when the matching domain value is a, with institute Store the ET table list items b's of the ground floor lookup structure in the IT table list items a for stating the corresponding ground floor lookup structure of matching domain Index, the value of the bit map in the ET tables list item b is used to identify the regular of in regular collection correspondence position Whether matching domain includes value a, a >=0, b >=0；
The generation unit, the ET tables list item generation current layer for being additionally operable to search structure according to preceding layer searches structure, until working as The lookup structure number that front layer searches in structure is 1, wherein, the index that current layer searches the IT table list items k of structure is preceding layer The index of T ET table list item of lookup structure is calculated after increasing renewal allowance respectively, and the T ET table list items are belonging respectively to Preceding layer searches T lookup structure of structure, and the ET that current layer searches structure is stored in the IT table list items k of current layer lookup structure The index of table list item f, the bit map that current layer searches in the ET table list items f of structure is the bit in the T ET table list items Bitmap step-by-step and result, k >=0, f >=0, T >=2；
Wherein, the generation unit, specifically for：
Temporal bit bitmap is created, wherein, the storage form of the temporal bit bitmap searches the ET of structure with the ground floor The storage form of table is identical；
Whether judge in the regular collection in each regular matching domain comprising value a, if comprising by the interim ratio The corresponding bit position 1 in position in special bitmap with described each rule in regular collection, otherwise sets to 0；
Judge whether the ground floor has existed and the temporal bit bitmap phase in searching each list items of the ET tables of structure With bit map, if it is present during the index of correspondence list item inserted into the IT table list items a of ground floor lookup structure, If it does not exist, then the temporal bit bitmap to be stored to the ground floor first free list in the ET tables for searching structure , and the index of described first idle list item inserted into the IT table list items a of the ground floor lookup structure.
9. device according to claim 7, it is characterised in that described device also includes：
Updating block, in the more new stage, the scope of the public matching domain being had according to newly-increased matching domain and existing matching domain, It is determined that to the more new strategy of bit map in the ET tables of ground floor lookup structure；According to what is updated in preceding layer lookup structure The IT tables and ET tables that bit map searches current layer structure are updated；
Wherein, the updating block, specifically for：
If newly-increased matching domain includes existing matching domain, by the ET table list items cited in the corresponding IT tables list item of public matching domain Bit map renewal bit position 1, newly-built full 0 temporal bit bitmap, by the renewal bit position 1 of temporal bit bitmap, And temporal bit bitmap stores to ground floor first idle list item in the ET tables for searching structure, and by first idle list item Index insert the corresponding list item of not common matching domain of the IT tables that ground floor searches structure, not common matching domain is newly-increased Remaining matching domain after existing matching domain is subtracted with domain；
If newly-increased matching domain is contained in existing matching domain, the ET tables cited in the corresponding IT tables list item of existing matching domain are replicated Bit map in list item as temporal bit bitmap, by the renewal bit position 1 of temporal bit bitmap, and by temporal bit position Figure stores to ground floor first idle list item in the ET tables for searching structure, and the index of first idle list item is inserted into first Layer is searched in the list item corresponding with public matching domain of the IT tables of structure；
If newly-increased matching domain partly overlaps with existing matching domain, the bit map of existing matching domain is replicated as the first interim ratio Special bitmap, by the renewal bit position 1 of the first temporal bit bitmap, and the first temporal bit bitmap is stored to ground floor lookup First idle list item in the ET tables of structure, and the index of first idle list item is inserted the IT tables of ground floor lookup structure In list item corresponding with public matching domain；Newly-built full 0 the second temporal bit bitmap, by the renewal bit of the second temporal bit bitmap Position 1, and the second temporal bit bitmap is stored to ground floor first idle list item in the ET tables for searching structure, and by first The index of individual idle list item is inserted in the IT tables list item corresponding with not common matching domain that ground floor searches structure；
If newly-increased matching domain does not have public matching domain, newly-built full 0 temporal bit bitmap, by temporal bit with existing matching domain The renewal bit position 1 of bitmap, and temporal bit bitmap is stored to ground floor first free list in the ET tables for searching structure , and the index of first idle list item is inserted into the list item corresponding with not common matching domain that ground floor searches the IT tables of structure In.
10. device according to claim 8, it is characterised in that T=2,
The generation unit, specifically for：
According to the 2i-1 ET table list item c and the 2i ET table table of lookup structure of lookup structure in preceding layer lookup structure D, it is c* (D+ Δ D)+d to determine that current layer searches a table item index in i-th IT table of lookup structure in structure, its In, i >=1,0≤c≤C+ Δs C, 0≤d≤D+ Δs D, C is that preceding layer searches the 2i-1 ET table table of lookup structure in structure Long, D is that the 2i ET table table for searching structure is long during preceding layer searches structure, Δ C >=0, Δ D >=0；
By the 2i-1 bit map and the 2i lookup structure of the ET table list items c of lookup structure in preceding layer lookup structure ET table list items d bit map carry out with operation, obtain the second temporal bit bitmap；
Judge current layer search structure ET tables each list item in whether existed and the second temporal bit bitmap identical Bit map, if it is present the index of correspondence list item is inserted into IT table list items c* (D+ Δ D)+d that current layer searches structure In, if it does not exist, then the second temporal bit bitmap to be stored to current layer first free time in the ET tables for searching structure List item, and the index of described first idle list item inserted into IT table list items c* (D+ Δ D)+d of current layer lookup structure；
The searching unit, specifically for：
The index value that current layer searches the IT table list items of structure is obtained according to c* (D+ Δ D)+d.
11. devices according to claim 9, it is characterised in that carry out step-by-step with operation in searching structure for preceding layer An ET tables and the 2nd ET tables, an ET tables the first group echo bit of correspondence, the 2nd ET tables correspondence second group echo bit Position, is a product that ET table tables are long and the 2nd ET table tables are long per the length of group echo bit, and the updating block is additionally operable to：
In the more new stage, when preceding layer lookup structure is updated, if an ET table list items g is updated, in first group of bit 1 is put on the bit [LEN2*g, LEN2* (g+1)] of position mark to mark, wherein, LEN2 is that the 2nd ET table tables are long；If second ET table list items h is updated, then in second group of bit h, h+LEN2*1, h+LEN2*2, h+LEN2* of bit mark 3rd ..., on h+LEN2* (LEN1-1) 1 is put to mark, wherein, LEN1 is that an ET table tables are long；
After completing to search the renewal of structure to preceding layer, the first group echo bit and second group echo bit are pressed into bit Position is with as a result the corresponding layer of marker bit for 1 searches the IT table indexs of structure and be this layer and search structure and need renewal IT table indexs.
12. device according to claim any one of 7-11, it is characterised in that the bit map is Bit String or layering Block pressure texture, the hierarchical block pressure texture includes S layers of Bit String, and each of s layers of Bit String corresponds to s+1 layers A Bit String, it is described to be all 0 Bit String and corresponding s+1 layers Bit String when a Bit String is all 0 in s layers Do not store, wherein, 0<s<S.
CN201611229592.XA 2016-12-27 2016-12-27 Message classification method and device Active CN106789727B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611229592.XA CN106789727B (en) 2016-12-27 2016-12-27 Message classification method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611229592.XA CN106789727B (en) 2016-12-27 2016-12-27 Message classification method and device

Publications (2)

Publication Number Publication Date
CN106789727A true CN106789727A (en) 2017-05-31
CN106789727B CN106789727B (en) 2020-01-21

Family

ID=58922803

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611229592.XA Active CN106789727B (en) 2016-12-27 2016-12-27 Message classification method and device

Country Status (1)

Country Link
CN (1) CN106789727B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107357843A (en) * 2017-06-23 2017-11-17 东南大学 Mass network data search method based on data flow architecture
CN108650221A (en) * 2018-03-29 2018-10-12 烽火通信科技股份有限公司 A kind of the control message extraction element and method of SPTN equipment
CN109802872A (en) * 2019-03-19 2019-05-24 北京信而泰科技股份有限公司 A kind of message capturing method, device and equipment
CN113132261A (en) * 2019-12-31 2021-07-16 北京金山云网络技术有限公司 Traffic data packet classification method and device and electronic equipment

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1494278A (en) * 2002-11-02 2004-05-05 华为技术有限公司 Data stream classifying method
US6778984B1 (en) * 2000-03-22 2004-08-17 Industrial Technology Research Institute Flexible and high-performance packet classification algorithm
US7193997B2 (en) * 2001-03-19 2007-03-20 International Business Machines Corporation Packet classification
CN101035062A (en) * 2006-03-09 2007-09-12 中兴通讯股份有限公司 Rule update method for three-folded content addressable memory message classification
CN101035060A (en) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 Integrated processing method for three-folded content addressable memory message classification
CN101783761A (en) * 2009-01-21 2010-07-21 华为技术有限公司 Method for storing and searching routing list and device therefor
CN102970150A (en) * 2011-09-01 2013-03-13 日电（中国）有限公司 Extensible multicast forwarding method and device for data center (DC)
CN103780491A (en) * 2012-10-23 2014-05-07 上海博达数据通信有限公司 Method for realizing IPv6 fast route lookup
CN105323159A (en) * 2014-07-21 2016-02-10 上海中兴思秸通讯有限公司 Data message processing method and device

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6778984B1 (en) * 2000-03-22 2004-08-17 Industrial Technology Research Institute Flexible and high-performance packet classification algorithm
US7193997B2 (en) * 2001-03-19 2007-03-20 International Business Machines Corporation Packet classification
CN1494278A (en) * 2002-11-02 2004-05-05 华为技术有限公司 Data stream classifying method
CN101035060A (en) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 Integrated processing method for three-folded content addressable memory message classification
CN101035062A (en) * 2006-03-09 2007-09-12 中兴通讯股份有限公司 Rule update method for three-folded content addressable memory message classification
CN101783761A (en) * 2009-01-21 2010-07-21 华为技术有限公司 Method for storing and searching routing list and device therefor
CN102970150A (en) * 2011-09-01 2013-03-13 日电（中国）有限公司 Extensible multicast forwarding method and device for data center (DC)
CN103780491A (en) * 2012-10-23 2014-05-07 上海博达数据通信有限公司 Method for realizing IPv6 fast route lookup
CN105323159A (en) * 2014-07-21 2016-02-10 上海中兴思秸通讯有限公司 Data message processing method and device

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107357843A (en) * 2017-06-23 2017-11-17 东南大学 Mass network data search method based on data flow architecture
CN107357843B (en) * 2017-06-23 2020-06-16 东南大学 Massive network data searching method based on data stream structure
CN108650221A (en) * 2018-03-29 2018-10-12 烽火通信科技股份有限公司 A kind of the control message extraction element and method of SPTN equipment
CN108650221B (en) * 2018-03-29 2020-12-15 烽火通信科技股份有限公司 Control message extraction device and method of SPTN (shortest Path bridging) equipment
CN109802872A (en) * 2019-03-19 2019-05-24 北京信而泰科技股份有限公司 A kind of message capturing method, device and equipment
CN113132261A (en) * 2019-12-31 2021-07-16 北京金山云网络技术有限公司 Traffic data packet classification method and device and electronic equipment

Also Published As

Publication number Publication date
CN106789727B (en) 2020-01-21

Similar Documents

Publication Publication Date Title
CN106789727A (en) Packet classification method and device
US6594655B2 (en) Wildcards in radix- search tree structures
US7089240B2 (en) Longest prefix match lookup using hash function
CN102055817B (en) Method for gathering homologous address beam and homologous gathering network route system
CN102945249B (en) A kind of policing rule matching inquiry tree generation method, matching process and device
CN101345707B (en) Method and apparatus for implementing IPv6 packet classification
CN105229977B (en) Method, apparatus and computer readable storage medium for recursive copying grouping
JP2000115243A (en) Packet repeater and multi-cast speedup system
JP3881663B2 (en) Packet classification apparatus and method using field level tree
Schwabe et al. Using MAC addresses as efficient routing labels in data centers
CN109218301A (en) The method and apparatus of the frame head mapping of software definition between multi-protocols
US8301738B1 (en) Systems and methods for private network addressing in IP protocols
CN105515997B (en) The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM
WO2011124030A1 (en) Method and device for storing routing table entry
CN104782087B (en) Switching equipment, controller, switching equipment configuration, message processing method and system
CN102427428A (en) Stream identifying method and device based on multi-domain longest match
CN106170956A (en) A kind of method for routing and equipment
CN107276916A (en) Interchanger flow table management method based on agreement unaware retransmission technique
CN103281211B (en) Large-scale network node system for managing in groups and management method
CN101222434B (en) Storage policy control list, policy searching method and tri-state addressing memory
US10897422B2 (en) Hybrid routing table for routing network traffic
CN106453091B (en) The equivalent route management method and device of router Forwarding plane
CN106209554A (en) Message forwarding method and equipment across virtual expansible LAN
CN102904812B (en) The storage means of route table items, lookup method, Apparatus and system
WO2017198052A1 (en) Packet processing method and apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant