On Optimal Orchestration of Virtualized Cellular Networks With Downlink Rate Coverage Probability Constraints

被引:4
作者
Chatterjee, Shubhajeet [1 ]
Abdel-Rahman, Mohammad J. [1 ,2 ,3 ]
Mackenzie, Allen B. [4 ,5 ]
机构
[1] Virginia Tech, Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
[2] Al Hussein Tech Univ, Dept Elect Engn, Amman 11821, Jordan
[3] Al Hussein Tech Univ, Dept Comp Sci, Amman 11821, Jordan
[4] Tennessee Tech, Dept Elect & Comp Engn, Cookeville, TN 38505 USA
[5] Virginia Tech, Dept Elect Engn, Blacksburg, VA 24061 USA
基金
美国国家科学基金会;
关键词
Resource management; Virtualization; Optimization; Wireless communication; Virtual machine monitors; Cellular networks; Computational complexity; Wireless network virtualization; resource allocation; rate coverage probability; chance-constrained stochastic optimization; RESOURCE-ALLOCATION; ACCESS NETWORKS; WIRELESS; SPECTRUM; GAME; ASSIGNMENT;
D O I
10.1109/TWC.2020.2983021
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Wireless network virtualization is emerging as a promising technology for next-generation (5G) cellular networks. A key advantage of introducing virtualization in cellular networks is that wireless services can be decoupled from network resources (e.g., infrastructure and spectrum) so that multiple virtual networks can be built using a shared pool of network resources. This paper develops a theoretical framework for optimizing the resource allocation in virtualized cellular networks with heterogeneous coverage requirements. Specifically, we first formulate a chance-constrained virtual resource allocation problem that aims at probabilistically guaranteeing virtual networks' downlink coverage and rate demand satisfaction while minimizing resource over-provisioning in the presence of uncertainty in user equipment (UE) locations and channel conditions. Thereafter, we derive a closed-form expression for the downlink rate coverage probability of a typical virtual network. With the closed-form expression, we design an efficient algorithm to solve the chance-constrained problem with affordable computation complexity. Furthermore, considering the possibility of lack of sufficient network resources to satisfy all virtual networks' demands, we design a prioritized virtual resource allocation scheme where virtual networks are built sequentially based on their given priorities. Our results demonstrate that the proposed stochastic virtualization framework outperforms existing deterministic virtualization frameworks in terms of probabilistically guaranteeing virtual networks' coverage and rate demand satisfaction.
引用
收藏
页码:4378 / 4393
页数:16
相关论文
共 44 条
[1]  
Abd-Elmagid MA, 2019, WIREL NETW, V25, P713, DOI 10.1007/s11276-017-1587-x
[2]  
Abdel-kader MH, 2016, COMPR SER PHOTOCH, V15, P1
[3]  
Abdel-Rahman M, 2017, AIP CONF PROC, V1809, DOI [10.1063/1.4975416, 10.1109/ULTSYM.2017.8092427, 10.1109/PRECEDE.2017.8071099]
[4]  
Abdel-Rahman M.J., 2016, P IEEE CCNC C JAN, P1049
[5]  
Abdel-Rahman MJ, 2015, 2015 IEEE INTERNATIONAL SYMPOSIUM ON DYNAMIC SPECTRUM ACCESS NETWORKS (DYSPAN), P200, DOI 10.1109/DySPAN.2015.7343903
[6]   Stochastic Guard-Band-Aware Channel Assignment With Bonding and Aggregation for DSA Networks [J].
Abdel-Rahman, Mohammad J. ;
Krunz, Marwan .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (07) :3888-3898
[7]   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
[8]   Piecewise linear approximation applied to nonlinear function of a neural network [J].
Amin, H ;
Curtis, KM ;
Hayes-Gill, BR .
IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1997, 144 (06) :313-317
[9]   A Tractable Approach to Coverage and Rate in Cellular Networks [J].
Andrews, Jeffrey G. ;
Baccelli, Francois ;
Ganti, Radha Krishna .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (11) :3122-3134
[10]  
[Anonymous], 2015, CISC VIS NETW IND FO