采用排名反馈的P2P 名誉评价模型
作者:
基金项目:

国家自然科学基金(60803148); 中央高校基本科研业务费专项资助(HIT.NSRIF.2010.047)


Reputation Model with Feedback of Ranking for P2P Systems
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [22]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    P2P 网络中的节点很可能从另外的节点那里收到质量很差的服务和信息,名誉评价是解决该问题的常见方法.基于评分反馈的P2P 名誉计算机制存在下述缺点:无法区分恶意评价和诚实节点给出错误评价间的差别;需要对评分可信度进行二次评价,使名誉计算速度减慢;用数字来表示节点名誉的方式不够自然.实际上,名誉评价的用途是确定节点可信度的相对顺序.因此,提出了一种基于排名反馈的P2P 名誉评价机制RbRf(reputation based ranking feedback).针对RbRf 和其上的恶意攻击进行了数学建模和理论分析,结果表明,RbRf 中非恶意错误的影响随排名反馈的数量指数而衰减;一般恶意攻击对RbRf 的影响随排名反馈数量的多项式而减小;对于有意设计的共谋攻击,由于必须给RbRf 引入正确信息而导致了恶意攻击被有效中和.因此,RbRf 不仅由于不再反馈打分信息而不存在评分反馈引起的名誉评价问题(如不需要对反馈信息的可信度进行二次评价),而且具有更好的抵抗恶意攻击的能力.仿真实验验证了理论分析的结果.

    Abstract:

    Some peers may receive service and information of low-quality from other peers in peer-to-peer (or P2P) networks. Reputation evaluation is the normal method used to reduce the above phenomena. P2P reputation, based on score feedback, is defective because it can not distinguish the malicious feedback from the erring feedback returned by honest peers. It needs long time to converge the reputation and evaluate feedback. It is inflexible and unnatural to depict the reputation of a peer through a lot of numbers. In fact, the reputation is used to determine the rank of the peers. A reputation model called RbRf (reputation based ranking feedback) based on the rank feedback, is presented in this paper. Mathematical models unfolds in this paper show that the influence of erring feedbacks attenuates with the exponential function of RbRf. The influence of unintended malicious feedbacks is attenuated with the polynomial function in RbRf. The intended collusive feedbacks are counteracted by the correct information introduced by these feedbacks. In summary, the defection of score feedback, such as the need of a second evaluation of the trust of feedback, does not in RbRf any longer because the RbRf uses rank feedback, instead of score feedback, and the RbRf can achieve a better effect when resisting to malicious attacks. All results are verified by experimental data.

    参考文献
    [1] Marti S, Garcia-Molina H. Taxonomy of trust: Categorizing P2P reputation systems. Computer Networks, 2006,50(4):472-484.[doi: 10.1016/j.comnet.2005.07.011]
    [2] Resnick P, Zeckhauser R, Friedman E, Kuwabara K. Reputation systems. Communications of the ACM, 2000,43(12):45-48. [doi:10.1145/355112.355122]
    [3] Cornelli F, Damiani E, Vimercati SDC, Paraboschi S, Samarati P. Choosing reputable servents in a P2P network. In: Lassner D, ed.Proc. of the 11th Int’l World Wide Web Conf. New York: ACM Press, 2002. 376-386. [doi: 10.1145/511446.511496]
    [4] Kamvar SD, Schlosser MT, Garcia-Molina H. The EigenTrust algorithm for reputation management in P2P networks. In: Richter V,ed. Proc. of the 12th Int’l World Wide Web Conf. New York: ACM Press, 2003. 640-651. [doi: 10.1145/775152.775242]
    [5] Xiong L, Liu L. PeerTrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Trans. on Knowledgeand Data Engineering, 2004,16(7):843-857. [doi: 10.1109/TKDE.2004.1318566]
    [6] Zhou RF, Hwang K. PowerTrust: A robust and scalable reputation system for trusted peer-to-peer computing. IEEE Trans. onParallel and Distributed Systems, 2007,18(4):460-473. [doi: 10.1109/TPDS.2007.1021]
    [7] Papaioannou TG, Stamoulis GD. Reputation-Based policies that provide the right incentives in peer-to-peer environments.Computer Networks, 2006,50(4):563-578. [doi: 10.1016/j.comnet.2005.07.024]
    [8] Almenarez F, Marin A, Diaz D, Sanchez J. Developing a model for trust management in pervasive devices. In: Werner B, ed. Proc.of the 3rd IEEE Int’l Workshop on Pervasive Computing and Communication Security (PerSec). Washington: IEEE ComputerSociety Press, 2006. 267-272. [doi: 10.1109/PERCOMW.2006.41]
    [9] Sun Y, Yu W, Han Z, Liu KJR. Trust modeling and evaluation in ad hoc networks. In: Miller A, ed. Proc. of the GlobalTelecommunications Conf. (Globecom). New York: IEEE Communications Society Press, 2005. 1862-1867. [doi: 10.1109/GLOCOM.2005.1577971]
    [10] Papaioannou TG, Stamoulis GD. Achieving honest ratings with reputation-based fines in electronic markets. In: Belding E, ed. Proc.of the 27th IEEE Annual IEEE Conf. on Computer Communications (Infocom). New York: IEEE Communications Society Press,2008. 1040-1048. [doi: 10.1109/INFOCOM.2008.158]
    [11] Liang ZQ, Shi WS. Analysis of ratings on trust inference in open environments. Performance Evaluation, 2008,65(2):99-128. [doi:10.1016/j.peva.2007.04.001]
    [12] Liang ZQ, Shi WS. PET: A personalized trust model with reputation and risk evaluation for P2P resource sharing. In: Sprague RH,ed. Proc. of the 38th Hawaii Int’l Conf. on System Sciences. Hawaii: IEEE Computer Society Press, 2005. 201-210. [doi:10.1109/HICSS.2005.493]
    [13] Wang Y, Vassileva J. Trust and reputation model in peer-to-peer networks. In: Kamkar M, ed. Proc. of the 3rd Int’l Conf. on Peerto-Peer Computing (P2P). Washington: IEEE Computer Society Press, 2003. 150-157. [doi: 10.1109/PTP.2003.1231515]
    [14] Srivatsa M, Xiong L, Liu L. Trustguard: Countering vulnerabilities in reputation management for decentralized overlay networks.In: Ellis A, ed. Proc. of the 14th World Wide Web Conf. New York: ACM Press, 2005. 422-431. [doi: 10.1145/1060745.1060808]
    [15] Dou W, Wang HM, Jia Y, Zou P. A recommendation-based peer-to-peer trust model. Journal of Software, 2004,15(4):571-583 (inChinese with English abstract). http://www.jos.org.cn/1000-9825/15/571.htm
    [16] Jiang SX, Li JZ. A reputation-based trust mechanism for P2P e-commerce systems. Journal of Software, 2007,18(10):2551-2563(in Chinese with English abstract). http://www.jos.org.cn/1000- 9825/18/2551.htm [doi: 10.1360/jos182551]
    [17] Zhang Q, Zhang X, Wen XZ, Liu JR, Ting Shan. Construction of peer-to-peer multiple-grain trust model. Journal of Software,2006,17(1):96-107 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/96.htm [doi: 10.1360/jos170096]
    [18] Tian CQ, Zou SH, Wang WD, Cheng SD. A new trust model based on recommendation evidence for P2P networks. ChineseJournal of Computers, 2008,31(2):270-281 (in Chinese with English abstract).
    [19] Li XY, Gui XL. Research on dynamic trust model for large scale distributed environment. Journal of Software, 2007,18(6):1510-1521 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/1510.htm [doi: 10.1360/jos181510]
    [20] Luis A, Ginosar S, Kedia M, Liu R, Blum M. Improving accessibility of the Web with a computer game. In: Proc. of the ACMSpecial Interest Group on Computer-Human Interaction Conf. on Human Factors in Computing Systems. New York: ACM Press,2006. 79-82. [doi: 10.1145/1124772.1124785]
    [21] Notredame C. Recent evolutions of multiple sequence alignment algorithms. PLOS Computational Biology, 2007,3(8):1405-1408.[doi: 10.1371/journal.pcbi.0030123]
    [22] Wilensky U. Netlogo. 2009. http://ccl.northwestern.edu/netlogo
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

李治军,姜守旭,李晓义.采用排名反馈的P2P 名誉评价模型.软件学报,2011,22(4):745-760

复制
分享
文章指标
  • 点击次数:5129
  • 下载次数: 7583
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2009-05-12
  • 最后修改日期:2009-10-10
文章二维码
您是第19781238位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号