Researches on inhibition mechanism in P2P networks

Dongwei Guo, Kangping Wang, Miao Liu, Tingting Shi, Jialun Du
{"title":"Researches on inhibition mechanism in P2P networks","authors":"Dongwei Guo, Kangping Wang, Miao Liu, Tingting Shi, Jialun Du","doi":"10.1109/ICACTE.2010.5579519","DOIUrl":null,"url":null,"abstract":"A peer-to-peer (P2P) system will starve from resource if every user acts as a free rider who only takes resources from the system but never contributes. While developing a scheme, it is also important to inhibit free riders besides incentivizing users to contribute resources. In this paper, we adopt game theory to explore behaviors of nodes in P2P networks and present a Tit-for-Tat based mechanism. The reputation of one node is scored dispersedly and stored locally by its counterparts, according to its past reactions to their requests. Experimental results have prove that free riders are inhibited effectively since it takes more time for them to download resources than altruistic nodes.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2010.5579519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A peer-to-peer (P2P) system will starve from resource if every user acts as a free rider who only takes resources from the system but never contributes. While developing a scheme, it is also important to inhibit free riders besides incentivizing users to contribute resources. In this paper, we adopt game theory to explore behaviors of nodes in P2P networks and present a Tit-for-Tat based mechanism. The reputation of one node is scored dispersedly and stored locally by its counterparts, according to its past reactions to their requests. Experimental results have prove that free riders are inhibited effectively since it takes more time for them to download resources than altruistic nodes.
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学术官方微信