Joint resource provisioning and admission control in wireless virtualized networks

Joint resource provisioning and admission control in wireless virtualized networks
复制标题

DOI:
10.1109/wcnc.2015.7127778
复制
发表时间:
2015-03
期刊:
2015 IEEE Wireless Communications and Networking Conference (WCNC)
影响因子:
--
通讯作者:
S. Parsaeefard;Vikas Jumba;Mahsa Derakhshani;T. Le-Ngoc
S. Parsaeefard;Vikas Jumba;Mahsa Derakhshani;T. Le-Ngoc
中科院分区:
其他
文献类型:
--
作者:
S. Parsaeefard;Vikas Jumba;Mahsa Derakhshani;T. Le-Ngoc

文献摘要

被引文献

相似文献

研究了无线虚拟网络(WVN)中的联合资源分配和接纳控制问题,其中基于OFDMA的无线网络中的一个基站被虚拟成基于资源和基于速率预留的两种类型的片。以最大化WVN的总使用率为目标,首先通过保证每个片的最小需求来建立资源配置优化问题。通过约束松弛和变量变换,提出了一种迭代的功率和子载波分配算法。由于信道的变化,WVN遭受了非零中断概率,即不能总是满足切片要求。为了防止这一问题,我们提出了一种基于信道状态信息动态调整分片要求的接纳控制算法。仿真结果验证了所提算法的有效性。
This paper studies joint resource provisioning and admission control in wireless virtualized networks (WVN), where one base station of an OFDMA-based wireless network is virtualized into two types of slices with resource-based and rate-based reservations. Aiming to maximize the total rate of WVN, first, the resource provisioning optimization problems are formulated by guaranteeing a minimum requirement for each slice. Via constraint relaxation and variable transformations, an iterative algorithm is developed for power and sub-carrier allocation. Due to the channel variations, WVN suffers from non-zero outage probability, i.e., slice requirements cannot always be met. To prevent this issue, we present an admission control algorithm in which slice requirements are dynamically adjusted based on channel state information. The simulation results demonstrate the effectiveness of our proposed algorithms.