Paper Info
Title
Many-Objective Virtual Machine Placement.
Abstract
The process of selecting which virtual machines (VMs) should be executed at each physical machine (PM) of a virtualized infrastructure is commonly known as Virtual Machine Placement (VMP). This work presents a general many-objective optimization framework that is able to consider as many objective functions as needed when solving a VMP problem in a pure multi-objective context. As an example of utilization of the proposed framework, a formulation of a many-objective VMP problem (MaVMP) is proposed, considering the simultaneous optimization of the following five objective functions: (1) power consumption, (2) network traffic, (3) economical revenue, (4) quality of service and (5) network load balancing. To solve the formulated MaVMP problem, an interactive memetic algorithm is proposed. Experimental results prove the correctness of the proposed algorithm, its effectiveness converging to a manageable number of solutions and its capabilities to solve problem instances with large numbers of PMs and VMs.
Year
DOI
Venue
2017
10.1007/s10723-017-9399-x
J. Grid Comput.
Keywords
Field
DocType
Virtual machine placement,Many-objective optimization,Memetic algorithm,Interactive algorithm,Cloud computing,Resource allocation
Memetic algorithm,Revenue,Mathematical optimization,Virtual machine,Network Load Balancing,Computer science,Correctness,Quality of service,Resource allocation,Cloud computing,Distributed computing
Journal
Volume
Issue
ISSN
15
2
1570-7873
Citations 
PageRank 
References 
12
0.53
16
Authors
2
Name
Order
Citations
PageRank
Fabio López Pires1725.81
Benjamín Barán257247.27