CN112422579A - Execution body set construction method based on mimicry defense Sketch - Google Patents
Execution body set construction method based on mimicry defense Sketch Download PDFInfo
- Publication number
- CN112422579A CN112422579A CN202011367449.3A CN202011367449A CN112422579A CN 112422579 A CN112422579 A CN 112422579A CN 202011367449 A CN202011367449 A CN 202011367449A CN 112422579 A CN112422579 A CN 112422579A
- Authority
- CN
- China
- Prior art keywords
- sketch
- bucket
- data structure
- mapping
- function
- 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
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/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
- H04L63/1483—Countermeasures against malicious traffic service impersonation, e.g. phishing, pharming or web spoofing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a construction method of an executive set based on mimicry defense Sketch, which comprises the following steps: randomly extracting Sketch from the standby set to establish an operation set; dividing the Skatch in the running set into a line granularity Skatch and a bucket granularity Skatch according to a preset strategy; respectively mapping the line granularity Sketch to lines in an execution volume set data structure through a line mapping function, and recording a mapping relation; respectively mapping the bucket granularity Sketch to a bucket in an execution body set data structure through a bucket mapping function, and recording a mapping relation; when a data packet is inserted, calling a Sketch insertion function corresponding to a bucket data structure corresponding to the hash value of the data packet; when the abnormal flow is queried, the execution body set data structure is traversed, and a corresponding query function is called. The invention can enhance the robustness of network measurement and reduce extra huge space-time overhead caused by the pseudo-configuration.
Description
Technical Field
The invention relates to the field of mimicry defense and the field of network measurement, in particular to an executive set construction method based on the mimicry defense Sketch.
Background
With the development of the internet, the network environment is becoming more complex and diversified, the network attack means are more and more varied, and the network space security situation is severe. In order to avoid huge loss caused by defense and defense of the network, potential security threats need to be discovered in time. The network measurement technology represented by Sketch monitors the network in real time, counts traffic information, accurately feeds back the network state, and provides real-time information of the network for a network administrator, so that the network measurement technology is more and more emphasized by people. However, when a device carrying network measurement functions (such as a switch in a data center) is subjected to network attacks or traffic distribution goes beyond a manual pre-configuration model, the performance of network measurements is greatly compromised. The emergence of the mimicry defense provides a scheme for improving the performance of network measurement in an abnormal scene.
The mimicry defense is mainly used for defense in the network field, such as a mimicry router, a mimicry switch, a mimicry DNS server and the like. The mimicry defense is based on a heterogeneous redundancy system, introduces dynamic and random properties, and provides a heterogeneous, redundant and dynamic defense architecture. The mimicry defense architecture mainly comprises an input agent, a reconfigurable heterogeneous execution body set, an output resolver, a feedback controller and an output agent. The system isomerism is increased through the design of a reconfigurable heterogeneous execution body set, so that the system effectiveness is increased; providing an accurate output through an output resolver; and supporting a closed-loop control link through a feedback controller. Therefore, the mimicry defense architecture can effectively deal with unknown risks in a network space, introduce mimicry defense into network measurement and well solve the problem of insufficient network measurement performance in an abnormal scene. However, the traditional mimicry defense architecture has huge additional space-time overhead, and cannot meet the real-time and efficient requirements of network measurement.
Disclosure of Invention
In view of this, the present invention provides an executive set construction method based on the mimicry defense Sketch, which can reduce the extra huge space-time overhead caused by the mimicry construction while enhancing the robustness of network measurement.
The invention is realized by adopting the following scheme: an executive set construction method based on mimicry defense Sketch specifically comprises the following steps:
randomly extracting Sketch from the standby set to establish an operation set;
dividing the Skatch in the running set into a line granularity Skatch and a bucket granularity Skatch according to a preset strategy;
respectively mapping the line granularity Sketch to lines in an execution volume set data structure through a line mapping function, and recording a mapping relation;
respectively mapping the bucket granularity Sketch to a bucket in an execution body set data structure through a bucket mapping function, and recording a mapping relation;
when a data packet is inserted, calling a Sketch insertion function corresponding to the bucket data structure of the hash value of the data packet;
when the abnormal flow is queried, the execution set data structure is traversed, and the corresponding Sketch query function of each data structure is called.
Further, the standby set is a set consisting of currently unused sketches; the run set is the set of sketches currently being used.
Further, the row mapping function and the bucket mapping function adopt a hash function.
Further, the execution volume set data structure consists of a Sketch atom data structure which is organized in a two-dimensional table form, and the Sketch atom data structure is a minimum data structure of a Sketch algorithm which plays a network measurement function; the mapping is specifically as follows: the number of line-granularity or bucket-granularity Sketch and the number of line or bucket in the execution set data structure are defined as a doublet, and the recorded mapping relation is a table containing all the doublets.
Further, when the data packet is inserted, invoking a Sketch insertion function corresponding to the bucket data structure corresponding to the hash value of the data packet specifically includes: when inserting a certain data packet into the data structure of the execution body set, directly calling the insertion function of the Sketch corresponding to the current bucket or the current line according to the recorded mapping relation to realize data insertion.
Further, when the abnormal stream is queried, traversing the execution set data structure, and calling the Sketch query function corresponding to each bucket data structure specifically includes: when the abnormal stream is inquired, all the buckets are traversed from the first bucket of the execution volume set data structure, and the corresponding inquiry function of the Sketch is directly called to realize data inquiry according to the mapping relation between the current bucket or the current line and the Sketch.
Further, the method also comprises a step of replacing the executive body, and the step specifically comprises the following steps: when a problem executable is detected, replacing the executable, and if both are Sketch of the same type, replacing the data structure at each position corresponding to the problem Sketch one by using the atomic data structure for replacing the Sketch; if the two sides of the replacement are Sketch of different categories, the problem Sketch in the running set needs to be replaced by the replacement Sketch, and the execution body set data structure is rebuilt.
The invention also provides a system for constructing an execution body set based on the Sketch, which comprises a memory, a processor and computer program instructions stored on the memory and capable of being executed by the processor, wherein when the computer program instructions are executed by the processor, the method steps can be realized.
The present invention also provides a computer readable storage medium having stored thereon computer program instructions executable by a processor, the computer program instructions when executed by the processor being capable of performing the method steps as described above.
Compared with the prior art, the invention has the following beneficial effects: the invention provides an executive set construction method based on the Sketch of the mimicry defense, which reduces the memory overhead caused by the mimicry structure while improving the robustness of network measurement, accelerates the insertion operation and the query operation in the network measurement and greatly reduces the huge overhead caused by introducing the Sketch of the mimicry defense.
Drawings
FIG. 1 is a schematic overall framework of an embodiment of the present invention.
Fig. 2 is a framework of the executable set construction method according to the embodiment of the present invention.
Fig. 3 is a specific process for performing the building of the data structure of the volume set according to the embodiment of the present invention.
Fig. 4 is a data packet insertion process involved in the execution entity set construction method according to the embodiment of the present invention.
Fig. 5 is an execution body replacement process according to an embodiment of the present invention.
Detailed Description
The invention is further explained below with reference to the drawings and the embodiments.
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
As shown in fig. 1 and fig. 2, this embodiment provides an execution entity set construction method based on a mimicry defense Sketch, which is to atomize a conventional Sketch data structure, and directly construct the execution entity set data structure by using an operation set Sketch atomic data structure at a fine-grained level through a line-column random mapping function. The system heterogeneity is increased through various heterogeneous Sketch and multi-granularity mapping functions, and therefore the system effectiveness is increased. The network measurement robustness is improved, meanwhile, the insertion efficiency and the query efficiency are effectively improved, and the memory overhead is reduced. The method specifically comprises the following steps:
(1) randomly extracting Sketch from the standby set to establish an operation set;
(2) dividing the Skatch in the running set into a line granularity Skatch and a bucket granularity Skatch according to a preset strategy;
(3) respectively mapping the line granularity Sketch to lines in an execution volume set data structure through a line mapping function, and recording a mapping relation;
(4) respectively mapping the bucket granularity Sketch to a bucket in an execution body set data structure through a bucket mapping function, and recording a mapping relation;
(5) when a data packet is inserted, calling a Sketch insertion function corresponding to the bucket data structure of the hash value of the data packet;
(6) when the abnormal flow is queried, the execution body set data structure is traversed, and the corresponding Sketch query function of each bucket data structure is called.
In this embodiment, in step (1), the standby set is a set composed of currently unused sketches; corresponding to this is a running set, which is the set of sketches currently being used. And (3) configuring the number extracted in the step (1) according to the requirements of a specific scene. For example, when the scene has low requirements on network measurement robustness, only 3-4 sketches can be extracted.
Preferably, in this embodiment, in step (2), the Sketch in the running set is divided into a line-granularity Sketch and a bucket-granularity Sketch according to a pre-configured policy. The strategy is to divide different sketches into line-granularity sketches and bucket-granularity sketches by theoretical and experimental considerations. Line-granularity Sketch and bucket-granularity Sketch refer to the form that a certain Sketch appears in the execution volume set data structure.
In this embodiment, the Sketch atom data structure is defined as the minimum unit that a certain Sketch can complete the network measurement function. Such as a single bucket, a single row, multiple rows. Atomization of a conventional Sketch data structure means that the Sketch can be found out by theory and experiment to be the minimum unit capable of completing the network measurement function. The Sketch is divided into a line-granularity Sketch and a bucket-granularity Sketch. For example, the CM-Heap only needs one bucket to complete the network measurement function, so that one bucket of the CM-Sketch is called as an atomic data structure, and the CM-Heap is classified into bucket granularity Sketch. And Rev-Sketch needs at least one line to complete the network measurement function, so the Rev-Sketch atomic data structure is one line thereof and is classified as line granularity Sketch. It should be noted that the minimum data structure unit capable of performing network measurement function by different sketches is determined by theoretical derivation and experiments. When the running set is established, randomly extracting the Sketch from the standby set to form the running set, and dividing the Sketch in the running set into a line granularity Sketch and a bucket granularity Sketch according to the preset configuration.
In step (3) (4), the row mapping function and the bucket mapping function generally use a hash function, such as a valley hash.
In this embodiment, the execution volume set data structure is composed of a Sketch atomic data structure, and is a data structure carrying network measurement functions (including insertion of streams, query operations), and is organized in a two-dimensional table; the mapping is specifically as follows: in step (3) (4), the number of the line granularity or bucket granularity Sketch and the number of the line or bucket in the execution entity set data structure are defined as a duplet, and the recorded mapping relation is a table containing all the duplets.
As shown in fig. 3 (a), the execution volume set data structure is empty initially. As shown in fig. 3 (b), first map the line granularity Sketch (i.e. Rev-Sketch in fig. 3 (b)) to some lines of the execution volume set data structure by a line mapping function, and record the mapping relationship; secondly, as shown in fig. 3 (c) and fig. 3 (d), the bucket granularity Sketch (i.e. MV-Sketch, CM-Heap) is mapped to the remaining buckets of the execution set data structure by the bucket mapping function, and the mapping relationship is recorded. The mapping functions are all random extraction functions, generally adopt hash functions, and the main function is to randomly extract partial rows and buckets from the execution volume set data structure so as to determine the occupied positions of certain Sketch when the execution volume set data structure is established. Intuitively, the execution set data structure is pieced together by many heterogeneous Sketch atomic data structures. The mapping relation recorded here is used for determining the Sketch corresponding to a certain bucket or a certain line during insertion and query.
In this embodiment, when inserting the data packet, the invoking the Sketch insertion function corresponding to the bucket data structure corresponding to the hash value of the data packet is specifically: when a certain data packet is inserted into the data structure of the execution body set, directly calling an insertion function of the Sketch corresponding to the current bucket or the current line to realize data insertion according to the mapping relation recorded in the step (3) and the step (4). The insertion functions of different sketches are different, and the specific insertion function needs to be implemented by programming according to the insertion algorithms of different sketches respectively. Specifically, as shown in fig. 4, when a packet is inserted, the number of times of packet distribution is determined by the input agent. Secondly, hashing the data packet to corresponding buckets of certain rows in the execution volume set data structure through mutually independent hash functions among the rows, and calling the insertion functions of the corresponding Sketch of the buckets to complete insertion operation. The insertion functions of different sketches are different, and the specific insertion function needs to be implemented by programming according to the insertion algorithms of different sketches respectively. Referring to fig. 4, for example, the inserted bucket corresponds to the CM-Heap, the CM-Heap bucket maintains a counter, and when a packet is inserted, the insertion function is called to self-increment the counter.
In this embodiment, when querying the exception stream, traversing the execution set data structure, and invoking the corresponding query function specifically includes: when the abnormal stream is inquired, all the buckets are traversed from the first bucket of the execution volume set data structure, and the corresponding inquiry function of the Sketch is directly called to realize data inquiry according to the mapping relation between the current bucket or the current line and the Sketch. Where an abnormal flow is defined as a flow that is too high in total flow. The query function is a concrete implementation of the query algorithm of Sketch. Sketch algorithms fall into two categories: one is that the exception traffic candidates may be held directly within the bucket, and one is that the exception traffic candidates are held within an additional data structure. When abnormal traffic is inquired, only abnormal traffic candidates in the bucket need to be returned for the former, and additional memory access operation needs to be carried out for the latter to obtain the abnormal traffic candidates. The functions used in these two types of query processes are called query functions. Generally, the query function of the former is simple and fast, and the query function of the latter is complex.
In this embodiment, the method further includes a step (7) of replacing the execution body, where the step specifically includes: when a problem executable is detected, replacing operation of the executable is needed, and if both replacing parts are Sketch of the same type, replacing the data structures at the positions corresponding to the replaced Sketch one by using the replacing Sketch atomic data structures; if the two sides of the replacement are Sketch of different categories, the problem Sketch in the running set needs to be replaced by the replacement Sketch, and the execution body set data structure is rebuilt. Take LD-Sketch as an example to replace MV-Sketch. Because the MV-Sketch and the LD-Sketch are both bucket granularity Sketch, only the bucket data structures at the positions corresponding to the MV-Sketch need to be replaced by the bucket data structures of the LD-Sketch, and the mapping relationship is updated, where the mapping relationship is the mapping relationship obtained in steps (3) and (4). If both sides of the replacement are not the same type of Sketch, i.e. one side is the line granularity Sketch and the other side is the bucket granularity Sketch, the execution entity set data structure needs to be rebuilt according to the steps (3) and (4). Specifically, as shown in fig. 5, when a problem executable is detected, an executable replacement operation needs to be performed, as in (a) of fig. 5. Suppose MV-Sketch is the problem executor and replaces MV-Sketch with LD-Sketch. As shown in fig. 5 (b), since the MV-Sketch and the LD-Sketch are both bucket granularity Sketch, only the bucket data structure at each position corresponding to the MV-Sketch needs to be replaced by the bucket data structure of the LD-Sketch, and the mapping relationship is updated. The replacement operation can be implemented by the free and new instructions in the C language. If both sides of the replacement are not the same type of Sketch, i.e. one side is the line-granularity Sketch and the other side is the bucket-granularity Sketch, the execution entity set data structure needs to be rebuilt.
The present embodiment also provides a system for constructing an execution entity set based on the stateful defense Sketch, which includes a memory, a processor, and computer program instructions stored on the memory and capable of being executed by the processor, and when the computer program instructions are executed by the processor, the method steps as described above can be implemented.
The present embodiments also provide a computer readable storage medium having stored thereon computer program instructions executable by a processor, the computer program instructions, when executed by the processor, being capable of performing the method steps as described above.
The foregoing is directed to preferred embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow. However, any simple modification, equivalent change and modification of the above embodiments according to the technical essence of the present invention are within the protection scope of the technical solution of the present invention.
Claims (9)
1. An executive set construction method based on mimicry defense Sketch is characterized by comprising the following steps:
randomly extracting Sketch from the standby set to establish an operation set;
dividing the Skatch in the running set into a line granularity Skatch and a bucket granularity Skatch according to a preset strategy;
respectively mapping the line granularity Sketch to lines in an execution volume set data structure through a line mapping function, and recording a mapping relation;
respectively mapping the bucket granularity Sketch to a bucket in an execution body set data structure through a bucket mapping function, and recording a mapping relation;
when a data packet is inserted, calling a Sketch insertion function corresponding to the bucket data structure of the hash value of the data packet;
when the abnormal flow is queried, the execution body set data structure is traversed, and the corresponding Sketch query function of each bucket data structure is called.
2. The method for constructing the execution body set based on the mimicry defense Sketch according to claim 1, wherein the standby set is a set consisting of currently unused sketches; the run set is the set of sketches currently being used.
3. The sketched defense Sketch-based executive set construction method according to claim 1, wherein a hash function is used for the line mapping function and the bucket mapping function.
4. The execution body set construction method based on the mimicry defense Sketch according to claim 1, characterized in that the execution body set data structure is composed of Sketch atomic data structures and is organized in a form of a two-dimensional table, and the Sketch atomic data structure is a minimum data structure of a Sketch algorithm which plays a network measurement function; the mapping is specifically as follows: the number of line-granularity or bucket-granularity Sketch and the number of line or bucket in the execution set data structure are defined as a doublet, and the recorded mapping relation is a table containing all the doublets.
5. The method for constructing the execution entity set based on the mimicry defense Sketch according to claim 1, wherein the step of calling the Sketch insertion function corresponding to the bucket data structure of the data packet hash value when inserting the data packet is specifically as follows: when inserting a certain data packet into the data structure of the execution body set, directly calling the insertion function of the Sketch corresponding to the current bucket or the current line according to the recorded mapping relation to realize data insertion.
6. The method for constructing the Sketch-defending Sketch-based executive set according to claim 1, wherein when an abnormal stream is queried, traversing the executive set data structure and calling the Sketch query function corresponding to each bucket data structure specifically comprises: when the abnormal stream is inquired, all the buckets are traversed from the first bucket of the execution volume set data structure, and the corresponding inquiry function of the Sketch is directly called to realize data inquiry according to the mapping relation between the current bucket or the current line and the Sketch.
7. The execution body set construction method based on the mimicry defense Sketch according to claim 1, characterized by further comprising a step of replacing an execution body, the step specifically being: when a problem executable is detected, replacing operation of the executable is needed, and if both replacing parts are Sketch of the same type, replacing the data structures at the positions corresponding to the problem Sketch one by using a replacing Sketch atomic data structure; if the two sides of the replacement are Sketch of different categories, the problem Sketch in the running set needs to be replaced by the replacement Sketch, and the execution body set data structure is rebuilt.
8. A system for construction of a set of executors based on a mimicry defense Sketch, characterized in that it comprises a memory, a processor and computer program instructions stored on the memory and executable by the processor, which when executed by the processor, are capable of implementing the method steps according to any one of claims 1 to 7.
9. A computer-readable storage medium, having stored thereon computer program instructions executable by a processor, the computer program instructions, when executed by the processor, being capable of carrying out the method steps according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011367449.3A CN112422579B (en) | 2020-11-30 | 2020-11-30 | Execution body set construction method based on mimicry defense Sketch |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011367449.3A CN112422579B (en) | 2020-11-30 | 2020-11-30 | Execution body set construction method based on mimicry defense Sketch |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112422579A true CN112422579A (en) | 2021-02-26 |
| CN112422579B CN112422579B (en) | 2021-11-30 |
Family
ID=74843826
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011367449.3A Active CN112422579B (en) | 2020-11-30 | 2020-11-30 | Execution body set construction method based on mimicry defense Sketch |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112422579B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106657038A (en) * | 2016-12-08 | 2017-05-10 | 西安交通大学 | Network traffic abnormality detection and positioning method based on symmetry degree sketch |
| CN108304409A (en) * | 2017-01-13 | 2018-07-20 | 北京大学 | A kind of data Frequency estimation method of the Sketch data structures based on carry |
| CN108400968A (en) * | 2018-01-16 | 2018-08-14 | 杭州电子科技大学 | A kind of efficient method for realizing mimicry defence model distributor |
| US20180300363A1 (en) * | 2017-04-14 | 2018-10-18 | Dynatrace Llc | Method And System To Estimate The Cardinality Of Sets And Set Operation Results From Single And Multiple HyperLogLog Sketches |
| CN109587168A (en) * | 2018-12-29 | 2019-04-05 | 河南信大网御科技有限公司 | Network function dispositions method based on mimicry defence in software defined network |
| CN110011876A (en) * | 2019-04-19 | 2019-07-12 | 福州大学 | A kind of network measure method of the Sketch based on intensified learning |
| CN110535825A (en) * | 2019-07-16 | 2019-12-03 | 北京大学 | A kind of data identification method of character network stream |
| CN110830322A (en) * | 2019-09-16 | 2020-02-21 | 北京大学 | Network flow measuring method and system based on probability measurement data structure Sketch with approximate zero error |
| CN111935103A (en) * | 2020-07-22 | 2020-11-13 | 河南信大网御科技有限公司 | System and method for recursive simulation of executive service function |
-
2020
- 2020-11-30 CN CN202011367449.3A patent/CN112422579B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106657038A (en) * | 2016-12-08 | 2017-05-10 | 西安交通大学 | Network traffic abnormality detection and positioning method based on symmetry degree sketch |
| CN108304409A (en) * | 2017-01-13 | 2018-07-20 | 北京大学 | A kind of data Frequency estimation method of the Sketch data structures based on carry |
| US20180300363A1 (en) * | 2017-04-14 | 2018-10-18 | Dynatrace Llc | Method And System To Estimate The Cardinality Of Sets And Set Operation Results From Single And Multiple HyperLogLog Sketches |
| CN108400968A (en) * | 2018-01-16 | 2018-08-14 | 杭州电子科技大学 | A kind of efficient method for realizing mimicry defence model distributor |
| CN108400968B (en) * | 2018-01-16 | 2019-12-24 | 杭州电子科技大学 | Method for realizing mimicry defense model distributor |
| CN109587168A (en) * | 2018-12-29 | 2019-04-05 | 河南信大网御科技有限公司 | Network function dispositions method based on mimicry defence in software defined network |
| CN110011876A (en) * | 2019-04-19 | 2019-07-12 | 福州大学 | A kind of network measure method of the Sketch based on intensified learning |
| CN110535825A (en) * | 2019-07-16 | 2019-12-03 | 北京大学 | A kind of data identification method of character network stream |
| CN110830322A (en) * | 2019-09-16 | 2020-02-21 | 北京大学 | Network flow measuring method and system based on probability measurement data structure Sketch with approximate zero error |
| CN111935103A (en) * | 2020-07-22 | 2020-11-13 | 河南信大网御科技有限公司 | System and method for recursive simulation of executive service function |
Non-Patent Citations (3)
| Title |
|---|
| LU TANG, QUN HUANG, AND PATRICK P. C. LEE1: "MV-Sketch: A Fast and Compact Invertible Sketch", 《IEEE》 * |
| ZHENGYAN ZHOU, DONG ZHANG AND XIAOYAN HONG: "RL-Sketch: Scaling Reinforcement Learning for", 《IEEE》 * |
| 孙敏铭，张栋: "分布式SDN控制平面下可靠的控制流传输路径选择", 《福州大学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112422579B (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109064345A (en) | Message treatment method, system and computer readable storage medium | |
| CN108462594B (en) | Virtual private network and rule table generation method, device and routing method | |
| US11269902B2 (en) | Time series data management method, device, and apparatus | |
| CN102571420B (en) | Method and system for network element data management | |
| CN106981024B (en) | Transaction limit calculation processing system and processing method thereof | |
| CN106951179B (en) | Data migration method and device | |
| CN111159002B (en) | Data edge collection method, edge collection equipment and system based on grouping | |
| CN112367211B (en) | Method, device and storage medium for generating configuration template by device command line | |
| CN105956068A (en) | Webpage URL repetition elimination method based on distributed database | |
| CN102915344B (en) | SQL (structured query language) statement processing method and device | |
| CN111385370B (en) | ID allocation method, device, storage medium and ID allocation system | |
| CN103294799B (en) | A kind of data parallel batch imports the method and system of read-only inquiry system | |
| CN112235436A (en) | Network address translation rule matching method and equipment | |
| CN112202645B (en) | Measuring system based on mimicry defense and Sketch algorithm and abnormal flow detection method | |
| CN112422579B (en) | Execution body set construction method based on mimicry defense Sketch | |
| CN104579753B (en) | User data statistical method, access stratum server and statistical server | |
| CN112491592B (en) | Storage resource grouping method, system, terminal and storage medium | |
| CN116723143B (en) | Network target range resource allocation method and system based on traffic affinity | |
| CN107203437A (en) | The methods, devices and systems for preventing internal storage data from losing | |
| CN109246222A (en) | service request processing method, device, system and computer readable storage medium | |
| CN107257356B (en) | Social user data optimal placement method based on hypergraph segmentation | |
| CN108416073A (en) | A kind of web crawlers method and system | |
| CN111031056B (en) | Method for realizing security domain function in security group | |
| CN111163060B (en) | Application group-based forwarding method, device and system | |
| CN107526690B (en) | Method and device for clearing cache |
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 |