Intelligent Virtual Machine Provisioning in Cloud Computing

Virtual machine (VM) provisioning is a common and critical problem in cloud computing. In industrial cloud platforms, there are a huge number of VMs provisioned per day. Due to the complexity and resource constraints, it needs to be carefully optimized to make cloud platforms effectively utilize the resources. Moreover, in practice, provisioning a VM from scratch requires fairly long time, which would degrade the customer experience. Hence, it is advisable to provision VMs ahead for upcoming demands. In this work, we formulate the practical scenario as the predictive VM provisioning (PreVMP) problem, where upcoming demands are predicted in advance, and then the VM provisioning plan is optimized based on predicted demands. Further, we propose Uncertainty-Aware Heuristic Search (UAHS) for PreVMP. UAHS first models the prediction uncertainty, and then utilizes the prediction uncertainty in optimization. Moreover, UAHS leverages Bayesian optimization to interact prediction and optimization to improve its performance. Extensive experiments show that UAHS performs much better than state-of-the-art competitors on two public real-world datasets and an industrial dataset. UAHS has been successfully applied in an industrial public cloud platform and brought practical benefits in real-world applications.

[1]  Ming Mao,et al.  A Performance Study on the VM Startup Time in the Cloud , 2012, 2012 IEEE Fifth International Conference on Cloud Computing.

[2]  James Bailey,et al.  An Investigation into Prediction + Optimisation for the Knapsack Problem , 2019, CPAIOR.

[3]  George Athanasopoulos,et al.  Forecasting: principles and practice , 2013 .

[4]  M. V. Rossum,et al.  In Neural Computation , 2022 .

[5]  Tao Qin,et al.  Selling Reserved Instances in Cloud Computing , 2015, IJCAI.

[6]  James Bailey,et al.  Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions , 2019, IJCAI.

[7]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[8]  Tias Guns,et al.  Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems , 2019, AAAI.

[9]  Hui Zhao,et al.  Power-Aware and Performance-Guaranteed Virtual Machine Placement in the Cloud , 2018, IEEE Transactions on Parallel and Distributed Systems.

[10]  Nando de Freitas,et al.  Taking the Human Out of the Loop: A Review of Bayesian Optimization , 2016, Proceedings of the IEEE.

[11]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[12]  IEEE Transactions on Parallel and Distributed Systems, Vol. 13 , 2002 .

[13]  Shaowei Cai,et al.  Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.

[14]  Milind Tambe,et al.  Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization , 2018, AAAI.

[15]  Melvin J. Hinich,et al.  Time Series Analysis by State Space Methods , 2001 .

[16]  Taylor Francis Online,et al.  The American statistician , 1947 .

[17]  Shaowei Cai,et al.  Local Search with Efficient Automatic Configuration for Minimum Vertex Cover , 2019, IJCAI.

[18]  Kaile Su,et al.  New local search methods for partial MaxSAT , 2016, Artif. Intell..

[19]  J. Mockus Bayesian Approach to Global Optimization: Theory and Applications , 1989 .

[20]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[21]  Kui Wu,et al.  VMThunder: Fast Provisioning of Large-Scale Virtual Machine Clusters , 2014, IEEE Transactions on Parallel and Distributed Systems.

[22]  P. Young,et al.  Time series analysis, forecasting and control , 1972, IEEE Transactions on Automatic Control.

[23]  Kotagiri Ramamohanarao,et al.  Dynamic Programming for Predict+Optimise , 2020, AAAI.

[24]  Kaile Su,et al.  CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability , 2017, Artif. Intell..

[25]  P. Deb Finite Mixture Models , 2008 .

[26]  Maher Ben Jemaa,et al.  Using Decomposition and Local Search to Solve Large-Scale Virtual Machine Placement Problems with Disk Anti-Colocation Constraints , 2017, 2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA).

[27]  Abdul Sattar,et al.  NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover , 2014, J. Artif. Intell. Res..

[28]  Ricardo Bianchini,et al.  Resource Central: Understanding and Predicting Workloads for Improved Resource Management in Large Cloud Platforms , 2017, SOSP.

[29]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[30]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .