Mobile Edge Data Cooperative Cache Admission Based on Content Popularity

Juan Fang, Siqi Chen, Min Cai
{"title":"Mobile Edge Data Cooperative Cache Admission Based on Content Popularity","authors":"Juan Fang, Siqi Chen, Min Cai","doi":"10.1109/EDGE53862.2021.00024","DOIUrl":null,"url":null,"abstract":"Edge computing provides more rapid and convenient services to the user by deploying computing resources and storage resources on network edges closer to the user. However, the edge server has small storage capacity, irregular user requests and real-time changes in user preferences. To address these problems, this paper presents a Mobile Edge Data Cooperative Cache Admission Based on Content Popularity (DCCCP) based on the perspective of the content provider. First, we analyze and learn the key feature properties of video objects to build the tree data structure and dynamically adjust the tree structure according to the state of the leaf nodes. Next, the multiarm bandit model is considered for the tree structure characteristics and the number of samples. In addition, considering the limited edge server capacity and the large cloudedge transmission latency, edge collaboration is used for data cache. Finally, we experiment the DCCCP algorithm with four excellent algorithms in terms of hit rate, latency and system cost, and demonstrate the effectiveness of the DCCCP algorithm.","PeriodicalId":115969,"journal":{"name":"2021 IEEE International Conference on Edge Computing (EDGE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Edge Computing (EDGE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDGE53862.2021.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Edge computing provides more rapid and convenient services to the user by deploying computing resources and storage resources on network edges closer to the user. However, the edge server has small storage capacity, irregular user requests and real-time changes in user preferences. To address these problems, this paper presents a Mobile Edge Data Cooperative Cache Admission Based on Content Popularity (DCCCP) based on the perspective of the content provider. First, we analyze and learn the key feature properties of video objects to build the tree data structure and dynamically adjust the tree structure according to the state of the leaf nodes. Next, the multiarm bandit model is considered for the tree structure characteristics and the number of samples. In addition, considering the limited edge server capacity and the large cloudedge transmission latency, edge collaboration is used for data cache. Finally, we experiment the DCCCP algorithm with four excellent algorithms in terms of hit rate, latency and system cost, and demonstrate the effectiveness of the DCCCP algorithm.
基于内容流行度的移动边缘数据协同缓存准入
边缘计算将计算资源和存储资源部署在离用户更近的网络边缘,为用户提供更快速、便捷的服务。但是,边缘服务器存储容量小,用户请求不规则,用户偏好实时变化。为了解决这些问题,本文提出了一种基于内容提供商视角的基于内容流行度的移动边缘数据协作缓存准入(DCCCP)。首先,对视频对象的关键特征属性进行分析学习,构建树状数据结构,并根据叶节点的状态动态调整树状结构。其次,考虑多臂强盗模型的树结构特征和样本数量。此外,考虑到边缘服务器容量有限和云边缘传输延迟较大,采用边缘协作进行数据缓存。最后,我们从命中率、延迟和系统开销等方面对四种优秀算法进行了DCCCP算法实验,验证了DCCCP算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信