On the Consolidation of Data-Centers with Performance Constraints

  • Authors:
  • Jonatha Anselmi;Paolo Cremonesi;Edoardo Amaldi

  • Affiliations:
  • Politecnico di Milano, DEI, Milan, Italy I-20133;Politecnico di Milano, DEI, Milan, Italy I-20133;Politecnico di Milano, DEI, Milan, Italy I-20133

  • Venue:
  • QoSA '09 Proceedings of the 5th International Conference on the Quality of Software Architectures: Architectures for Adaptive Software Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the data-center consolidation problem: given a working data-center, the goal of the problem is to choose which software applications must be deployed on which servers in order to minimize the number of servers to use while avoiding the overloading of system resources and satisfying availability constraints. This in order to tradeoff between quality of service issues and data-center costs. The problem is approached through a robust model of the data-center which exploits queueing networks theory. Then, we propose two mixed integer linear programming formulations of the problem able to capture novel aspects such as workload partitioning (load-balancing) and availability issues. A simple heuristic is proposed to compute solutions in a short time. Experimental results illustrate the impact of our approach with respect to a real-world consolidation project.