...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >An Index Coding Approach to Caching With Uncoded Cache Placement
【24h】

An Index Coding Approach to Caching With Uncoded Cache Placement

机译：使用未编码的缓存放置进行缓存的索引编码方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users' demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the "acyclic index coding converse bound." This converse bound is proved to be achievable by the Maddah-Ali and Niesen's scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used "composite (index) coding" achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper.
机译：通过将一些内容存储在用户的本地缓存中，即使不了解用户以后的需求，缓存也是减少高峰时段网络流量拥塞的有效方法。 Maddah-Ali和Niesen为具有缓存辅助用户的广播频道提出了一个两阶段（放置阶段和交付阶段）编码缓存策略。本文研究了在内容未经编码放置在缓存中的情况下（即，仅在缓存中复制文件的某些位）约束下的同一模型。当缓存内容未编码并显示用户需求时，可以将缓存问题与索引编码问题联系起来。本文着重于通过使用在这项工作中已知或新开发的索引编码问题工具来推导缓存问题的基本性能极限。首先，基于“非循环索引编码的逆界”，提出了在未编码的高速缓存放置的约束下针对缓存问题的逆界。当文件数不少于用户数时，可以通过Maddah-Ali和Niesen的方案来实现这一逆界，否则，可以通过新获得的索引编码方案来实现。所提出的索引编码可实现方案基于分布式源编码，并且严格地对广泛使用的“复合（索引）编码”可实现范围及其改进进行了改进，并且具有独立的意义。本文研究结果的重要结果是，只有通过考虑带有编码放置阶段的策略，才有可能对Maddah-Ali和Niesen提出的编码缓存问题进行改进。然而，Yu等人的最新工作表明，与本文介绍的结果相比，编码缓存的放置最多可以使网络负载减少一半。

著录项

  • 来源
    《IEEE Transactions on Information Theory》 |2020年第3期|1318-1332|共15页
  • 作者

  • 作者单位

    Univ Paris Sud Cent Supelec French Natl Ctr Sci Res CNRS L2S F-91192 Gif Sur Yvette France|Tech Univ Berlin Elect Engn & Comp Sci Dept D-10587 Berlin Germany;

    Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA;

    Univ Paris Sud French Natl Ctr Sci Res CNRS F-91192 Gif Sur Yvette France|Univ Montreal MILA Montreal PQ H3T 1N8 Canada;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Coded caching; uncoded cache placement; index coding; distributed source coding;

    机译：编码缓存;未编码的缓存位置;索引编码分布式源编码;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号