An effective energy-efficient virtual machine placement using clonal selection algorithm

Virtual machine (VM) placement is a process of server consolidation at the same time optimizing tasks execution in an energy-efficient environment. This process occurs in data centre which manages a number of physical machines independently. In the past decade, many research investigating virtual ma...

Full description

Bibliographic Details
Published in:International Journal of Advanced Technology and Engineering Exploration
Main Author: Suliman S.I.; Nazman H.; Harun A.F.; Mohamad R.; Kassim M.; Rahman F.Y.A.; Wati Mohamad Yusof Y.
Format: Article
Language:English
Published: Accent Social and Welfare Society 2021
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103375681&doi=10.19101%2fijatee.2020.762129&partnerID=40&md5=54db0082bc4b39db5f382e3d04e781b8
Description
Summary:Virtual machine (VM) placement is a process of server consolidation at the same time optimizing tasks execution in an energy-efficient environment. This process occurs in data centre which manages a number of physical machines independently. In the past decade, many research investigating virtual machine placement problem have been conducted extensively. However, most of the research focus on the energy consumptions by physical machines in a data centre. In reality, communication activities inter and intra networks is also consuming energy that should be taken into the consideration when planning for VM placement. Therefore, these two types of energy should be considered and managed in parallel during the virtual machine placement execution in order to produce energy-efficient environment. In this paper, we propose the use of Clonal Selection Algorithm (CSA) in handling virtual machine placement task which takes into consideration energy consumptions in both servers and communication network in data centre. The obtained results from the simulations produced the lowest consumption of 2219 energy unit, thus highlighting the efficiency of the proposed algorithm on the tested problem instances of different types with different complexity. © 2021 Saiful Izwan Suliman et al.
ISSN:23945443
DOI:10.19101/ijatee.2020.762129