An online auction mechanism for time-varying multidimensional resource allocation in clouds

Zhang, J; Yang, X; Xie, N; Zhang, X; Vasilakos, AV; Li, W

An online auction mechanism for time-varying multidimensional resource allocation in clouds

Zhang, J Yang, X Xie, N Zhang, X Vasilakos, AV Li, W

Permalink

Publisher:: Elsevier BV
Publication Type:: Journal Article
Citation:: Future Generation Computer Systems, 2020, 111, pp. 27-38
Issue Date:: 2020-10-01

Closed Access

	Filename	Description	Size
	1-s2.0-S0167739X19331127-main.pdf	Published version	1.13 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	Zhang, J
dc.contributor.author	Yang, X
dc.contributor.author	Xie, N
dc.contributor.author	Zhang, X
dc.contributor.author	Vasilakos, AV
dc.contributor.author	Li, W
dc.date.accessioned	2020-10-31T05:35:49Z
dc.date.available	2020-10-31T05:35:49Z
dc.date.issued	2020-10-01
dc.identifier.citation	Future Generation Computer Systems, 2020, 111, pp. 27-38
dc.identifier.issn	0167-739X
dc.identifier.uri	http://hdl.handle.net/10453/143637
dc.description.abstract	© 2020 Elsevier B.V. Multidimensional resource allocation is a hot topic in cloud computing, but current cloud platforms support only fixed resource allocation, that is, the user resource requirements are consistent throughout the usage period, which may cause a waste of resources and reduce the revenue of resource providers. Therefore, time-varying multidimensional resource allocation and the corresponding pricing mechanism represent a new challenge in cloud computing. We address the problem of online time-varying multidimensional resource allocation and pricing in clouds. Specifically, (1) we propose a novel integer programming model for the time-varying multidimensional resource allocation problem and (2) we design a truthful online auction mechanism for resource allocation in a competitive environment. For the resource allocation algorithm, we propose a waiting period strategy and dominant-resource-based strategy to improve the social welfare and resource utilization. Simultaneously, a payment pricing algorithm based on critical value theory is proposed. Finally, we prove that the mechanism is truthful and individual rationality. Compared with existing research, our approach is characterized by high social welfare, high resource utilization and short execution time.
dc.language	en
dc.publisher	Elsevier BV
dc.relation.ispartof	Future Generation Computer Systems
dc.relation.isbasedon	10.1016/j.future.2020.04.029
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0803 Computer Software, 0805 Distributed Computing, 0806 Information Systems
dc.subject.classification	Distributed Computing
dc.title	An online auction mechanism for time-varying multidimensional resource allocation in clouds
dc.type	Journal Article
utslib.citation.volume	111
utslib.for	0803 Computer Software
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2020-10-31T05:35:36Z
pubs.publication-status	Published
pubs.volume	111

Abstract:

© 2020 Elsevier B.V. Multidimensional resource allocation is a hot topic in cloud computing, but current cloud platforms support only fixed resource allocation, that is, the user resource requirements are consistent throughout the usage period, which may cause a waste of resources and reduce the revenue of resource providers. Therefore, time-varying multidimensional resource allocation and the corresponding pricing mechanism represent a new challenge in cloud computing. We address the problem of online time-varying multidimensional resource allocation and pricing in clouds. Specifically, (1) we propose a novel integer programming model for the time-varying multidimensional resource allocation problem and (2) we design a truthful online auction mechanism for resource allocation in a competitive environment. For the resource allocation algorithm, we propose a waiting period strategy and dominant-resource-based strategy to improve the social welfare and resource utilization. Simultaneously, a payment pricing algorithm based on critical value theory is proposed. Finally, we prove that the mechanism is truthful and individual rationality. Compared with existing research, our approach is characterized by high social welfare, high resource utilization and short execution time.

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

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