Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

CLOSURE: A cloud scientific workflow scheduling algorithm based on attack-defense game model

Wang, Y, Guo, Y, Guo, Z, Baker, T and Liu, W (2019) CLOSURE: A cloud scientific workflow scheduling algorithm based on attack-defense game model. Future Generation Computer Systems. ISSN 0167-739X

final.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB) | Preview


The multi-tenant coexistence service mode makes the cloud-based scientific workflow encounter the risks of being intruded. For this problem, we propose a CLoud scientific wOrkflow SchedUling algoRithm based on attack-defensE game model (CLOSURE). In the algorithm, attacks based on different operating system vulnerabilities are regarded as different “attack” strategies; and different operating system distributions in a virtual machine cluster executing the workflows are regarded as different “defense” strategies. The information of the attacker and defender is not balanced. In other words, the defender cannot obtain the information about the attacker’s strategies, while the attacker can acquire information about the defender’s strategies through a network scan. Therefore, we propose to dynamically switch the defense strategies during the workflow execution, which can weaken the network scan effects and transform the workflow security problem into an attack-defense game problem. Then, the probability distribution of the optimal mixed defense strategies can be achieved by calculating the Nash Equilibrium in the attack-defense game model. Based on this probability, diverse VMs are provisioned for workflow execution. Furthermore, a task-VM mapping algorithm based on dynamic Heterogeneous Earliest Finish Time (HEFT) is presented to accelerate the defense strategy switching and improve workflow efficiency. The experiments are conducted on both simulation and actual environment, experimental results demonstrate that compared with other algorithms, the proposed algorithm can reduce the attacker’s benefits by around 15.23%, and decrease the time costs of the algorithm by around 7.86%.

Item Type: Article
Uncontrolled Keywords: 0805 Distributed Computing, 0806 Information Systems, 0803 Computer Software
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Computer Science & Mathematics
Publisher: Elsevier
Date Deposited: 11 Nov 2019 12:52
Last Modified: 04 Sep 2021 08:28
URI: https://researchonline.ljmu.ac.uk/id/eprint/11746
View Item View Item