Coded Caching in Multi-Rate Wireless Networks

Makoto Takita, M. Hirotomo, M. Morii
{"title":"Coded Caching in Multi-Rate Wireless Networks","authors":"Makoto Takita, M. Hirotomo, M. Morii","doi":"10.1587/transfun.2020tap0013","DOIUrl":null,"url":null,"abstract":"SUMMARY The network load is increasing due to the spread of con- tent distribution services. Caching is recognized as a technique to reduce the peak network load by storing popular content into memories of users. Coded caching is a new caching approach based on a carefully designed content placement to create coded multicasting opportunities. Coded caching schemes in single-rate networks are evaluated by the tradeo ff between the size of memory and that of delivered data. For considering the network with multiple transmission rates, it is crucial how to operate multicast. In multicast delivery, a sender must communicate to intended receivers at a rate that is available to all receivers. Multicast scheduling method of determining rates to deliver are evaluated by throughput and de- lay in multi-rate wireless networks. In this paper, we discuss coded caching in the multi-rate wireless networks. We newly define a measure for eval- uating the coded caching scheme as coded caching delay and propose a new coded caching scheme. Also, we compare the proposed coded caching scheme with conventional coded caching schemes and show that the proposed scheme is suitable for multi-rate wireless networks.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"240 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/transfun.2020tap0013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

SUMMARY The network load is increasing due to the spread of con- tent distribution services. Caching is recognized as a technique to reduce the peak network load by storing popular content into memories of users. Coded caching is a new caching approach based on a carefully designed content placement to create coded multicasting opportunities. Coded caching schemes in single-rate networks are evaluated by the tradeo ff between the size of memory and that of delivered data. For considering the network with multiple transmission rates, it is crucial how to operate multicast. In multicast delivery, a sender must communicate to intended receivers at a rate that is available to all receivers. Multicast scheduling method of determining rates to deliver are evaluated by throughput and de- lay in multi-rate wireless networks. In this paper, we discuss coded caching in the multi-rate wireless networks. We newly define a measure for eval- uating the coded caching scheme as coded caching delay and propose a new coded caching scheme. Also, we compare the proposed coded caching scheme with conventional coded caching schemes and show that the proposed scheme is suitable for multi-rate wireless networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多速率无线网络中的编码缓存
由于内容分发服务的普及,网络负载正在增加。缓存被认为是一种通过将流行内容存储到用户内存中来减少峰值网络负载的技术。编码缓存是一种新的缓存方法,它基于精心设计的内容布局来创建编码多播机会。单速率网络中的编码缓存方案是通过权衡内存大小和传输数据大小来评估的。考虑到网络具有多种传输速率,如何操作组播是一个关键问题。在多播传递中,发送方必须以所有接收方可用的速率与预期接收方通信。在多速率无线网络中,通过吞吐量和延迟对确定传输速率的组播调度方法进行了评价。本文讨论了多速率无线网络中的编码缓存技术。我们重新定义了一种评价编码缓存方案的度量方法——编码缓存延迟,并提出了一种新的编码缓存方案。并将所提出的编码缓存方案与传统的编码缓存方案进行了比较,结果表明所提出的编码缓存方案适用于多速率无线网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Erratum: Concatenated Permutation Codes under Chebyshev Distance [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E106.A (2023), No. 3 pp.616-632] Automorphism Shuffles for Graphs and Hypergraphs and Its Applications Erratum: A Compact Digital Signature Scheme Based on the Module-LWR Problem [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E104.A (2021), No. 9 pp.1219-1234] Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields Ramsey Numbers of Trails
×
引用
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