Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing
P. Zhao, and G. Dán. 30th International Teletraffic Congress (ITC 30), Vienna, Austria, (2018)
Abstract
We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.
%0 Conference Paper
%1 Zhao18ITC30
%A Zhao, Peiyue
%A Dán, György
%B 30th International Teletraffic Congress (ITC 30)
%C Vienna, Austria
%D 2018
%K Session_2:_Mobile_Edge_Computing itc itc30
%T Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing
%U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Zhao18ITC30.pdf?inline=true
%X We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.
@inproceedings{Zhao18ITC30,
abstract = {We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.},
added-at = {2020-04-29T16:58:36.000+0200},
address = {Vienna, Austria},
author = {Zhao, Peiyue and Dán, György},
biburl = {https://www.bibsonomy.org/bibtex/22073534ab385f458c934f5c533676c83/itc},
booktitle = {30th International Teletraffic Congress (ITC 30)},
interhash = {fd5e4de9c28174b6d9d660b126157278},
intrahash = {2073534ab385f458c934f5c533676c83},
keywords = {Session_2:_Mobile_Edge_Computing itc itc30},
timestamp = {2020-05-24T20:14:34.000+0200},
title = {Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing},
url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Zhao18ITC30.pdf?inline=true},
year = 2018
}