Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing
Virtual machine allocation is a core problem in cloud computing. Most cloud computing platforms allow users to submit one requirement, which does not satisfy the diversity of user demands and also reduces the incomes of the platform. We propose a novel model, called multi-choice virtual machine allocation (MCVMA) with time windows, where the users can enter and leave the system at any time and submit multiple requirements. We design an optimal algorithm based on dynamic programming and a heuristic algorithm based on the resource scarcity and density for the MCVMA problem with time windows. We experimentally analyze both algorithms in terms of social welfare, execution time, resource utilization and users served.
KeywordsCloud computing Multiple requirements Heuristic algorithm Online Virtual resource allocation
The authors thank IBM for providing the full version of CPLEX12, which sets no limitations for solving for the optimal solution. This research is supported by the National Natural Science Foundation of China (61472345, 61662088 and 11663007), the Project of Natural Science Foundation of Yunnan Province of China (2014FA023, 2015FB115), and the Scientific Research Foundation of Yunnan Provincial Department of Education (2017ZZX228).
- 1.Amazon: Amazon ec2 instance types. https://amazonaws-china.com/cn/ec2/instance-types/
- 4.ASCI: Grid workloads archives. http://gwa.ewi.tudelft.nl
- 6.Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. https://doi.org/10.1109/tpds.2017.2785815