Multiobjective Virtual Machine Placement Using Evolutionary Algorithm with Decomposition

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

Abstract

Virtual machine placement in a distributed cloud environment becomes more challenging due to the tradeoffs between multiple objectives. Placing a virtual machine to an appropriate physical machine must simultaneously minimize the objectives such as resource wastage, power consumption and network transmission delay. Minimizing an objective may have negative impact on some other objectives. A multiobjective optimization problem is to find a solution where all objective will attain optimality. With the evolution of solutions, the Multiobjective Evolutionary Algorithms has the potential to converge towards pareto-optimal solutions. In this paper, VM placement problem with multi-objectives is addressed using Evolutionary algorithm with Decomposition. The proposed algorithm is compared based on performance indicator such as spacing and ONGV with existing multiobjective Elitist algorithms (SPEA and NSGA-II) and Non-elitist algorithms (VEGA and MOGA) shows significant improvement.

Cite

CITATION STYLE

APA

Gopu, A., & Neelanarayanan, V. (2020). Multiobjective Virtual Machine Placement Using Evolutionary Algorithm with Decomposition. In Smart Innovation, Systems and Technologies (Vol. 164, pp. 149–162). Springer. https://doi.org/10.1007/978-981-32-9889-7_12

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