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 the previous work, the authors 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, they 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.