An Efficient Virtual Machine Placement via Bin Packing in Cloud Data Centers

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Virtual machine (VM) consolidation is an intelligent and efficient strategy to balance the load of cloud data centers. VM consolidation includes a most important subproblem, i.e., VM placement problem. The basic objective of VM placement is to minimize the use of running physical machines (PMs). An enhanced levy based particle swarm optimization algorithm with variable sized bin packing (PSOLBP) is proposed for solving VM placement problem. Moreover, the best fit strategy is also used with the variable sized bin packing problem (VSBPP). Simulations are performed to check the performance of the proposed algorithm. The proposed algorithm is compared with simple particle swarm optimization (PSO) and the hybrid of levy flight and particle swarm optimization (LFPSO). The proposed algorithm efficiently minimized the number of running PMs. Matlab is used for simulations.

Cite

CITATION STYLE

APA

Fatima, A., Javaid, N., Sultana, T., Aalsalem, M. Y., Shabbir, S., & Durr-e-Adan. (2020). An Efficient Virtual Machine Placement via Bin Packing in Cloud Data Centers. In Advances in Intelligent Systems and Computing (Vol. 926, pp. 977–987). Springer Verlag. https://doi.org/10.1007/978-3-030-15032-7_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free