Optimizing back-and-forth live migration

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Back-and-forth live migration, which means a running VM migrates between two physical machines back and forth, has several important applications. Traditional methods treat each migration as a single event, so the VM releases its system resources on the source site after migration. However, many resources can be kept to mitigate the cost of the next migration back to the machine. This paper presents performance optimization methods for back-and-forth live migration. Different from previous work, our approach can keep the data center resiliency. We leverage the technique of snapshot and the bitmap model, which are available in most existing VM management systems. Using the snapshot, a VM can be immediately restarted from the saved state. The bitmaps model is used to avoid redundant data transmission to decrease the costs of migration. We implemented the bank-and-forth live migration optimization methods in QEMU-KVM 2.0. The experiments show that the proposed methods can significantly reduce the overhead of migrations. The total migration time can be saved up to 99% for some applications.

Author supplied keywords

Cite

CITATION STYLE

APA

Lee, K. H., Lai, I. C., & Lee, C. R. (2016). Optimizing back-and-forth live migration. In Proceedings - 9th IEEE/ACM International Conference on Utility and Cloud Computing, UCC 2016 (pp. 49–54). Association for Computing Machinery, Inc. https://doi.org/10.1145/2996890.2996909

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free