An Efficient Hybrid P2P Incentive Scheme

Zhitao Guan, Yuanda Cao, M. H. Durad, Liehuang Zhu
{"title":"An Efficient Hybrid P2P Incentive Scheme","authors":"Zhitao Guan, Yuanda Cao, M. H. Durad, Liehuang Zhu","doi":"10.1109/SNPD.2007.180","DOIUrl":null,"url":null,"abstract":"P2P systems have suffered a lot from free riding problem i.e. some participants consume more resources than they contribute. In order to deal with this problem efficiently, an incentive model based on peer credit has been proposed. Each peer in this model is a credit entity. Through introducing reward method to the model, peers will allocate resources according to the credits of requesting peers to maximize their own credits. A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards. To avoid inflation of the credit, attenuation method is introduced. The scheme how to apply the credit model in hybrid P2P networks has also been elaborated in this work. The experimental results show that the model can effectively control free riding and improve efficiency of the system.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2007.180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

P2P systems have suffered a lot from free riding problem i.e. some participants consume more resources than they contribute. In order to deal with this problem efficiently, an incentive model based on peer credit has been proposed. Each peer in this model is a credit entity. Through introducing reward method to the model, peers will allocate resources according to the credits of requesting peers to maximize their own credits. A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards. To avoid inflation of the credit, attenuation method is introduced. The scheme how to apply the credit model in hybrid P2P networks has also been elaborated in this work. The experimental results show that the model can effectively control free riding and improve efficiency of the system.
一个有效的混合P2P激励方案
P2P系统遭受了很多搭便车的问题,即一些参与者消耗的资源比他们贡献的资源多。为了有效地解决这一问题,提出了一种基于同伴信用的激励模型。该模型中的每个节点都是一个信用实体。通过在模型中引入奖励方法,节点根据请求节点的积分分配资源,使自己的积分最大化。提出了一种回溯算法来解决信用奖励最大化问题。为了避免信用膨胀,引入了衰减法。本文还详细阐述了信用模型在混合P2P网络中的应用方案。实验结果表明,该模型能有效控制搭便车,提高系统效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信