Towards a P2P Cloud: Reliable Resource Reservations in Unreliable P2P Systems

Kalman Graffi, D. Stingl, C. Gross, Hoang Nguyen, A. Kovacevic, R. Steinmetz
{"title":"Towards a P2P Cloud: Reliable Resource Reservations in Unreliable P2P Systems","authors":"Kalman Graffi, D. Stingl, C. Gross, Hoang Nguyen, A. Kovacevic, R. Steinmetz","doi":"10.1109/ICPADS.2010.34","DOIUrl":null,"url":null,"abstract":"The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. However, the resources, e.g. storage space, CPU power and online time, provided by the peers are unreliable due to churn. In order to enable churn resistant reliable services using the resources in p2p systems, we propose in this paper a distributed mechanism termed P3R3O.KOM. The mechanism allows to reserve, monitor and use resources provided by the unreliable p2p system and maintains long-term resource reservations through controlled redundant resource provision. Evaluation shows that using KAD measurements on the prediction of the lifetime of peers allows for 100% successful reservations under churn with very low traffic overhead. This approach marks a first step for the building of a reliable p2p-based SOA and future p2p-based clouds.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.2010.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

The peer-to-peer paradigm shows the potential to provide the same functionality and quality like client/server based systems, but with much lower costs. However, the resources, e.g. storage space, CPU power and online time, provided by the peers are unreliable due to churn. In order to enable churn resistant reliable services using the resources in p2p systems, we propose in this paper a distributed mechanism termed P3R3O.KOM. The mechanism allows to reserve, monitor and use resources provided by the unreliable p2p system and maintains long-term resource reservations through controlled redundant resource provision. Evaluation shows that using KAD measurements on the prediction of the lifetime of peers allows for 100% successful reservations under churn with very low traffic overhead. This approach marks a first step for the building of a reliable p2p-based SOA and future p2p-based clouds.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
走向P2P云:不可靠P2P系统中的可靠资源预留
点对点范式显示了提供与基于客户机/服务器的系统相同的功能和质量的潜力,但成本要低得多。然而,由对等体提供的资源,如存储空间、CPU能力和在线时间,由于用户流失是不可靠的。为了利用p2p系统中的资源提供抗流失的可靠服务,本文提出了一种名为p3r30 . kom的分布式机制。该机制允许预留、监控和使用不可靠的p2p系统提供的资源,并通过可控的冗余资源提供来维持长期的资源预留。评估表明,在预测对等体的生命周期时使用KAD度量可以在流量开销非常低的情况下实现100%的成功预订。这种方法标志着构建可靠的基于p2p的SOA和未来基于p2p的云的第一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mixed-Parallel Implementations of Extrapolation Methods with Reduced Synchronization Overhead for Large Shared-Memory Computers Kumoi: A High-Level Scripting Environment for Collective Virtual Machines A Pervasive Simplified Method for Human Movement Pattern Assessing Broadcasting Algorithm Via Shortest Paths Detection of a Weak Conjunction of Unstable Predicates in Dynamic Systems
×
引用
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