首页> 外文会议>Annual Conference on Wireless On-demand Network Systems and Services >Distributed proactive caching in a group of selfish nodes
【24h】

Distributed proactive caching in a group of selfish nodes

机译:一组自私节点中的分布式主动缓存

获取原文

摘要

The paper considers the problem of proactive caching (or replication) of content in a collection of caches which can form a group and collectively satisfy content requests of their users (clientele); such caches can be the ones associated with close-by base stations. Under significant user similarity, avoiding caching the same content in multiple locations within the group and leaving room for more content to be cached within the group, can yield significant performance improvement compared to the case of isolated, greedy local, caching behavior by the nodes. The work considers a generic content-provisioning cost structure that jointly incorporates objective (i.e., distance-based) and subjective (social/behavioral-based) cost elements and studies the resulting non-cooperative game, proposes a simple content placement implementation, presents results and discusses the impact of the subjective cost element.
机译:本文考虑了在缓存集合中对内容进行主动缓存(或复制)的问题,缓存集合可以组成一个组并共同满足其用户(客户)的内容请求;这样的高速缓存可以是与附近基站相关联的高速缓存。与节点进行隔离,贪婪的本地缓存行为相比,在明显的用户相似性下,避免在同一组内的多个位置缓存相同的内容并为在该组内缓存更多内容留出空间,可以显着提高性能。该工作考虑了一个通用的内容供应成本结构,该结构将目标成本(即基于距离的成本)和主观成本(基于社会/行为的成本)结合在一起,并研究了由此产生的非合作博弈,提出了一个简单的内容放置实施方案,并提出了结果并讨论了主观成本要素的影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号