首页> 外文OA文献 >User preference aware caching deployment for device-to-device caching networks
【2h】

User preference aware caching deployment for device-to-device caching networks

机译:用于设备到设备缓存网络的用户首选项感知缓存部署

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Content caching in the device-to-device (D2D) cellular networks can be utilized to improve the content delivery efficiency and reduce traffic load of cellular networks. In such cache-enabled D2D cellular networks, how to cache the diversity contents in the multiple cache-enabled mobile terminals, namely, the caching deployment, has a substantial impact on the network performance. In this paper, a user preference aware caching deployment algorithm is proposed for D2D caching networks. First, the definition of the user interest similarity is given based on the user preference. Then, a content cache utility of a mobile terminal is defined by taking the transmission coverage region of this mobile terminal and the user interest similarity of its adjacent mobile terminals into consideration. A general cache utility maximization problem with joint caching deployment and cache space allocation is formulated, where the special logarithmic utility function is integrated. In doing so, the caching deployment and the cache space allocation can be decoupled by equal cache space allocation. Subsequently, we relax the logarithmic utility maximization problem, and obtain a low complexity near-optimal solution via a dual decomposition method. Compared with the existing caching placement methods, the proposed algorithm can achieve significant improvement on cache hit ratio, content access delay, and traffic offloading gain.
机译:设备到设备(D2D)蜂窝网络中的内容缓存可用于提高内容交付效率并减少蜂窝网络的流量负载。在这种启用缓存的D2D蜂窝网络中,如何在多个启用缓存的移动终端中缓存分集内容,即缓存部署,对网络性能具有实质性影响。本文提出了一种针对D2D缓存网络的用户偏好感知缓存部署算法。首先,基于用户偏好给出用户兴趣相似度的定义。然后,通过考虑该移动终端的传输覆盖区域及其相邻移动终端的用户兴趣相似性来定义移动终端的内容缓存实用程序。提出了具有联合缓存部署和缓存空间分配的一般缓存实用程序最大化问题,其中集成了特殊对数实用程序功能。这样,可以通过相等的高速缓存空间分配来解耦高速缓存部署和高速缓存空间分配。随后,我们放松了对数效用最大化问题,并通过对偶分解方法获得了低复杂度的近最优解。与现有的缓存放置方法相比,该算法可以显着提高缓存命中率,内容访问延迟和流量卸载增益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号