CN107016091B - Regular expression update method and device in a kind of software defined network - Google Patents
Regular expression update method and device in a kind of software defined network Download PDFInfo
- Publication number
- CN107016091B CN107016091B CN201710219422.1A CN201710219422A CN107016091B CN 107016091 B CN107016091 B CN 107016091B CN 201710219422 A CN201710219422 A CN 201710219422A CN 107016091 B CN107016091 B CN 107016091B
- Authority
- CN
- China
- Prior art keywords
- model
- regular expression
- nfa
- target
- dfa
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2358—Change logging, detection, and notification
-
- 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/33—Flow control; Congestion control using forward notification
Abstract
The embodiment of the invention provides regular expression update method and devices in a kind of software defined network, applied to the controller in software defined network, record has the first regular expression set in controller, the corresponding first NFA model of first regular expression set, and the first DFA model obtained by the first NFA model conversion, method includes: when detecting that the first regular expression set is adjusted to the second regular expression set, determine the first regular expression set and the second regular expression intersection of sets collection, utilize the regular expression that intersection is not belonging in the first regular expression set and the second regular expression set, construct target regular expression subset；Determine the corresponding target NFA model of target regular expression subset；Based on the first NFA model, the first DFA model and target NFA model, the 2nd DFA model corresponding to the second regular expression set is determined.Using the embodiment of the present invention, reduce the calculation amount of controller.
Description
Technical field
The present invention relates to network technique fields, more particularly to regular expression update method in a kind of software defined network
And device.
Background technique
At present, it is often necessary to the composition rule of character string described using regular expression, and using regular expression come
Judge whether the composition rule of certain character strings matches with character string composition rule corresponding to the regular expression, Jin Ergen
Different operations is executed according to different matching results.
Wherein, in the controller of software defined network, multiple regular expressions, i.e. regular expression collection are typically stored with
It closes, and the regular expression set can be based on, (such as unite to the application layer message for the data flow for flowing into the software defined network
One Resource Locator URL, user name and application layer protocol etc.) it is identified, that is, identify the composition rule of the application layer message
Whether match with rule corresponding at least one regular expression in the regular expression set, and the case where matching
Under, according to flow forwarding strategy corresponding to the regular expression set, which is forwarded.
But in general, regular expression cannot be matched directly with the application layer message of data flow, therefore
Need for the regular expression set to be converted into a NFA (Non-Deterministic Finite Automata, it is non-determined
Finite-state automata) (Deterministic Finite Automata, determines finity state machine by model or a DFA
Machine) model, to be matched using the DFA model or the NFA model to the application layer message of data flow.In addition, due to DFA
Model is very fast relative to the matching speed of NFA model, therefore regular expression set is first usually converted to a NFA model,
It is again corresponding DFA model by the NFA model conversion, and then can use the DFA model being converted to and data flow is answered
It is matched with layer information, improves matching speed.
In addition, in order to adapt to the requirement of the data forwarding of software defined network, it is often necessary to being stored just in controller
Then expression formula set is updated, and is typically referred to specifically, being updated to the regular expression set stored in controller:
A newly-increased regular expression is executed to the regular expression set stored in controller or deletes a regular expression
Adjustment operation, and DFA model corresponding to the regular expression set adjusted is obtained, it completes in this way, just calculating to the control
The update for the regular expression that device is stored.
But in the prior art, after the regular expression set stored in controller is adjusted, needing should
Regular expression set adjusted is converted to a new NFA model, then passes through subset construction method for the new NFA model weight
Newly be converted to a new DFA model.And this kind of update mode the problem is that: can occupy the controller it is more calculating money
Source, so that controller calculation amount is larger.
Summary of the invention
The embodiment of the present invention is designed to provide regular expression update method and device in a kind of software defined network,
When with controller is stored in updating software defined network regular expression, reduces the controller and update regular expression
Calculation amount.
In a first aspect, the embodiment of the invention provides regular expression update method in a kind of software defined network, application
Controller in software defined network, record has the first regular expression set, the first canonical table in the controller
It is obtained up to the first non-deterministic finite automaton NFA model corresponding to formula set, and by the first NFA model conversion
The first deterministic finite automation DFA model, which comprises
When detecting that the first regular expression set is adjusted to the second regular expression set, described first is determined
Regular expression set and the second regular expression intersection of sets collection, and utilize the first regular expression set and institute
The regular expression for being not belonging to the intersection in the second regular expression set is stated, target regular expression subset is constructed；
Determine target NFA model corresponding to the target regular expression subset；
Based on the first NFA model, the first DFA model and the target NFA model, second canonical is determined
2nd DFA model corresponding to expression formula set.
Optionally, described to be based on the first NFA model, the first DFA model and the target NFA model, it determines
The step of 2nd DFA model corresponding to the second regular expression set, comprising:
Determine at least two first closure state sets and described two first recorded in the first NFA model
First NFA model transfer function corresponding to closure state set；
Determine at least two first states recorded in the first DFA model and at least two first shape
First DFA model transfer function corresponding to state；
Determine by the first NFA model conversion by the mapping relations that are utilized when the first DFA model, it is described to reflect
Penetrating relation record has the corresponding conversion between at least two first closure state set and at least two first state to close
System；Wherein, the state number of the set number Yu at least two first state of at least two first closure state set
It is identical；
Determine at least two target closure state sets and described at least two recorded in the target NFA model
Target NFA model transfer function corresponding to target closure state set；
Based on at least two first closure state set, the first NFA model transfer function, described at least two
One state, the first DFA model transfer function, the mapping relations, at least two targets closure state set and described
Target NFA model transfer function determines the 2nd DFA model corresponding to the second regular expression set.
Optionally, the first regular expression set is adjusted to the operation of the second regular expression set are as follows: to institute
It states and increases the target regular expression subset in the first regular expression set, obtain the second regular expression set；
Correspondingly, described to be based on at least two first closure state set, the first NFA model transfer function, institute
State at least two first states, the first DFA model transfer function, the mapping relations, at least two targets closure
State set and the target NFA model transfer function, determine the 2nd DFA model corresponding to the second regular expression set
The step of, comprising:
Based on the first NFA model transfer function, at least two first state, the first DFA Model transfer
Described two target closure state sets correspondence is added to by function, the mapping relations and the target NFA model transfer function
In at least two first closure state set, the second closure state set is obtained；Wherein, a target closure state set and one
First closure state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
Optionally, the first regular expression set is adjusted to the operation of the second regular expression set are as follows: by institute
The target regular expression subset stated in the first regular expression set is deleted, and the second regular expression set is obtained；
Correspondingly, described to be based on at least two first closure state set, the first NFA model transfer function, institute
State at least two first states, the first DFA model transfer function, the mapping relations, at least two targets closure
State set and the target NFA model transfer function, determine the 2nd DFA model corresponding to the second regular expression set
The step of, comprising:
Based on the first NFA model transfer function, at least two first state, the first DFA Model transfer
Function, the mapping relations and the target NFA model transfer function, it is corresponding to delete at least two first closure state set
In element identical with described two target closure state sets, obtain the second closure state set；Wherein, a target closure state
Collect uniquely corresponding with a first closure state set；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
It optionally, further include at least one interchanger in the software defined network；The method also includes:
Before the first regular expression set is adjusted to the second regular expression set, determine described first just
Then NFA model corresponding to each regular expression in expression formula set；
According to the first default distribution principle, by NFA model corresponding to each regular expression, be sent to it is described extremely
A few interchanger, so that received NFA model conversion is a 3rd DFA model by each interchanger, and using this
Three DFA models match the application layer message of received data flow.
Optionally, after the target NFA model corresponding to the determination target regular expression subset, the method
Further include:
According to the second default distribution principle, the target NFA model is sent at least one described interchanger, for institute
At least one interchanger is stated after receiving the target NFA model, based on NFA model received by the interchanger with
And the target NFA model, update the 3rd DFA model.
Second aspect, the embodiment of the invention also provides regular expression updating devices in a kind of software defined network, answer
For the controller in software defined network, record has the first regular expression set, first canonical in the controller
First non-deterministic finite automaton NFA model corresponding to expression formula set, and obtained by the first NFA model conversion
The the first deterministic finite automation DFA model arrived, described device include:
First determination unit detects that the first regular expression set is adjusted to the second regular expression collection for working as
When conjunction, the first regular expression set and the second regular expression intersection of sets collection are determined, and utilize described first
The regular expression of the intersection is not belonging in regular expression set and the second regular expression set, building target is just
Then expression formula subset；
Second determination unit, for determining target NFA model corresponding to the target regular expression subset；
Third determination unit, for being based on the first NFA model, the first DFA model and the target NFA mould
Type determines the 2nd DFA model corresponding to the second regular expression set.
Optionally, the third determination unit, comprising:
First determines subelement, for determining at least two first closure states recorded in the first NFA model
First NFA model transfer function corresponding to collection and described two first closure state sets；
Second determines subelement, for determining at least two first states recorded in the first DFA model, and
First DFA model transfer function corresponding at least two first state；
Third determines subelement, is being the first DFA model Shi Suoli by the first NFA model conversion for determining
Mapping relations, the mapping relations record have at least two first closure state set and at least two first shape
Corresponding conversion relationship between state；Wherein, the set number and described at least two of at least two first closure state set
The state number of first state is identical；
4th determines subelement, for determining at least two target closure state recorded in the target NFA model
Target NFA model transfer function corresponding to collection and at least two targets closure state set；
5th determines subelement, for being based on at least two first closure state set, the first NFA Model transfer
Function, at least two first state, the first DFA model transfer function, the mapping relations, at least two mesh
Closure state set and the target NFA model transfer function are marked, is determined second corresponding to the second regular expression set
DFA model.
Optionally, in one implementation, the described 5th determine that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: Xiang Suoshu first
Increase the target regular expression subset in regular expression set, when obtaining the second regular expression set, based on described
First NFA model transfer function, at least two first state, the first DFA model transfer function, the mapping relations
With the target NFA model transfer function, described two target closure state sets correspondence is added to described at least two first
In closure state set, the second closure state set is obtained；Wherein, a target closure state set and a first closure state set be only
One is corresponding；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
Optionally, in another implementation, the described 5th determine that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: by described first
The target regular expression subset in regular expression set is deleted, and when obtaining the second regular expression set, is based on institute
State the first NFA model transfer function, at least two first state, the first DFA model transfer function, mapping pass
System and the target NFA model transfer function, it is corresponding delete in at least two first closure state set with described two mesh
The identical element of closure state set is marked, the second closure state set is obtained；Wherein, a target closure state set is closed with one first
Packet state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
It optionally, further include at least one interchanger in the software defined network；Described device further include:
4th determination unit, for by the first regular expression set be adjusted to the second regular expression set it
Before, determine NFA model corresponding to each regular expression in the first regular expression set；
First transmission unit is used for according to the first default distribution principle, by NFA corresponding to each regular expression
Model is sent at least one described interchanger, so that received NFA model conversion is a third by each interchanger
DFA model, and the application layer message of received data flow is matched using the 3rd DFA model.
Optionally, in embodiments of the present invention, described device further include:
Second transmission unit, for being determined corresponding to the target regular expression subset in second determination unit
Target NFA model after, according to the second default distribution principle, the target NFA model is sent at least one described exchange
Machine, so that at least one described interchanger is after receiving the target NFA model, described in received by the interchanger
NFA model and the target NFA model update the 3rd DFA model.
In embodiments of the present invention, when the first regular expression set stored in the controller is updated to second
When regular expression set, the second obtained regular expression will be updated by, which not needing, is uniformly converted to a new NFA model, then
The new NFA Unified Model is converted into a new DFA model, it is only necessary to according in the controller stored described
One NFA model and the first DFA model, and the target NFA model in conjunction with corresponding to the target regular expression subset, i.e.,
It can determine the 2nd DFA model corresponding to the second regular expression set that update obtains.In this way, avoiding repetition conversion, drop
Low calculation amount.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is the flow chart of regular expression update method in a kind of software defined network provided in an embodiment of the present invention；
Fig. 2 is the shape of target NFA model corresponding to a kind of target regular expression subset provided in an embodiment of the present invention
State transition diagram；
Fig. 3 is the shape of the first NFA model corresponding to a kind of first regular expression set provided in an embodiment of the present invention
State transition diagram；
Fig. 4 is the corresponding state transition graph of the first DFA model that the first NFA model corresponding to Fig. 3 is converted to；
Fig. 5 is the 2nd DFA model pair corresponding to a kind of second regular expression set provided in an embodiment of the present invention
The state transition graph answered；
Fig. 6 is the structural representation of regular expression updating device in a kind of software defined network provided in an embodiment of the present invention
Figure.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
In order to solve the problems in the existing technology, the embodiment of the invention provides canonicals in a kind of software defined network
Expression formula update method and device.
Regular expression update method in software defined network provided in an embodiment of the present invention is illustrated first below.
It should be noted that in software defined network provided in an embodiment of the present invention regular expression update method execution
Main body are as follows: the controller in software defined network.Wherein, regular expression in the software defined network of the embodiment of the present invention is realized
The functional software of update method can be with are as follows: is set to the software updated in the controller dedicated for regular expression；It can also
With are as follows: it is set in the controller and updates the feature card in software for regular expression, be not limited thereto certainly.
It should also be noted that, record has the first regular expression set, first regular expressions in the controller
First non-deterministic finite automaton NFA model corresponding to formula set, and obtained by the first NFA model conversion
First deterministic finite automation DFA model.
Wherein, the first NFA model can use the first NFA state transition graph to indicate, also can use the first NFA
State transition table indicates.The first DFA model can use the first DFA state transition graph to indicate, also can use
One DFA state transition table indicates that this is all reasonable.It is laid out for clarity, it is subsequent to state transition graph and state transition table
Form be illustrated.
It is worth noting that the first regular expression set can be converted to according to Thompson structured approach
One NFA model, wherein may include at least one regular expression in the first regular expression set.Wherein, specific to turn
Changing operation may include: that at least one described regular expression is converted at least one NFA model, wherein a canonical table
It is uniquely corresponding up to formula and a NFA model；Further according to connection operation, at least one described NFA model is connected into described first
NFA model.It, can be according to subset construction method by the first NFA model conversion in addition, after obtaining the first NFA model
Obtain the first DFA model.
Referring to Fig. 1, regular expression update method be can wrap in a kind of software defined network provided in an embodiment of the present invention
Include following steps:
S101: when detecting that the first regular expression set is adjusted to the second regular expression set, institute is determined
The first regular expression set and the second regular expression intersection of sets collection are stated, and utilizes the first regular expression collection
The regular expression for closing and being not belonging to the intersection in the second regular expression set constructs target regular expressions formula
Collection；
It should be noted that the operation that the first regular expression set is adjusted to the second regular expression set can
With are as follows: increase target regular expression subset in Xiang Suoshu the first regular expression set, to obtain the second canonical table
Up to formula set.Or: the target regular expression subset in the first regular expression set is deleted, to obtain
The second regular expression set, this is all reasonable.
For example, the first regular expression collection is combined into aa*b | bb*a, i.e., the described first regular expression set packet
Include regular expression aa*b and regular expression bb*a.When detecting that the first regular expression set is adjusted to the second canonical table
Up to formula set (aa*b | bb*a) | when a*ba, then it can determine the first regular expression set and second regular expression
Intersection of sets integrates as aa*b | bb*a, and can determine the canonical that the intersection is not belonging in the second regular expression set
Expression formula is a*ba, and then can construct by the regular expression is the target regular expression subset that constitutes of a*ba, i.e., this
When the target regular expression subset be regular expression a*ba.
S102: target NFA model corresponding to the target regular expression subset is determined；
It is understood that can be according in the prior art, the method for converting NFA model for regular expression determines
Target NFA model corresponding to the target regular expression subset.For example, Thompson structured approach, structure can be passed through
Make target NFA model corresponding to the target regular expression subset (such as regular expression a*ba).Wherein, regular expressions
The state transition graph of target NFA model corresponding to formula a*ba can be found in Fig. 2.
The state transition graph of target NFA model corresponding to regular expression a*ba in Fig. 2 is illustrated below.
Referring to fig. 2, it is known that the beginning state set of target NFA model corresponding to regular expression a*ba be 16,17,
19}.After inputting character a, starts state set { 16,17,19 } and be transferred to state set { 17,18,19 }；After inputting character b, open
Beginning state set { 16,17,19 } is transferred to state { 14 }.Also, after inputting character a, state set { 17,18,19 } is transferred to certainly
Body state set { 17,18,19 }；After inputting character b, state set { 17,18,19 } is transferred to state { 14 }.In input character a
Afterwards, state { 14 } can be transferred to end state { 15 }.
It should be noted that being previously mentioned in the NFA model such as the first NFA model and target NFA model in the embodiment of the present invention
State set and state, each mean: shifting reached NFA by all ε from a NFA state of the NFA model
State set.
S103: being based on the first NFA model, the first DFA model and the target NFA model, determines described the
2nd DFA model corresponding to two regular expression set.
For above-mentioned example, when the first regular expression collection is combined into aa*b | when bb*a, deposited in the controller
Contain: the first regular expression set aa*b | the first NFA model and the first DFA model corresponding to bb*a.Wherein, this first
The corresponding state transition graph of NFA model can be found in Fig. 3, and the corresponding state transition graph of the first DFA model can be found in Fig. 4.
Referring to Fig. 3, it is known that the first regular expression set aa*b | the beginning state of the first NFA model corresponding to bb*a
Collection is { 0,1,3 }.After inputting character a, starts state set { 0,1,3 } and be transferred to state set { 6,7,9 }；After inputting character b,
Start state set { 0,1,3 } and is transferred to state set { 10,11,13 }.After inputting character a, state set { 6,7,9 } can be transferred to shape
State collection { 7,8,9 }；After inputting character b, state set { 6,7,9 }, which can be transferred to, terminates state set { 2,5 }.After inputting character a,
State set { 10,11,13 } can be transferred to state set { 4,5 }；After inputting character b, state set { 10,11,13 } can be transferred to shape
State collection { 11,12,13 }.After inputting character a, state set { 11,12,13 }, which can be transferred to, terminates state set { 4,5 }；In input word
After according with b, state set { 11,12,13 } is transferred to oneself state collection { 11,12,13 }.In addition, after inputting character a, state set 7,
8,9 } oneself state collection { 7,8,9 } are transferred to, after inputting character b, state set { 7,8,9 } is transferred to state set { 2,5 }.
After obtaining the transfer relationship of each state set and each state set of the first NFA model, it can will open
Beginning state set { 0,1,3 } is indicated with state A.State set { 6,7,9 } is indicated with state B；State set { 10,11,13 } state C table
Show.State set { 7,8,9 } is indicated with state D；Terminate state set { 2,5 } is indicated with state E.State set { 11,12,13 } uses state
G is indicated；Terminate state set { 4,5 } is indicated with state F.So as to according to the transfer for each state set for obtaining the first NFA model
Relationship determines the transfer relationship between state A, state B, state C, state D, state E, state F and state G, so as to true
Surely the corresponding state transition graph of the first DFA model as shown in Figure 4 is obtained.
It is of course also possible to by the transfer relationship of each state set in above-mentioned first NFA model, in above-mentioned first DFA model
Corresponding relationship between the transfer relationship of each state and each state set and each state is carried out using table one
It indicates:
Table one
It is understood that when by the first regular expression set aa*b | bb*a is adjusted to (aa*b | bb*a) | a*
After ba, target NFA model corresponding to identified target regular expression subset a*ba and the first canonical table can use
Up to formula set aa*b | the first NFA model corresponding to bb*a is adjusted the first DFA model, and then adjusts and obtain institute
State the second regular expression set (aa*b | bb*a) | the 2nd DFA model corresponding to a*ba.That is, this kind of mode, no
Need to abandon the first DFA model, it is only necessary on the basis of the first DFA model, based on the first NFA model and
The target NFA model is adjusted the first DFA model, can be obtained the 2nd DFA model.
It should be noted that when the first regular expression set is adjusted to the second regular expression set, this hair
The scheme of bright embodiment does not need to execute: the regular expression in the second regular expression set is converted to the 2nd NFA
Model；Conversion operation is executed to the 2nd NFA model again, to be converted to corresponding to second regular expression the
The step of two DFA models.In this way, making the scheme of the embodiment of the present invention that the first regular expression set is being adjusted to
When two regular expression set, the quantity for needing to be converted to the NFA model of DFA model can reduce, to considerably reduce
Time needed for obtaining the 2nd DFA model, and then highly shortened the time for updating regular expression.
Optionally, in one implementation, step S103: described to be based on the first NFA model, the first DFA
Model and the target NFA model determine that the operation of the 2nd DFA model corresponding to the second regular expression set is specific
May include:
S1: at least two first closure state sets recorded in the first NFA model and described two are determined
First NFA model transfer function corresponding to one closure state set；
For above-mentioned example, when the first NFA model is by the first regular expression set aa*b | bb*a turns
Get in return when, can determine the first closure state set recorded in the first NFA model include: { 0,1,3 }, 6,7,
9 }, { 7,8,9 }, { 2,5 }, { 10,11,13 }, { 11,12,13 } and { 4,5 }.In addition, in the first NFA model transfer function
At least record has the transfer relationship between above-mentioned each first closure state set.
S2: at least two first states recorded in the first DFA model and described at least two first are determined
First DFA model transfer function corresponding to state；
It is understood that when the first DFA model is obtained by the first NFA model conversion under above-mentioned S1 step example
Arrive when, would know that in conjunction with content above, the first state recorded in the first DFA model includes: state A, state B, shape
State C, state D, state E, state F and state G.In addition, in the first DFA model transfer function at least record have it is above-mentioned each
Transfer relationship between first state.
S3: determine by the first NFA model conversion by the mapping relations that are utilized when the first DFA model, institute
It states mapping relations and records corresponding turn had between at least two first closure state set and at least two first state
Change relationship；Wherein, the state of the set number Yu at least two first state of at least two first closure state set
Number is identical；
Referring to table one, the mapping relations can recorde: the corresponding relationship of { 0,1,3 } and state A；{ 6,7,9 } and shape
The corresponding relationship of state B；The corresponding relationship of { 10,11,13 } and state C；The corresponding relationship of { 7,8,9 } and state D；{ 2,5 } and shape
The corresponding relationship of state E；The corresponding relationship of { 11,12,13 } and state G；The corresponding relationship of { 4,5 } and state F.
S4: at least two target closure state sets recorded in the target NFA model and described at least two are determined
Target NFA model transfer function corresponding to a target closure state set；
For example, when the target NFA model is be converted to by target regular expression subset a*ba, in conjunction with
Above description is it is found that target closure state set recorded in the target NFA model are as follows: { 16,17,19 }, { 17,18,19 },
{ 14 } and { 15 }.At least record has turn between above-mentioned each target closure state set in the target NFA model transfer function
Shifting relationship.
S5: at least two first closure state set, the first NFA model transfer function, described at least two are based on
A first state, the first DFA model transfer function, the mapping relations, at least two targets closure state set and
The target NFA model transfer function determines the 2nd DFA model corresponding to the second regular expression set.
It is understood that can use at least two first closure state set and the first NFA model transfer function,
At least two first state and the first DFA model transfer function, the mapping relations and at least two target are closed
Packet state set and target NFA model transfer function, are adjusted the first DFA model, to obtain second canonical
2nd DFA model corresponding to expression formula set.
Wherein, in one implementation, when the first regular expression set is adjusted to the second regular expression
The operation of set are as follows: increase the target regular expression subset in Xiang Suoshu the first regular expression set, obtaining second just
Then when expression formula set, the operation of step S5 be may particularly include:
Based on the first NFA model transfer function, at least two first state, the first DFA Model transfer
Described two target closure state sets correspondence is added to by function, the mapping relations and the target NFA model transfer function
In at least two first closure state set, the second closure state set is obtained；Wherein, a target closure state set and one
First closure state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
For example, it is assumed that the first regular expression set aa*b is stored in the controller | bb*a, then described first
NFA model transfer function, at least two first state, the first DFA model transfer function and the mapping relations are equal
It can be found in table one.
When to the first regular expression set aa*b | increase target regular expression subset a*ba in bb*a, obtains
Second regular expression set (aa*b | bb*a) | after a*ba, it is known that the second regular expression set (aa*b | bb*a) | a*ba institute
The beginning state set of corresponding NFA model are as follows: beginning state set { 0,1,3 } and target NFA model in the first NFA model are opened
Set, that is, start state set and be updated to { 0,1,3,16,17,19 } composed by beginning state set { 16,17,19 }.
After inputting character a, it can be transferred to state set { 6,7,9 } due to starting state set { 0,1,3 }, start state set
{ 16,17,19 } can be transferred to state set { 17,18,19 }, therefore, after inputting character a, state set { 0,1,3,16,17,19 }
Set composed by state set { 6,7,9 } and state set { 17,18,19 } can be transferred to, i.e., can be transferred to state set 6,7,9,
17,18,19 }.
According to above-mentioned increase mode, it is known that after inputting character b, state set { 0,1,3,16,17,19 } can be transferred to state
Collect { 10,11,13,14 }；After inputting character a, state set { 6,7,9,17,18,19 } can be transferred to state set 7,8,9,17,
18,19 }；Etc., it is not described here in detail.
It is thus possible to be used as a second closure state set for obtained each state set is updated.In this way, each second
Closure state set can be carried out with second state it is corresponding, thus obtain the 2nd DFA model.For example, the second closure shape
State A ' in corresponding second state of state collection { 0,1,3,16,17,19 }, the second closure state set { 6,7,9,17,18,19 } are corresponding
State B ' in second state, etc..Also, the second closure shape corresponding to each second state in the 2nd DFA model
The transfer relationship of state collection and each second closure state set may refer to table two:
| NFA’STATE | DFA STATE | a | b |
| {0,1,3,16,17,19} | A’ | B’ | C’ |
| {6,7,9,17,18,19} | B’ | D’ | E’ |
| {10,11,13,14} | C’ | F’ | G’ |
| {7,8,9,17,18,19} | D’ | D’ | E’ |
| {2,5,14} | E’ | H’ | / |
| {4,5,15} | F’ | / | / |
| {11,12,13} | G’ | I’ | G’ |
| {5,15} | H’ | / | / |
| {4,5} | I’ | / | / |
Table two
It should be noted that NFA ' the STATE refer to the second closure state set include: 0,1,3,16,17,
19 } ..., { 4,5 }.
In addition, the transfer relationship according to shown in table two, can obtain the corresponding shape of the 2nd DFA model as shown in Figure 5
State transition diagram.
It should be noted that a target closure state set with a first closure state set is uniquely corresponding refers to: one
Target closure state set can only add in a first closure state set.
In another implementation, when the first regular expression set is adjusted to the second regular expression set
Operation are as follows: by the first regular expression set the target regular expression subset delete, obtain the second canonical
When expression formula set, the operation of step S5 be may particularly include:
Based on the first NFA model transfer function, at least two first state, the first DFA Model transfer
Function, the mapping relations and the target NFA model transfer function, it is corresponding to delete at least two first closure state set
In element identical with described two target closure state sets, obtain the second closure state set；Wherein, a target closure state
Collect uniquely corresponding with a first closure state set；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
For example, when by the first regular expression set (aa*b | bb*a) | the target regular expression in a*ba
Subset bb*a delete, obtain the second regular expression set aa*b | when a*ba, can by the first closure state set with the mesh
It marks the identical element of state set to delete, to obtain the second closure state set.
For example, knowing the second regular expression set aa*b | the beginning state set of NFA model corresponding to a*ba are as follows: will
Beginning state { 3 } in beginning state set { 0,1,3,16,17,19 } in first NFA model comprising target NFA model deletes institute
Obtained set, that is, the beginning state set updated are { 0,1,16,17,19 }.
After inputting character a, due to start state set { 0,1,3,16,17,19 } can be transferred to state set 6,7,9,17,
18,19 }, start state { 3 } and do not transfer to any state, therefore, after inputting character a, state set 0,1,16,17,
19 } state set { 6,7,9,17,18,19 } can be transferred to.
After inputting character b, since state set { 0,1,3,16,17,19 } can be transferred to state set { 10,11,13,14 },
And { 10,11,13 } can be transferred to by starting state { 3 }, therefore, after inputting character b, state set { 0,1,16,17,19 } can be shifted
To state set { 14 }.
According to above-mentioned deletion mode, it is known that after inputting character a, state set { 6,7,9,17,18,19 } can be transferred to state
Collect { 7,8,9,17,18,19 }；Etc..It is not described here in detail.Wherein, the second closure state set obtained and each second
The transfer relationship of closure state set can be with reference table three:
Table three
It should be noted that the content crossed out of three bend of table and horizontal line is the content deleted relative to table two.And
And according to the available second regular expression set aa*b of the content that do not crossed out | the 2nd DFA model corresponding to a*ba.
It should also be noted that, in order to search conveniently, it, can also be to described when increasing newly or deleting target regular expression
Target regular expression is numbered, thus according to the number search the target regular expression corresponding to target NFA model,
This is reasonable.
In embodiments of the present invention, when the first regular expression set stored in the controller is updated to second
When regular expression set, the second obtained regular expression will be updated by, which not needing, is uniformly converted to a new NFA model, then
The new NFA Unified Model is converted into a new DFA model, it is only necessary to according in the controller stored described
One NFA model and the first DFA model, and the target NFA model in conjunction with corresponding to the target regular expression subset, i.e.,
It can determine the 2nd DFA model corresponding to the second regular expression set that update obtains.In this way, avoiding repetition conversion, drop
Low calculation amount.
It optionally, further include at least one interchanger in the software defined network；The method also includes:
Before the first regular expression set is adjusted to the second regular expression set, determine described first just
Then NFA model corresponding to each regular expression in expression formula set；
According to the first default distribution principle, by NFA model corresponding to each regular expression, be sent to it is described extremely
A few interchanger, so that received NFA model conversion is a 3rd DFA model by each interchanger, and using this
Three DFA models match the application layer message of received data flow.
It is understood that the matching of regular expression is the control in software defined network due in the prior art
It is executed in device.That is, requiring after the interchanger in software defined network often receives a data stream by this number
It is uploaded to controller according to the application layer message (such as uniform resource position mark URL, user name and application layer protocol etc.) of stream, into
And controller judge the application layer message composition rule whether with corresponding at least one regular expression in the controller
Rule match.And in the event of a match, controller obtains the corresponding flow forwarding strategy of the data stream, and should
Flow forwarding strategy is sent to corresponding interchanger and carries out flow forwarding.
It can be seen that, when software defined network receives more data stream, controller needs to be implemented largely in this kind of mode
Ground matches the operation of regular expression, and the computation burden that will lead to controller in this way is heavier, can also reduce and obtain flow forwarding plan
Speed slightly.Also, the more network bandwidth of controller can be also occupied, or even causes network bandwidth bottleneck.
It therefore to solve the above-mentioned problems, can be according to the first default distribution principle, by the first regular expression collection
NFA model corresponding to each regular expression in conjunction, is sent in the interchanger in the software defined network.To each
Received NFA model can be converted to a 3rd DFA model by interchanger, and using the 3rd DFA model to being connect
The application layer message of the data flow received is matched.
Optionally, after the target NFA model corresponding to the determination target regular expression subset, the method
Can also include:
According to the second default distribution principle, the target NFA model is sent at least one described interchanger, for institute
At least one interchanger is stated after receiving the target NFA model, based on NFA model received by the interchanger with
And the target NFA model, update the 3rd DFA model.
It is understood that when the first regular expression set is adjusted to the second regular expression set, control
Identified target NFA model can be sent in the software defined network by device processed according to the second default distribution principle
Interchanger.In this way, the interchanger is after receiving the target NFA model, can according to it is as described above any one more
The mode of new regular expression, the 3rd DFA model stored to itself are updated.And it can use updated third
DFA model matches the application layer message of received data flow.
Corresponding to above method embodiment, the embodiment of the invention also provides regular expressions in a kind of software defined network
Updating device, applied to the controller in software defined network, record has the first regular expression set, institute in the controller
The first non-deterministic finite automaton NFA model corresponding to the first regular expression set is stated, and by the first NFA
The first deterministic finite automation DFA model that model conversion obtains, referring to Fig. 6, the apparatus may include:
In embodiments of the present invention, when the first regular expression set stored in the controller is updated to second
When regular expression set, the second obtained regular expression will be updated by, which not needing, is uniformly converted to a new NFA model, then
The new NFA Unified Model is converted into a new DFA model, it is only necessary to according in the controller stored described
One NFA model and the first DFA model, and the target NFA model in conjunction with corresponding to the target regular expression subset, i.e.,
It can determine the 2nd DFA model corresponding to the second regular expression set that update obtains.In this way, avoiding repetition conversion, drop
Low calculation amount.
Optionally, the third determination unit 603 may include:
First determines subelement, for determining at least two first closure states recorded in the first NFA model
First NFA model transfer function corresponding to collection and described two first closure state sets；
Second determines subelement, for determining at least two first states recorded in the first DFA model, and
First DFA model transfer function corresponding at least two first state；
Third determines subelement, is being the first DFA model Shi Suoli by the first NFA model conversion for determining
Mapping relations, the mapping relations record have at least two first closure state set and at least two first shape
Corresponding conversion relationship between state；Wherein, the set number and described at least two of at least two first closure state set
The state number of first state is identical；
4th determines subelement, for determining at least two target closure state recorded in the target NFA model
Target NFA model transfer function corresponding to collection and at least two targets closure state set；
5th determines subelement, for being based on at least two first closure state set, the first NFA Model transfer
Function, at least two first state, the first DFA model transfer function, the mapping relations, at least two mesh
Closure state set and the target NFA model transfer function are marked, is determined second corresponding to the second regular expression set
DFA model.
Optionally, in one implementation, the described 5th determine that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: Xiang Suoshu first
Increase the target regular expression subset in regular expression set, when obtaining the second regular expression set, based on described
First NFA model transfer function, at least two first state, the first DFA model transfer function, the mapping relations
With the target NFA model transfer function, described two target closure state sets correspondence is added to described at least two first
In closure state set, the second closure state set is obtained；Wherein, a target closure state set and a first closure state set be only
One is corresponding；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
Optionally, in another implementation, the described 5th determine that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: by described first
The target regular expression subset in regular expression set is deleted, and when obtaining the second regular expression set, is based on institute
State the first NFA model transfer function, at least two first state, the first DFA model transfer function, mapping pass
System and the target NFA model transfer function, it is corresponding delete in at least two first closure state set with described two mesh
The identical element of closure state set is marked, the second closure state set is obtained；Wherein, a target closure state set is closed with one first
Packet state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
It optionally, further include at least one interchanger in the software defined network；Described device can also include:
4th determination unit, for by the first regular expression set be adjusted to the second regular expression set it
Before, determine NFA model corresponding to each regular expression in the first regular expression set；
First transmission unit is used for according to the first default distribution principle, by NFA corresponding to each regular expression
Model is sent at least one described interchanger, so that received NFA model conversion is a third by each interchanger
DFA model, and the application layer message of received data flow is matched using the 3rd DFA model.
Optionally, in embodiments of the present invention, described device can also include:
Second transmission unit, for being determined corresponding to the target regular expression subset in second determination unit
Target NFA model after, according to the second default distribution principle, the target NFA model is sent at least one described exchange
Machine, so that at least one described interchanger is after receiving the target NFA model, described in received by the interchanger
NFA model and the target NFA model update the 3rd DFA model.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
Each embodiment in this specification is all made of relevant mode and describes, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for system reality
For applying example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method
Part explanation.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all
Any modification, equivalent replacement, improvement and so within the spirit and principles in the present invention, are all contained in protection scope of the present invention
It is interior.
Claims (8)
1. regular expression update method in a kind of software defined network, which is characterized in that applied in software defined network
Controller, record has corresponding to the first regular expression set, the first regular expression set the in the controller
One non-deterministic finite automaton NFA model, and the first determining finite state obtained by the first NFA model conversion
Automatic machine DFA model, which comprises
When detecting that the first regular expression set is adjusted to the second regular expression set, first canonical is determined
Expression formula set and the second regular expression intersection of sets collection, and utilize the first regular expression set and described the
It is not belonging to the regular expression of the intersection in two regular expression set, constructs target regular expression subset；
Determine target NFA model corresponding to the target regular expression subset；
Based on the first NFA model, the first DFA model and the target NFA model, second regular expressions are determined
2nd DFA model corresponding to formula set；
It is described to be based on the first NFA model, the first DFA model and the target NFA model, determine second canonical
The step of 2nd DFA model corresponding to expression formula set, comprising:
Determine at least two first closure state sets recorded in the first NFA model and described two first closures
First NFA model transfer function corresponding to state set；
Determine at least two first states recorded in the first DFA model and at least two first states institute
Corresponding first DFA model transfer function；
Determine to be the mapping relations that utilize when the first DFA model by the first NFA model conversion, the mapping pass
System's record has the corresponding conversion relationship between at least two first closure state set and at least two first state；Its
In, the set number of at least two first closure state set is identical as the state number of at least two first state；
Determine at least two target closure state sets and at least two target recorded in the target NFA model
Target NFA model transfer function corresponding to closure state set；
Based on at least two first closure state set, the first NFA model transfer function, at least two first shape
State, the first DFA model transfer function, the mapping relations, at least two targets closure state set and the target
NFA model transfer function determines the 2nd DFA model corresponding to the second regular expression set.
2. the method according to claim 1, wherein the first regular expression set is being adjusted to second just
The then operation of expression formula set are as follows: increase the target regular expression subset in Xiang Suoshu the first regular expression set, obtain
Obtain the second regular expression set；
Correspondingly, it is described based on at least two first closure state set, the first NFA model transfer function, it is described extremely
Few two first states, the first DFA model transfer function, the mapping relations, at least two targets closure state
Collection and the target NFA model transfer function, determine the step of the 2nd DFA model corresponding to the second regular expression set
Suddenly, comprising:
Based on the first NFA model transfer function, at least two first state, the first DFA model transfer function,
The mapping relations and the target NFA model transfer function correspond to described two target closure state sets described in being added to
In at least two first closure state sets, the second closure state set is obtained；Wherein, a target closure state set and one first
Closure state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
3. the method according to claim 1, wherein the first regular expression set is being adjusted to second just
The then operation of expression formula set are as follows: the target regular expression subset in the first regular expression set is deleted,
Obtain the second regular expression set；
Correspondingly, it is described based on at least two first closure state set, the first NFA model transfer function, it is described extremely
Few two first states, the first DFA model transfer function, the mapping relations, at least two targets closure state
Collection and the target NFA model transfer function, determine the step of the 2nd DFA model corresponding to the second regular expression set
Suddenly, comprising:
Based on the first NFA model transfer function, at least two first state, the first DFA model transfer function,
The mapping relations and the target NFA model transfer function, it is corresponding delete in at least two first closure state set with
The identical element of described two target closure state sets, obtains the second closure state set；Wherein, target closure state set with
One the first closure state set uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
4. the method according to claim 1, wherein further including at least one exchange in the software defined network
Machine；The method also includes:
Before the first regular expression set is adjusted to the second regular expression set, the first canonical table is determined
Up to NFA model corresponding to each regular expression in formula set；
According to the first default distribution principle, by NFA model corresponding to each regular expression, it is sent to described at least one
A interchanger so that received NFA model conversion is a 3rd DFA model by each interchanger, and utilizes the 3rd DFA
Model matches the application layer message of received data flow.
5. according to the method described in claim 4, it is characterized in that, right in the determination target regular expression subset institute
After the target NFA model answered, the method also includes:
According to the second default distribution principle, the target NFA model is sent at least one described interchanger, for it is described extremely
A few interchanger is after receiving the target NFA model, based on NFA model received by the interchanger and institute
Target NFA model is stated, the 3rd DFA model is updated.
6. regular expression updating device in a kind of software defined network, which is characterized in that applied in software defined network
Controller, record has corresponding to the first regular expression set, the first regular expression set the in the controller
One non-deterministic finite automaton NFA model, and the first determining finite state obtained by the first NFA model conversion
Automatic machine DFA model, described device include:
First determination unit detects that the first regular expression set is adjusted to the second regular expression set for working as
When, determine the first regular expression set and the second regular expression intersection of sets collection, and just using described first
It is then not belonging to the regular expression of the intersection in expression formula set and the second regular expression set, constructs target canonical
Expression formula subset；
Second determination unit, for determining target NFA model corresponding to the target regular expression subset；
Third determination unit, for being based on the first NFA model, the first DFA model and the target NFA model, really
2nd DFA model corresponding to the fixed second regular expression set；
The third determination unit, comprising:
First determines subelement, for determining at least two first closure state sets recorded in the first NFA model, with
And the first NFA model transfer function corresponding to described two first closure state sets；
Second determines subelement, for determining at least two first states recorded in the first DFA model and described
First DFA model transfer function corresponding at least two first states；
Third determines subelement, is utilized for determining in first DFA model that the first NFA model conversion is described
Mapping relations, mapping relations record have at least two first closure state set and at least two first state it
Between corresponding conversion relationship；Wherein, the set number of at least two first closure state set and described at least two first
The state number of state is identical；
4th determines subelement, for determining at least two target closure state set recorded in the target NFA model, with
And target NFA model transfer function corresponding at least two targets closure state set；
5th determines subelement, for being based on at least two first closure state set, the first NFA Model transfer letter
Several, described at least two first state, the first DFA model transfer function, the mapping relations, at least two target
Closure state set and the target NFA model transfer function, determine the 2nd DFA corresponding to the second regular expression set
Model.
7. device according to claim 6, which is characterized in that the described 5th determines that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: the first canonical of Xiang Suoshu
Increase the target regular expression subset in expression formula set, when obtaining the second regular expression set, is based on described first
NFA model transfer function, at least two first state, the first DFA model transfer function, the mapping relations and institute
Target NFA model transfer function is stated, described two target closure state sets correspondence is added at least two first closure
In state set, the second closure state set is obtained；Wherein, a target closure state set and a first closure state set are uniquely right
It answers；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
8. device according to claim 6, which is characterized in that the described 5th determines that subelement is specifically used for:
In the operation that the first regular expression set is adjusted to the second regular expression set are as follows: by first canonical
The target regular expression subset in expression formula set is deleted, when obtaining the second regular expression set, based on described the
One NFA model transfer function, at least two first state, the first DFA model transfer function, the mapping relations and
The target NFA model transfer function, corresponding delete are closed in at least two first closure state set with described two targets
The identical element of packet state set obtains the second closure state set；Wherein, a target closure state set and a first closure shape
State collection uniquely corresponds to；
Based on the second closure state set, the 2nd DFA model corresponding to the second regular expression set is determined.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710219422.1A CN107016091B (en) | 2017-04-06 | 2017-04-06 | Regular expression update method and device in a kind of software defined network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710219422.1A CN107016091B (en) | 2017-04-06 | 2017-04-06 | Regular expression update method and device in a kind of software defined network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107016091A CN107016091A (en) | 2017-08-04 |
| CN107016091B true CN107016091B (en) | 2019-10-15 |
Family
ID=59445275
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710219422.1A Active CN107016091B (en) | 2017-04-06 | 2017-04-06 | Regular expression update method and device in a kind of software defined network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107016091B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111222022B (en) * | 2020-01-15 | 2023-05-12 | 奇安信科技集团股份有限公司 | Regular expression-based matching method and device |
| CN113596043B (en) * | 2021-08-03 | 2023-03-24 | 中国电信股份有限公司 | Attack detection method, attack detection device, storage medium and electronic device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360088A (en) * | 2007-07-30 | 2009-02-04 | 华为技术有限公司 | Regular expression compiling, matching system and compiling, matching method |
| CN101827084A (en) * | 2009-01-28 | 2010-09-08 | 丛林网络公司 | The application identification efficiently of the network equipment |
| CN102523219A (en) * | 2011-12-16 | 2012-06-27 | 清华大学 | Regular expression matching system and regular expression matching method |
| CN102844759A (en) * | 2010-04-20 | 2012-12-26 | 国际商业机器公司 | A dual dfa decomposition for large scale regular expression matching |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9251440B2 (en) * | 2012-12-18 | 2016-02-02 | Intel Corporation | Multiple step non-deterministic finite automaton matching |
-
2017
- 2017-04-06 CN CN201710219422.1A patent/CN107016091B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360088A (en) * | 2007-07-30 | 2009-02-04 | 华为技术有限公司 | Regular expression compiling, matching system and compiling, matching method |
| CN101827084A (en) * | 2009-01-28 | 2010-09-08 | 丛林网络公司 | The application identification efficiently of the network equipment |
| CN102844759A (en) * | 2010-04-20 | 2012-12-26 | 国际商业机器公司 | A dual dfa decomposition for large scale regular expression matching |
| CN102523219A (en) * | 2011-12-16 | 2012-06-27 | 清华大学 | Regular expression matching system and regular expression matching method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107016091A (en) | 2017-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103902653B (en) | A kind of method and apparatus for building data warehouse table genetic connection figure | |
| CN101408877B (en) | System and method for loading tree node | |
| CN102737057B (en) | Determining method and device for goods category information | |
| CN104539502B (en) | A kind of method of self-defined addition modbus equipment | |
| CN102945249B (en) | A kind of policing rule matching inquiry tree generation method, matching process and device | |
| CN106202028B (en) | A kind of address information recognition methods and device | |
| CN108932236A (en) | A kind of file management method, scratch file delet method and device | |
| CN103227778B (en) | Memory pool access method, equipment and system | |
| CN109033471A (en) | A kind of information assets recognition methods and device | |
| CN107016091B (en) | Regular expression update method and device in a kind of software defined network | |
| CN110442603A (en) | Address matching method, apparatus, computer equipment and storage medium | |
| CN108429701A (en) | network acceleration system | |
| CN105868169B (en) | A kind of data acquisition device, collecting method and system | |
| CN107612833A (en) | A kind of URI method for routing and relevant apparatus based on storage system | |
| CN109726280A (en) | A kind of row's discrimination method and device for scholar of the same name | |
| CN110837608A (en) | Public opinion topic propagation path analysis system and method based on multi-source data | |
| CN106874507A (en) | Method, device and server for pushed information | |
| CN103533029B (en) | Gantt chart data loading method and system | |
| CN110020243A (en) | Querying method, device, Internet of Things server and the storage medium of internet of things data | |
| CN102567367A (en) | Method and system for setting correlations in communication interface | |
| CN106375944A (en) | Data acquisition system based on cloud computing | |
| CN110399530A (en) | Data matching method, device and computer equipment | |
| CN107291746A (en) | A kind of method and apparatus for storing and reading data | |
| KR100902934B1 (en) | Method and apparatus for updating digital map | |
| CN106656850A (en) | Chip realizing method for automatically identifying network traffic and making speed limit |
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 |