TY - JOUR
T1 - QoS guaranteed resource allocation for live virtual machine migration in edge clouds
AU - Yang, Lei
AU - Yang, Doudou
AU - Cao, Jiannong
AU - Sahni, Yuvraj
AU - Xu, Xiaohua
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 61972161, in part by the Hong Kong RGC General Research Fund under Grant PolyU 15217919 and Grant PolyU 152133/18, in part by the Key Research and Development Program of Guangdong Province under Grant 2019B010154004, in part by the Guangdong Basic and Applied Basic Research Foundation under Grant 2020A1515011496, and in part by the Fundamental Research Funds for the Central Universities under Grant 2018MS53.
Publisher Copyright:
© 2013 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020
Y1 - 2020
N2 - Live Virtual Machine (VM) migration among geographically distributed edge clouds is an important strategy for providing low latency and reliable services for mobile end users. VM migration among edge clouds is more challenging than that in cloud computing, because the network bandwidth among edge clouds is more constrained than the cloud data center networks. In this paper, we study the bandwidth allocation among multiple concurrent live VM migrations in edge clouds. This problem is novel in that existing works aim to reduce the migration time for a single live VM migration among the edge clouds, and also ignores the QoS requirement for the service running on the VM in migration. However, our problem considers multiple VM migration tasks, and aims to maximize the average QoS while meeting the migration time constraint for each VM migration task. We formulate the problem as a Non-Linear Programming (NLP) problem which is also shown to be NP-Hard. We develop a new method to solve this problem. In our approach, we first transfer the problem into a Linear Programming (LP) problem by reducing the solution space. Taking the output from the LP solver as an initial solution, we then develop a heuristic to adjust it in order to find a better one to the original NLP problem. Finally, we design a set of evolutionary algorithms to select the optimal initial solution from the LP solver. Extensive simulations show that our proposed method can achieve good QoS and also has a fast convergence speed.
AB - Live Virtual Machine (VM) migration among geographically distributed edge clouds is an important strategy for providing low latency and reliable services for mobile end users. VM migration among edge clouds is more challenging than that in cloud computing, because the network bandwidth among edge clouds is more constrained than the cloud data center networks. In this paper, we study the bandwidth allocation among multiple concurrent live VM migrations in edge clouds. This problem is novel in that existing works aim to reduce the migration time for a single live VM migration among the edge clouds, and also ignores the QoS requirement for the service running on the VM in migration. However, our problem considers multiple VM migration tasks, and aims to maximize the average QoS while meeting the migration time constraint for each VM migration task. We formulate the problem as a Non-Linear Programming (NLP) problem which is also shown to be NP-Hard. We develop a new method to solve this problem. In our approach, we first transfer the problem into a Linear Programming (LP) problem by reducing the solution space. Taking the output from the LP solver as an initial solution, we then develop a heuristic to adjust it in order to find a better one to the original NLP problem. Finally, we design a set of evolutionary algorithms to select the optimal initial solution from the LP solver. Extensive simulations show that our proposed method can achieve good QoS and also has a fast convergence speed.
KW - Edge cloud
KW - live VM migration
KW - QoS
KW - resource allocation
UR - http://www.scopus.com/inward/record.url?scp=85084800733&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2020.2989154
DO - 10.1109/ACCESS.2020.2989154
M3 - Journal article
AN - SCOPUS:85084800733
SN - 2169-3536
VL - 8
SP - 78441
EP - 78451
JO - IEEE Access
JF - IEEE Access
M1 - 9075172
ER -