Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Efficient Routing and Bandwidth Assignment for Inter-Data-Center Live Virtual-Machine Migrations

Not Accessible

Your library or personal account may give you access

Abstract

Using virtualization, service providers can create an abstraction of the physical servers hosted in their data centers, and run their services directly on these abstract entities, called virtual machines (VMs). As a direct result of service virtualization, services hosted on VMs can be migrated from one data center to another. VM migration can be performed without or with a minimal service interruption, and in this case we talk about live VM migration. The main issue of live VM migration is that memory pages are modified during the process. Due to this fact, the same memory pages might be transferred several times, thus increasing both the migration duration and the amount of network resources occupied by the VM migration process. Considering the increasing amount of VM migrations carried on in inter-data-center networks, efficient strategies for live-VM-migration bandwidth provisioning are needed. In this paper, we propose and compare various novel routing and bandwidth assignment algorithms for the live migration of VMs in a distributed DC infrastructure, under dynamic traffic conditions. We find that assigning a bandwidth to the VM migration request in proportion to the path length with the objective of minimizing the amount of resources occupied by the migration request could improve the network performance. In addition, we present a comparative analysis of the serial and the parallel migration of multiple VMs. We quantify the impact of the migration strategy (serial versus parallel) on blocking probability, migration duration, downtime, and resource occupation.

© 2017 Optical Society of America

Full Article  |  PDF Article
More Like This
Anycast-Based Optimizations for Inter-Data-Center Interconnections [Invited]

Molka Gharbaoui, Barbara Martini, and Piero Castoldi
J. Opt. Commun. Netw. 4(11) B168-B178 (2012)

In Compute/Memory Dynamic Packet/Circuit Switch Placement for Optically Disaggregated Data Centers

Adaranijo Peters, George Oikonomou, and Georgios Zervas
J. Opt. Commun. Netw. 10(7) B164-B178 (2018)

Flexible Network Architecture and Provisioning Strategy for Geographically Distributed Metro Data Centers

Matteo Fiorani, Payman Samadi, Yiwen Shen, Lena Wosinska, and Keren Bergman
J. Opt. Commun. Netw. 9(5) 385-392 (2017)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (7)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (7)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (1)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.