Maximum Migration Time Guarantees in Dynamic Server Consolidation for Virtualized Data Centers

  • Tiago Ferreto
  • César A. F. De Rose
  • Hans-Ulrich Heiss
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6852)


Server consolidation is a vital mechanism in modern data centers in order to minimize expenses with infrastructure. In most cases, server consolidation may require migrating virtual machines between different physical servers. Although the downtime of live-migration is negligible, the amount of time to migrate all virtual machines can be substantial, delaying the completion of the consolidation process. This paper proposes a new server consolidation algorithm, which guarantees that migrations are completed in a given maximum time. The migration time is estimated using the max-min fairness model, in order to consider the competition of migration flows for the network infrastructure. The algorithm was simulated using a real workload and shows a good consolidation ratio in comparison to other algorithms, while also guaranteeing a maximum migration time.


Virtual Machine Migration Time Current Solution Physical Server Tabu List 
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.
    Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. Tech. Rep. 04-19, Zuse Institute Berlin (2004)Google Scholar
  2. 2.
    Andrzejak, A., Arlitt, M., Rolia, J.: Bounding the resource savings of utility computing models. Technical report hpl-2002-339, Hewlett Packard Laboratories (2002)Google Scholar
  3. 3.
    Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)zbMATHGoogle Scholar
  4. 4.
    Bichler, M., Setzer, T., Speitkamp, B.: Capacity planning for virtualized servers. In: Proceedings of the 16th Annual Workshop on Information Technologies and Systems, WITS 2006 (2006)Google Scholar
  5. 5.
    Bobroff, N., Kochut, A., Beaty, K.: Dynamic placement of virtual machines for managing sla violations. In: Proceedings of the 10th IFIP/IEEE International Symposium on Integrated Network Management (2007)Google Scholar
  6. 6.
    Coffman Jr., E., Garey, M., Johnson, D.: Approximation Algorithms for Bin Packing - A Survey. In: Approximation algorithms for NP-hard problems, PWS Publishing Co. (1996)Google Scholar
  7. 7.
    Floudas, C.C.A., Pardalos, P.M.: Encyclopedia of Optimization. Springer-Verlag New York, Inc., Secaucus (2006)zbMATHGoogle Scholar
  8. 8.
    Ioannis, D.: New Algorithm for the Generalized Max-Min Fairness Policy based on Linear Programming. IEICE Transactions on Communications (2005)Google Scholar
  9. 9.
    Khanna, G., Beaty, K., Kar, G., Kochut, A.: Application performance management in virtualized server environments. In: Proceedings of the 10th IEEE/IFIP Network Operations and Management Symposium, NOMS 2006 (2006)Google Scholar
  10. 10.
    Koch, T.: Rapid Mathematical Programming. Ph.D. thesis, Technische Universitaet Berlin (2004)Google Scholar
  11. 11.
    Kou, L., Markowsky, G.: Multidimensional bin packing algorithms. IBM Journal of Research and development 21(5) (1977)Google Scholar
  12. 12.
    Lodi, A., Martello, S., Vigo, D.: TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Annals of Operations Research 131(1-4) (2004)Google Scholar
  13. 13.
    Mehta, S., Neogi, A.: ReCon: A Tool to Recommend Dynamic Server Consolidation in Multi-Cluster Data Centers. In: Proceedings of the IEEE Network Operations and Management Symposium, NOMS 2008 (2008)Google Scholar
  14. 14.
    Nace, D., Nhatdoan, L., Klopfenstein, O., Bashllari, a.: Max-min fairness in multi-commodity flows. Computers & Operations Research 35(2) (2008)Google Scholar
  15. 15.
    Speitkamp, B., Bichler, M.: A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers. IEEE Transactions on Services Computing (2010)Google Scholar
  16. 16.
    Verma, A., Ahuja, P., Neogi, A.: pMapper: Power and migration cost aware application placement in virtualized systems. In: Proceedings of the ACM/IFIP/USENIX 9th International Middleware Conference (2008)Google Scholar
  17. 17.
    Wood, T., Shenoy, P.J., Venkataramani, A., Yousif, M.S.: Sandpiper: Black-box and gray-box resource management for virtual machines. Computer Networks 53(17) (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tiago Ferreto
    • 1
  • César A. F. De Rose
    • 1
  • Hans-Ulrich Heiss
    • 2
  1. 1.Faculty of InformaticsPUCRSBrazil
  2. 2.Technische Universitaet BerlinGermany

Personalised recommendations