基于异构用户配置文件的编码缓存平均速率研究

Ciyuan Zhang, B. Peleato
{"title":"基于异构用户配置文件的编码缓存平均速率研究","authors":"Ciyuan Zhang, B. Peleato","doi":"10.1109/ICC40277.2020.9148779","DOIUrl":null,"url":null,"abstract":"Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On the Average Rate for Coded Caching with Heterogeneous User Profiles\",\"authors\":\"Ciyuan Zhang, B. Peleato\",\"doi\":\"10.1109/ICC40277.2020.9148779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.\",\"PeriodicalId\":106560,\"journal\":{\"name\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC40277.2020.9148779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

编码缓存利用非高峰时段的预取和多播传输来平衡通信网络中的流量负载。尽管现代系统通常能够根据用户的偏好对用户进行分类,并且倾向于更关心平均速率而不是峰值速率,但大多数现有研究都侧重于在同质文件流行度的情况下降低峰值传输速率。本文考虑了一个具有异构用户配置文件的场景,并在假设每个用户只能请求总可用文件的一个子集的情况下,分析了三种编码缓存方案的平均传输速率。此外,还评估了当文件数量远大于用户数量和缓存容量时,三种方案的平均速率。此外,在用户的存储空间相对较小的情况下,提出了使平均速率最小化的缓存分配方法。我们的结果展示了导致最小平均速率和峰值速率的缓存分布之间的联系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Average Rate for Coded Caching with Heterogeneous User Profiles
Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Full Duplex MIMO Digital Beamforming with Reduced Complexity AUXTX Analog Cancellation Cognitive Management and Control of Optical Networks in Dynamic Environments Offloading Media Traffic to Programmable Data Plane Switches Simultaneous Transmitting and Air Computing for High-Speed Point-to-Point Wireless Communication A YouTube Dataset with User-level Usage Data: Baseline Characteristics and Key Insights
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1