首页> 外文期刊>IEEE/ACM Transactions on Networking >Combining Contract Theory and Lyapunov Optimization for Content Sharing With Edge Caching and Device-to-Device Communications
【24h】

Combining Contract Theory and Lyapunov Optimization for Content Sharing With Edge Caching and Device-to-Device Communications

机译:结合合同理论和Lyapunov优化与边缘缓存和设备到设备通信的内容共享

获取原文
获取原文并翻译 | 示例

摘要

The paper proposes a novel framework based on the contract theory and Lyapunov optimization for content sharing in a wireless content delivery network (CDN) with edge caching and device-to-device (D2D) communications. The network is partitioned into a set of clusters. In a cluster, users can share contents via D2D links in coordination with the cluster head. Upon receiving the content request from any user in its cluster, the cluster head either delivers the content itself or forwards the request to another node, i.e., a base station (BS) or another user in the cluster. The content access at the BS and in each cluster is modeled as a queuing system, where arrivals represent the content requests directed to respective nodes. The objective is to assign content delivery nodes to stabilize all queues while minimizing the time-averaged network cost given incomplete information about content sharing costs of the users and unknown distribution of the network state defined by users' locations and their cached/requested content. The proposed framework allows the users to truthfully reveal their content sharing expenditures, minimize the time-averaged network cost and stabilize the queuing system representing the CDN. Based on this framework, a distributed content access and delivery algorithm where the node assignments are made by every cluster head independently is developed. It is shown that the algorithm converges to the optimal policy with the trade-off in total queue backlog and achieves a superior performance compared with some other D2D content sharing policies.
机译:本文提出了一种基于合同理论和Lyapunov优化的新颖框架,用于使用边缘缓存和设备(D2D)通信在无线内容传送网络(CDN)中的内容共享内容共享。该网络被划分为一组集群。在群集中,用户可以通过与群集头部协调的D2D链路共享内容。在从其群集中从任何用户接收到内容请求时,群集头可以将内容本身传递或将请求转发给另一个节点,即基站(BS)或群集中的其他用户。 BS和每个群集的内容访问被建模为排队系统,其中到达表示针对各个节点的内容请求。该目的是分配内容传递节点以稳定所有队列,同时最小化时间平均网络成本给出了关于用户位置的内容共享成本的不完整信息和由用户位置定义的网络状态的未知分发以及其高速缓存/请求的内容。所提出的框架允许用户如实地揭示他们的内容共享支出,最大限度地减少时间平均网络成本并稳定代表CDN的排队系统。基于该框架,开发了每个群集头部独立于节点分配的分布式内容访问和传递算法。结果表明,该算法会聚到总队列积压中的权衡和折衷的最佳策略,并与一些其他D2D内容共享策略相比,实现了卓越的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号