基于线性流行度预测的混合点对点网络上共享内容副本的预先部署

Kazumasa Takahashi, S. Sugawara
{"title":"基于线性流行度预测的混合点对点网络上共享内容副本的预先部署","authors":"Kazumasa Takahashi, S. Sugawara","doi":"10.1109/ICIET51873.2021.9419648","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient content deployment method over a Peer-to-Peer network in advance, before issuing content retrieval requests from the users, according to the users' location and whose content preferences. In that situation, the proposed method predicts the temporal alteration of each content items' popularity using simple linear approximation and deploys each item to its appropriate place. As a result, the method can be expected that the network load, content loss, and storage cost required for redundant replica deployment will be reduced. On top of that, the proposal is evaluated by computer simulations from the viewpoint of those three costs mentioned above, and from the results, the effectiveness of the proposed method is finally discussed.","PeriodicalId":156688,"journal":{"name":"2021 9th International Conference on Information and Education Technology (ICIET)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"In-advance Deployment of Shared Content Replicas over Hybrid Peer-to-Peer Network Using Linear Popularity Prediction\",\"authors\":\"Kazumasa Takahashi, S. Sugawara\",\"doi\":\"10.1109/ICIET51873.2021.9419648\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an efficient content deployment method over a Peer-to-Peer network in advance, before issuing content retrieval requests from the users, according to the users' location and whose content preferences. In that situation, the proposed method predicts the temporal alteration of each content items' popularity using simple linear approximation and deploys each item to its appropriate place. As a result, the method can be expected that the network load, content loss, and storage cost required for redundant replica deployment will be reduced. On top of that, the proposal is evaluated by computer simulations from the viewpoint of those three costs mentioned above, and from the results, the effectiveness of the proposed method is finally discussed.\",\"PeriodicalId\":156688,\"journal\":{\"name\":\"2021 9th International Conference on Information and Education Technology (ICIET)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 9th International Conference on Information and Education Technology (ICIET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIET51873.2021.9419648\",\"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 9th International Conference on Information and Education Technology (ICIET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIET51873.2021.9419648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于点对点网络的高效内容部署方法,在用户发出内容检索请求之前,根据用户的位置和内容偏好提前进行内容部署。在这种情况下,所提出的方法使用简单的线性近似来预测每个内容项的流行程度的时间变化,并将每个内容项部署到适当的位置。因此,可以预期该方法将降低冗余副本部署所需的网络负载、内容丢失和存储成本。在此基础上,从上述三种成本的角度对该方案进行了计算机模拟评估,并从结果上讨论了所提出方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
In-advance Deployment of Shared Content Replicas over Hybrid Peer-to-Peer Network Using Linear Popularity Prediction
This paper proposes an efficient content deployment method over a Peer-to-Peer network in advance, before issuing content retrieval requests from the users, according to the users' location and whose content preferences. In that situation, the proposed method predicts the temporal alteration of each content items' popularity using simple linear approximation and deploys each item to its appropriate place. As a result, the method can be expected that the network load, content loss, and storage cost required for redundant replica deployment will be reduced. On top of that, the proposal is evaluated by computer simulations from the viewpoint of those three costs mentioned above, and from the results, the effectiveness of the proposed method is finally discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信