Optimizing Migration of Virtual Machines across Data-Centers

Managing virtual machines (VM) in large scale enterprise grid scenarios, commonly encountered in data centers, is extremely challenging. Currently, live VM migration is based on QoS non-conformance events; migration of a VM is initiated as soon as the aggregate resource (CPU and memory) requirements of the VMs on the physical machine (PM) exceed the capacity available on the PM. However, this paper establishes that, such ‘event-based’ migration can be extremely myopic. To overcome the limitations posed by the ‘event-based’ VM migration, this paper, proposes a new migration strategy based on ‘time-windows’. The paper outlines a mixed integer linear programming (MILP) model and a heuristic solution for generating near-optimal rearrangements of the VMs on the PMs. The paper evaluates the solutions on various VM scenarios which show encouraging results.

[1]  Æleen Frisch,et al.  Decision Support for Virtual Machine Re-Provisioning in Production Environments , 2007, LISA.

[2]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[3]  Rohit Gupta,et al.  A Two Stage Heuristic Algorithm for Solving the Server Consolidation Problem with Item-Item and Bin-Item Incompatibility Constraints , 2008, 2008 IEEE International Conference on Services Computing.

[4]  谷野 哲三,et al.  Multi-objective programming and goal programming : theory and applications , 2003 .

[5]  M. Rosenblum,et al.  Optimizing the migration of virtual computers , 2002, OSDI '02.

[6]  Ian T. Foster,et al.  Virtual Workspaces in the Grid , 2005, Euro-Par.

[7]  Amin Vahdat,et al.  Managing energy and server resources in hosting centers , 2001, SOSP.

[8]  Xavier Gandibleux,et al.  MultiObjective Programming and Goal Programming , 2003 .

[9]  Renato J. O. Figueiredo,et al.  A case for grid computing on virtual machines , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[10]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[11]  Dieter Jungnickel,et al.  Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem , 2000, Oper. Res. Lett..

[12]  Andrew Warfield,et al.  Live migration of virtual machines , 2005, NSDI.

[13]  Robert P. Goldberg,et al.  Formal requirements for virtualizable third generation architectures , 1973, SOSP 1973.