On the Consolidation of Data-Centers with Performance Constraints

  • Jonatha Anselmi
  • Paolo Cremonesi
  • Edoardo Amaldi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5581)


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.


Server Utilization Mixed Integer Linear Programming Performance Constraint Service Demand Deployment Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anselmi, J., Amaldi, E., Cremonesi, P.: Service consolidation with end-to-end response time constraints. In: Software Engineering and Advanced Applications, 2008. SEAA 2008. 34th Euromicro Conference, September 3-5, pp. 345–352 (2008)Google Scholar
  2. 2.
    Baskett, F., Chandy, K., Muntz, R., Palacios, F.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2), 248–260 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bichler, M., Setzer, T., Speitkamp, B.: Capacity planning for virtualized servers. In: Proceedings of the Workshop on Information Technologies and Systems, Milwaukee, Wisconsin, USA (2006)Google Scholar
  4. 4.
    Cardellini, V., Casalicchio, E., Grassi, V., Mirandola, R.: A framework for optimal service selection in broker-based architectures with multiple qos classes. In: SCW 2006: Proceedings of the IEEE Services Computing Workshops, pp. 105–112. IEEE Computer Society, Washington (2006)CrossRefGoogle Scholar
  5. 5.
    Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press (November 2002)Google Scholar
  6. 6.
    Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C.: Quantitative system performance: computer system analysis using queueing network models. Prentice-Hall, Inc., Upper Saddle River (1984)Google Scholar
  7. 7.
    Liu, Z., Wynter, L., Xia, C.H., Zhang, F.: Parameter inference of queueing models for it systems using end-to-end measurements. Perform. Eval. 63(1), 36–60 (2006)CrossRefGoogle Scholar
  8. 8.
    Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0-1 knapsack problem (1997)Google Scholar
  9. 9.
    Menasce, D.A.: Virtualization: Concepts, applications, and performance modeling. The volgenau school of information technology and engineering (2005)Google Scholar
  10. 10.
    Menasce, D.A., Almeida, V.A.F., Dowdy, L.W.: Performance by Design: Computer Capacity Planning by Example: Computer Capacity Planning. Prentice Hall International, Englewood CliffsGoogle Scholar
  11. 11.
    Menasce, D.A., Dowdy, L.W., Almeida, V.A.F.: Performance by Design: Computer Capacity Planning By Example. Prentice Hall PTR, Upper Saddle River (2004)Google Scholar
  12. 12.
    Rolia, J., Andrzejak, A., Arlitt, M.F.: Automating enterprise application placement in resource utilities. In: Brunner, M., Keller, A. (eds.) DSOM 2003. LNCS, vol. 2867, pp. 118–129. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jonatha Anselmi
    • 1
  • Paolo Cremonesi
    • 1
  • Edoardo Amaldi
    • 1
  1. 1.Politecnico di Milano, DEIMilanItaly

Personalised recommendations