Interference-aware virtual machine placement in cloud computing systems

Cloud computing provides scalable computing and storage resources. These scalable resources can be dynamically organized as many virtual machines (VMs) to run user applications based on a pay-per-use basis. This paper investigates the interference-aware VM placement (IAVMP) problem. In addition to fully exploiting the resources of PMs, the IAVMP problem considers the quality of service (QoS) requirements of user applications and the VM interference reduction. We first formulate the IAVMP problem by an Integer Linear Programming (ILP) model to solve it optimally. Due to the computation complexity of the ILP model, we also propose a polynomial-time heuristic algorithm to efficiently solve the IAVMP problem. Finally, simulation experiments are performed to demonstrate the effectiveness of the proposed heuristic algorithm by comparing with other VM placement algorithms.