Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

Li, Q; Meng, S; Sang, X; Zhang, H; Wang, S; Bashir, AK; Yu, K; Tariq, U

Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing

Li, Q Meng, S Sang, X Zhang, H Wang, S

Bashir, AK Yu, K Tariq, U

Permalink

Publisher:: ASSOC COMPUTING MACHINERY
Publication Type:: Journal Article
Citation:: ACM Transactions on Internet Technology, 2021, 21, (3)
Issue Date:: 2021-08-01

Closed Access

	Filename	Description	Size
	ACM ToIT-Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing.pdf	Accepted version	2.17 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, Q
dc.contributor.author	Meng, S
dc.contributor.author	Sang, X
dc.contributor.author	Zhang, H
dc.contributor.author	Wang, S https://orcid.org/0000-0003-1133-9379
dc.contributor.author	Bashir, AK
dc.contributor.author	Yu, K
dc.contributor.author	Tariq, U
dc.date.accessioned	2022-07-21T23:03:18Z
dc.date.available	2022-07-21T23:03:18Z
dc.date.issued	2021-08-01
dc.identifier.citation	ACM Transactions on Internet Technology, 2021, 21, (3)
dc.identifier.issn	1533-5399
dc.identifier.issn	1557-6051
dc.identifier.uri	http://hdl.handle.net/10453/159093
dc.description.abstract	Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. Volunteer computing 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 volunteer computing. 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 volunteer computing. 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.
dc.language	English
dc.publisher	ASSOC COMPUTING MACHINERY
dc.relation.ispartof	ACM Transactions on Internet Technology
dc.relation.isbasedon	10.1145/3408291
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0801 Artificial Intelligence and Image Processing, 0805 Distributed Computing, 0806 Information Systems
dc.subject.classification	Networking & Telecommunications
dc.title	Dynamic Scheduling Algorithm in Cyber Mimic Defense Architecture of Volunteer Computing
dc.type	Journal Article
utslib.citation.volume	21
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access	*
dc.date.updated	2022-07-21T23:03:16Z
pubs.issue	3
pubs.publication-status	Published
pubs.volume	21
utslib.citation.issue	3

Abstract:

Volunteer computing uses computers volunteered by the general public to do distributed scientific computing. Volunteer computing 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 volunteer computing. 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 volunteer computing. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/159093