Evolutionary Optimal Virtual Machine Placement and Demand Forecaster for Cloud Computing

Cloud computing allows the users to efficiently and dynamically provision computing resources to meet their IT needs. Most cloud providers offer two types of payment plans to the user, i.e., reservation and on-demand. The reservation plan is typically cheaper than the on-demand plan but reservation plan has to be provisioned in advance. Reserving the resources would be straightforward if the actual computing demand (e.g., job processing) is known in advance. However, in reality, the actual computing demand can be observed only at the point of actual usage. Therefore, it is difficult to reserve the correct amount of resources during the reservation to meet the computing demands of the users. In this paper, we propose an evolutionary optimal virtual machine placement (EOVMP) algorithm with a demand forecaster. First, a demand forecaster predicts the computing demand. Then, EOVMP uses this predicted demand to allocate the virtual machines using reservation and on-demand plans for job processing. The performance of the proposed schemes is evaluated by simulations and numerical studies. The evaluation result shows that the EOVMP algorithm can provide the solution close to the optimal solution of stochastic integer programming (SIP) and the prediction of the demand forecaster is of reasonable accuracy.

[1]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[2]  Eric Sanlaville,et al.  Linear programming based algorithms for preemptive and non-preemptive RCPSP , 2007, Eur. J. Oper. Res..

[3]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[4]  Abdelhakim Hafid,et al.  Adaptive Resources Provisioning for Grid Applications and Services , 2008, 2008 IEEE International Conference on Communications.

[5]  Bu-Sung Lee,et al.  Optimal virtual machine placement across multiple cloud providers , 2009, 2009 IEEE Asia-Pacific Services Computing Conference (APSCC).

[6]  A. Zahariev.  Google App Engine , 2009 .

[7]  Jan Broeckhove,et al.  Cost-Optimal Scheduling in Hybrid IaaS Clouds for Deadline Constrained Workloads , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[9]  William J. O'Brien,et al.  Resource-Constrained Project Scheduling: Past Work and New Directions 1 , 2001 .

[10]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[11]  Marcel Mongeau,et al.  Event-based MILP models for resource-constrained project scheduling problems , 2011, Comput. Oper. Res..

[12]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[13]  Bai Wang,et al.  A Dynamic Price Model with Demand Prediction and Task Classification in Grid , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  J. L. Roux.  An Introduction to the Kalman Filter , 2003 .

[16]  Eugene Ciurana,et al.  Google App Engine , 2009 .

[17]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[18]  Greg Welch,et al.  An Introduction to Kalman Filter , 1995, SIGGRAPH 2001.