Egalitarian stable matching for VM migration in cloud computing

Virtual machine migration represents a new challenge to design efficient and practical migration algorithms that work well with hundreds or even thousands of VMs and servers. In our previous work, we advocated the use of a general stable matching framework from economics to solve networking problems, and showed that it offers unique advantages compared to utility-based optimization, using a simple procedure of deferred acceptance. In this paper, we apply this framework to the VM migration problem, and propose an egalitarian approach that finds a stable matching fair to both VMs and servers, instead of favoring either side as a result of the deferred acceptance procedure. Such an egalitarian stable matching that minimizes the total rank sum of the outcome is shown to be a sensible notion of fairness under mild conditions, and through simulations is demonstrated to offer superior results.

[1]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[2]  Arun Venkataramani,et al.  Black-box and Gray-box Strategies for Virtual Machine Migration , 2007, NSDI.

[3]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[4]  William H. Lane,et al.  Stable Marriage Problem , 2001 .

[5]  Baochun Li,et al.  Seen as stable marriages , 2011, 2011 Proceedings IEEE INFOCOM.

[6]  Michel Balinski,et al.  Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) , 2000, Discret. Appl. Math..

[7]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[8]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[9]  Aseem Agrawal,et al.  Polynomial time algorithm for an optimal stable assignment with multiple partners , 2007, Theor. Comput. Sci..

[10]  Hai Jin,et al.  Live migration of virtual machine based on full system trace and replay , 2009, HPDC '09.

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

[12]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[13]  A. Roth.  The college admissions problem is not equivalent to the marriage problem , 1985 .

[14]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[15]  Alvin E. Roth.  Deferred acceptance algorithms: history, theory, practice, and open questions , 2008, Int. J. Game Theory.

[16]  A. Roth.  Stability and Polarization of Interests in Job Matching , 1984 .

[17]  Pietro Michiardi,et al.  Analysis of user-driven peer selection in peer-to-peer backup and storage systems , 2008, Telecommun. Syst..

[18]  Fatemeh Fazel,et al.  On the endogenous formation of energy efficient cooperative wireless networks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).