通过评估web可扩展存储的流行程度来评估不平衡复制

Ting-wei Chen, Carlos Madrazo, Takeshi Tsuchiya, K. Koyanagi
{"title":"通过评估web可扩展存储的流行程度来评估不平衡复制","authors":"Ting-wei Chen, Carlos Madrazo, Takeshi Tsuchiya, K. Koyanagi","doi":"10.1109/CSAE.2011.5952831","DOIUrl":null,"url":null,"abstract":"A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80–20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Unbalanced replication by evaluating popularity over web scalable storage\",\"authors\":\"Ting-wei Chen, Carlos Madrazo, Takeshi Tsuchiya, K. Koyanagi\",\"doi\":\"10.1109/CSAE.2011.5952831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80–20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.\",\"PeriodicalId\":138215,\"journal\":{\"name\":\"2011 IEEE International Conference on Computer Science and Automation Engineering\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Computer Science and Automation Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSAE.2011.5952831\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Computer Science and Automation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAE.2011.5952831","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于点对点的存储系统已经成为缓解网络拥塞和存储空间限制的一种常用方式,用于提供文件共享、分布式计算和即时通信。由于在文件共享中使用了点对点技术,因此产生文件的副本以获得快速响应和高可用性。另一方面,过多的文件复制可能会在文件变得不受欢迎后浪费存储空间。目标是有效地管理文件的副本。在所提出的方法中,定义了用于评估文件的流行程度的流行级别,用于确定复制数量的增加或减少。流行级别有三个阈值来确定文件的复制。阈值是根据80-20规则设置的,并且随着时间的推移会动态变化。本文认为,文件的流行程度和文件的复制次数是相互影响的,可以有效地利用存储空间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Unbalanced replication by evaluating popularity over web scalable storage
A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80–20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visual group identification method of technical competitors using LinLog graph clustering algorithm Overview of 3D textile dynamic simulation research Monotonically decreasing eigenvalue for edge-sharpening diffusion Visual Tracking with adaptive layered-optimizing particles in Multifeature Particle Filtering Framework The fast Viterbi algorithm caching Profile Hidden Markov Models on graphic processing units
×
引用
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