Research Area:  Cloud Computing

Abstract:

Virtual Machine (VM) placement consolidates VMs into a minimum number of Physical Machines (PMs), which can be viewed as a Vector Bin-Packing (VBP) problem. Recent literature reveals the significance of first-fit-decreasing variants in solving VBP problems, however they suffer from reduced packing efficiency and delayed packing speed. This paper presents VM NeAR (VM Nearest and Available to Residual resource ratios of PM), a novel heuristic method to address the above said challenges in VBP. Further, we have developed Bulk-Bin-Packing based VM Placement (BBPVP) and Multi-Capacity Bulk VM Placement (MCBVP) as a solution for VBP. The simulation results on real-time Amazon EC2 dataset and synthetic datasets obtained from CISH, SASTRA shows that VM NeAR based MCVBP achieves about 1.6% reduction in the number of PMs and possess a packing speed which was found to be 24 times faster than exisiting state-of-the-art VBP heuristics.

Keywords:  

Author(s) Name:  SaikishorJangiti and ShankarSriram. V.S

Publisher name:  ELSEVIER

DOI:  10.1016/j.compeleceng.2018.03.029

Volume Information:  Volume 68, May 2018, Pages 44-61

Paper Link:   https://www.sciencedirect.com/science/article/abs/pii/S0045790617312168