RevOPT:基于lstm的CDN高效缓存策略

Hamza Ben Ammar, Y. Ghamri-Doudane
{"title":"RevOPT:基于lstm的CDN高效缓存策略","authors":"Hamza Ben Ammar, Y. Ghamri-Doudane","doi":"10.1109/GLOBECOM46510.2021.9685051","DOIUrl":null,"url":null,"abstract":"In order to face the rise in data consumption and network congestion, caching structures like Content Delivery Networks (CDNs) are being more and more used and integrated into the network infrastructure. Knowing that the capacities of caching resources are most often limited due to their large operational cost, it has become very important that these entities are managed efficiently. Especially, at the caching operations level, the question that arises is what content should be cached or evicted from the cache when it becomes full. Having these in mind, we introduce a lightweight Artificial Intelligence-based caching scheme called Reversed OPT (RevOPT). In our proposal, we use a Long Short-Term Memory (LSTM) encoder-decoder model to learn future requests patterns from the past and exploit its outcome with a Counting Bloom Filter (CBF) structure to manage efficiently the caching decisions and to keep in the cache only contents expected to be reused in the near future. The conducted simulations show promising results of RevOPT in terms of the cache hit ratio compared to existing caching algorithms.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"RevOPT: An LSTM-based Efficient Caching Strategy for CDN\",\"authors\":\"Hamza Ben Ammar, Y. Ghamri-Doudane\",\"doi\":\"10.1109/GLOBECOM46510.2021.9685051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to face the rise in data consumption and network congestion, caching structures like Content Delivery Networks (CDNs) are being more and more used and integrated into the network infrastructure. Knowing that the capacities of caching resources are most often limited due to their large operational cost, it has become very important that these entities are managed efficiently. Especially, at the caching operations level, the question that arises is what content should be cached or evicted from the cache when it becomes full. Having these in mind, we introduce a lightweight Artificial Intelligence-based caching scheme called Reversed OPT (RevOPT). In our proposal, we use a Long Short-Term Memory (LSTM) encoder-decoder model to learn future requests patterns from the past and exploit its outcome with a Counting Bloom Filter (CBF) structure to manage efficiently the caching decisions and to keep in the cache only contents expected to be reused in the near future. The conducted simulations show promising results of RevOPT in terms of the cache hit ratio compared to existing caching algorithms.\",\"PeriodicalId\":200641,\"journal\":{\"name\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM46510.2021.9685051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM46510.2021.9685051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为了应对日益增长的数据消耗和网络拥塞,像内容分发网络(cdn)这样的缓存结构被越来越多地使用并集成到网络基础设施中。由于缓存资源的操作成本很大,它们的容量通常受到限制,因此有效地管理这些实体变得非常重要。特别是,在缓存操作级别,出现的问题是,当缓存满时,应该缓存哪些内容,或者从缓存中删除哪些内容。考虑到这些,我们引入了一种轻量级的基于人工智能的缓存方案,称为反向OPT (RevOPT)。在我们的建议中,我们使用长短期记忆(LSTM)编码器-解码器模型来从过去学习未来的请求模式,并利用计数布隆过滤器(CBF)结构来有效地管理缓存决策,并在缓存中只保留预期在不久的将来重用的内容。仿真结果表明,与现有的缓存算法相比,RevOPT在缓存命中率方面取得了令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RevOPT: An LSTM-based Efficient Caching Strategy for CDN
In order to face the rise in data consumption and network congestion, caching structures like Content Delivery Networks (CDNs) are being more and more used and integrated into the network infrastructure. Knowing that the capacities of caching resources are most often limited due to their large operational cost, it has become very important that these entities are managed efficiently. Especially, at the caching operations level, the question that arises is what content should be cached or evicted from the cache when it becomes full. Having these in mind, we introduce a lightweight Artificial Intelligence-based caching scheme called Reversed OPT (RevOPT). In our proposal, we use a Long Short-Term Memory (LSTM) encoder-decoder model to learn future requests patterns from the past and exploit its outcome with a Counting Bloom Filter (CBF) structure to manage efficiently the caching decisions and to keep in the cache only contents expected to be reused in the near future. The conducted simulations show promising results of RevOPT in terms of the cache hit ratio compared to existing caching algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Blockchain-based Energy Trading Scheme for Dynamic Charging of Electric Vehicles Algebraic Design of a Class of Rate 1/3 Quasi-Cyclic LDPC Codes A Fast and Scalable Resource Allocation Scheme for End-to-End Network Slices Modelling of Multi-Tier Handover in LiFi Networks Enabling Efficient Scheduling Policy in Intelligent Reflecting Surface Aided Federated Learning
×
引用
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