首页> 外文会议>IEEE Vehicular Technology Conference >Throughput-Maximum Resource Provision in the OFDMA-Based Wireless Virtual Network
【24h】

Throughput-Maximum Resource Provision in the OFDMA-Based Wireless Virtual Network

机译:基于OFDMA的无线虚拟网络中的吞吐量最大资源配置

获取原文

摘要

In this paper, we propose a throughput-maximum resource provision scheme in the OFDMA-based Wireless Virtual Network (WVN). The proposed scheme takes the dynamics of both traffic arrivals and wireless channels into consideration. Furthermore, we consider a more flexible service contract where average resource provision is guaranteed for each slice. As it is practically impossible to know future traffic arrival and channel information, we employ the Lyapunov Optimization to develop an online resource provision algorithm. The proposed online algorithm performs joint subcarrier and power allocation to each slice based on the traffic information, wireless channel state as well as historical resource provision. Theoretic analysis implies that the proposed algorithm can arbitrarily get close to the theoretic optimal throughput with degradations in delay, and the two performances can be balanced on demand. Extensive simulation results show that our proposed scheme can significantly improve the average throughput, while reducing the average delay and achieving an excellent isolation performance.
机译:在本文中,我们提出了一种基于OFDMA的无线虚拟网络(WVN)中吞吐量最大的资源提供方案。所提出的方案考虑了业务到达和无线信道的动态。此外,我们考虑了更为灵活的服务合同,其中保证了每个切片的平均资源供应。由于实际上不可能知道将来的流量到达和信道信息,因此我们使用Lyapunov优化来开发在线资源提供算法。提出的在线算法基于交通信息,无线信道状态以及历史资源提供,对每个切片执行联合子载波和功率分配。理论分析表明,所提出的算法可以在延迟降低的情况下任意接近理论最优吞吐量,并且可以根据需要平衡两种性能。大量的仿真结果表明,我们提出的方案可以显着提高平均吞吐量,同时减少平均延迟并实现出色的隔离性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号