Scenario-based dynamic scheduling method for heterogeneous execution of mimic web server
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A dynamic scheduling and executor technology, applied in the field of network security, can solve problems such as the inability to fully guarantee the diversity of executors, the effective use of unfavorable mimic voting mechanisms, and the reduction of system security
Active Publication Date: 2019-01-15
上海拟态数据技术有限公司
View PDF5 Cites 30 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
Although this strategy can effectively realize the dynamic and random changes of the executive body, it cannot fully guarantee the diversity among the executive bodies, which is not conducive to the effective use of the mimic voting mechanism.
The above two strategies
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0043] figure 2 It is a schematic flow chart of a scenario-based method for dynamically scheduling heterogeneous executives of a mimetic web server provided by an embodiment of the present invention. like figure 2 As shown, the method includes the following steps:
[0044] S101. Calculate the overall difference value between the offline execution body and the online execution body;
[0045] S102. Count the attacker type set L and the attacker l's attack method strategy set N in the target scenario. l , get the attack probability table P of various types of attackers A ={p 1 ,p 2 ,...,p l}, where l∈L;
[0046] S103. Calculate the income value A of the attacker and the defender in various attack modes when the attacker l launches an attack on any executive body l and D l ;
[0047] S104. Map the Bayesian-Stackelberg game model to the mimic web server, and construct an objective function for solving the optimal scheduling strategy;
[0048] S105. Comparing the overal...
Embodiment 2
[0051] On the basis of the first embodiment above, the present invention provides another embodiment, and the specific process is as follows:
[0052] S201. Calculating the overall difference between the offline executive and the online executive mainly includes the following sub-steps:
[0053] S2011: Calculate the difference ω between the execution body i and the execution body j ij ;
[0054] ω ij =C ij *P (1)
[0055] Among them, C ij =[c 0 ,c 1 ,c 2 ,... c t ] represents the difference value of each layer of the software stack from executive i to executive j, P=[p 0 ,p 1 ,p 2 ,...p t ] T Represent the weighting coefficient of the difference value of each layer of the software stack, and t represents the number of software stack layers of each executive body in the executive body set C of the mimic web server;
[0056] Specifically, according to the common vulnerabilities of different software at each layer of the software stack of executive body i and execut...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention provides a scenario-based dynamic scheduling method for the heterogeneous execution of a mimic web server. The method comprises the following steps of: calculating an overall differencevalue between an offline actuator and an offline actuator; The attack probability table PA= {p1, p2,..., pl} of each type of attacker is obtained by counting the type set L of attacker and the attackmode policy set Nl of attacker l in the target scenario. The attack probability table PA= {p1, p2,..., pl} of each type of attacker is obtained. When attacker l launches an attack against any executor, the profit values Al and Dl of the attacker and the defender under various attack modes are calculated. The Stackelberg game model is mapped to a pseudo-web server to construct an objective functionfor solving the optimal scheduling policy. The overall difference value and the revenue values Al and Dl of the offensive and defensive sides are brought into the objective function to obtain the defender's optimal mixed strategy x. By constructing the objective function, we can get the dynamic scheduling strategy of pseudo-web server under different attack environments, which can give full playto the diversity, randomness and dynamic advantages of pseudo-web server, and effectively improve the security and resource utilization of the system.
Description
technical field [0001] The invention relates to the technical field of network security, in particular to a scenario-based method for dynamic scheduling of heterogeneous executive bodies of mimetic web servers. Background technique [0002] As the most important way of carrying and providing Internet services at present, web services are the starting point of most network attacks. The existence of vulnerabilities allows some people or groups to obtain important information with a small amount of resources, threatening the security of information infrastructure and public services. It even endangers network order and social stability. [0003] Mimic defense deploys heterogeneous software and hardware executives with the same function at different levels in web services, uses multiple heterogeneous executives to execute the same request and votes on the response results, and dynamically schedules executives through the feedback results of threat perception to increase security...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more