Abstract
We address the problem of online virtual machine (VM) provisioning and allocation with multiple types of resources. Formulating this problem in an auction-based setting, we propose an accurate mathematical model incorporating the ability to preempt and resume a given task for the sake of best overall use of resources. Our objective is to efficiently provide and allocate multiple VMs to maximize social welfare and encourage users to declare truthful requests. We first design an offline optimal mechanism based on the VCG mechanism; this mechanism has full knowledge of all users and offers ideal solutions. We also design an online greedy mechanism that considers only current knowledge while offering near-optimal solutions instead. Our proposed greedy mechanism consists of winner determination and payment algorithms. Furthermore, we show that the winner determination algorithm is monotonic and that the payment algorithm implements the critical payment. Both our allocation methods offer incentives to users providing true values for the sake of obtaining the best utility. We performed extensive experiments to investigate the performance of our proposed greedy mechanism compared to the optimal mechanism. Experimental results demonstrate that our proposed greedy mechanism obtains near-optimal solutions in a reasonable time.
Similar content being viewed by others
Data availability
The datasets used or analysed during the current study are available from the corresponding author on reasonable request.
References
Azizi, S., Zandsalimi, M., Li, D.: An energy-efficient algorithm for virtual machine placement optimization in cloud data center. Clust. Comput. 23, 3421–3434 (2020)
Ray, B.K., Saha, A., Khatua, S., Roy, S.: Toward maximization of profit and quality of cloud federation: solution to cloud federation formation problem. J. Supercomput. 75, 885–929 (2019)
Amazon EC2 Instances. http://aws.amazon.com/cn/ec2. Access 12 Feb (2017)
Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16, 8–37 (1961)
Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)
Groves, T.: Incentives in teams. Econometrica 41(4), 617–631 (1973)
Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166–196 (2001)
Lehmann, D., O’callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577–602 (2002)
Kantere, V., Dash, D., Francois, G., Kyriakopoulou, S., Ailamaki, A.: Optimal service pricing for a cloud cache. IEEE Trans. Knowl. Data Eng. 23(9), 1345–1358 (2011)
Wang, Y., Nakao, A., Vasilakos, V.A.: Heterogeneity playing key role: modeling and analyzing the dynamics of incentive mechanisms in autonomous networks. ACM Trans. Autonomous Adapt. Syst. 7(3), 1–25 (2012)
Nejad, M.M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans. Parall. Distrib. Syst. 26(2), 594–603 (2015)
Mashayekhy, L., Nejad, M.M., Grosu, D.: Physical machine resource management in clouds: a mechanism design approach. IEEE Trans. Cloud Comput. 3(3), 247–260 (2015)
Middya, A.I., Ray, B., Roy, S.: Auction based resource allocation mechanism in federated cloud environment: TARA. IEEE Trans. Serv. Comput. (2019). https://doi.org/10.1109/TSC.2019.2952772
Liu, X., Liu, J.: A truthful double auction mechanism for multi-resource allocation in crowd sensing systems. IEEE Trans. Serv. Comput. (2021). https://doi.org/10.1109/TSC.2021.3075541
Kumar, D., Baranwal, G., Raza, Z., Vidyarthi, P.D.: A truthful combinatorial double auction-based marketplace mechanism for cloud computing. J. Syst. Softw. 140, 91–108 (2018)
Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parall. Distrib. Syst. 29(7), 1650–1663 (2018)
Ray, K.B., Saha, A., Khatua, S., Roy, S.: Quality and profit assured trusted cloud federation formation: game theory based approach. IEEE Trans. Serv. Comput. 14(3), 805–819 (2021)
Lu, L., Yu, J., Zhu, Y., Li, M.: A double auction mechanism to bridge users task requirements and providers resources in two-sided cloud markets. IEEE Trans. Parall. Distrib. Syst. 29(4), 720–733 (2018)
Patel, Y.S., Malwi, Z., Nighojkar, A., Misra, R.: Truthful online double auction based dynamic resource provisioning for multi-objective trade-offs in IaaS clouds. Clust. Comput. 24, 1855–1879 (2021)
Shi, W., Zhang, L., Wu, C., Li, Z., Lau, F.C.M.: An online auction framework for dynamic resource provisioning in cloud computing. IEEE/ACM Trans. Netw. 24(4), 2060–2073 (2016)
Mashayekhy, L., Nejad, M.M., Grosu, D., Vasilakos, V.A.: An online mechanism for resource allocation and pricing in clouds. IEEE Transact. Comput. 65(4), 1172–1184 (2015)
Zaman, S., Grosu, D.: An online mechanism for dynamic VM provisioning and allocation in clouds. In: Proceeding of \(2012\) IEEE fifth international conference on cloud computing. Honolulu (2012)
Zhou, R., Li, Z., Wu, C., Huang, Z.: An efficient cloud market mechanism for computing jobs with soft deadlines. IEEE/ACM Trans. Netw. 25(2), 793–805 (2017)
Zhang, H., Jiang, H., Li, B., Liu, F., Vasilakos, A.V., Liu, J.: A framework for truthful online auctions in cloud computing with heterogeneous user demands. IEEE Trans. Comput. 65(3), 805–818 (2016)
Chen, X., Hu, X., Liu, Y.T., Ma, W., Qin, T., Tang, P., Wang, C., Zheng, B.: Efficient mechanism design for online scheduling. J. Artif. Intell. Res. 56, 1–5 (2016)
Hajiaghayi, M.T.: Online auctions with re-usable goods. In: Proceeding of the sixth ACM conferenceon electronic on electronic commerce, pp. 165–174. Association for Computing Machinery, New York (2005)
Mu’Alem, A., Nisanb, N.: Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ. Behav. 64(2), 612–631 (2008)
IBM ILOG CPLEX Optimizer.: https://www.ibm.com/analytics/cplex-optimizer. Access 15 Feb (2017)
Grid Workloads Archive.: http://gwa.ewi.tudelft.nl. Access 12 Feb (2014)
Archer, A., Tardos, É.: Frugal path mechanisms. ACM Trans. Algorithms 3(1), 15 (2007)
Titan.: http://www.olcf.ornl.gov/titan/. Access 15 Feb (2016)
Top 500 Supercomputers.: http://www.top500.org. Access 15 Feb (2016)
Acknowledgements
This work was supported in part by the Chinese Natural Science Foundation under Grant 11361048, in part by the Yunnan Natural Science Foundation under Grant 2017FH001-014, in part by the Yunnan Science Foundation under Grant 2019J0613, and in part by the Qujing Normal University Science Foundation under Grant ZDKC2016002.
Author information
Authors and Affiliations
Contributions
All authors contributed to the study conception and design. Material preparation, data collection, and analysis were performed by Xi Liu and Jun Liu. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare there is no conflicts of interest regarding the publication of this paper. The manuscript has been submitted solely to this journal and is not published, in press, or submitted elsewhere.
Ethical approval
The manuscript does not include human or animal research.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Liu, X., Liu, J. A truthful online mechanism for virtual machine provisioning and allocation in clouds. Cluster Comput 25, 1095–1109 (2022). https://doi.org/10.1007/s10586-021-03499-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-021-03499-7