Deadlock-free migration for virtual machine consolidation using Chicken Swarm Optimization algorithm

F. Tian, R. Zhang, Jacek Lewandowski, Kuo-Ming Chao, L. Li, B. Dong

Research output: Contribution to journalArticle

9 Citations (Scopus)
74 Downloads (Pure)

Abstract

Consolidation of services is one of the key problems in cloud data centers. It consists of two separate but related issues: Virtual machine (VM) placement and VM migration problems. In this paper, a VM consolidation scheme is proposed that turns the virtual machine consolidation (VMC) problem into a vector packing optimization problem based on deadlock-free migration (DFM) to minimize the energy consumptions. To solve this NP-hard and computationally infeasible for large data centers problem, a novel algorithm named Chicken Swarm Optimization based on deadlock-free migration (DFM-CSO) algorithm is proposed. The DFM-CSO algorithm is characterized by the ‘one-step look-ahead with n-VMs migration in parallel (OSLA-NVMIP)’ method, which carries out the VM migration validation and the rearrangement of target physical host, as well as records the migration order for each solution placement, so that VM transfer can be completed according to the migration sequence. The experimental results, for both real and synthetic datasets, show that the proposed algorithm with higher convergence rate is favourable in comparison with the other deadlock-free migration algorithms.
Original languageEnglish
Pages (from-to)1389-1400
Number of pages11
JournalJournal of Intelligent & Fuzzy Systems
Volume32
Issue number2
DOIs
Publication statusPublished - 17 Nov 2016

Bibliographical note

The final publication is available at IOS Press through http://dx.doi.org/10.3233/JIFS-169136

Keywords

  • VM consolidation
  • VM placement
  • deadlock-free migration
  • Chicken Swarm Optimization

Fingerprint Dive into the research topics of 'Deadlock-free migration for virtual machine consolidation using Chicken Swarm Optimization algorithm'. Together they form a unique fingerprint.

  • Cite this