Improving Churn Resistance of P2P Data Stores Based on the Hypercube

D. Fahrenholtz, V. Turau
{"title":"Improving Churn Resistance of P2P Data Stores Based on the Hypercube","authors":"D. Fahrenholtz, V. Turau","doi":"10.1109/ISPDC.2006.31","DOIUrl":null,"url":null,"abstract":"P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the fusion maintenance operation. It aims at reorganizing parts of our P2P data store in case the peer population shrinks so much that data availability is threatened. To this end, we present a formal cost model that peers use to estimate the optimal invocation point of a fusion. Finally, we present experimental results that validate our cost model by simulating various network conditions","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"13 22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2006.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer population dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the fusion maintenance operation. It aims at reorganizing parts of our P2P data store in case the peer population shrinks so much that data availability is threatened. To this end, we present a formal cost model that peers use to estimate the optimal invocation point of a fusion. Finally, we present experimental results that validate our cost model by simulating various network conditions
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于Hypercube提高P2P数据存储的抗流失性
如果必须保证插入的数据项的可用性,P2P数据存储将是最佳选择。它们对抗对等种群动态的内在机制使它们适用于广泛的应用领域。本文介绍并分析了融合维护操作。它的目的是重组我们的P2P数据存储的部分,以防对等人口减少太多,数据可用性受到威胁。为此,我们提出了一个正式的成本模型,对等体使用该模型来估计融合的最佳调用点。最后,我们通过模拟各种网络条件,给出了验证我们的成本模型的实验结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Security Framework for P2P Based Grid Systems Mobile Parallel Computing Towards a Model for Broadcasting Secure Mobile Processes Usage of Global States-Based Application Control Austrian Grid: Overview on the Project with Focus on Parallel Applications
×
引用
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