On Orchestrating Service Function Chains in 5G Mobile Network

Dongcheng Zhao, Jing Ren, Rongping Lin, Shizhong Xu, Victor Chang

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Article number8631035
Pages (from-to)39402-39416
Number of pages15
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 21 Jan 2019

Fingerprint

Wireless networks
Costs
Inductive logic programming (ILP)
Fog
Heuristic algorithms
Network architecture
Computational complexity

Cite this

Zhao, Dongcheng ; Ren, Jing ; Lin, Rongping ; Xu, Shizhong ; Chang, Victor. / On Orchestrating Service Function Chains in 5G Mobile Network. In: IEEE Access. 2019 ; Vol. 7. pp. 39402-39416.
@article{b4cb586843d94c60a7638844c75e645a,
title = "On Orchestrating Service Function Chains in 5G Mobile Network",
abstract = "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.",
author = "Dongcheng Zhao and Jing Ren and Rongping Lin and Shizhong Xu and Victor Chang",
year = "2019",
month = "1",
day = "21",
doi = "10.1109/ACCESS.2019.2895316",
language = "English",
volume = "7",
pages = "39402--39416",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

On Orchestrating Service Function Chains in 5G Mobile Network. / Zhao, Dongcheng; Ren, Jing; Lin, Rongping; Xu, Shizhong; Chang, Victor.

In: IEEE Access, Vol. 7, 8631035, 21.01.2019, p. 39402-39416.

Research output: Contribution to journalArticle

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

PY - 2019/1/21

Y1 - 2019/1/21

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.

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

VL - 7

SP - 39402

EP - 39416

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8631035

ER -