On the Upgrade of Service Function Chains With Heterogeneous NFV Platforms

被引:4
作者
Xue, Yuhan [1 ]
Zhu, Zuqing [1 ]
机构
[1] Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230027, Anhui, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2021年 / 18卷 / 04期
关键词
Hardware; Optimization; Approximation algorithms; Heuristic algorithms; Substrates; Quality of service; Servers; Network function virtualization (NFV); heterogeneous NFV platforms; service function chain (SFC); approximation algorithm; facility location; multiple knapsack; linear programming (LP) relaxation and randomized rounding; ALGORITHMS; PERFORMANCE; WIRELESS;
D O I
10.1109/TNSM.2021.3103175
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The fast development of high-performance and flexible SmartNICs and programmable data plane switches (PDP-SWs) has motivated people to consider the deployment of virtual network functions (vNFs) on them. Hence, together with traditional virtual machines (VMs), SmartNICs and PDP-SWs form heterogeneous network function virtualization (NFV) platforms for realizing vNF service chains (vNF-SCs). In this work, we consider the transition from software-based homogeneous NFV platforms to the heterogeneous ones, and study how to optimize the service upgrade of vNF-SCs. Specifically, the service upgrade is divided into two steps, which are 1) selecting servers/switches in the substrate network (SNT) to upgrade, which is done by adding SmartNICs to servers and replacing traditional switches with PDP-SWs, under a fixed budget, and 2) redeploying the existing vNF-SCs in the updated SNT to maximize the quality-of-service (QoS) improvement on latency reductions. We first formulate an integer linear programming (ILP) model to optimize the overall service upgrade, then design two correlated optimizations for its two steps, and finally propose polynomial-time approximation algorithms to solve the optimizations. The results of extensive simulations confirm that our proposed algorithm outperforms the existing benchmarks in various network scenarios, and achieves better tradeoff between performance and time-efficiency.
引用
收藏
页码:4311 / 4323
页数:13
相关论文
共 56 条
[1]   Efficient integration of multihop wireless and wired networks with QoS constraints [J].
Bejerano, Y .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (06) :1064-1078
[2]   A survey on service function chaining [J].
Bhamare, Deval ;
Jain, Raj ;
Samaka, Mohammed ;
Erbad, Aiman .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 75 :138-155
[3]  
Carvalho M., 2014, P 5 ACM S CLOUD COMP, P1
[4]  
Charikar M, 2012, LECT NOTES COMPUT SC, V7391, P194, DOI 10.1007/978-3-642-31594-7_17
[5]   Enabling Heterogeneous Network Function Chaining [J].
Cui, Lin ;
Tso, Fung Po ;
Guo, Song ;
Jia, Weijia ;
Wei, Kaimin ;
Zhao, Wei .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (04) :842-854
[6]  
Dong L., 2019, PROC GLOBECOM, P1
[7]   Application-Driven Provisioning of Service Function Chains Over Heterogeneous NFV Platforms [J].
Dong, Lu ;
da Fonseca, Nelson L. S. ;
Zhu, Zuqing .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2021, 18 (03) :3037-3048
[8]  
Dubhashi D.P., 2009, CONCENTRATION MEASUR, DOI DOI 10.1017/CBO9780511581274
[9]   An Approach for Service Function Chain Routing and Virtual Function Network Instance Migration in Network Function Virtualization Architectures [J].
Eramo, Vincenzo ;
Miucci, Emanuele ;
Ammar, Mostafa ;
Lavacca, Francesco Giacinto .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (04) :2008-2025
[10]   Joint Spectrum and IT Resource Allocation for Efficient VNF Service Chaining in Inter-Datacenter Elastic Optical Networks [J].
Fang, Wenjian ;
Zeng, Menglu ;
Liu, Xiahe ;
Lu, Wei ;
Zhu, Zuqing .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (08) :1539-1542