编码缓存与共享缓存和私有缓存

Elizabath Peter, K. K. K. Namboodiri, B. Rajan
{"title":"编码缓存与共享缓存和私有缓存","authors":"Elizabath Peter, K. K. K. Namboodiri, B. Rajan","doi":"10.1109/ITW55543.2023.10161678","DOIUrl":null,"url":null,"abstract":"We consider the coded caching problem where users are simultaneously endowed with a private and shared cache. The problem setting consists of a server having a library of files connected to a set of users via a smaller number of helper nodes having its own storage facility. Each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache serves an arbitrary number of users. We assume that the server knows the set of users served by each helper cache at the content placement itself. For this setting, we design two centralized coded caching schemes based on uncoded placement. The proposed schemes are shown to be optimal in specific memory regimes.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Coded Caching with Shared Caches and Private Caches\",\"authors\":\"Elizabath Peter, K. K. K. Namboodiri, B. Rajan\",\"doi\":\"10.1109/ITW55543.2023.10161678\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the coded caching problem where users are simultaneously endowed with a private and shared cache. The problem setting consists of a server having a library of files connected to a set of users via a smaller number of helper nodes having its own storage facility. Each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache serves an arbitrary number of users. We assume that the server knows the set of users served by each helper cache at the content placement itself. For this setting, we design two centralized coded caching schemes based on uncoded placement. The proposed schemes are shown to be optimal in specific memory regimes.\",\"PeriodicalId\":439800,\"journal\":{\"name\":\"2023 IEEE Information Theory Workshop (ITW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW55543.2023.10161678\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW55543.2023.10161678","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们考虑编码缓存问题,其中用户同时被赋予私有和共享缓存。问题设置包括一个服务器,该服务器拥有一个文件库,通过拥有自己的存储设施的较少数量的辅助节点连接到一组用户。每个用户都有一个专用的缓存,也用于预取文件内容。每个helper缓存为任意数量的用户提供服务。我们假设服务器知道在内容放置处的每个helper缓存所服务的用户集。对于这种设置,我们基于非编码放置设计了两种集中式编码缓存方案。所提出的方案在特定的内存环境下是最优的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coded Caching with Shared Caches and Private Caches
We consider the coded caching problem where users are simultaneously endowed with a private and shared cache. The problem setting consists of a server having a library of files connected to a set of users via a smaller number of helper nodes having its own storage facility. Each user possesses a dedicated cache which is also used to prefetch file contents. Each helper cache serves an arbitrary number of users. We assume that the server knows the set of users served by each helper cache at the content placement itself. For this setting, we design two centralized coded caching schemes based on uncoded placement. The proposed schemes are shown to be optimal in specific memory regimes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信