Abstract

The current trend in the computing era is cloud computing, which helps in providing seamless service to the user, but optimizing the utilization of the available resources and an efficient placement of the virtual machines are not so significant in the existing phenomena. Virtual machines are software computers that act as the key feature in providing services to the existing physical machine. VM placement is the process of mapping the virtual machine requests or images to the physical machines, according to the availability of resources in these hosts. Hence in this study, we have studied on various methods in which the placement are being done and have proposed an idea which, treats the available pool of physical resources as each knapsacks, which are solved using genetic algorithm, to get an optimal placement. Starting with this aspect, we enhanced the solution by considering multiple and multidimensional parameters in the virtual machine request, so that the migration of the virtual machines will be reduced and hence power-saving.

Keywords:

Bin packing, cloud computing, crossover, genetic algorithm, knapsack problem, migration, mutation, virtual machine placement , VM placement algorithms,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.