首页> 外文会议>IEEE Wireless Communications and Networking Conference >Optimal cache placement for VoD services with wireless multicast and cooperative caching
【24h】

Optimal cache placement for VoD services with wireless multicast and cooperative caching

机译:具有无线组播和协作式缓存的VoD服务的最佳缓存放置

获取原文

摘要

Wireless multicast and client caching are two promising approaches to provide scalable video-on-demand (VoD) services. In this paper, we consider VoD services with client pre-caching under asynchronous requests, where a client request watches the desired video from the beginning to the end. A requesting client can retrieve the data of the requested video from its local cache, other clients it meets via device-to-device (D2D) communication, and the BS multicast transmission. Under this model, we optimize the cache placement to minimize the average traffic rate of BS transmission by the optimal exploitation of BS multicast and cooperative caching. Specifically, we first formulate the cache placement problem into a separable concave minimization problem with convex constraints, which can be solved via convex underestimation and branch bound, where the global optimality is achieved at the cost of a very high computational complexity. To reduce the complexity, we further adopt the difference of convex algorithm. Moreover, two special cases are investigated, i.e., without D2D communication and without BS multicast. Simulation results verify the effectiveness of the proposed scheme which combines BS multicast and cooperative caching.
机译:无线多播和客户端缓存是提供可扩展的视频点播(VOD)服务的有希望的方法。在本文中,我们考虑在异步请求下与客户端预缓存的VOD服务,客户端请求从开始到结束时观看所需的视频。请求客户端可以通过设备到设备(D2D)通信和BS组播传输来检索来自其本地缓存的其他客户端的所请求视频的数据。在此模型下,我们优化缓存放置,以最小化BS多播和协作缓存的最佳开发来最小化BS传输的平均流量速率。具体地,我们首先将高速缓存放置问题分配到具有凸起约束的可分离凹入最小化问题中,该凸起约束可以通过凸低估和分支绑定来解决,其中全球最优性以非常高的计算复杂性实现。为了降低复杂性,我们进一步采用了凸算法的差异。此外,还研究了两个特殊情况,即,没有D2D通信,没有BS组播。仿真结果验证了拟议方案的有效性,该方案结合了BS多播和协作缓存。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号