Many-objective optimization for virtual machine placement in cloud computing

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

Abstract

Resource allocation in cloud computing datacenters presents several research challenges, where the Virtual Machine Placement (VMP) is one of the most studied problems with several possible formulations considering a large number of existing optimization criteria. This chapter presents the main contributions that studied for the first time Many-Objective VMP (MaVMP) problems for cloud computing environments. In this context, two variants ofMaVMP problems were formulated and different algorithms were designed to effectively address existing research challenges associated to the resolution of Many-Objective Optimization Problems (MaOPs). Experimental results proved the correctness of the presented algorithms, its effectiveness in solving particular associated challenges and its capabilities to solve problem instances with large numbers of physical and virtual machines for: (1) MaVMP for initial placement of VMs (static) and (2) MaVMP with reconfiguration of VMs (semi-dynamic). Finally, open research problems for the formulation and resolution of MaVMP problems for cloud computing (dynamic) are discussed.

Cite

CITATION STYLE

APA

López-Pires, F., & Barán, B. (2017). Many-objective optimization for virtual machine placement in cloud computing. In Research Advances in Cloud Computing (pp. 291–326). Springer Singapore. https://doi.org/10.1007/978-981-10-5026-8_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