In this paper, we introduce a generalization of the vector bin packing problem, where the bins have variable sizes. This generalization can be used to model virtual machine placement problems. In particular, we study the machine reassignment problem. We propose several greedy heuristics for the variable size vector bin packing problem and show that they are flexible and can be adapted to handle...

Recently, the virtual machine allocation problem, in which virtual machines must be allocated to physical machines in cloud data centers, has received a lot of attention. This is a very complex optimization problem with many possible formulations. In order to foster the clear definition of problem variants and the comparability of algorithms to solve those problem formulations, this paper intro...

Abstract In cloud computing, there is a trade-off between SLAV (Service Level Agreement Violation) and system operating cost. Violation rates can be decreased when using more hosts, which increases costs. Therefore, to manage the resources of those hosts efficiently, finding an optimal balancing point cost critical. addition, cost-effective load approach based on proper migration VMs (Virtual M...

Cloud computing enables cloud providers to outsource their Information Technology (IT) services from data centers in a pay-as-you-go model. However, infrastructure comprises virtualized physical resources that consume huge amount of energy and emits carbon footprints environment. Hence, there should be focus on optimal assignment Virtual Machines (VM) Physical (PM) ensure the efficiency service...

Live Migration is one of the essential operations that require more attention to addressing its high variability problems with virtual machines. We review the existing techniques of resource management to find that there are less modeling to solve this problem. The present paper introduces a novel framework that mainly targets to achieve a computational effective resource management technique. ...