Abstract—Virtual machine(VM) live migration is a core feature of virtualization which enables dynamic resource requirements to be matched with available physical resources, leading to better performance and reduced energy consumption. A group of pages have been mapped writable in response to the migration algorithm, however there lacks a algorithm to choose the matching algorithm dynamically based on the upper running features. This paper propose FBA algorithm which can first divide all the migrations into two types “sluggish dirty page” and “swifting dirty page” by monitoring the value of skip_to, moreover this paper present corresponding corrective strategies for migrating the two types of application. Finally via simulation and experiments with real system prototypes, the results show that when it belongs to “swifting dirty page”, compared with existing pre-copy algorithm FBA algorithm improve the bandwidth utilization and reduce the total migration time; while for the “sluggish dirty page”, the pre-copy algorithm will fail and FBA algorithm makes a beneficial supplement.
Index Terms—VM live migration, FBA algorithm, swifting dirty page, sluggish dirty page.
The authors are with State Key Laboratory of Networking & Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China (e-mail: shuangk@bupt.edu.cn, 15650713360@163.com).
[PDF]
Cite:Shuang Kai and Chen Yan, "Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration," Journal of Advances in Computer Networks vol. 4, no. 2, pp. 92-99, 2016.
