TY - JOUR
T1 - On Orchestrating Service Function Chains in 5G Mobile Network
AU - Zhao, Dongcheng
AU - Ren, Jing
AU - Lin, Rongping
AU - Xu, Shizhong
AU - Chang, Victor
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2019
Y1 - 2019
N2 - As two of the key technologies of 5G, fog-based radio access network and network function virtualization have become an important direction for the radio network architecture evolution. Virtual network functions (VNFs) compose the service function chain (SFC) in a particular order, and the mobile network users communicate with each other or service terminals through SFCs. For service providers, it is crucially important for efficient deploying/mapping SFCs into the 5G mobile network since the SFCs deployment problem is an NP-hard problem. In this paper, we propose the efficient SFCs deployment algorithms for solving this challenge with two main design goals: 1) minimizing the cost of link resource, i.e., minimizing the path length of the entire SFC by combining VNFs and mapping temporary links and 2) minimizing the cost of computing resources by using the existing virtual machines as much as possible while performing the same VNF. We model the SFCs deployment problem as an optimization problem by using ILP as well as devise the heuristic algorithms to make the tradeoff between these two conflicting design goals. From simulation results, we can see that the performance of our proposed algorithms is promising in terms of the total SFCs mapping cost, total links mapping cost, and blocking ratio.
AB - As two of the key technologies of 5G, fog-based radio access network and network function virtualization have become an important direction for the radio network architecture evolution. Virtual network functions (VNFs) compose the service function chain (SFC) in a particular order, and the mobile network users communicate with each other or service terminals through SFCs. For service providers, it is crucially important for efficient deploying/mapping SFCs into the 5G mobile network since the SFCs deployment problem is an NP-hard problem. In this paper, we propose the efficient SFCs deployment algorithms for solving this challenge with two main design goals: 1) minimizing the cost of link resource, i.e., minimizing the path length of the entire SFC by combining VNFs and mapping temporary links and 2) minimizing the cost of computing resources by using the existing virtual machines as much as possible while performing the same VNF. We model the SFCs deployment problem as an optimization problem by using ILP as well as devise the heuristic algorithms to make the tradeoff between these two conflicting design goals. From simulation results, we can see that the performance of our proposed algorithms is promising in terms of the total SFCs mapping cost, total links mapping cost, and blocking ratio.
KW - 5G mobile network
KW - Service function chain
KW - deployment
KW - fog-based radio access network
KW - network function virtualization
KW - virtual network function
UR - http://www.scopus.com/inward/record.url?scp=85065176396&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2895316
DO - 10.1109/ACCESS.2019.2895316
M3 - Article
AN - SCOPUS:85065176396
SN - 2169-3536
VL - 7
SP - 39402
EP - 39416
JO - IEEE Access
JF - IEEE Access
M1 - 8631035
ER -