Mobile-aware service function chain migration in cloud-fog computing

被引:31
作者
Zhao, Dongcheng [1 ,2 ]
Sun, Gang [1 ]
Liao, Dan [1 ,3 ]
Xu, Shizhong [1 ]
Chang, Victor [4 ]
机构
[1] Univ Elect Sci & Technol China, Minist Educ, Key Lab Opt Fiber Sensing & Commun, Chengdu, Sichuan, Peoples R China
[2] Sci & Technol Commun Networks Lab, Shijiazhuang, Hebei, Peoples R China
[3] Univ Elect Sci & Technol China, Chengdu Res Inst, Chengdu, Sichuan, Peoples R China
[4] Xian Jiaotong Liverpool Univ, Suzhou, Peoples R China
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2019年 / 96卷
关键词
Network Function Virtualization; Cloud-fog computing; Service Function Chain; Live migration; NETWORK FUNCTION VIRTUALIZATION; LIVE MIGRATION; NFV; ORCHESTRATION; FRAMEWORK; EFFICIENT; MODEL;
D O I
10.1016/j.future.2019.02.031
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Network Function Virtualization (NFV) provides a good paradigm for sharing the resources of the physical network. The deployment problem of Service Function Chains (SFCs) composed of a specific order of Virtual Network Functions (VNFs) has become the focus of research. Moreover, to solve the facing challenges of the centralized cloud computing, the researchers have proposed the distributed fog computing. When the mobile user moves among different fog-based radio access networks, the SFC must be migrated. Therefore, in the paper, we research the problem of SFCs migration/remapping caused by the user movement in cloud-fog computing environments. We firstly model the migration problem of SFCs as an integer linear program; then we propose two SFC migration strategies: the minimum number of VNFs migration strategy and the two-step migration strategy, to reduce the reconfiguration cost, the migration time and downtime of SFCs and improve the remapping success ratio of SFCs; and we have designed a two-step migration algorithm to migrate SFCs. We use the cloud-fog computing environment to evaluate our proposed algorithms. The reconfiguration cost, the remapping success ratio, the migration time and the downtime of our proposed algorithms are more excellent than that of benchmark algorithm. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:591 / 604
页数:14
相关论文
共 47 条
[1]  
[Anonymous], 2017, FUTURE GENER COMP SY
[2]  
[Anonymous], 2016, 2016 IEEE NUCL SCI S, DOI DOI 10.1109/NSSMIC.2016.8069726
[3]  
[Anonymous], CLUST COMPUT
[4]  
[Anonymous], 2017, Institute of Development Studies Practice Paper
[5]  
[Anonymous], P IEEE IFIP NETW OP
[6]  
[Anonymous], 2017, MOB INF SYST
[7]  
[Anonymous], IEEE INTERNET COMPUT
[8]  
[Anonymous], 2018, IMAGE BASED DETECTIO
[9]  
[Anonymous], IEEE INFOCOM
[10]  
Cerroni W, 2014, IEEE ICC, P2963, DOI 10.1109/ICC.2014.6883775