Improving Total Migration Time in Live Virtual Machine Migration
Bubai Das, Kunal Kumar Mandal, Suvrojit Das
Abstract
Open-access reader
Bubai Das, Kunal Kumar Mandal, Suvrojit Das
Abstract
Open-access reader
Virtualization is the key underlying technology enabling cloud providers to host services for a large number of customers. Live migration is an essential feature of virtualization that allows transfer of virtual machines from one physical server to another. Live migration facilitates workload balancing, fault tolerance, online system maintenance, consolidation of virtual machines etc. The pre-copy algorithm is the most used method for the live migration of virtual machines. One of the objectives of live migration is that it should have minimum migration time as well as downtime so that application running on VM will be suspended for negligible time. In this paper we proposed an algorithm to improve the total migration time which is modifies the existing counting Sort algorithm for the live Migration and time series based algorithm. This algorithm takes dirty counts of group of pages instead of individual dirty counts of each page and send those pages only which are not highly dirtied.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Virtualization is the key underlying technology enabling cloud providers to host services for a large number of customers. Live migration is an essential feature of virtualization that allows transfer of virtual machines from one physical server to another. Live migration facilitates workload balancing, fault tolerance, online system maintenance, consolidation of virtual machines etc. The pre-copy algorithm is the most used method for the live migration of virtual machines. One of the objectives of live migration is that it should have minimum migration time as well as downtime so that application running on VM will be suspended for negligible time. In this paper we proposed an algorithm to improve the total migration time which is modifies the existing counting Sort algorithm for the live Migration and time series based algorithm. This algorithm takes dirty counts of group of pages instead of individual dirty counts of each page and send those pages only which are not highly dirtied.
Key concepts: Live migration, Downtime, Computer science, Virtual machine, Virtualization, Cloud computing, Distributed computing, Operating system