两层分层缓存辅助系统中的协同缓存

Van Xiem Hoang, T. H. Duong, Anh Vu Trinh, Xuan-Thang Vu
{"title":"两层分层缓存辅助系统中的协同缓存","authors":"Van Xiem Hoang, T. H. Duong, Anh Vu Trinh, Xuan-Thang Vu","doi":"10.25073/2588-1086/VNUCSCE.222","DOIUrl":null,"url":null,"abstract":"Caching has received much attention as a promising technique to overcome high data rate and stringent latency requirements in the future wireless networks. The premise of caching technique is to prefetch most popular contents closer to end users in local cache of edge nodes, e.g., base station (BS). When a user requests a content that is available in the cache, it can be served directly without being sent from the core network. In this paper, we investigate the performance of hierarchical caching systems, in which both BS and end users are equipped with a storage memory. In particular, we propose a novel cooperative caching scheme that jointly optimizes the content placement at the BS’s and users’ caches. The proposed caching scheme is analytically shown to achieve a larger global caching gain than the reference in both uncoded – and coded caching strategies. Finally, numerical results are presented to demonstrate the effectiveness of our proposed caching algorithm. \nKeywords \nHierarchical caching system, cooperative caching, caching gain, uncoded caching, coded caching \n References \n[1] D. Liu, B. Chen, C. Yang, A.F. Molisch, Caching at the Wireless Edge: Design Aspects, Challenges, and Future Directions, IEEE Communications Magazine 54 (2016) 22-28. https://doi.org/10.1109/MCOM.2016.7565183.[2] T.X. Vu, S. Chatzinotas, B. Ottersten, Edge-Caching Wireless Networks: Performance Analysis and Optimization, IEEE Transactions on Wireless Communications 17 (2018) 2827-2839. https://doi.org/10.1109/TWC.2018.2803816.[3] M.A. Maddah-Ali, U. Niesen, Fundamental Limits of Caching, IEEE Transactions on Information Theory 60 (2014) 2856-2867. https://doi.org/10.1109/TIT.2014.2306938.[4] M.A. Maddah-Ali, U. Niesen, Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff,  IEEE/ACM Transactions on Networking 23 (2015) 1029-1040. https://doi.org/10.1109/TNET.2014.2317316.[5] U. Niesen, M.A. Maddah-Ali, Coded Caching with Nonuniform Demands, IEEE Transactions on Information Theory 63 (2017) 1146-1158. https://doi.org/10.1109/TIT.2016.2639522.[6] Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, The exact rate-memory tradeoff for caching with uncoded prefetching, IEEE Transactions on Information Theory 64 (2018) 1281-1296. https://doi.org/10.1109/TIT.2017.2785237.[7] S.P. Shariatpanahi, H. Shah-Mansouri, B.H. Khalaj, Caching gain in interference-limited wireless networks, IET Communications 9 (2015) 1269-1277. https://doi.org/10.1049/iet-com.2014.0955.[8] N. Naderializadeh, M.A. Maddah-Ali, A.S. Avestimehr, Fundamental limits of cache-aided interference management, IEEE Transactions on Information Theory 63 (2017) 3092-3107. https://doi.org/10.1109/TIT.2017.2669942.[9] J. Hachem, U. Niesen, S. Diggavi, Energy-Efficiency Gains of Caching for Interference Channels, IEEE Communications Letters 22 (2018) 1434-1437. https://doi.org/10.1109/LCOMM.2018.2822694.[10] M.A. Maddah-Ali, U. Niesen, Cache-aided interference channels, IEEE International Symposium on Information Theory ISIT, 2015, pp. 809-813. https://doi.org/10.1109/ISIT.2015.7282567.[11] T.X. Vu, S. Chatzinotas, B. Ottersten, T.Q. Duong, Energy minimization for cache-assisted content delivery networks with wireless backhaul, IEEE Wireless Communications Letters 7 (2018) 332-335. https://doi.org/10.1109/LWC.2017.2776924.[12] S. Li, Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, Coded distributed computing: Fundamental limits and practical challenges, 50th Asilomar Conference on Signals, Systems and Computers (2016) 509-513. https://doi.org/ 10.1109/ACSSC.2016.7869092.[13] S. Li, M.A. Maddah-Ali, Q. Yu, A.S. Avestimehr, A fundamental tradeoff between computation and communication in distributed computing, IEEE Transactions on Information Theory 64 (2018) 109-128. https://doi.org/10.1109/TIT.2017.2756959.[14] S. Borst, V. Gupta, A. Walid, Distributed caching algorithms for content distribution networks, Proceedings IEEE INFOCOM. (2010) 1-9. https://doi.org/10.1109/INFCOM.2010.5461964.[15] N. Karamchandani, U. Niesen, M.A. Maddah-Ali, SN Diggavi, Hierarchical coded caching, IEEE Transactions on Information Theory 62 (2016) 3212-3229. https://doi.org/10.1109/TIT.2016.2557804.[16] S.P. Shariatpanahi, G. Caire, B. H. Khalaj, Multi-antenna coded caching, IEEE International Symposium on Information Theory ISIT, 2017, pp. 2113-2117. https://doi.org/10.1109/ISIT.2017.8006902.[17] R. Pedarsani, M.A. Maddah-Ali, U. Niesen, Online coded caching, IEEE/ACM Transactions on Networking 24 (2016) 836-845. https://doi.org/10.1109/TNET.2015.2394482.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cooperative Caching in Two-Layer Hierarchical Cache-aided Systems\",\"authors\":\"Van Xiem Hoang, T. H. Duong, Anh Vu Trinh, Xuan-Thang Vu\",\"doi\":\"10.25073/2588-1086/VNUCSCE.222\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Caching has received much attention as a promising technique to overcome high data rate and stringent latency requirements in the future wireless networks. The premise of caching technique is to prefetch most popular contents closer to end users in local cache of edge nodes, e.g., base station (BS). When a user requests a content that is available in the cache, it can be served directly without being sent from the core network. In this paper, we investigate the performance of hierarchical caching systems, in which both BS and end users are equipped with a storage memory. In particular, we propose a novel cooperative caching scheme that jointly optimizes the content placement at the BS’s and users’ caches. The proposed caching scheme is analytically shown to achieve a larger global caching gain than the reference in both uncoded – and coded caching strategies. Finally, numerical results are presented to demonstrate the effectiveness of our proposed caching algorithm. \\nKeywords \\nHierarchical caching system, cooperative caching, caching gain, uncoded caching, coded caching \\n References \\n[1] D. Liu, B. Chen, C. Yang, A.F. Molisch, Caching at the Wireless Edge: Design Aspects, Challenges, and Future Directions, IEEE Communications Magazine 54 (2016) 22-28. https://doi.org/10.1109/MCOM.2016.7565183.[2] T.X. Vu, S. Chatzinotas, B. Ottersten, Edge-Caching Wireless Networks: Performance Analysis and Optimization, IEEE Transactions on Wireless Communications 17 (2018) 2827-2839. https://doi.org/10.1109/TWC.2018.2803816.[3] M.A. Maddah-Ali, U. Niesen, Fundamental Limits of Caching, IEEE Transactions on Information Theory 60 (2014) 2856-2867. https://doi.org/10.1109/TIT.2014.2306938.[4] M.A. Maddah-Ali, U. Niesen, Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff,  IEEE/ACM Transactions on Networking 23 (2015) 1029-1040. https://doi.org/10.1109/TNET.2014.2317316.[5] U. Niesen, M.A. Maddah-Ali, Coded Caching with Nonuniform Demands, IEEE Transactions on Information Theory 63 (2017) 1146-1158. https://doi.org/10.1109/TIT.2016.2639522.[6] Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, The exact rate-memory tradeoff for caching with uncoded prefetching, IEEE Transactions on Information Theory 64 (2018) 1281-1296. https://doi.org/10.1109/TIT.2017.2785237.[7] S.P. Shariatpanahi, H. Shah-Mansouri, B.H. Khalaj, Caching gain in interference-limited wireless networks, IET Communications 9 (2015) 1269-1277. https://doi.org/10.1049/iet-com.2014.0955.[8] N. Naderializadeh, M.A. Maddah-Ali, A.S. Avestimehr, Fundamental limits of cache-aided interference management, IEEE Transactions on Information Theory 63 (2017) 3092-3107. https://doi.org/10.1109/TIT.2017.2669942.[9] J. Hachem, U. Niesen, S. Diggavi, Energy-Efficiency Gains of Caching for Interference Channels, IEEE Communications Letters 22 (2018) 1434-1437. https://doi.org/10.1109/LCOMM.2018.2822694.[10] M.A. Maddah-Ali, U. Niesen, Cache-aided interference channels, IEEE International Symposium on Information Theory ISIT, 2015, pp. 809-813. https://doi.org/10.1109/ISIT.2015.7282567.[11] T.X. Vu, S. Chatzinotas, B. Ottersten, T.Q. Duong, Energy minimization for cache-assisted content delivery networks with wireless backhaul, IEEE Wireless Communications Letters 7 (2018) 332-335. https://doi.org/10.1109/LWC.2017.2776924.[12] S. Li, Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, Coded distributed computing: Fundamental limits and practical challenges, 50th Asilomar Conference on Signals, Systems and Computers (2016) 509-513. https://doi.org/ 10.1109/ACSSC.2016.7869092.[13] S. Li, M.A. Maddah-Ali, Q. Yu, A.S. Avestimehr, A fundamental tradeoff between computation and communication in distributed computing, IEEE Transactions on Information Theory 64 (2018) 109-128. https://doi.org/10.1109/TIT.2017.2756959.[14] S. Borst, V. Gupta, A. Walid, Distributed caching algorithms for content distribution networks, Proceedings IEEE INFOCOM. (2010) 1-9. https://doi.org/10.1109/INFCOM.2010.5461964.[15] N. Karamchandani, U. Niesen, M.A. Maddah-Ali, SN Diggavi, Hierarchical coded caching, IEEE Transactions on Information Theory 62 (2016) 3212-3229. https://doi.org/10.1109/TIT.2016.2557804.[16] S.P. Shariatpanahi, G. Caire, B. H. Khalaj, Multi-antenna coded caching, IEEE International Symposium on Information Theory ISIT, 2017, pp. 2113-2117. https://doi.org/10.1109/ISIT.2017.8006902.[17] R. Pedarsani, M.A. Maddah-Ali, U. Niesen, Online coded caching, IEEE/ACM Transactions on Networking 24 (2016) 836-845. https://doi.org/10.1109/TNET.2015.2394482.\",\"PeriodicalId\":416488,\"journal\":{\"name\":\"VNU Journal of Science: Computer Science and Communication Engineering\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"VNU Journal of Science: Computer Science and Communication Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.25073/2588-1086/VNUCSCE.222\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"VNU Journal of Science: Computer Science and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25073/2588-1086/VNUCSCE.222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在未来的无线网络中,缓存作为一种克服高数据速率和严格延迟要求的有前途的技术受到了广泛的关注。缓存技术的前提是在边缘节点(如基站(BS))的本地缓存中预取最接近最终用户的热门内容。当用户请求缓存中可用的内容时,可以直接提供该内容,而无需从核心网络发送。在本文中,我们研究了分层缓存系统的性能,其中BS和最终用户都配备了存储内存。特别是,我们提出了一种新的合作缓存方案,该方案共同优化了在BS和用户缓存中的内容放置。分析表明,所提出的缓存方案在非编码和编码缓存策略中都比参考方案获得更大的全局缓存增益。最后,给出了数值结果来验证所提缓存算法的有效性。[1]刘德华,陈斌,杨超,Molisch,无线边缘缓存:设计、挑战和未来发展方向,IEEE通信学报,54(2016):22-28。[2]吴廷祥,吴志强,吴志强,基于边缘缓存的无线网络性能分析与优化,通信学报,2017(2):379 - 379。[3]刘建军,张建军,张建军,高速缓存技术的研究进展,计算机工程学报,2014,(4):559 - 567。[4]王志强,张志强,基于分布式编码的高速缓存算法,计算机应用学报,2015(4):1029-1040。[5]王志强,王志强,基于非统一需求的编码缓存算法,计算机工程与应用,2017(5):349 - 349。[6]于庆,马德安。基于非编码预取的高速缓存的速率-内存权衡[j] .计算机工程学报,2018(6):1281-1296。[7]张建军,张建军,张建军。无线网络中高速缓存增益的研究进展[j] .通信技术与技术,2015(4):379 - 379。[8]王晓明,王晓明,王晓明,基于多路径的高速缓存干扰管理[j] .计算机工程与应用,2016(4):379 - 379。[9]张建军,张建军,张建军。基于多通道高速缓存的多通道高速缓存算法[j] .通信技术学报,2018,34(4):559 - 559。[10]张建军,张建军,张建军,高速缓存辅助干扰信道,信息技术与应用,2015,pp. 391 - 391。[11]吴廷霞,王晓明,王晓明,基于无线回传的无线内容分发网络的能量最小化算法,通信学报,2018,33(2):332-335。https://doi.org/10.1109/LWC.2017.2776924.[12]李淑娟,于庆强,M.A. madah - ali, A.S. Avestimehr,编码分布式计算:基本限制和实践挑战,第50届Asilomar信号系统与计算机会议,2016,509-513。https://doi.org/ 10.1109 / ACSSC.2016.7869092。[13]李士林,于强,A.S. Avestimehr,分布式计算中计算与通信的基本权衡,信息学报,64(2018):109-128。[14]张晓明,张晓明,张晓明,基于分布式缓存算法的内容分发网络[j] .计算机工程学报。(2010) 1 - 9。[15]张建军,张建军,张建军。基于编码的高速缓存技术,计算机应用学报,2016,32(1):334 - 334。[16]王晓明,王晓明,王晓明,多天线编码缓存,信息技术与应用,2017,pp. 1313 - 1317。[17]王晓明,王晓明,王晓明,网络编码缓存技术,计算机工程学报,2016(4):836-845。https://doi.org/10.1109/TNET.2015.2394482。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cooperative Caching in Two-Layer Hierarchical Cache-aided Systems
Caching has received much attention as a promising technique to overcome high data rate and stringent latency requirements in the future wireless networks. The premise of caching technique is to prefetch most popular contents closer to end users in local cache of edge nodes, e.g., base station (BS). When a user requests a content that is available in the cache, it can be served directly without being sent from the core network. In this paper, we investigate the performance of hierarchical caching systems, in which both BS and end users are equipped with a storage memory. In particular, we propose a novel cooperative caching scheme that jointly optimizes the content placement at the BS’s and users’ caches. The proposed caching scheme is analytically shown to achieve a larger global caching gain than the reference in both uncoded – and coded caching strategies. Finally, numerical results are presented to demonstrate the effectiveness of our proposed caching algorithm. Keywords Hierarchical caching system, cooperative caching, caching gain, uncoded caching, coded caching  References [1] D. Liu, B. Chen, C. Yang, A.F. Molisch, Caching at the Wireless Edge: Design Aspects, Challenges, and Future Directions, IEEE Communications Magazine 54 (2016) 22-28. https://doi.org/10.1109/MCOM.2016.7565183.[2] T.X. Vu, S. Chatzinotas, B. Ottersten, Edge-Caching Wireless Networks: Performance Analysis and Optimization, IEEE Transactions on Wireless Communications 17 (2018) 2827-2839. https://doi.org/10.1109/TWC.2018.2803816.[3] M.A. Maddah-Ali, U. Niesen, Fundamental Limits of Caching, IEEE Transactions on Information Theory 60 (2014) 2856-2867. https://doi.org/10.1109/TIT.2014.2306938.[4] M.A. Maddah-Ali, U. Niesen, Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff,  IEEE/ACM Transactions on Networking 23 (2015) 1029-1040. https://doi.org/10.1109/TNET.2014.2317316.[5] U. Niesen, M.A. Maddah-Ali, Coded Caching with Nonuniform Demands, IEEE Transactions on Information Theory 63 (2017) 1146-1158. https://doi.org/10.1109/TIT.2016.2639522.[6] Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, The exact rate-memory tradeoff for caching with uncoded prefetching, IEEE Transactions on Information Theory 64 (2018) 1281-1296. https://doi.org/10.1109/TIT.2017.2785237.[7] S.P. Shariatpanahi, H. Shah-Mansouri, B.H. Khalaj, Caching gain in interference-limited wireless networks, IET Communications 9 (2015) 1269-1277. https://doi.org/10.1049/iet-com.2014.0955.[8] N. Naderializadeh, M.A. Maddah-Ali, A.S. Avestimehr, Fundamental limits of cache-aided interference management, IEEE Transactions on Information Theory 63 (2017) 3092-3107. https://doi.org/10.1109/TIT.2017.2669942.[9] J. Hachem, U. Niesen, S. Diggavi, Energy-Efficiency Gains of Caching for Interference Channels, IEEE Communications Letters 22 (2018) 1434-1437. https://doi.org/10.1109/LCOMM.2018.2822694.[10] M.A. Maddah-Ali, U. Niesen, Cache-aided interference channels, IEEE International Symposium on Information Theory ISIT, 2015, pp. 809-813. https://doi.org/10.1109/ISIT.2015.7282567.[11] T.X. Vu, S. Chatzinotas, B. Ottersten, T.Q. Duong, Energy minimization for cache-assisted content delivery networks with wireless backhaul, IEEE Wireless Communications Letters 7 (2018) 332-335. https://doi.org/10.1109/LWC.2017.2776924.[12] S. Li, Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, Coded distributed computing: Fundamental limits and practical challenges, 50th Asilomar Conference on Signals, Systems and Computers (2016) 509-513. https://doi.org/ 10.1109/ACSSC.2016.7869092.[13] S. Li, M.A. Maddah-Ali, Q. Yu, A.S. Avestimehr, A fundamental tradeoff between computation and communication in distributed computing, IEEE Transactions on Information Theory 64 (2018) 109-128. https://doi.org/10.1109/TIT.2017.2756959.[14] S. Borst, V. Gupta, A. Walid, Distributed caching algorithms for content distribution networks, Proceedings IEEE INFOCOM. (2010) 1-9. https://doi.org/10.1109/INFCOM.2010.5461964.[15] N. Karamchandani, U. Niesen, M.A. Maddah-Ali, SN Diggavi, Hierarchical coded caching, IEEE Transactions on Information Theory 62 (2016) 3212-3229. https://doi.org/10.1109/TIT.2016.2557804.[16] S.P. Shariatpanahi, G. Caire, B. H. Khalaj, Multi-antenna coded caching, IEEE International Symposium on Information Theory ISIT, 2017, pp. 2113-2117. https://doi.org/10.1109/ISIT.2017.8006902.[17] R. Pedarsani, M.A. Maddah-Ali, U. Niesen, Online coded caching, IEEE/ACM Transactions on Networking 24 (2016) 836-845. https://doi.org/10.1109/TNET.2015.2394482.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信