A Reputation Aggregation Method Considering File Request Distribution and Peer Behavior in Unstructured P2P Networks

Hiroki Ushikubo, Sonoko Takeda, H. Shigeno
{"title":"A Reputation Aggregation Method Considering File Request Distribution and Peer Behavior in Unstructured P2P Networks","authors":"Hiroki Ushikubo, Sonoko Takeda, H. Shigeno","doi":"10.1109/NBiS.2013.27","DOIUrl":null,"url":null,"abstract":"In order to establish secure file-sharing in unstructured peer-to-peer networks, reputation aggregation methods are now focused on. In these methods, each peer calculates reputation values which denote the reliability and safety of peers participating in P2P networks. When peers exchange files, they can avoid transacting with the malicious peers by reference to reputation values. Reputation aggregation methods, however, have a problem that file requests concentrate on partial peers with high reputation values. In the existing method, file requests are distributed by making partial peers whose reputation values are high to some extent more likely to be selected temporarily. Although, there are tactical malicious peers providing not only inauthentic but also authentic files in each transaction. And the existing method do not consider the problem that the malicious peers can spread more inauthentic files by providing authentic files intentionally and acquiring high reputation value by the system. Thus in this paper, we propose a reputation aggregation method which decreases the probability of selecting the malicious peers by considering reputation value. Furthermore, the method considers trade-off between the safety of file-sharing and the distribution of file requests. The results of computer simulation demonstrate the distribution of file requests and the advancement of transaction success rate.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 16th International Conference on Network-Based Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NBiS.2013.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In order to establish secure file-sharing in unstructured peer-to-peer networks, reputation aggregation methods are now focused on. In these methods, each peer calculates reputation values which denote the reliability and safety of peers participating in P2P networks. When peers exchange files, they can avoid transacting with the malicious peers by reference to reputation values. Reputation aggregation methods, however, have a problem that file requests concentrate on partial peers with high reputation values. In the existing method, file requests are distributed by making partial peers whose reputation values are high to some extent more likely to be selected temporarily. Although, there are tactical malicious peers providing not only inauthentic but also authentic files in each transaction. And the existing method do not consider the problem that the malicious peers can spread more inauthentic files by providing authentic files intentionally and acquiring high reputation value by the system. Thus in this paper, we propose a reputation aggregation method which decreases the probability of selecting the malicious peers by considering reputation value. Furthermore, the method considers trade-off between the safety of file-sharing and the distribution of file requests. The results of computer simulation demonstrate the distribution of file requests and the advancement of transaction success rate.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
非结构化P2P网络中考虑文件请求分布和对等体行为的声誉聚合方法
为了在非结构化点对点网络中建立安全的文件共享,信誉聚合方法是目前研究的重点。在这些方法中,每个对等体计算信誉值,信誉值表示参与P2P网络的对等体的可靠性和安全性。对等体在交换文件时,可以通过引用信誉值来避免与恶意对等体进行交易。然而,声誉聚合方法存在一个问题,即文件请求集中在具有高声誉值的部分对等点上。在现有的方法中,文件请求是通过使信誉值较高的部分节点更有可能被临时选中来分发的。但是,在每个事务中存在战术恶意对等点,它们不仅提供不真实的文件,还提供真实的文件。现有的方法没有考虑恶意对等体通过故意提供真实文件传播更多不真实文件的问题,从而获得系统较高的信誉价值。因此,本文提出了一种声誉聚合方法,通过考虑声誉值来降低选择恶意节点的概率。此外,该方法还考虑了文件共享安全性与文件请求分布之间的权衡。计算机仿真结果显示了文件请求的分布和事务成功率的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
3 Tiers Storage Model for Low Throughput Off-Line Storage Implementation of Web-Based Interactive Interface as Software Execution Environment A Novel Resource Allocation Heuristic for a Power Constrained Data Center A Clustering Algorithm Using Twitter User Biography Querying MongoDB with LINQ in a Server-Side JavaScript Environment
×
引用
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