An Efficient Virtual Machine Placement via Bin Packing in Cloud Data Centers
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.
KeywordsCloud computing Particle swarm optimization Levy flight algorithm Virtual machine placement Variable sized bin packing
- 2.Guo, Y., Stolyar, A., Walid, A.: Online VM auto-scaling algorithms for application hosting in a cloud. IEEE Trans. Cloud Comput. (2018, accepted)Google Scholar
- 4.Abdel-Basset, M., Abdle-Fatah, L., Sangaiah, A.K.: An improved Lévy based whale optimization algorithm for bandwidth-efficient virtual machine placement in cloud computing environment. Cluster Comput. 1–16 (2018)Google Scholar
- 9.Cao, Z., Lin, J., Wan, C., Song, Y., Zhang, Y., Wang, X.: Optimal cloud computing resource allocation for demand side management in smart grid. IEEE Trans. Smart Grid 8(4), 1943–1955 (2017)Google Scholar