VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

被引:89
作者
Agarwal, Satyam [1 ]
Malandrino, Francesco [2 ,3 ,4 ]
Chiasserini, Carla Fabiana [2 ,3 ,4 ]
De, Swades [5 ]
机构
[1] IIT Ropar, Dept Elect Engn, Ropar 140001, India
[2] Politecn Torino, Dept Elect & Telecommun, I-10129 Turin, Italy
[3] Inst Elect Comp & Commun Engn, I-10129 Turin, Italy
[4] CNR, I-10129 Turin, Italy
[5] IIT Delhi, Dept Elect Engn, New Delhi 10016, India
关键词
5G mobile communication; queuing theory; resource allocation; ALGORITHMS;
D O I
10.1109/TNET.2018.2890631
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the main goals of 5G networks is to support the technological and business needs of various industries (the so-called verticals), which wish to offer to their customers a wide range of services characterized by diverse performance requirements. In this context, a critical challenge lies in mapping in an automated manner the requirements of verticals into decisions concerning the network infrastructure, including VNF placement, resource assignment, and traffic routing. In this paper, we seek to make such decisions jointly, accounting for their mutual interaction, efficiently. To this end, we formulate a queuing-based model and use it at the network orchestrator to optimally match the vertical's requirements to the available system resources. We then propose a fast and efficient solution strategy, called MaxZ, which allows us to reduce the solution complexity. Our performance evaluation, carried out an accounting for multiple scenarios representing the real-world services, shows that MaxZ performs substantially better than the state-of-the-art alternatives and consistently close to the optimum.
引用
收藏
页码:433 / 446
页数:14
相关论文
共 34 条
[21]   Network Slicing in 5G: Survey and Challenges [J].
Foukas, Xenofon ;
Patounas, Georgios ;
Elmokashfi, Ahmed ;
Marina, Mahesh K. .
IEEE COMMUNICATIONS MAGAZINE, 2017, 55 (05) :94-100
[22]  
Hirwe A, 2016, 2016 IEEE NETSOFT CONFERENCE AND WORKSHOPS (NETSOFT), P33, DOI 10.1109/NETSOFT.2016.7502438
[23]  
Kuhn H.W., 2014, P 2 BERK S MATH STAT, P247
[24]   Pattern search methods or linearly constrained minimization [J].
Lewis, RM ;
Torczon, V .
SIAM JOURNAL ON OPTIMIZATION, 2000, 10 (03) :917-941
[25]  
Li X, 2018, IEEE WIREL COMMUNN, P260, DOI 10.1109/WCNCW.2018.8369008
[26]  
Lin Gu, 2016, 2016 IEEE Conference on Computer Communications: Workshops (INFOCOM WKSHPS), P604, DOI 10.1109/INFCOMW.2016.7562148
[27]  
Marotta A, 2016, 2016 28TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC 28), VOL 1, P331, DOI 10.1109/ITC-28.2016.151
[28]  
Martini B., 2015, PROC 1 IEEE C NETW S, P1
[29]   A Scalable Algorithm for the Placement of Service Function Chains [J].
Mechtri, Marouen ;
Ghribi, Chaima ;
Zeghlache, Djamal .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2016, 13 (03) :533-546
[30]   Modeling and Dimensioning of a Virtualized MME for 5G Mobile Networks [J].
Prados-Garzon, Jonathan ;
Ramos-Munoz, Juan J. ;
Ameigeiras, Pablo ;
Andres-Maldonado, Pilar ;
Lopez-Soler, Juan M. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (05) :4383-4395