CN109542601A - Tactful Compilation Method, device, electronic equipment and computer storage medium - Google Patents
Tactful Compilation Method, device, electronic equipment and computer storage medium Download PDFInfo
- Publication number
- CN109542601A CN109542601A CN201811385453.5A CN201811385453A CN109542601A CN 109542601 A CN109542601 A CN 109542601A CN 201811385453 A CN201811385453 A CN 201811385453A CN 109542601 A CN109542601 A CN 109542601A
- Authority
- CN
- China
- Prior art keywords
- maximum
- leaf node
- regular
- compilation
- compiling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4831—Task transfer initiation or dispatching by interrupt, e.g. masked with variable priority
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Stored Programmes (AREA)
Abstract
The embodiment of the present application is for a kind of tactful Compilation Method, comprising: obtains the regular number of maximum of at least one of maximum memory value and maximum node number and leaf node；It is compiled according to the regular several pairs of strategies of the maximum of the leaf node, in compilation process, if the memory currently applied is greater than or equal to the maximum memory value, and/or, if the number of nodes currently split out is greater than or equal to the maximum node number, stop compiling；Modify the regular number of maximum of leaf node；Strategy is compiled again according to the regular number of the maximum of the modified leaf node.According to the embodiment of the present application, strategy compiling low efficiency caused by can solving the problems, such as only just to manually adjust the maximum rule number of leaf node when discovery strategy compiles time-consuming and occupancy a large amount of memories in the prior art as far as possible.The embodiment of the present application also provides a kind of tactful compilation device, electronic equipment and computer storage mediums.
Description
Technical field
This application involves network safety filed, in particular to tactful Compilation Method, device, electronic equipment and computer storage
Medium.
Background technique
Safety equipment handles the message received according to the security strategy of user configuration.The security strategy quantity of user configuration
It is numerous, usually up to up to ten thousand.When safety equipment is matched according to security strategy, the priority based on security strategy, priority match
The forward security strategy in position.
Summary of the invention
The requested number of certain strategy entries of safety equipment can be very much, usually as unit of ten thousand, and according to priority
Sequence there are also sequence requirements.If successively finding corresponding strategy from the strategy entries of tens of thousands of meters according to priority orders
Entry, under search efficiency is very low.In this case, in order to improve search efficiency, it will usually which being compiled into strategy can be fast
Speed finds a kind of corresponding first tactful tree structure.
But present inventor has found under study for action, strategy compiling under certain conditions (e.g., when certain bidimensional or
The configuration of strategy more than bidimensional is more discrete, and when regular number is more) can be very time-consuming and a large amount of memories be occupied, to cause to modify
Strategy cannot come into force in time.It is usually the regular number of maximum of leaf node when manually adjusting compiling to alleviate this problem, thus
The adjustable number for splitting rule, to accelerate matching speed or compilation speed.But manually adjusting can only be that discovery has this problem
After could implement, such controlling policy compiles efficiency, and is also unfavorable for user maintenance equipment.
In view of this, the application provides tactful Compilation Method, device, electronic equipment and computer storage medium, to the greatest extent may be used
It can solve and only just manually adjust leaf node when discovery strategy compiles time-consuming and occupancy a large amount of memories in the prior art
The regular number of maximum caused by strategy compiling low efficiency the problem of.
Specifically, the application is achieved by the following technical solution:
A kind of strategy Compilation Method, comprising:
Obtain the regular number of maximum of at least one of maximum memory value and maximum node number and leaf node；
It is compiled according to the regular several pairs of strategies of the maximum of the leaf node, in compilation process, if current Shen
Memory please is greater than or equal to the maximum memory value and/or the number of nodes currently split out is greater than or equal to the maximum section
Points stop compiling；
Modify the regular number of maximum of leaf node；
Strategy is compiled again according to the regular number of the maximum of the modified leaf node.
Optionally, the method also includes:
If the memory currently applied is less than the maximum memory value and the number of nodes currently split out is less than institute
Maximum node number is stated, continues to compile, until compiling is completed.
Optionally, the method also includes:
After stopping compiling, the data that are generated in compilation process before release.
Optionally, the regular number of maximum of the modification leaf node includes: that the regular number of the maximum of leaf node is increased by 2
Multiple.
Optionally, the regular number of the maximum of the leaf node of acquisition is the leaf finally used when compiling successfully the last time
The regular number of the maximum of node.
A kind of strategy compilation device, comprising:
Acquiring unit, for obtaining the maximum of at least one of maximum memory value and maximum node number and leaf node
Regular number；
Compilation unit is compiled for the regular several pairs of strategies of maximum according to the leaf node, in compilation process,
If the number of nodes that the memory currently applied is greater than or equal to the maximum memory value and/or has currently split out is greater than or waits
In the maximum node number, stop compiling；
Unit is modified, the regular number of the maximum for modifying leaf node；
The compilation unit is also used to, and is carried out again to strategy according to the regular number of the maximum of the modified leaf node
Compiling.
Optionally, the compilation unit is also used to, if currently the memory applied be less than the maximum memory value and
The number of nodes currently split out is less than the maximum node number, continues to compile, until compiling is completed.
Optionally, described device further include:
Releasing unit, the data for being generated in compilation process before release after stopping compiling.
Optionally, the modification unit is further used for, and the regular number of the maximum of leaf node is increased to 2 multiple.
Optionally, the regular number of the maximum of the leaf node of acquisition is the leaf finally used when compiling successfully the last time
The regular number of the maximum of node.
A kind of electronic equipment, the electronic equipment include:
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors, so that one or more of processing
Device realizes tactful Compilation Method above-mentioned.
A kind of computer readable storage medium, is stored thereon with computer program, realization when which is executed by processor
Strategy Compilation Method above-mentioned.
By the above technical solution provided by the present application as it can be seen that in compilation process, by the practical situation of detection memory and
The number of nodes split out determines whether this compiling is time-consuming and occupies a large amount of memories, and determines to exit volume according to testing result
Translate, then by adjusting leaf node the regular number of maximum and recompilate that compiling is time-consuming and EMS memory occupation to reduce.
Detailed description of the invention
Fig. 1 is that the network architecture of the network terminal in the related technology and server progress network communication shown in the application is illustrated
Figure；
Fig. 2 is a kind of flow chart of tactful Compilation Method shown in the application；
Fig. 3 is a kind of structural block diagram of tactful compilation device shown in the application；
Fig. 4 is the structural block diagram of the tactful compilation device of another kind shown in the application；
Fig. 5 is the structural block diagram of a kind of electronic equipment shown in the application；
Fig. 6 is the structural schematic diagram for realizing the computer system according to the tactful Compilation Method shown in the application.
Specific embodiment
Example embodiments are described in detail here, and the example is illustrated in the accompanying drawings.Following description is related to
When attached drawing, unless otherwise indicated, the same numbers in different drawings indicate the same or similar elements.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistent with the application.On the contrary, they be only with it is such as appended
The example of the consistent device and method of some aspects be described in detail in claims, the application.
It is only to be not intended to be limiting the application merely for for the purpose of describing particular embodiments in term used in this application.
It is also intended in the application and the "an" of singular used in the attached claims, " described " and "the" including majority
Form, unless the context clearly indicates other meaning.It is also understood that term "and/or" used herein refers to and wraps
It may be combined containing one or more associated any or all of project listed.
It will be appreciated that though various information, but this may be described using term first, second, third, etc. in the application
A little information should not necessarily be limited by these terms.These terms are only used to for same type of information being distinguished from each other out.For example, not departing from
In the case where the application range, the first information can also be referred to as the second information, and similarly, the second information can also be referred to as
One information.Depending on context, word as used in this " if " can be construed to " ... when " or " when ...
When " or " in response to determination ".
It referring to Figure 1, is the net of the network terminal in the related technology and server progress network communication shown in the application
Network configuration diagram.It include the network terminal and server in the network architecture.For example, the network terminal sends DHCP to server
After (Dynamic Host Configuration Protocol, dynamic host configuration protocol) request message, pass through server point
The IP address matched is established with server and is connected to the network.After establishment of the network connection, the network terminal to server by sending
HTTP (HyperText Transfer Protocol, hypertext transfer protocol) message carrys out the Internet resources on request server.
In addition, server handles the message received according to the security strategy of user configuration.
The requested number of certain strategy entries of server can be very much, usually as unit of ten thousand, and according to priority
There are also sequence requirements for sequence.If corresponding tactful item is successively found from the strategy entries of tens of thousands of meters according to priority orders
Mesh, under search efficiency is very low.In this case, in order to improve search efficiency, it will usually which being compiled into strategy can be quick
Find a kind of corresponding first tactful tree structure.
Decision Tree algorithms use didactic range lookup strategy.Decision Tree algorithms choose optimal equinox every time,
With by the point and perpendicular to the plane of reference axis by search space two minutes.Since regular collection is also classified into two after dividing every time
Rules subset, then section two is divided to and is only handled respectively two rules subsets next time, therefore practical interval number by
Grade reduces.Further, since each node of decision Tree algorithms only needs to save an equinox using binary chop, and therefore, section
Point size has obtained effective control, and data structure is relatively easy.Based on this, the data structure of algorithm is multiple domain binary chop tree,
Each node selection equinox carries out two points to the projection section that current rule set closes, and final matched rule are stored on each node
Then subset.
In compilation process, according to Fundamentals of Compiling, rule can be split according to recursive mode, until on each node
Until regular number is both less than the regular number of maximum of leaf node.So every fractionation once can all be become three sections from a node
Point, one of them is comparison node, also referred to as intermediate node, other two nodes separately include a part of rule, the two
The union of the rule of node is the rule of the node before splitting.Therefore, compilation process is that a fractionation rule and node increase
The process added.Along with the increase of node, memory is used and is also increase accordingly.
And compilation process and the factor of compiling result are influenced other than the process flow of algorithm oneself itself, also with compiling
Relating to parameters, for example, the regular number of the maximum of leaf node.This numerical value itself is to be arranged by user according to the actual conditions of strategy
, when maximum rule number is smaller, matching efficiency is very high, but the number for splitting rule is more, and the node for splitting generation is more, compiles
Translating the time can be longer, and EMS memory occupation is also more；When maximum rule is larger, the number for splitting rule is less, splits the section of generation
Point is less, and compilation time can be shorter, and EMS memory occupation is also less, but matching efficiency can be poor.Therefore, in addition to optimization algorithm itself
Outside, according to the regular number of maximum of actual rule adjust automatically leaf node can largely the efficiency of co mpiler optimization process and
Compile result.For example, the regular number of maximum on leaf node is turned down, if necessary if necessary to high-performance (high matching degree)
It reduces compilation time and reduces the occupancy of memory, then tune up the regular number of maximum on leaf node.
The application provides a kind of tactful Compilation Method, according to the practical occupancy of memory and can tear open in compilation process
At least one of the number of nodes generated after point, the regular number of the maximum of adjust automatically leaf node, such as, if it is desired in reduction
Occupancy, the reduction compilation time deposited, the regular number of the maximum of leaf node is tuned up.
Fig. 2 is referred to, Fig. 2 is a kind of flow chart of tactful Compilation Method shown in the application.This method can for example answer
For server shown in FIG. 1, method includes the following steps:
Step 201: obtaining the maximum rule of at least one of maximum memory value and maximum node number and leaf node
Number.
Maximum memory value can determine that e.g., device memory is sufficient, then this value can be fitted by the memory value of equipment itself
Work as expansion, to provide matching efficiency, if device memory residue is not very much, this value can suitably reduce, and suitably subtract with this
Few EMS memory occupation.Maximum node number is determined according to the memory of equipment itself, and the memory of equipment itself is bigger, is supported most
Big number of nodes is bigger.
The regular number of maximum of leaf node can also obtain according to the service condition empirical value of equipment, and using this value as
The parameter value of secondary compiling, starting compiling.
Step 202: being compiled according to the regular several pairs of strategies of the maximum of leaf node；
Step 203: in compilation process, the memory that judgement has currently been applied is greater than or equal to maximum memory value, and/or,
The number of nodes currently split out is greater than or equal to maximum node number, if so, step 204 is jumped to, if not, jumping to step
205。
Step 204: stopping compiling, modify the regular number of maximum of leaf node, return step 202.
Since compilation process is fractionation rule and the increased process of node, with the progress of compiling, node
It is continuously increased, along with the increase of node, memory is used and also increase accordingly.If the memory applied is more than maximum memory
Value, and/or, if the number of nodes split out is more than maximum node number, in order to avoid compilation time is too long, committed memory mistake
Greatly, stop compiling, and the regular number of the maximum for remodifying leaf node, increase on the basis of the maximum of original leaf node regular number
Maximum regular number is added e.g. to increase by 2 multiple.Then step 202 is returned to be compiled.
For the memory of release busy, after stopping compiling, generated data in compilation process before can also discharging.
Step 205: continuing to compile, until compiling successfully.
It should be understood that the 202-204 in above-mentioned steps can be the process of a reciprocation cycle, successfully it is until compiling
Only, in each circulation, the regular number of maximum of modification leaf node is required, one stepping can be set for each modification
Value, modifying each time all is to increase the step value on the basis of existing maximum regular number, which can be set to arbitrarily
Value, for example, it may be 2 multiple.
After compiling successfully, the regular number of maximum of currently used leaf node is recorded, using as initial when compiling next time
Leaf node the regular number of maximum, reduced with this because of compiling failure and a possibility that repeatedly attempt due to increases compilation time.
Regular item number when compiling is less than this maximum regular number next time when, then the regular number of the maximum of initial leaf node is set as
1/2 (but minimum value is 3) of regular item number, to guarantee that result is best after compiling.
In addition, can recorde the time that compiling starts when compilation process starts, this time not only can be used as primary volume
The time of beginning is translated, can also be subsequently used for calculating the duration once compiled.That is, the time of compiling beginning for the first time and second
Compile the time interval started, so that it may be considered the duration compiled for the first time.
By the above technical solution provided by the present application as it can be seen that in compilation process, by the practical situation of detection memory and
The number of nodes split out determines whether this compiling is time-consuming and occupies a large amount of memories, and determines to exit volume according to testing result
Translate, then by adjusting leaf node the regular number of maximum and recompilate that compiling is time-consuming and EMS memory occupation to reduce.
Referring to FIG. 3, Fig. 3 is a kind of structural block diagram of tactful compilation device shown in the application, it is applied to shown in FIG. 1
Server side, the device include: acquiring unit 310, compilation unit 320 and modification unit 330.
Acquiring unit 310, for obtaining at least one of maximum memory value and maximum node number and leaf node
Maximum rule number；
Compilation unit 320 is compiled, in compilation process for the regular several pairs of strategies of maximum according to the leaf node
In, if the memory currently applied is greater than or equal to the maximum memory value, and/or, if the node currently split out
Number is greater than or equal to the maximum node number, stops compiling；
Unit 330 is modified, the regular number of the maximum for modifying leaf node；
The compilation unit 320 is also used to, according to the regular number of the maximum of the modified leaf node again to strategy
It is compiled.
In a kind of optional embodiment, compilation unit 320 is also used to, if currently the memory applied be less than it is described most
Big memory value and the number of nodes currently split out are less than the maximum node number, continue to compile, until compiling is completed.
Another structural block diagram that please participate in tactful compilation device shown in Fig. 4, in another embodiment, the dress
Setting further includes releasing unit, the data for being generated in compilation process after stopping compiling before release.
In another embodiment, modification unit 330 is further used for, and the regular number of the maximum of leaf node is increased
2 multiple.
In another embodiment, the regular number of the maximum of the leaf node of acquisition is when compiling successfully the last time
The regular number of the maximum of the leaf node finally used.
By the above technical solution provided by the present application as it can be seen that in compilation process, by the practical situation of detection memory and
The number of nodes split out determines whether this compiling is time-consuming and occupies a large amount of memories, and determines to exit volume according to testing result
Translate, then by adjusting leaf node the regular number of maximum and recompilate that compiling is time-consuming and EMS memory occupation to reduce.
For device embodiment, since it corresponds essentially to embodiment of the method, so related place is referring to method reality
Apply the part explanation of example.The apparatus embodiments described above are merely exemplary, wherein described be used as separation unit
The unit of explanation may or may not be physically separated, and component shown as a unit can be or can also be with
It is not physical unit, it can it is in one place, or may be distributed over multiple network units.It can be according to actual
The purpose for needing to select some or all of the modules therein to realize application scheme.Those of ordinary skill in the art are not paying
Out in the case where creative work, it can understand and implement.
Referring to FIG. 5, Fig. 5 is the structural block diagram of a kind of electronic equipment shown in the application, as shown in figure 5, the electronics
Equipment 500 includes processor 501 and memory 502；Wherein,
The memory 502 is for storing one or more computer instruction, wherein one or more computer refers to
It enables and being executed by the processor 501 to realize all or part of the steps in aforementioned approaches method step.
Fig. 6 is the structural schematic diagram for realizing the computer system according to the tactful Compilation Method shown in the application.
As shown in fig. 6, computer system 600 includes central processing unit (CPU) 601, it can be read-only according to being stored in
Program in memory (ROM) 602 or be loaded into the program in random access storage device (RAM) 603 from storage section 608 and
Execute the various processing in above-mentioned embodiment shown in Fig. 2.In RAM603, be also stored with system 600 operate it is required each
Kind program and data.CPU601, ROM602 and RAM603 are connected with each other by bus 604.Input/output (I/O) interface 605
It is also connected to bus 604.
I/O interface 605 is connected to lower component: the importation 606 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 607 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 608 including hard disk etc.；
And the communications portion 609 of the network interface card including LAN card, modem etc..Communications portion 609 via such as because
The network of spy's net executes communication process.Driver 610 is also connected to I/O interface 605 as needed.Detachable media 611, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 610, in order to read from thereon
Computer program be mounted into storage section 608 as needed.
Particularly, according to presently filed embodiment, it is soft to may be implemented as computer above with reference to Fig. 2 method described
Part program.For example, presently filed embodiment includes a kind of computer program product comprising be tangibly embodied in and its readable
Computer program on medium, the computer program include the program code for executing aforementioned tactful Compilation Method.At this
In the embodiment of sample, which can be downloaded and installed from network by communications portion 609, and/or from can
Medium 611 is dismantled to be mounted.
Flow chart and block diagram in attached drawing illustrate system, method and computer according to the various embodiments of the application
The architecture, function and operation in the cards of program product.In this regard, each box in course diagram or block diagram can be with
A part of a module, section or code is represented, a part of the module, section or code includes one or more
Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box
The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical
On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants
It is noted that the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, Ke Yiyong
The dedicated hardware based system of defined functions or operations is executed to realize, or can be referred to specialized hardware and computer
The combination of order is realized.
Being described in unit or module involved in the application embodiment can be realized by way of software, can also
It is realized in a manner of through hardware.Described unit or module also can be set in the processor, these units or module
Title do not constitute the restriction to the unit or module itself under certain conditions.
As on the other hand, present invention also provides a kind of computer readable storage medium, the computer-readable storage mediums
Matter can be computer readable storage medium included in device described in above embodiment；It is also possible to individualism,
Without the computer readable storage medium in supplying equipment.Computer-readable recording medium storage has one or more than one journey
Sequence, described program is used to execute by one or more than one processor is described in the present processes.
The foregoing is merely the preferred embodiments of the application, not to limit the application, all essences in the application
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the application protection.
Claims (12)
1. a kind of strategy Compilation Method characterized by comprising
Obtain the regular number of maximum of at least one of maximum memory value and maximum node number and leaf node；
It is compiled according to the regular several pairs of strategies of the maximum of the leaf node, in compilation process, if currently applied
Memory is greater than or equal to the maximum memory value, and/or, if the number of nodes currently split out is greater than or equal to the maximum
Number of nodes stops compiling；
Modify the regular number of maximum of leaf node；
Strategy is compiled again according to the regular number of the maximum of the modified leaf node.
2. the method according to claim 1, wherein the method also includes:
If currently the memory applied be less than the maximum memory value and the number of nodes currently split out be less than it is described most
Big number of nodes continues to compile, until compiling is completed.
3. the method according to claim 1, wherein the method also includes:
After stopping compiling, the data that are generated in compilation process before release.
4. method according to any one of claim 1-3, which is characterized in that the maximum rule of the modification leaf node
Number includes: the multiple that the regular number of the maximum of leaf node is increased to 2.
5. method according to any one of claim 1-3, which is characterized in that the maximum rule of the leaf node of acquisition
The regular number of the maximum of the leaf node finally used when then number compiles successfully for the last time.
6. a kind of strategy compilation device characterized by comprising
Acquiring unit, for obtaining the maximum rule of at least one of maximum memory value and maximum node number and leaf node
Number；
Compilation unit is compiled for the regular several pairs of strategies of maximum according to the leaf node, in compilation process, if
Currently the memory applied is greater than or equal to the maximum memory value, and/or, if the number of nodes currently split out be greater than or
Equal to the maximum node number, stop compiling；
Unit is modified, the regular number of the maximum for modifying leaf node；
The compilation unit is also used to, and is compiled again to strategy according to the regular number of the maximum of the modified leaf node
It translates.
7. device according to claim 6, which is characterized in that
The compilation unit is also used to, if the memory currently applied is less than the maximum memory value and has currently split out
Number of nodes be less than the maximum node number, continue to compile, until compiling complete.
8. device according to claim 6, which is characterized in that described device further include:
Releasing unit, the data for being generated in compilation process before release after stopping compiling.
9. device a method according to any one of claims 6-8, which is characterized in that the modification unit is further used for, will
The regular number of the maximum of leaf node increases by 2 multiple.
10. device a method according to any one of claims 6-8, which is characterized in that the maximum of the leaf node of acquisition
Regular number is the regular number of maximum of the leaf node finally used when compiling successfully the last time.
11. a kind of electronic equipment, which is characterized in that the electronic equipment includes:
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors, so that one or more of processors are real
The now tactful Compilation Method as described in any one of claims 1 to 5.
12. a kind of computer storage medium, which is characterized in that be stored thereon with computer program, which is characterized in that the program quilt
The tactful Compilation Method as described in any one of claims 1 to 5 is realized when processor executes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385453.5A CN109542601B (en) | 2018-11-20 | 2018-11-20 | Policy compiling method and device, electronic equipment and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385453.5A CN109542601B (en) | 2018-11-20 | 2018-11-20 | Policy compiling method and device, electronic equipment and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109542601A true CN109542601A (en) | 2019-03-29 |
| CN109542601B CN109542601B (en) | 2020-12-29 |
Family
ID=65848726
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811385453.5A Active CN109542601B (en) | 2018-11-20 | 2018-11-20 | Policy compiling method and device, electronic equipment and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109542601B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1992674A (en) * | 2005-12-31 | 2007-07-04 | 华为技术有限公司 | Method of multi-dimensional Packet Classification based on muti-bit segmentation |
| CN102281196A (en) * | 2011-08-11 | 2011-12-14 | 中兴通讯股份有限公司 | Decision tree generating method and equipment, decision-tree-based message classification method and equipment |
| CN102902734A (en) * | 2012-09-12 | 2013-01-30 | 北京伸得纬科技有限公司 | Method and system for catalogue storage and mapping |
| US20130060727A1 (en) * | 2011-08-02 | 2013-03-07 | Cavium, Inc. | Identifying Duplication in Decision Trees |
| CN105306439A (en) * | 2015-09-17 | 2016-02-03 | 哈尔滨工程大学 | Feature rule detection method based on decision tree self-repairing |
| CN105354588A (en) * | 2015-09-28 | 2016-02-24 | 北京邮电大学 | Decision tree construction method |
| CN106453387A (en) * | 2016-07-28 | 2017-02-22 | 电子科技大学 | Security strategy conflict detecting and eliminating method based on Hicuts algorithm |
-
2018
- 2018-11-20 CN CN201811385453.5A patent/CN109542601B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1992674A (en) * | 2005-12-31 | 2007-07-04 | 华为技术有限公司 | Method of multi-dimensional Packet Classification based on muti-bit segmentation |
| US20130060727A1 (en) * | 2011-08-02 | 2013-03-07 | Cavium, Inc. | Identifying Duplication in Decision Trees |
| CN102281196A (en) * | 2011-08-11 | 2011-12-14 | 中兴通讯股份有限公司 | Decision tree generating method and equipment, decision-tree-based message classification method and equipment |
| CN102902734A (en) * | 2012-09-12 | 2013-01-30 | 北京伸得纬科技有限公司 | Method and system for catalogue storage and mapping |
| CN105306439A (en) * | 2015-09-17 | 2016-02-03 | 哈尔滨工程大学 | Feature rule detection method based on decision tree self-repairing |
| CN105354588A (en) * | 2015-09-28 | 2016-02-24 | 北京邮电大学 | Decision tree construction method |
| CN106453387A (en) * | 2016-07-28 | 2017-02-22 | 电子科技大学 | Security strategy conflict detecting and eliminating method based on Hicuts algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109542601B (en) | 2020-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110413294B (en) | Service release system, method, device and equipment | |
| US10402746B2 (en) | Computing instance launch time | |
| EP3667500B1 (en) | Using a container orchestration service for dynamic routing | |
| US9529699B2 (en) | System and method for test data generation and optimization for data driven testing | |
| US10204033B2 (en) | Method and system for semantic test suite reduction | |
| US20220147879A1 (en) | System and method for labeling machine learning inputs | |
| CN108848092A (en) | The processing method and processing device of micro services gray scale publication based on call chain | |
| US9864749B2 (en) | Methods for provisioning workloads in a storage system using machine learning and devices thereof | |
| US20170344910A1 (en) | Continuously provisioning large-scale machine learning models | |
| CN110276074B (en) | Distributed training method, device, equipment and storage medium for natural language processing | |
| US20170024396A1 (en) | Determining application deployment recommendations | |
| CN109861842A (en) | O&M method, apparatus, electronic equipment and the storage medium of server cluster | |
| WO2016040699A1 (en) | Computing instance launch time | |
| US10621651B2 (en) | Automatic recharge system and method, and server | |
| US8694580B2 (en) | Information processing apparatus, server selecting method and recording medium | |
| CN110249312B (en) | Method and system for converting data integration jobs from a source framework to a target framework | |
| CN108241531A (en) | A kind of method and apparatus for distributing resource for virtual machine in the cluster | |
| CN110417903A (en) | A kind of information processing method and system based on cloud computing | |
| CN109408761A (en) | A kind of filter method of repetitive requests, system, equipment and storage medium | |
| CN113641591A (en) | Test case generation method and device and test method and device | |
| CN115168162A (en) | Multi-gray-scale issuing method and device based on ingress controller in container environment and storage medium | |
| WO2022105662A1 (en) | Topology-driven completion of chemical data | |
| CN108037984A (en) | Method for managing resource, system and the readable storage medium storing program for executing of data analysis | |
| US20210397646A1 (en) | Method, electronic device, and storage medium for processing visual data of deep model | |
| CN110417777A (en) | A kind of method and device communicated between micro services of optimization |
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 |