A Deep Reinforcement Learning Approach for Shared Caching

P. Trinadh, Anoop Thomas
{"title":"A Deep Reinforcement Learning Approach for Shared Caching","authors":"P. Trinadh, Anoop Thomas","doi":"10.1109/NCC52529.2021.9530143","DOIUrl":null,"url":null,"abstract":"A client-server network in which multiple clients are connected to a single server possessing files/data through a shared error free link is considered. Each client is associated with a cache memory and demands a file from the server. The server loads the cache memory with a portion of files during off-peak hours to reduce the delivery rate during peak hours. A decentralized placement approach which is more practical for large networks is considered for filling the cache contents. In this paper, the shared caching problem in which each cache can be accessed by multiple clients is considered. A Deep Reinforcement Learning (DRL) based framework is proposed for optimizing the delivery rate of the requested contents by the users. The system is strategically modelled as a Markov decision process, to deploy our DRL agent and enable it to learn how to make decisions. The DRL agent learns to multicast coded bits from the file library of the server in such a way that the user requests are met with minimum transmissions of these coded bits. It is shown that the proposed DRL based agent outperforms the existing decentralized algorithms for the shared caching problem in terms of normalized delivery rate. For the conventional caching problem which is a special case of the shared caching problem, simulation results show that the proposed DRL agent outperforms the existing algorithms.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC52529.2021.9530143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A client-server network in which multiple clients are connected to a single server possessing files/data through a shared error free link is considered. Each client is associated with a cache memory and demands a file from the server. The server loads the cache memory with a portion of files during off-peak hours to reduce the delivery rate during peak hours. A decentralized placement approach which is more practical for large networks is considered for filling the cache contents. In this paper, the shared caching problem in which each cache can be accessed by multiple clients is considered. A Deep Reinforcement Learning (DRL) based framework is proposed for optimizing the delivery rate of the requested contents by the users. The system is strategically modelled as a Markov decision process, to deploy our DRL agent and enable it to learn how to make decisions. The DRL agent learns to multicast coded bits from the file library of the server in such a way that the user requests are met with minimum transmissions of these coded bits. It is shown that the proposed DRL based agent outperforms the existing decentralized algorithms for the shared caching problem in terms of normalized delivery rate. For the conventional caching problem which is a special case of the shared caching problem, simulation results show that the proposed DRL agent outperforms the existing algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
共享缓存的深度强化学习方法
考虑一个客户机-服务器网络,其中多个客户机通过共享的无错误链接连接到拥有文件/数据的单个服务器。每个客户机都与一个缓存内存相关联,并从服务器请求一个文件。服务器在非高峰时段用一部分文件加载缓存内存,以降低高峰时段的交付率。在填充缓存内容时,考虑了一种对大型网络更实用的分散放置方法。本文研究了多个客户端可以访问每个缓存的共享缓存问题。提出了一种基于深度强化学习(DRL)的框架,用于优化用户请求内容的传递率。该系统被战略性地建模为马尔可夫决策过程,以部署我们的DRL代理并使其能够学习如何做出决策。DRL代理学习从服务器的文件库中多播编码位,以这样一种方式满足用户请求,以这些编码位的最小传输。结果表明,本文提出的基于DRL的代理在规范化交付率方面优于现有的分布式共享缓存算法。对于传统的缓存问题,即共享缓存问题的一种特殊情况,仿真结果表明所提出的DRL代理优于现有的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Biomedical Image Retrieval using Muti-Scale Local Bit-plane Arbitrary Shaped Patterns Forensics of Decompressed JPEG Color Images Based on Chroma Subsampling Optimized Bio-inspired Spiking Neural Models based Anatomical and Functional Neurological Image Fusion in NSST Domain Improved Hankel Norm Criterion for Interfered Nonlinear Digital Filters Subjected to Hardware Constraints The Capacity of Photonic Erasure Channels with Detector Dead Times
×
引用
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