By Topic

An adaptive virtual machine replication algorithm for highly-available services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Colesa, A. ; Comput. Sci. Dept., Tech. Univ. of Cluj-Napoca, Cluj-Napoca, Romania ; Mihai, B.

This paper presents an adaptive algorithm for the replication process of a primary virtual machine (VM) hosting a service that must be provided high-availability. Running the service in a VM and replicating the entire VM is a general strategy, totally transparent for the service itself and its clients. The replication takes place in phases, which are run asynchronous for efficiency reasons. The replication algorithm adapts to the running context, consisting of the behavior of the service and the available bandwidth between primary and backup nodes. The length of each replication phase is determined dynamically, in order to reduce as much as possible the latencies experienced by the clients of the service, especially in the case of a degraded connectivity between primary and backup nodes. We implemented our replication algorithm as an extension of the Xen hypervisor's VM migration operation. It proved better than its non-adaptive variants.

Published in:

Computer Science and Information Systems (FedCSIS), 2011 Federated Conference on

Date of Conference:

18-21 Sept. 2011