Improved multiobjective salp swarm optimization for virtual machine placement in cloud computing
Open Access
- 9 April 2019
- journal article
- research article
- Published by Springer Nature in Human-centric Computing and Information Sciences
- Vol. 9 (1) , 1-24
Abstract
In data center companies, cloud computing can host multiple types of heterogeneous virtual machines (VMs) and provide many features, including flexibility, security, support, and even better maintenance than traditional centers. However, some issues need to be considered, such as the optimization of energy usage, utilization of resources, reduction of time consumption, and optimization of virtual machine placement. Therefore, this paper proposes an alternative multiobjective optimization (MOP) approach that combines the salp swarm and sine-cosine algorithms (MOSSASCA) to determine a suitable solution for virtual machine placement (VMP). The objectives of the proposed MOSSASCA are to maximize mean time before a host shutdown (MTBHS), to reduce power consumption, and to minimize service level agreement violations (SLAVs). The proposed method improves the salp swarm and the sine-cosine algorithms using an MOP technique. The SCA works by using a local search approach to improve the performance of traditional SSA by avoiding trapping in a local optimal solution and by increasing convergence speed. To evaluate the quality of MOSSASCA, we perform a series of experiments using different numbers of VMs and physical machines. The results of MOSSASCA are compared with well-known methods, including the nondominated sorting genetic algorithm (NSGA-II), multiobjective particle swarm optimization (MOPSO), a multiobjective evolutionary algorithm with decomposition (MOEAD), and a multiobjective sine-cosine algorithm (MOSCA). The results reveal that MOSSASCA outperforms the compared methods in terms of solving MOP problems and achieving the three objectives. Compared with the other methods, MOSSASCA exhibits a better ability to reduce power consumption and SLAVs while increasing MTBHS. The main differences in terms of power consumption between the MOSCA, MOPSO, MOEAD, and NSGA-II and the MOSSASCA are 0.53, 1.31, 1.36, and 1.44, respectively. Additionally, the MOSSASCA has higher MTBHS value than MOSCA, MOPSO, MOEAD, and NSGA-II by 362.49, 274.70, 585.73 and 672.94, respectively, and the proposed method has lower SLAV values than MOPSO, MOEAD, and NSGA-II by 0.41, 0.28, and 1.27, respectively.Keywords
This publication has 73 references indexed in Scilit:
- A multi-objective ant colony system algorithm for virtual machine placement in cloud computingJournal of Computer and System Sciences, 2013
- Flower pollination algorithm: A novel approach for multiobjective optimizationEngineering Optimization, 2013
- Energy and transition-aware runtime task scheduling for multicore processorsJournal of Parallel and Distributed Computing, 2013
- Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computingFuture Generation Computer Systems, 2012
- Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centersConcurrency and Computation: Practice and Experience, 2011
- CoMonACM SIGOPS Operating Systems Review, 2006
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Self-Adaptive Genetic Algorithms with Simulated Binary CrossoverEvolutionary Computation, 2001
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997