Towards Reliable Reputations for Dynamic Networked Systems

Gayatri Swamynathan, Ben Y. Zhao, K. Almeroth, S. Rao Jammalamadaka
{"title":"Towards Reliable Reputations for Dynamic Networked Systems","authors":"Gayatri Swamynathan, Ben Y. Zhao, K. Almeroth, S. Rao Jammalamadaka","doi":"10.1109/SRDS.2008.31","DOIUrl":null,"url":null,"abstract":"A new generation of distributed systems and applications rely on the cooperation of diverse user populations motivated by self-interest. While they can utilize \"reputation systems\" to reduce selfish behaviors that disrupt or manipulate the network for personal gain, current reputations face a key challenge in large dynamic networks: vulnerability to peer collusion. In this paper, we propose to dramatically improve the accuracy of reputation systems with the use of a statistical metric that measures the \"reliability\" of a peer's reputation taking into account collusion-like behavior. Trace-driven simulations on P2P network traffic show that our reliability metric drastically improves system performance. We also apply our metric to 18,000 randomly selected eBay user reputation profiles, and surprisingly discover numerous users with collusion-like behaviors worthy of additional investigation.","PeriodicalId":397103,"journal":{"name":"2008 Symposium on Reliable Distributed Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Symposium on Reliable Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2008.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A new generation of distributed systems and applications rely on the cooperation of diverse user populations motivated by self-interest. While they can utilize "reputation systems" to reduce selfish behaviors that disrupt or manipulate the network for personal gain, current reputations face a key challenge in large dynamic networks: vulnerability to peer collusion. In this paper, we propose to dramatically improve the accuracy of reputation systems with the use of a statistical metric that measures the "reliability" of a peer's reputation taking into account collusion-like behavior. Trace-driven simulations on P2P network traffic show that our reliability metric drastically improves system performance. We also apply our metric to 18,000 randomly selected eBay user reputation profiles, and surprisingly discover numerous users with collusion-like behaviors worthy of additional investigation.
迈向动态网络系统的可靠声誉
新一代的分布式系统和应用程序依赖于受自身利益驱动的不同用户群体的合作。虽然他们可以利用“声誉系统”来减少为了个人利益而破坏或操纵网络的自私行为,但目前的声誉在大型动态网络中面临着一个关键挑战:容易受到同伴勾结的影响。在本文中,我们建议使用一种统计指标来显著提高声誉系统的准确性,该指标可以衡量同行声誉的“可靠性”,并考虑到类似共谋的行为。对P2P网络流量的跟踪驱动仿真表明,我们的可靠性度量极大地提高了系统性能。我们还将我们的指标应用于18000个随机选择的eBay用户声誉档案,并令人惊讶地发现许多用户有类似串通的行为,值得进一步调查。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信