P2P备份存储应用中的不协调对等体选择

László Toka, P. Michiardi
{"title":"P2P备份存储应用中的不协调对等体选择","authors":"László Toka, P. Michiardi","doi":"10.1109/INFCOMW.2009.5072202","DOIUrl":null,"url":null,"abstract":"In this work we tackle the problem of on-line backup and storage with a peer-to-peer approach. We propose a novel system architecture involving the users' devices that confederate by pooling their resources and offer an alternative to capital-intensive data-centers. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, colluding peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the \"quality\" of local resources they provide to reach lower operational costs. Our results are corroborated by both a game-theoretic analysis and a numerical evaluation of several system configurations.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"33 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Uncoordinated Peer Selection in P2P Backup and Storage Applications\",\"authors\":\"László Toka, P. Michiardi\",\"doi\":\"10.1109/INFCOMW.2009.5072202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we tackle the problem of on-line backup and storage with a peer-to-peer approach. We propose a novel system architecture involving the users' devices that confederate by pooling their resources and offer an alternative to capital-intensive data-centers. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, colluding peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the \\\"quality\\\" of local resources they provide to reach lower operational costs. Our results are corroborated by both a game-theoretic analysis and a numerical evaluation of several system configurations.\",\"PeriodicalId\":252414,\"journal\":{\"name\":\"IEEE INFOCOM Workshops 2009\",\"volume\":\"33 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM Workshops 2009\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2009.5072202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM Workshops 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2009.5072202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在这项工作中,我们用点对点的方法解决了在线备份和存储的问题。我们提出了一种新的系统架构,涉及用户的设备,通过汇集资源进行联盟,并提供资本密集型数据中心的替代方案。与当前建立在分布式哈希表上的点对点架构相反,我们研究了一种不协调的数据放置方法是否能够有效地为用户提供嵌入式激励,从而为系统提供本地资源。通过将对等体建模为自私的实体,努力使参与系统的成本最小化,我们分析了从对等体选择过程中实现的均衡拓扑,其中对等体建立涉及以对称方式存储数据的双边链接。系统分层是同行选择过程的一个重要结果:同行被吸引去提高他们提供的当地资源的“质量”,以达到更低的运营成本。我们的结果得到了博弈论分析和几种系统配置的数值评估的证实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Uncoordinated Peer Selection in P2P Backup and Storage Applications
In this work we tackle the problem of on-line backup and storage with a peer-to-peer approach. We propose a novel system architecture involving the users' devices that confederate by pooling their resources and offer an alternative to capital-intensive data-centers. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, colluding peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the "quality" of local resources they provide to reach lower operational costs. Our results are corroborated by both a game-theoretic analysis and a numerical evaluation of several system configurations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信