Name
Abstract | ||
|---|---|---|
This paper presents for the first time a formulation of the Virtual Machine Placement as a Many-Objective problem (MaVMP), considering the simultaneous optimization of the following five objective functions for dynamic environments: (1) power consumption, (2) inter-VM network traffic, (3) economical revenue, (4) number of VM migrations and (5) network traffic overhead for VM migrations. To solve the formulated MaVMP problem, a novel Memetic Algorithm is proposed. As a potentially large number of feasible solutions at any time is one of the challenges of MaVMP, five selection strategies are evaluated in order to automatically select one solution at each time. The proposed algorithm with the considered selection strategies were evaluated in two different scenarios. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/UCC.2015.22 | 2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC) |
Keywords | Field | DocType |
Virtual Machine Placement,Many-Objective Optimization,Cloud Computing,Memetic Algorithm | Memetic algorithm,Revenue,Virtual machine,Computer science,Minification,Memory management,Linear programming,Cloud computing,Power consumption,Distributed computing | Conference |
ISSN | Citations | PageRank |
2373-6860 | 6 | 0.45 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego Ihara | 1 | 6 | 0.45 |
| Fabio López Pires | 2 | 72 | 5.81 |
| Benjamín Barán | 3 | 572 | 47.27 |