CN111901311A - Firewall strategy searching method, system, terminal and storage medium based on space sequencing - Google Patents
Firewall strategy searching method, system, terminal and storage medium based on space sequencing Download PDFInfo
- Publication number
- CN111901311A CN111901311A CN202010641857.7A CN202010641857A CN111901311A CN 111901311 A CN111901311 A CN 111901311A CN 202010641857 A CN202010641857 A CN 202010641857A CN 111901311 A CN111901311 A CN 111901311A
- Authority
- CN
- China
- Prior art keywords
- policy
- strategy
- list
- searched
- port
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012163 sequencing technique Methods 0.000 title claims description 9
- 238000004364 calculation method Methods 0.000 claims abstract description 12
- 239000013598 vector Substances 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 13
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 abstract description 8
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
- H04L63/0227—Filtering policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
- H04L63/0227—Filtering policies
- H04L63/0263—Rule management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a firewall strategy searching method based on spatial sorting, compared with the prior art, the algorithm time complexity of the searching method is only O (N/2+ log)2N), the algorithm time complexity O (N) of the existing searching method is greatly reduced, and the calculation performance is obviously improved; the invention also discloses a searching system, which is used for realizing the searching method.
Description
Technical Field
The invention relates to the technical field of firewalls, in particular to a firewall policy search method, a firewall policy search system, a firewall policy search terminal and a storage medium based on spatial sorting.
Background
The existing firewall strategy searching method comprises the following steps: setting the existing strategy list on the firewall as P [0.. N-1], wherein N is the strategy number; setting a strategy to be searched as x; the target relationship of the search is assumed to be the inclusion relationship:
step 1: traversing the list P, taking the current strategy P [ i ], comparing the source address, the destination port and the protocol of the strategy x and the strategy P [ i ], judging the inclusion relation between the strategy x and the strategy P [ i ], and if the strategy P [ i ] contains x, storing the strategy P [ i ] in a result list R;
step 2: a list R is returned.
The time complexity of the algorithm of the searching method is O (N), and the time consumption is long.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a firewall policy search method based on spatial sorting to significantly reduce the time complexity of the algorithm, thereby significantly improving the computation performance.
The invention is realized in such a way, and the technical scheme adopted by the firewall strategy searching method based on the space sequencing provided by the invention is as follows: the target relation of the search is a containment relation, and the search method comprises the following steps:
s1: traversing an existing strategy list on a firewall, obtaining a current strategy of the strategy list, converting a source address, a destination address and a destination port of the current strategy of the strategy list, wherein the converted source address, destination address and destination port form a cuboid of a three-dimensional space;
s2: calculating the weight of the cuboid;
s3: finishing the traversal of the strategy list to obtain a new strategy list, and sequencing the new strategy list from big to small;
s4: according to the steps S1 and S2, calculating the weight of the strategy to be searched; the strategy to be searched is a search strategy input from the outside;
s5: performing binary search on the new strategy list to find the minimum value of the weight of the strategy to be searched, wherein the minimum value is greater than or equal to the weight of the strategy to be searched;
s6: reading a sub-policy list from the new policy list, traversing the sub-policy list, obtaining a current policy of the sub-policy list, comparing a protocol value, a source address, a destination address and a port range of the policy to be searched with the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list, and if the comparison results of the protocol value, the source address, the destination address and the port range of the policy to be searched and the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list are equal or contain relationship, storing a policy corresponding to the current policy of the sub-policy list in the policy list into a result list;
s7: and ending the traversal and returning to the result list.
Further, the policy list is P [0.. N-1]]N is the number of strategies(ii) a The current policy of the policy list is P [ i ]]Introduction of P [ i ]]Source address translation to (Src)s，Srct) Is marked as
P [ i ]]Destination address translation of (Dst)s，Dstt) Is marked as
P [ i ]]Destination Port conversion to (Port)s，Portt) Is marked as
The source address, the destination address and the destination port form a cuboid which is expressed as a three-dimensional space
<(SrcsDsts，Ports)，(SrcsDsts，Ports)>Is denoted by ci。
Further, the calculation method of step S2 is:
the weight of the cuboid is WiIf, if
Where one vector has a length of 0, then WiIs the area of a rectangle formed by two other vectors, if the lengths of two vectors are both 0, W isiFor the remaining vectors, if the lengths of all three vectors are 0, then WiIs marked as 0, otherwise, WiIs ciThe volume of (a).
Further, the new strategy list is w [0.. N-1], and N is the strategy number.
Further, the strategy to be searched is x, and the weight of the strategy to be searched is Wx。
Further, the minimum value of the weight of the strategy to be searched is Wy。
Further, the sub-policy list is W0-yThe current policy of the sub-policy list is WjThe result isThe list is R.
The invention also comprises a search system, which is used for realizing the firewall strategy search method based on the space sequencing and comprises a storage unit, an acquisition unit, a calculation unit, a comparison unit and an output unit;
the storage unit is used for storing the strategy list and the new strategy list;
the acquisition unit is used for acquiring the strategy to be searched input by the outside world according to claim 1;
the computing unit is used for realizing the steps S1-S5;
the comparing unit is used for realizing the step S6;
and the output unit is used for outputting the result list.
The present invention also includes a terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the firewall policy search method based on spatial ordering as described above when executing the computer program.
The present invention also includes a computer readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the steps of a firewall policy search method based on spatial ranking as described above.
Compared with the prior art, the invention has the beneficial effects that: the algorithm time complexity of the searching method is only O (N/2+ log)2N), so that the algorithm time complexity O (N) of the existing search method is greatly reduced, and the calculation performance is obviously improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic flowchart of a firewall policy search method based on spatial sorting according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a search system according to an embodiment of the present invention.
The reference symbols in the above figures are: 1. a search system; 101. a storage unit; 102. an acquisition unit; 103. a calculation unit; 104. a comparison unit; 105. and an output unit.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The same or similar reference numerals in the drawings of the present embodiment correspond to the same or similar components; in the description of the present invention, it should be noted that when an element is referred to as being "fixed" to another element, it can be directly on the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may be present, it is to be understood that the terms "upper", "lower", "left", "right", and the like, if any, refer to an orientation or positional relationship based on that shown in the drawings, that is for convenience in describing and simplifying the description, and that no indication or suggestion that the referenced device or element must have a particular orientation, be constructed and operated in a particular orientation, is therefore depicted in the drawings by the use of positional relationship descriptive terms only for purposes of illustration and not for purposes of limitation, the particular meaning of such terms being interpreted as broadly as will be understood by those skilled in the art based on the particular circumstances.
The technical solution of the present invention is described in detail below with reference to the accompanying drawings and specific embodiments.
The present invention provides a firewall policy search method based on spatial sorting, the preferred embodiment is shown in fig. 1, the target relationship of the search is an inclusion relationship, the search method includes the following steps:
s1: traversing an existing strategy list on the firewall, obtaining a current strategy of the strategy list, converting a source address, a destination address and a destination port of the current strategy of the strategy list, wherein the converted source address, destination address and destination port form a cuboid of a three-dimensional space;
s2: calculating the weight of the cuboid;
s3: finishing the traversal of the strategy list to obtain a new strategy list, and sequencing the new strategy list from large to small;
s4: calculating the weight of the strategy to be searched according to the steps S1 and S2; the strategy to be searched is an externally input searching strategy;
s5: performing binary search on the new strategy list to find the minimum value of the weight which is greater than or equal to the strategy to be searched;
s6: reading a sub-policy list from the new policy list, traversing the sub-policy list, obtaining a current policy of the sub-policy list, comparing a protocol value, a source address, a destination address and a port range of a policy to be searched with the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list, and if the comparison results of the protocol value, the source address, the destination address and the port range of the policy to be searched and the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list are equal or in an inclusion relationship, storing a policy corresponding to the current policy of the sub-policy list in the policy list into a result list;
s7: ending traversal and returning to a result list;
wherein, the searched target relationship is the inclusion relationship.
Compared with the prior art, the firewall strategy searching method based on the spatial sorting has the advantage that the algorithm time complexity of the searching method is only O (N/2+ log)2N), so that the algorithm time complexity O (N) of the existing search method is greatly reduced, and the calculation is obviously improvedCan be used.
As an embodiment of the present invention, the policy list is P [0.. N-1]]N is the number of strategies; the current policy of the policy list is P [ i ]]Introduction of P [ i ]]Source address translation to (Src)s，Srct) Is marked as
P [ i ]]Destination address translation of (Dst)s，Dstt) Is marked as
P [ i ]]Destination Port conversion to (Port)s，Portt) Is marked as
The source address, the destination address and the destination port form a cuboid which is expressed as a three-dimensional space
<(Srcs，Dsts，Ports)，(Srcs，Dsts，Ports)>Is denoted by ci。
As an embodiment of the present invention, the calculation method of step S2 is:
the weight of the rectangular parallelepiped is WiIf, if
Where one vector has a length of 0, then WiIs the area of a rectangle formed by two other vectors, if the lengths of two vectors are both 0, W isiFor the remaining vectors, if the lengths of all three vectors are 0, then WiIs marked as 0, otherwise, WiIs ciThe volume of (a).
As an embodiment of the present invention, the new strategy list is W [0.. N-1], and N is the number of strategies.
As an embodiment of the present invention, the policy to be searched is x, and the weight of the policy to be searched is Wx。
As an embodiment of the invention, the minimum value of the weight of the strategy to be searched is Wy。
As an embodiment of the present invention, the sub-policy list is W0-yThe current policy of the sub-policy list is WjThe result is tabulated as R.
Specifically, the search method is implemented as follows:
setting the existing strategy list on the firewall as P [0.. N-1], wherein N is the strategy number; setting a strategy to be searched as x; assuming that the target relationship of the search is an inclusion relationship, the search steps are as follows:
s1: traversing the list P, and taking the current strategy P [ i]Introduction of P [ i ]]Source address translation to (Src)s，Srct) Is marked as
P [ i ]]Destination address translation of (Dst)s，Dstt) Is marked as
P [ i ]]Destination Port conversion to (Port)s，Portt) Is marked as
Cuboid forming three-dimensional space<(Srcs，Dsts，Ports)，(Srcs，Dsts，Ports)>Is denoted by ci；
S2: calculation of ciThe weight of (A) is recorded as WiThe calculation method comprises the following steps: if it is not
Where one vector has a length of 0, then WiIs the area of a rectangle formed by two other vectors, if the lengths of two vectors are both 0, W isiFor the remaining vectors, if the lengths of all three vectors are 0, then WiIs marked as 0, otherwise, WiIs ciThe volume of (a);
s3: ending the traversal of the list P to obtain a list W [0.. N-1], and sequencing W from large to small;
s4: calculating the weight W of the policy x according to the methods of steps S1 and S2x；
S5: performing binary search on the list W to find W which is more than or equal to WxMinimum value W ofy；
S6: take child list W from list W0-yGo through W0-yGet the current policy WjCompare strategy x with strategy WjIf equal or inclusive, will WjStoring the corresponding strategy in the list P into a result list R;
s7: and ending the traversal and returning to a result list R.
The present invention also provides a search system 1, where the search system 1 is used to implement the above search method, as shown in fig. 2, the search system 1 includes a storage unit 101, an obtaining unit 102, a calculating unit 103, a comparing unit 104, and an output unit 105;
a storage unit 101 for storing a policy list and a new policy list;
an obtaining unit 102, configured to obtain a policy to be searched input by the outside;
a calculation unit 103 for realizing the above steps S1 to S5;
a comparing unit 104 for implementing the step S6;
an output unit 105 for outputting the result list.
The invention also provides a terminal, which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, and is characterized in that the steps of the searching method are realized when the processor executes the computer program.
The invention also proposes a computer-readable storage medium, in which a computer program is stored, characterized in that the computer program implements the steps of the above-mentioned search method when executed by a processor.
Preferably, all computer programs related to the present invention are written and implemented by using existing, public, open-source program codes; the technical solution according to the embodiments of the present invention can be implemented very easily by software programmers in the art.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (10)
1. A firewall strategy searching method based on space sequencing is characterized in that a target relation of searching is a contained relation, and the searching method comprises the following steps:
s1: traversing an existing strategy list on a firewall, obtaining a current strategy of the strategy list, converting a source address, a destination address and a destination port of the current strategy of the strategy list, wherein the converted source address, destination address and destination port form a cuboid of a three-dimensional space;
s2: calculating the weight of the cuboid;
s3: finishing the traversal of the strategy list to obtain a new strategy list, and sequencing the new strategy list from big to small;
s4: according to the steps S1 and S2, calculating the weight of the strategy to be searched; the strategy to be searched is a search strategy input from the outside;
s5: performing binary search on the new strategy list to find the minimum value of the weight of the strategy to be searched, wherein the minimum value is greater than or equal to the weight of the strategy to be searched;
s6: reading a sub-policy list from the new policy list, traversing the sub-policy list, obtaining a current policy of the sub-policy list, comparing a protocol value, a source address, a destination address and a port range of the policy to be searched with the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list, and if the comparison results of the protocol value, the source address, the destination address and the port range of the policy to be searched and the protocol value, the source address, the destination address and the port range of the current policy of the sub-policy list are equal or contain relationship, storing a policy corresponding to the current policy of the sub-policy list in the policy list into a result list;
s7: and ending the traversal and returning to the result list.
2. The method according to claim 1, wherein the policy list is P [0.. N-1]N is the number of strategies; the current policy of the policy list is P [ i ]]Introduction of P [ i ]]Source address translation to (Src)s，Srct) Is marked as
P [ i ]]Destination address translation of (Dst)s，Dstt) Is marked as
P [ i ]]Destination Port conversion to (Port)s，Portt) Is marked as
The source address, the destination address and the destination port form a cuboid which is expressed as a three-dimensional space<(Srcs，Dsts，Ports),(Srcs，Dsts，Ports)>Is marked as Ci。
3. The fire wall policy search method based on spatial sorting according to claim 2, wherein the calculation method of step S2 is as follows:
the weight of the cuboid is WiIf, if
Where one vector has a length of 0, then WiIs the area of a rectangle formed by two other vectors, if the lengths of two vectors are both 0, W isiFor the remaining vectors, if the lengths of all three vectors are 0, then WiIs marked as 0, otherwise, WiIs CiThe volume of (a).
4. The method according to claim 1, wherein the new policy list is W [0.. N-1], and N is a policy number.
5. The fire wall strategy searching method based on spatial ordering of claim 4, wherein the strategy to be searched is x, and the weight of the strategy to be searched is Wx。
6. The fire wall strategy searching method based on spatial ordering of claim 5, wherein the minimum value of the weight of the strategy to be searched is Wy。
7. The method as claimed in claim 6, wherein the sub-policy list is W0→yThe current policy of the sub-policy list is WjAnd the result list is R.
8. A search system, wherein the search system is configured to implement the firewall policy search method based on spatial ordering according to any one of claims 1-7, and the search system comprises a storage unit, an acquisition unit, a calculation unit, a comparison unit, and an output unit;
the storage unit, is used for storing the tactics tabulation and new tactics tabulation according to claim 1;
the acquisition unit is used for acquiring the strategy to be searched input by the outside world according to claim 1;
the computing unit for implementing steps S1-S5 as claimed in claim 1;
the comparing unit, configured to implement step S6 according to claim 1;
the output unit for outputting the result list of claim 1.
9. A terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor when executing the computer program implements the steps of a firewall policy search method based on spatial ordering according to any one of claims 1-7.
10. A computer-readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the steps of a firewall policy search method based on spatial ordering according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010641857.7A CN111901311B (en) | 2020-07-06 | 2020-07-06 | Firewall strategy searching method, system, terminal and storage medium based on space sequencing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010641857.7A CN111901311B (en) | 2020-07-06 | 2020-07-06 | Firewall strategy searching method, system, terminal and storage medium based on space sequencing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111901311A true CN111901311A (en) | 2020-11-06 |
| CN111901311B CN111901311B (en) | 2022-10-04 |
Family
ID=73193005
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010641857.7A Active CN111901311B (en) | 2020-07-06 | 2020-07-06 | Firewall strategy searching method, system, terminal and storage medium based on space sequencing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111901311B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112968896A (en) * | 2021-02-24 | 2021-06-15 | 深圳天元云科技有限公司 | Vector compression-based firewall policy filtering method, system, terminal and storage medium |
| CN113411336A (en) * | 2021-06-21 | 2021-09-17 | 深圳天元云科技有限公司 | Firewall strategy position optimization method, system, terminal and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060248580A1 (en) * | 2005-03-28 | 2006-11-02 | Wake Forest University | Methods, systems, and computer program products for network firewall policy optimization |
| US20090097418A1 (en) * | 2007-10-11 | 2009-04-16 | Alterpoint, Inc. | System and method for network service path analysis |
| US20190306118A1 (en) * | 2018-03-28 | 2019-10-03 | Fortinet, Inc. | Accelerating computer network policy search |
| CN110677383A (en) * | 2019-08-22 | 2020-01-10 | 平安科技（深圳）有限公司 | Firewall opening method and device, storage medium and computer equipment |
-
2020
- 2020-07-06 CN CN202010641857.7A patent/CN111901311B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060248580A1 (en) * | 2005-03-28 | 2006-11-02 | Wake Forest University | Methods, systems, and computer program products for network firewall policy optimization |
| US20090097418A1 (en) * | 2007-10-11 | 2009-04-16 | Alterpoint, Inc. | System and method for network service path analysis |
| US20190306118A1 (en) * | 2018-03-28 | 2019-10-03 | Fortinet, Inc. | Accelerating computer network policy search |
| CN110677383A (en) * | 2019-08-22 | 2020-01-10 | 平安科技（深圳）有限公司 | Firewall opening method and device, storage medium and computer equipment |
Non-Patent Citations (1)
| Title |
|---|
| 王旭虓: "利用决策树提高防火墙过滤能力的研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112968896A (en) * | 2021-02-24 | 2021-06-15 | 深圳天元云科技有限公司 | Vector compression-based firewall policy filtering method, system, terminal and storage medium |
| CN112968896B (en) * | 2021-02-24 | 2022-06-24 | 深圳天元云科技有限公司 | Vector compression-based firewall policy filtering method, system, terminal and storage medium |
| CN113411336A (en) * | 2021-06-21 | 2021-09-17 | 深圳天元云科技有限公司 | Firewall strategy position optimization method, system, terminal and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111901311B (en) | 2022-10-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109189474B (en) | Neural network processing device and method for executing vector addition instruction | |
| CN110298443B (en) | Neural network operation device and method | |
| CN111901311B (en) | Firewall strategy searching method, system, terminal and storage medium based on space sequencing | |
| CN111275199A (en) | Conversion method and system of deep learning model file, computer equipment and computer readable storage medium | |
| EP3561732A1 (en) | Operation apparatus and method for artificial neural network | |
| CN112799599B (en) | Data storage method, computing core, chip and electronic equipment | |
| EP3451160A1 (en) | Apparatus and method for performing vector outer product arithmetic | |
| CN111651202A (en) | Device for executing vector logic operation | |
| CN109189994B (en) | CAM structure storage system for graph computation application | |
| CN113411380B (en) | Processing method, logic circuit and equipment based on FPGA (field programmable gate array) programmable session table | |
| CN112231591B (en) | Information recommendation method and system considering social network user group compactness | |
| CN109885812B (en) | Method and device for dynamically adding hotwords and readable storage medium | |
| Borboudakis et al. | Scoring and searching over Bayesian networks with causal and associative priors | |
| CN112968896B (en) | Vector compression-based firewall policy filtering method, system, terminal and storage medium | |
| CN112765269B (en) | Data processing method, device, equipment and storage medium | |
| CN113886652A (en) | Memory-priority multimode graph data storage and calculation method and system | |
| CN111461314B (en) | Method and device for performing artificial neural network calculation based on constant data packet and computer readable storage medium | |
| Yu et al. | Improved approximation algorithms for min-max and minimum vehicle routing problems | |
| CN113392143B (en) | Construction and processing method of reachability query index facing multiple relational graphs | |
| CN111353124A (en) | Operation method, operation device, computer equipment and storage medium | |
| CN115482147B (en) | Efficient parallel graph processing method and system based on compressed data direct calculation | |
| CN114372238B (en) | Distributed state estimation method | |
| RU2796047C1 (en) | Method for building a decoding network, method and device for speech recognition, as well as data carrier | |
| WO2020192587A1 (en) | Artificial intelligence computing device and related product | |
| CN113792867B (en) | Arithmetic circuit, chip and board card |
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 | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A method, system, terminal, and storage medium for searching firewall policies based on spatial sorting Granted publication date: 20221004 Pledgee: Shenzhen small and medium sized small loan Co.,Ltd. Pledgor: SHENZHEN TIANYUAN CLOUD TECHNOLOGY Co.,Ltd. Registration number: Y2024980011792 |