CN109542601B - Policy compiling method and device, electronic equipment and computer storage medium - Google Patents
Policy compiling method and device, electronic equipment and computer storage medium Download PDFInfo
- Publication number
- CN109542601B CN109542601B CN201811385453.5A CN201811385453A CN109542601B CN 109542601 B CN109542601 B CN 109542601B CN 201811385453 A CN201811385453 A CN 201811385453A CN 109542601 B CN109542601 B CN 109542601B
- Authority
- CN
- China
- Prior art keywords
- maximum
- compiling
- memory
- node
- nodes
- 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
- 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
Abstract
The embodiment of the present application provides a policy compiling method, including: acquiring at least one of a maximum memory value and a maximum node number and a maximum rule number of leaf nodes; compiling the strategies according to the maximum rule number of the leaf nodes, and stopping compiling if the currently applied memory is larger than or equal to the maximum memory value and/or if the currently split node number is larger than or equal to the maximum node number in the compiling process; modifying the maximum rule number of the leaf nodes; and compiling the strategy again according to the modified maximum rule number of the leaf nodes. According to the embodiment of the application, the problem that the policy compiling efficiency is low due to the fact that the maximum rule number of the leaf nodes is manually adjusted only when the fact that the policy compiling is time-consuming and occupies a large amount of memory in the prior art can be solved as far as possible. The embodiment of the application also provides a strategy compiling device, electronic equipment and a computer storage medium.
Description
Technical Field
The present application relates to the field of network security, and in particular, to a policy compiling method and apparatus, an electronic device, and a computer storage medium.
Background
And the safety equipment processes the received message according to the safety strategy configured by the user. User-configured security policies are numerous, typically up to tens of thousands. And when the safety equipment is matched according to the safety strategy, the safety strategy with the front position is preferentially matched based on the priority of the safety strategy.
Disclosure of Invention
The required number of certain policy entries for a security device will be many, usually in tens of thousands, and there will be order requirements in the ordering according to priority. If the corresponding strategy items are searched from tens of thousands of strategy items in sequence according to the priority order, the searching efficiency is very low. In this case, to improve the search efficiency, the policies are usually compiled into a tree structure in which the corresponding first policy can be found quickly.
However, the inventor of the present application has found in research that policy compilation under certain conditions (e.g., when the configuration of a policy in two or more dimensions is discrete and the number of rules is large) is time-consuming and consumes a large amount of memory, so that the modified policy cannot be timely validated. To alleviate this problem, the maximum rule number of leaf nodes at compile time is usually adjusted manually, so that the number of splitting rules can be adjusted to speed up matching or compiling. However, manual adjustment can only be implemented after the problem is found, which affects the strategy compiling efficiency and is not beneficial for the user to maintain the equipment.
In view of this, the present application provides a policy compiling method, a policy compiling apparatus, an electronic device, and a computer storage medium, so as to solve the problem in the prior art that the policy compiling efficiency is low because the maximum rule number of the leaf node is manually adjusted only when the time consumption of the policy compiling is found and a large amount of memory is occupied.
Specifically, the method is realized through the following technical scheme:
a policy compilation method comprising:
acquiring at least one of a maximum memory value and a maximum node number and a maximum rule number of leaf nodes;
compiling the strategies according to the maximum rule number of the leaf nodes, and stopping compiling if the currently applied memory is larger than or equal to the maximum memory value and/or the currently split node number is larger than or equal to the maximum node number in the compiling process;
modifying the maximum rule number of the leaf nodes;
and compiling the strategy again according to the modified maximum rule number of the leaf nodes.
Optionally, the method further includes:
and if the currently applied memory is smaller than the maximum memory value and the number of the currently split nodes is smaller than the maximum number of the nodes, continuing compiling until the compiling is completed.
Optionally, the method further includes:
after stopping compiling, the data generated in the previous compiling process is released.
Optionally, the modifying the maximum rule number of the leaf node includes: the maximum rule number for a leaf node is increased by a factor of 2.
Optionally, the obtained maximum rule number of the leaf node is the maximum rule number of the leaf node used last time when the compiling was successful.
A policy compiling apparatus comprising:
the acquiring unit is used for acquiring at least one of a maximum memory value and a maximum node number and a maximum rule number of the leaf nodes;
the compiling unit is used for compiling the strategies according to the maximum rule number of the leaf nodes, and in the compiling process, if the currently applied memory is larger than or equal to the maximum memory value and/or the currently split node number is larger than or equal to the maximum node number, the compiling is stopped;
a modification unit for modifying the maximum rule number of the leaf node;
and the compiling unit is also used for compiling the strategy again according to the modified maximum rule number of the leaf node.
Optionally, the compiling unit is further configured to continue compiling until compiling is completed if the currently applied memory is smaller than the maximum memory value and the number of the currently split nodes is smaller than the maximum number of the nodes.
Optionally, the apparatus further comprises:
and the releasing unit is used for releasing the data generated in the previous compiling process after the compiling is stopped.
Optionally, the modifying unit is further configured to increase the maximum rule number of the leaf node by a multiple of 2.
Optionally, the obtained maximum rule number of the leaf node is the maximum rule number of the leaf node used last time when the compiling was successful.
An electronic device, the electronic device comprising:
one or more processors;
a memory for storing one or more programs;
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the aforementioned policy compilation method.
A computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the aforementioned policy compilation method.
According to the technical scheme provided by the application, in the compiling process, whether the compiling is time-consuming and occupies a large amount of memory is determined by detecting the practical condition of the memory and the number of split nodes, the compiling is determined to quit according to the detection result, and the compiling time-consuming and the memory occupying are reduced by adjusting the maximum rule number of the leaf nodes and recompiling.
Drawings
Fig. 1 is a schematic diagram of a network architecture of a network terminal and a server in network communication in the related art shown in the present application;
FIG. 2 is a flow chart of a policy compilation method shown in the present application;
fig. 3 is a block diagram illustrating a policy compiling apparatus according to the present application;
fig. 4 is a block diagram illustrating a structure of another policy compiling apparatus according to the present application;
FIG. 5 is a block diagram of an electronic device shown in the present application;
fig. 6 is a schematic structural diagram of a computer system for implementing the policy compiling method according to the present application.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
Please refer to fig. 1, which is a schematic diagram of a network architecture for network communication between a network terminal and a server in the related art. The network architecture comprises a network terminal and a server. For example, after sending a DHCP (Dynamic Host Configuration Protocol) request message to the server, the network terminal establishes a network connection with the server through an IP address allocated by the server. After establishing a network connection, the network terminal requests a network resource on the server by transmitting an HTTP (HyperText Transfer Protocol) message to the server. In addition, the server processes the received message according to the security policy configured by the user.
The required number of certain policy entries for a server will be many, usually in tens of thousands, and there will be order requirements in the ordering according to priority. If the corresponding strategy items are searched from tens of thousands of strategy items in sequence according to the priority order, the searching efficiency is very low. In this case, to improve the search efficiency, the policies are usually compiled into a tree structure in which the corresponding first policy can be found quickly.
The decision tree algorithm employs a heuristic interval search strategy. The decision tree algorithm selects the optimal binary point each time, so that a plane passing through the point and perpendicular to the coordinate axes divides the search space into two. Since the rule set is divided into two rule subsets after each division, only the two rule subsets are respectively processed in the next interval halving process, and therefore the actual interval number is reduced step by step. In addition, because binary search is used, each node of the decision tree algorithm only needs to store one binary point, so that the size of the node is effectively controlled, and the data structure is relatively simple. Based on the method, the data structure of the algorithm is a multi-domain binary search tree, each node selects a binary point to divide the projection interval of the current rule set into two, and a finally matched rule subset is stored in each node.
In the compiling process, according to the compiling principle, the rules are split in a recursive mode until the number of the rules on each node is smaller than the maximum rule number of the leaf nodes. Therefore, each splitting is performed, one node is changed into three nodes, one of the three nodes is a comparison node, which is also called an intermediate node, the other two nodes respectively contain a part of rules, and the union of the rules of the two nodes is the rule of the node before the splitting. Therefore, the compiling process is a process of splitting rules and node addition. Along with the increase of nodes, the use of the memory is correspondingly increased.
Factors influencing the compiling process and the compiling result are related to compiling parameters, such as the maximum rule number of leaf nodes, besides the own processing flow of the algorithm. The number is set by a user according to the actual situation of the strategy, when the maximum rule number is smaller, the matching efficiency is very high, but the times of splitting the rule are more, nodes generated by splitting are more, the compiling time is longer, and the memory occupation is more; when the maximum rule is larger, the number of times of splitting the rule is less, nodes generated by splitting are fewer, the compiling time is shorter, the memory occupation is less, and the matching efficiency is poorer. Therefore, in addition to the optimization algorithm, the efficiency of the compiling process and the compiling result can be optimized to a great extent by automatically adjusting the maximum rule number of the leaf nodes according to the actual rules. For example, if high performance (high matching degree) is required, the maximum rule number on the leaf node is adjusted to be small, and if the compiling time and the memory occupation are required to be reduced, the maximum rule number on the leaf node is adjusted to be large.
The application provides a strategy compiling method, which can automatically adjust the maximum rule number of leaf nodes according to at least one of the actual occupation of a memory and the node number generated after splitting in the compiling process, for example, if the occupation of the memory and the compiling time are required to be reduced, the maximum rule number of the leaf nodes is increased.
Referring to fig. 2, fig. 2 is a flowchart illustrating a policy compiling method according to the present application. The method can be applied to a server shown in fig. 1, for example, and includes the following steps:
step 201: and acquiring at least one of the maximum memory value and the maximum node number and the maximum rule number of the leaf nodes.
The maximum memory value may be determined by the memory value of the device itself, which may be appropriately expanded to provide matching efficiency if the device memory is sufficient, or reduced if the device memory is not so much remaining, thereby appropriately reducing memory usage. The maximum node number is determined according to the memory of the device, and the larger the memory of the device is, the larger the maximum node number supported by the device is.
The maximum rule number of the leaf node can also be obtained according to the experience value of the service condition of the equipment, and the value is used as the parameter value of the compiling at this time to start the compiling.
Step 202: compiling the strategies according to the maximum rule number of the leaf nodes;
step 203: in the compiling process, judging that the currently applied memory is greater than or equal to the maximum memory value, and/or the number of the currently split nodes is greater than or equal to the maximum number of the nodes, if so, jumping to a step 204, and if not, jumping to a step 205.
Step 204: the compilation is stopped, the maximum rule number of the leaf node is modified, and the process returns to the step 202.
Because the compiling process is a process of splitting rules and node addition, nodes are continuously added along with the compiling process, and the memory use is correspondingly increased along with the node addition. If the applied memory exceeds the maximum memory value and/or if the number of the split nodes exceeds the maximum number of the nodes, in order to avoid that the compiling time is too long and the memory is too large, the compiling is stopped, the maximum rule number of the leaf nodes is re-modified, and the maximum rule number is increased on the basis of the original maximum rule number of the leaf nodes, for example, by a multiple of 2. And then returns to step 202 for compilation.
In order to release the occupied memory, after the compiling is stopped, the data generated in the previous compiling process can be released.
Step 205: and continuing to compile until compiling is successful.
It is understood that 202-204 of the above steps may be a round-robin process, until compiling is successful, the maximum rule number of the leaf node needs to be modified in each loop, a step value may be set for each modification, each modification is to increase the step value based on the existing maximum rule number, and the step value may be set to an arbitrary value, for example, may be a multiple of 2.
After compiling is successful, the maximum rule number of the currently used leaf node is recorded to be used as the maximum rule number of the initial leaf node at the next compiling, so that the possibility of increasing compiling time due to compiling failure and multiple attempts is reduced. When the number of rules at the next compilation is less than the maximum number of rules, the maximum number of rules of the initial leaf node is set to 1/2 (but the minimum value is 3) of the number of rules to ensure the best result after compilation.
In addition, the compiling starting time can be recorded when the compiling process starts, and the time can be used as the compiling starting time for one time and can also be used for calculating the compiling time length for one time later. That is, the time interval between the first compilation start and the second compilation start may be considered as the time duration of the first compilation.
According to the technical scheme provided by the application, in the compiling process, whether the compiling is time-consuming and occupies a large amount of memory is determined by detecting the practical condition of the memory and the number of split nodes, the compiling is determined to quit according to the detection result, and the compiling time-consuming and the memory occupying are reduced by adjusting the maximum rule number of the leaf nodes and recompiling.
Referring to fig. 3, fig. 3 is a block diagram of a policy compiling apparatus shown in the present application, applied to the server side shown in fig. 1, where the apparatus includes: an acquisition unit 310, a compiling unit 320, and a modifying unit 330.
An obtaining unit 310, configured to obtain at least one of a maximum memory value and a maximum node number, and a maximum rule number of a leaf node;
a compiling unit 320, configured to compile the policy according to the maximum rule number of the leaf node, and in the compiling process, if the currently applied memory is greater than or equal to the maximum memory value, and/or if the number of currently split nodes is greater than or equal to the maximum node number, stop compiling;
a modifying unit 330, configured to modify the maximum rule number of the leaf node;
the compiling unit 320 is further configured to recompile the policy according to the modified maximum rule number of the leaf node.
In an optional embodiment, the compiling unit 320 is further configured to continue compiling until compiling is completed, if the currently applied memory is smaller than the maximum memory value and the number of currently split nodes is smaller than the maximum number of nodes.
Referring to another structural block diagram of the policy compiling apparatus shown in fig. 4, in another possible embodiment, the apparatus further includes a releasing unit, configured to release data generated in a previous compiling process after the compiling is stopped.
In another possible implementation, the modifying unit 330 is further configured to increase the maximum number of rules of the leaf node by a factor of 2.
In another embodiment, the maximum rule number of the leaf node obtained is the maximum rule number of the leaf node used last time the compiling was successful.
According to the technical scheme provided by the application, in the compiling process, whether the compiling is time-consuming and occupies a large amount of memory is determined by detecting the practical condition of the memory and the number of split nodes, the compiling is determined to quit according to the detection result, and the compiling time-consuming and the memory occupying are reduced by adjusting the maximum rule number of the leaf nodes and recompiling.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
Referring to fig. 5, fig. 5 is a block diagram illustrating a structure of an electronic device according to the present application, and as shown in fig. 5, the electronic device 500 includes a processor 501 and a memory 502; wherein the content of the first and second substances,
the memory 502 is used to store one or more computer instructions that are executed by the processor 501 to implement all or some of the method steps described above.
Fig. 6 is a schematic structural diagram of a computer system for implementing the policy compiling method according to the present application.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can execute various processes in the embodiment shown in fig. 2 described above according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the system 600 are also stored. The CPU601, ROM602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, according to embodiments of the present application, the method described above with reference to fig. 2 may be implemented as a computer software program. For example, embodiments of the present application include a computer program product comprising a computer program tangibly embodied on and readable medium thereof, the computer program comprising program code for performing the aforementioned policy compilation method. In such embodiments, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The units or modules described may also be provided in a processor, and the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
As another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus in the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described herein.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (12)
1. A method of policy compilation, comprising:
acquiring at least one of a maximum memory value and a maximum node number and a maximum rule number of leaf nodes; the maximum memory value and the maximum node number are determined according to the memory of the equipment;
compiling the strategies according to the maximum rule number of the leaf nodes, and stopping compiling if the currently applied memory is larger than or equal to the maximum memory value and/or if the currently split node number is larger than or equal to the maximum node number in the compiling process;
modifying the maximum rule number of the leaf nodes;
and compiling the strategy again according to the modified maximum rule number of the leaf nodes.
2. The method of claim 1, further comprising:
and if the currently applied memory is smaller than the maximum memory value and the number of the currently split nodes is smaller than the maximum number of the nodes, continuing compiling until the compiling is completed.
3. The method of claim 1, further comprising:
after stopping compiling, the data generated in the previous compiling process is released.
4. The method of any of claims 1-3, wherein modifying the maximum number of rules for a leaf node comprises: the maximum rule number for a leaf node is increased by a factor of 2.
5. The method according to any one of claims 1-3, wherein the obtained maximum rule number of the leaf node is the maximum rule number of the leaf node last used when the compilation was successful last time.
6. A policy compiling apparatus characterized by comprising:
the acquiring unit is used for acquiring at least one of a maximum memory value and a maximum node number and a maximum rule number of the leaf nodes; the maximum memory value and the maximum node number are determined according to the memory of the equipment;
the compiling unit is used for compiling the strategies according to the maximum rule number of the leaf nodes, and in the compiling process, if the currently applied memory is larger than or equal to the maximum memory value and/or if the number of the currently split nodes is larger than or equal to the maximum node number, the compiling is stopped;
a modification unit for modifying the maximum rule number of the leaf node;
and the compiling unit is also used for compiling the strategy again according to the modified maximum rule number of the leaf node.
7. The apparatus of claim 6,
and the compiling unit is further used for continuing compiling until compiling is completed if the currently applied memory is smaller than the maximum memory value and the number of the currently split nodes is smaller than the maximum number of the nodes.
8. The apparatus of claim 6, further comprising:
and the releasing unit is used for releasing the data generated in the previous compiling process after the compiling is stopped.
9. The apparatus according to any of claims 6-8, wherein the modifying unit is further configured to increase the maximum number of rules for a leaf node by a factor of 2.
10. The apparatus according to any of claims 6-8, wherein the obtained maximum rule number of the leaf node is the maximum rule number of the leaf node last used when the compilation was successful last time.
11. An electronic device, characterized in that the electronic device comprises:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the policy compilation method of any of claims 1-5.
12. A computer storage medium, having stored thereon a computer program, characterized in that the program, when executed by a processor, implements a policy compilation method according to any one of claims 1 to 5.
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 CN109542601A (en) | 2019-03-29 |
| CN109542601B true 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) |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1992674B (en) * | 2005-12-31 | 2010-05-12 | 华为技术有限公司 | Method of multi-dimensional packet classification based on muti-bit segmentation |
| WO2013019996A1 (en) * | 2011-08-02 | 2013-02-07 | Cavium, Inc. | Lookup front end input processor |
| CN102281196B (en) * | 2011-08-11 | 2017-10-10 | 中兴通讯股份有限公司 | Decision tree generation method and equipment, based on decision tree packet classification method and equipment |
| CN102902734A (en) * | 2012-09-12 | 2013-01-30 | 北京伸得纬科技有限公司 | Method and system for catalogue storage and mapping |
| CN105306439B (en) * | 2015-09-17 | 2019-04-19 | 哈尔滨工程大学 | A kind of characterization rules detection method based on decision tree selfreparing |
| CN105354588A (en) * | 2015-09-28 | 2016-02-24 | 北京邮电大学 | Decision tree construction method |
| CN106453387B (en) * | 2016-07-28 | 2019-08-13 | 电子科技大学 | Security strategy collision detection and removing method based on Hicuts algorithm |
-
2018
- 2018-11-20 CN CN201811385453.5A patent/CN109542601B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109542601A (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107590001B (en) | Load balancing method and device, storage medium and electronic equipment | |
| US20150363229A1 (en) | Resolving task dependencies in task queues for improved resource management | |
| US9699028B2 (en) | Method and device for updating client | |
| CN110113408B (en) | Block synchronization method, equipment and storage medium | |
| CN109388626B (en) | Method and apparatus for assigning numbers to services | |
| US11146660B2 (en) | Information packet download method for preventing high concurrency, electronic device and storage medium | |
| CN109726004B (en) | Data processing method and device | |
| CN110580188B (en) | Multithreading network allocation method and storage medium | |
| CN112416964A (en) | Data processing method, device and system, computer equipment and computer readable storage medium | |
| CN110888658B (en) | Method and device for dynamically changing function modules in application program and storage medium | |
| US11038783B2 (en) | Method and apparatus for managing network connection, and storage medium | |
| CN111371585A (en) | Configuration method and device for CDN node | |
| CN107347093B (en) | Configuration method and device for distributed server system | |
| CN114924851A (en) | Training task scheduling method and device, electronic equipment and storage medium | |
| US11360684B2 (en) | Data storage method and apparatus, storage medium and computer device | |
| CN109542601B (en) | Policy compiling method and device, electronic equipment and computer storage medium | |
| CN107045452B (en) | Virtual machine scheduling method and device | |
| CN109871260B (en) | Multi-dimensional service current limiting method and system based on shared memory between containers | |
| CN112328693A (en) | Block synchronization method, device and storage medium | |
| CN111338803A (en) | Thread processing method and device | |
| CN109962941B (en) | Communication method, device and server | |
| US10250515B2 (en) | Method and device for forwarding data messages | |
| US11122146B2 (en) | Information processing method, electronic device and computer program product | |
| CN112688980B (en) | Resource distribution method and device, and computer equipment | |
| CN112988391B (en) | Data processing method, device, equipment and storage medium |
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 |