ACM Trans. Internet Techn. | 2021

Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing



\n Volunteer computing\n uses computers volunteered by the general public to do distributed scientific computing.\n Volunteer computing\n is being used in high-energy physics, molecular biology, medicine, astrophysics, climate study, and other areas. These projects have attained unprecedented computing power. However, with the development of information technology, the traditional defense system cannot deal with the unknown security problems of\n volunteer computing\n . At the same time, Cyber Mimic Defense (CMD) can defend the unknown attack behavior through its three characteristics: dynamic, heterogeneous, and redundant. As an important part of the CMD, the dynamic scheduling algorithm realizes the dynamic change of the service centralized executor, which can enusre the security and reliability of CMD of\n volunteer computing\n . Aiming at the problems of passive scheduling and large scheduling granularity existing in the existing scheduling algorithms, this article first proposes a scheduling algorithm based on time threshold and task threshold and realizes the dynamic randomness of mimic defense from two different dimensions; finally, combining time threshold and random threshold, a dynamic scheduling algorithm based on multi-level queue is proposed. The experiment shows that the dynamic scheduling algorithm based on multi-level queue can take both security and reliability into account, has better dynamic heterogeneous redundancy characteristics, and can effectively prevent the transformation rule of heterogeneous executors from being mastered by attackers.\n

Volume 21
Pages 75:1-75:33
DOI 10.1145/3408291
Language English
Journal ACM Trans. Internet Techn.

Full Text