An Incentive Security Model to Provide Fairness for Peer-to-Peer Networks

S. Berenjian, Saeed Hajizadeh, Reza Ebrahimi Atani
{"title":"An Incentive Security Model to Provide Fairness for Peer-to-Peer Networks","authors":"S. Berenjian, Saeed Hajizadeh, Reza Ebrahimi Atani","doi":"10.1109/AINS47559.2019.8968699","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer networks are designed to rely on the resources of their own users. Therefore, resource management plays an important role in P2P protocols. Early P2P networks did not use proper mechanisms to manage fairness. However, after seeing difficulties and rise of freeloaders in networks like Gnutella, the importance of providing fairness for users have become apparent. In this paper, we propose an incentive-based security model which leads to a network infrastructure that lightens the work of Seeders and makes Leechers to contribute more. This method is able to prevent betrayals in Leecher-to-Leecher transactions and helps Seeders to be treated more fairly. This is what other incentive methods such as Bittorrent are incapable of doing. Additionally, by getting help from cryptography and combining it with our method, it is also possible to achieve secure channels, immune to spying, next to a fair network. This is the first protocol designed for P2P networks which has separated Leechers and Seeders without the need to a central server. The simulation results clearly show how our proposed approach can overcome free-riding issue. In addition, our findings revealed that our approach is able to provide an appropriate level of fairness for the users and can decrease the download time.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Conference on Application, Information and Network Security (AINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINS47559.2019.8968699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Peer-to-Peer networks are designed to rely on the resources of their own users. Therefore, resource management plays an important role in P2P protocols. Early P2P networks did not use proper mechanisms to manage fairness. However, after seeing difficulties and rise of freeloaders in networks like Gnutella, the importance of providing fairness for users have become apparent. In this paper, we propose an incentive-based security model which leads to a network infrastructure that lightens the work of Seeders and makes Leechers to contribute more. This method is able to prevent betrayals in Leecher-to-Leecher transactions and helps Seeders to be treated more fairly. This is what other incentive methods such as Bittorrent are incapable of doing. Additionally, by getting help from cryptography and combining it with our method, it is also possible to achieve secure channels, immune to spying, next to a fair network. This is the first protocol designed for P2P networks which has separated Leechers and Seeders without the need to a central server. The simulation results clearly show how our proposed approach can overcome free-riding issue. In addition, our findings revealed that our approach is able to provide an appropriate level of fairness for the users and can decrease the download time.
为对等网络提供公平性的激励安全模型
点对点网络的设计依赖于它们自己用户的资源。因此,资源管理在P2P协议中起着重要的作用。早期的P2P网络没有使用适当的机制来管理公平性。然而,在看到Gnutella等网络中的困难和免费者的崛起之后,为用户提供公平的重要性变得显而易见。在本文中,我们提出了一个基于激励的安全模型,该模型导致网络基础设施减轻了播种者的工作,并使leecher做出了更多的贡献。这种方法能够防止Leecher-to-Leecher交易中的背叛,并有助于种子者得到更公平的对待。这是Bittorrent等其他激励方法无法做到的。此外,通过获得密码学的帮助并将其与我们的方法相结合,还可以在公平的网络旁边实现安全通道,免受间谍活动的影响。这是第一个为P2P网络设计的协议,它将Leechers和Seeders分开,而不需要中央服务器。仿真结果清楚地表明,我们提出的方法可以克服搭便车问题。此外,我们的研究结果表明,我们的方法能够为用户提供适当的公平水平,并可以减少下载时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书