Joint Resource Allocation and Content Caching in Virtualized Content-Centric Wireless Networks
Joint Resource Allocation and Content Caching in Virtualized Content-Centric Wireless Networks
复制标题
DOI：
10.1109/access.2018.2804902
复制
发表时间：
2018
期刊：
影响因子：
3.9
通讯作者：
Thinh Duy Tran;L. Le
中科院分区：
文献类型：
--
作者：
Thinh Duy Tran;L. Le
高效的内容缓存在第五代（5G）无线网络的回程和核心网络的服务质量增强和拥塞缓解方面起着至关重要的作用，该无线网络必须支持大量的多媒体和视频内容。无线网络虚拟化为5G系统设计提供了一种新的范式转变，可以更好地利用网络资源，快速开发新业务，并降低运营成本。然而，在虚拟化无线网络环境中协调部署内容缓存策略需要合适的无线电资源分配框架来实现这些技术的巨大益处。在本文中，我们研究了联合资源分配和内容缓存问题，其目的是有效地利用无线电和内容存储资源在高度拥塞的回程场景。在这个设计中，我们最大限度地减少了不同的移动的虚拟网络运营商的用户在不同的小区，这导致在一个混合整数非线性规划的最大内容请求拒绝率。我们解决了这个困难的优化问题，提出了一个基于二分搜索的算法，迭代优化的资源分配和内容缓存的位置。我们进一步提出了一个低复杂度的启发式算法，实现适度的性能损失相比，基于二分搜索的算法。大量的数值结果证实了我们提出的框架，显着降低了最大请求中断概率与其他基准算法相比的有效性。
Efficient content caching plays a crucial role in quality of service enhancement and congestion mitigation of the backhaul and core networks for the fifth-generation (5G) wireless network, which must support a large amount of multimedia and video content. Wireless network virtualization provides a novel paradigm shift in 5G system design which enables to better utilize network resources, rapid development of new services, and reduce the operation cost. Harmonized deployment of a content caching strategy in the virtualized wireless network environment, however, requires a suitable radio resource allocation framework to realize the great benefits of these technologies. In this paper, we study the joint resource allocation and content caching problem which aims to efficiently utilize the radio and content storage resources in the highly congested backhaul scenario. In this design, we minimize the maximum content request rejection rate experienced by users of different mobile virtual network operators in different cells, which results in a mixed-integer non-linear program. We solve this difficult optimization problem by proposing a bisection-search-based algorithm that iteratively optimizes the resource allocation and content caching placement. We further propose a low-complexity heuristic algorithm which achieves moderate performance loss compared to the bisection-search based algorithm. Extensive numerical results confirm the efficacy of our proposed framework which significantly reduces the maximum request outage probability compared with other benchmark algorithms.