A Coverage-Aware Resource Provisioning Method for Network Slicing

被引:21
作者
Luu, Quang-Trung [1 ,2 ]
Kerboeuf, Sylvaine [1 ]
Mouradian, Alexandre [2 ]
Kieffer, Michel [2 ]
机构
[1] Nokia Bell Labs, F-91620 Nozay, France
[2] Univ Paris Saclay, CNRS, Cent Supelec, L2S, F-91192 Gif Sur Yvette, France
关键词
Network slicing; Cloud computing; 5G mobile communication; Indium phosphide; III-V semiconductor materials; Data centers; Virtualization; resource provisioning; coverage constraints; wireless network virtualization; 5G; linear programming; ALGORITHM;
D O I
10.1109/TNET.2020.3019098
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With network slicing in 5G networks, Mobile Network Operators can create various slices for Service Providers (SPs) to accommodate customized services. Usually, the various Service Function Chains (SFCs) belonging to a slice are deployed on a best-effort basis. Nothing ensures that the Infrastructure Provider (InP) will be able to allocate enough resources to cope with the increasing demands of some SP. Moreover, in many situations, slices have to be deployed over some geographical area: coverage as well as minimum per-user rate constraints have then to be taken into account. This paper takes the InP perspective and proposes a slice resource provisioning approach to cope with multiple slice demands in terms of computing, storage, coverage, and rate constraints. The resource requirements of the various SFCs within a slice are aggregated within a graph of Slice Resource Demands (SRD). Infrastructure nodes and links have then to be provisioned so as to satisfy all SRDs. This problem leads to a Mixed Integer Linear Programming formulation. A two-step approach is considered, with several variants, depending on whether the constraints of each slice to be provisioned are taken into account sequentially or jointly. Once provisioning has been performed, any slice deployment strategy may be considered on the reduced-size infrastructure graph on which resources have been provisioned. Simulation results demonstrate the effectiveness of the proposed approach compared to a more classical direct slice embedding approach.
引用
收藏
页码:2393 / 2406
页数:14
相关论文
共 40 条
[1]  
5G America, 2016, CISC VIS NETW IND GL
[2]   Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions [J].
Afolabi, Ibrahim ;
Taleb, Tarik ;
Samdanis, Konstantinos ;
Ksentini, Adlen ;
Flinck, Hannu .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (03) :2429-2453
[3]  
[Anonymous], 2018, P IEEE GLOBECOM
[4]  
Basta Arsany., 2014, Proceedings of the 4th Workshop on All Things Cellular: Operations, Applications, Challenges, AllThingsCellular '14, P33, DOI [10.1145/2627585.2627592, DOI 10.1145/2627585.2627592]
[5]   Semantically Enhanced Mapping Algorithm for Affinity-Constrained Service Function Chain Requests [J].
Bouten, Niels ;
Mijumbi, Rashid ;
Serrat, Joan ;
Famaey, Jeroen ;
Latre, Steven ;
De Turck, Filip .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2017, 14 (02) :317-331
[6]   COMPOSER: A compact open-source service platform [J].
Cerrato, Ivano ;
Risso, Fulvio ;
Bonafiglia, Roberto ;
Pentikousis, Kostas ;
Pongracz, Gergely ;
Woesner, Hagen .
COMPUTER NETWORKS, 2018, 139 :151-174
[7]  
Chattopadhyay S., 2018, 2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), P1
[8]   ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping [J].
Chowdhury, Mosharaf ;
Rahman, Muntasir Raihan ;
Boutaba, Raouf .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (01) :206-219
[9]  
Cohen R, 2015, IEEE INFOCOM SER
[10]   Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results [J].
D'Oro, Salvatore ;
Restuccia, Francesco ;
Melodia, Tommaso ;
Palazzo, Sergio .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (06) :2815-2828