Time-Aware VM-Placement and Routing with Bandwidth Guarantees in Green Cloud Data Centers

Variation in network performance due to the shared resources is a key obstacle for cloud adoption. Thus, the success of cloud providers to attract more tenants depends on their ability to provide bandwidth guarantees. Power efficiency in data centers has become critically important for supporting larger number of tenants. In this paper, we address the problem of time-aware VM-placement and routing (TVPR), where each tenant requests for a specified amount of server resources (VMs) and network resource (bandwidth) for a given duration. The TVPR problem allocates the required resources for as many tenants as possible by finding the right set of servers to map their VMs and routing their traffic so as to minimize the total power consumption. We propose a multi-component utilization-based power model to determine the total power consumption of a data center according to the resource utilization of the components (servers and switches). We then develop a mixed integer linear programming (MILP) optimization problem formulation based on the proposed power model and prove it to be N P-complete. Since the TVPR problem is computationally prohibitive, we develop a fast and scalable heuristic algorithm. To demonstrate the efficiency of our proposed algorithm, we compare its performance with the numerical results obtained by solving the MILP problem using CPLEX, for a small data center. We then demonstrate the effectiveness of the proposed algorithm in terms of power consumption and acceptance ratio for large data centers through simulation results.