Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Strategy-proof mechanism for time-varying batch virtual machine allocation in clouds

Published: 01 December 2021 Publication History

Abstract

Time-varying resource allocation allows users to define their own unique resource requirement plans during different time periods. This mode of allocation can increase the flexibility of resource usage and reduce resource usage costs for users. Moreover, combining this approach with an auction mechanism can enable resource providers to obtain greater social welfare and benefits; therefore, such resource allocation has become a hot topic in cloud computing. This paper addresses the problem of time-varying batch virtual machine (VM) allocation and pricing in the cloud. Specifically, (1) we propose a novel integer programming model for the time-varying batch VM allocation problem, and (2) we design two truthful auction mechanisms to solve the allocation and pricing problem in a competitive environment. The optimal mechanism includes a dynamic programming (DP)-based resource allocation algorithm and a Vickrey–Clarke–Groves (VCG)-based payment price algorithm. Meanwhile, we also design a greedy mechanism that includes a dominant-resource-based allocation algorithm and a dichotomy-based payment price algorithm. We prove the economic characteristics, including truthfulness and individual rationality, of the above two mechanisms. Furthermore, we prove the approximation ratio of the allocation algorithm in the greedy mechanism. Compared to state-of-the-art research, our approach is characterized by high social welfare, a high served user ratio and a short execution time.

References

[1]
Alhumaima RS, Ahmed RK, and Al-Raweshidy HS Maximizing the energy efficiency of virtualized c-ran via optimizing the number of virtual machines IEEE Trans. Green Commun. Netw. 2018 2 4 992-1001
[2]
Alibaba (2020) Alibaba cloud. [Online]. https://www.aliyun.com/product/batchcompute
[3]
Alibaba (2020) Alibaba cloud. [Online]. https://tianchi.aliyun.com/home/
[4]
Angelelli E and Filippi C On the complexity of interval scheduling with a resource constraint Theor. Comput. Sci. 2011 412 29 3650-3657
[5]
Angelelli E, Bianchessi N, and Filippi C Optimal interval scheduling with a resource constraint Comput. Oper. Res. 2014 51 268-281
[6]
Guo L and Shen H Efficient approximation algorithms for the bounded flexible scheduling problem in clouds IEEE Trans. Parallel Distrib. Syst. 2017 28 12 3511-3520
[7]
He J, Zhang D, Zhou Y, and Zhang Y A truthful online mechanism for collaborative computation offloading in mobile edge computing IEEE Trans. Industr. Inf. 2020 16 7 4832-4841
[8]
Hieu NT, Francesco MD, and Yla-Jaaski A Virtual machine consolidation with multiple usage prediction for energy-efficient cloud data centers IEEE Trans. Serv. Comput. 2020 13 1 186-199
[9]
Jiao Y, Wang P, Niyato D, and Suankaewmanee K Auction mechanisms in cloud/fog computing resource allocation for public blockchain networks IEEE Trans. Parallel Distrib. Syst. 2019 30 9 1975-1989
[10]
Li K Optimal temporal partitioning of a multicore server processor for virtual machine allocation IEEE Access 2018 6 54726-54738
[11]
Li Q, Zhao L, Gao J, Liang H, Zhao L, and Tang X Smdp-based coordinated virtual machine allocations in cloud-fog computing systems IEEE Internet Things J. 2018 5 3 1977-1988
[12]
Liu X, Li W, and Zhang X Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds IEEE Trans. Parallel Distrib. Syst. 2018 29 7 1650-1663
[13]
Mashayekhy L, Nejad M, and Grosu D A ptas mechanism for provisioning and allocation of heterogeneous cloud resources IEEE Trans. Parallel Distrib. Syst. 2015 26 9 2386-2399
[14]
Mashayekhy L, Fisher N, and Grosu D Truthful mechanisms for competitive reward-based scheduling IEEE Trans. Comput. 2016 65 7 2299-2312
[15]
Mashayekhy L, Nejad M, Grosu D, and Vasilakos A An online mechanism for resource allocation and pricing in clouds IEEE Trans. Comput. 2016 65 4 1172-1184
[16]
Nejad M, Mashayekhy L, and Grosu D Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds IEEE Trans. Parallel Distrib. Syst. 2015 26 2 594-603
[17]
Nisan T, Roughgarden E, Tardos E, and Vazirani V Algorithmic Game Theory 2007 Cambridge Cambridge Univ. Press
[18]
Pahlevan A, Qu X, Zapater M, and Atienza D Integrating heuristic and machine-learning methods for efficient virtual machine allocation in data centers IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018 37 8 1667-1680
[19]
Shi W, Zhang L, Wu C, Li Z, and Francis C An online auction framework for dynamic resource provisioning in cloud computing IEEE/ACM Trans. Netw. 2014 42 1 71-83
[20]
Skutella M and Verschae J Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures Math. Oper. Res. 2016 41 3 991-1021
[21]
Song W, Xiao Z, Chen Q, and Luo H Adaptive resource provisioning for the cloud using online bin packing IEEE Trans. Comput. 2014 63 11 2647-2660
[22]
Tang, X., Li, Y., Ren, R., Cai, W.: On first fit bin packing for online cloud server allocation. In: IEEE International Parallel and Distributed Processing Symposium, pp. 323–332 (2016)
[23]
Wang W, Liang B, and Li B Multi-resource fair allocation in heterogeneous cloud computing systems IEEE Trans. Parallel Distrib. Syst. 2014 28 10 2822-2836
[24]
Wu Q and Hao J A clique-based exact method for optimal winner determination in combinatorial auctions Inf. Sci. 2016 334 103-121
[25]
Yadav R, Zhang W, Li K, Liu C, and Laghari AA Managing overloaded hosts for energy-efficiency in cloud data centers Clust. Comput. 2021
[26]
Yadav R, Zhang W, Li K, Liu C, and Karn NK An adaptive heuristic for managing energy consumption and overloaded hosts in a cloud data center Wireless Netw. 2020 26 1905-1919
[27]
Yadav R, Zhang W, Kaiwartya O, Singh PR, Elgendy IA, and Tian Y Adaptive energy-aware algorithms for minimizing energy consumption and SLA violation in cloud computing IEEE Access 2020 6 55923-55936
[28]
Yadav R and Zhang W MeReg: managing energy-SLA tradeoff for green mobile cloud computing Wirel. Commun. Mob. Comput. 2017 2017 1-11
[29]
Yadav, R., Zhang, W., Chen, H., Guo, T. MuMs: Energy-Aware VM selection scheme for cloud data center. In: 2017 28th International Workshop on Database and Expert Systems Applications (DEXA) 2017, pp. 132–136 (2017)
[30]
Yao W, Shen Y, and Wang D A weighted pagerankbased algorithm for virtual machine placement in cloud computing IEEE Access 2019 7 176369-176381
[31]
Zaman S and Grosu D A combinatorial auctionbased mechanism for dynamic vm provisioning and allocation in clouds IEEE Trans. Cloud Comput. 2013 1 2 129-141
[32]
Zhang J, Xie N, Li W, Yue K, and Zhang X Truthful multi requirements auction mechanism for virtual resource allocation of cloud computing J. Electron. Inf. Technol. 2018 40 1 25-34
[33]
Zhang J, Xie N, Zhang X, and Li W An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost Futur. Gener. Comput. Syst. 2018 89 286-299
[34]
Zhang J, Xie N, Zhang X, Athanasios V, and Li W An online auction mechanism for time-varying multidimensional resource allocation in clouds Futur. Gener. Comput. Syst. 2020 111 27-38
[35]
Zhang, X., Huang, Z., Wu, C., Li, Z., Francis, C.: Online auctions in iaas clouds: welfare and profit maximization with server costs. In: IEEE/ACM Transactions on Networking, pp 1034–1047 (2015)
[36]
Zhang X, Wu C, Li Z, and Lau FCM A truthful (1−ε)-optimal mechanism for on-demand cloud resource provisioning IEEE Trans. Cloud Comput. 2020 8 3 735-748
[37]
Zhou H, Bai G, and Deng S Optimal interval scheduling with nonidentical given machines Clust. Comput. 2019 22 1007 1015
[38]
Zhou R, Li Z, Wu C, and Huang Z An efficient cloud market mechanism for computing jobs with soft deadlines IEEE/ACM Trans. Netw. 2017 25 2 793-805

Cited By

View all
  • (2024)A resource competition-based truthful mechanism for IoV edge computing resource allocation with a lowest revenue limitJournal of Cloud Computing: Advances, Systems and Applications10.1186/s13677-023-00572-x13:1Online publication date: 10-Jan-2024
  • (2023)A dueling DQN-based online resource allocation algorithm for cloud computingProceedings of the 2023 International Conference on Communication Network and Machine Learning10.1145/3640912.3640986(371-376)Online publication date: 27-Oct-2023
  • (2022)An online auction mechanism for double time-varying constraints in vehicular edge computingProceedings of the 2022 6th International Conference on Computer Science and Artificial Intelligence10.1145/3577530.3577570(249-257)Online publication date: 9-Dec-2022

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Cluster Computing
Cluster Computing  Volume 24, Issue 4
Dec 2021
1105 pages

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 December 2021
Accepted: 11 July 2021
Revision received: 16 June 2021
Received: 11 November 2020

Author Tags

  1. Cloud computing
  2. Time-varying batch VM allocation
  3. Truthful mechanism
  4. Dominant resources
  5. Approximation algorithm

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A resource competition-based truthful mechanism for IoV edge computing resource allocation with a lowest revenue limitJournal of Cloud Computing: Advances, Systems and Applications10.1186/s13677-023-00572-x13:1Online publication date: 10-Jan-2024
  • (2023)A dueling DQN-based online resource allocation algorithm for cloud computingProceedings of the 2023 International Conference on Communication Network and Machine Learning10.1145/3640912.3640986(371-376)Online publication date: 27-Oct-2023
  • (2022)An online auction mechanism for double time-varying constraints in vehicular edge computingProceedings of the 2022 6th International Conference on Computer Science and Artificial Intelligence10.1145/3577530.3577570(249-257)Online publication date: 9-Dec-2022

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media