期刊文献+

信任模型中搭便车节点的抑制 被引量:2

Reducing Number of Free Riders in Trust Model
在线阅读 下载PDF
导出
摘要 现有的信任机制虽然有效地遏制了P2P系统中节点的恶意攻击,但未考虑如何抑制内在的大量搭便车节点的存在,即高信任值节点向搭便车节点的转变。大量搭便车节点的存在,降低了P2P网络的健壮性及可用性,为此设计了基于时间窗口的信任模型,对距现在时刻越近的时间窗口给予的权重值越大。仿真结果表明,机制不仅能够有效抑制大量高信任值节点向搭便车节点的转变,而且与提出的其它方案相比,能够有效遏制节点近期内进行恶意攻击,并且节点的信任值会更高。 Although current existing trust model reduces the impact of peers' malicious attack in P2P system, these reputation systems do not concern with reducing free riders in P2P networks, namely, peers with high trust value tansform to free riders. Because lots of free riders exist, robust and available of P2P system are degraded. So, a trust model based on time slots was designed, and the nearer time from now the greater time slot's weight was gaven. Theoretical analysis and simulation show that this proposal not only prevents peers with high trust value to free riders, but also limits peers to make malicious attack recently, and peers' trust value are more and more hight in compared with other proposals.
出处 《计算机科学》 CSCD 北大核心 2012年第3期88-92,共5页 Computer Science
基金 国家自然科学基金(61005017)资助
关键词 信任模型 节点抑制 搭便车 P2P网络 恶意攻击 Trust model,Peer reduction,Free rider,P2P networks,Malicious attack
  • 相关文献

参考文献17

  • 1Kamvar S D, Schlosser M T, Garcia-Molina H. The EigenTrust Algorithm for Reputation Management in P2P Networks[C]// Proceedings of the 12th International Conference on World Wide Web. Budapest, Hungary: ACM Press, 2003 : 640-651.
  • 2Karnvar S D, Schlosser M T, Garcia-Molina H. Incentives for Combatting Freeriding on P2P Networks[C]//European Conference on Parallel Processing. Lecture Notes in Computer Science. Berlin, Germany: Springer-verlag, 2003 : 1273-1279.
  • 3Yuhua L,Yuling L,Wei C,et al. The Research Based on Trust Value Against Vulnerability in P2P Networks[C]//Proceedings of the 2nd IEEE International Conference on Computer Science and Information Technology. USA : IEEE, 2009 : 85-89.
  • 4Xiong L, Liu L. PeerTrust : Supporting Reputation-based Trust for Peer-to-Peer Electronic Communities[J]. IEEE Transactions on Knowledge and Data Engineering,2004,16(7) :843-857.
  • 5Leitao G,Shoubao Y,Jing W,et al. Trust Model Based on Similarity Measure of Vectors in P2P Networks[C] //Grid and Cooperative Computing-GCC. Lecture Notes in Computer Science. Berlin, Germany: Springer-verlag, 2005 : 836-847.
  • 6Srivatsa M, Xiong L, Liu L. Trustguard: Countering Vulnerabilities in Reputation Management for Decentralized Overlay Networks[C]//Proceedings of the 14th International World Wide Web. New York, USA: ACM Press, 2005 : 422-431.
  • 7Zhou Run-fang, Hwang Kai. PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing[J]. IEEE Transactions on Parallel and Distributed Systems, 2007,.
  • 8Spitz S,Tuchelmann Y. A Trust Model Considering the Aspects of Time[C] // Proceedings of the Second International Conference on Computer and Electrical Engineering(ICCEE). USA: IEEE Computer Sec, 2009: 550-554.
  • 9Srivatsa M, Liu L. Vulnerabilities and security issues in structured overlay networks: A quantitative analysis[C]// Proceedings of the 20th Annual Computer Security Applications Conference(ACSAC). USA : IEEE Computer Society, 2004 : 252-261.
  • 10李勇军,代亚非.对等网络信任机制研究[J].计算机学报,2010,33(3):390-405. 被引量:85

二级参考文献142

共引文献253

同被引文献22

  • 1STEINMETZ R,WEHRLE K.P2P系统及其应用[M].王玲芳,陈炎,译.北京:机械工业出版社,2008.
  • 2Wikipedia. BitTorrent[ EB/OL]. http ://en. wikipedia, org/ wiki/BitTorrent, 2013-01-14.
  • 3Jensen Kurt. Coloured Petri Nets: Basic Concepts, Analy- sis Methods and Practical Use[ M]. Heidelberg: Springer- Verlag, 1997.
  • 4Jensen Kurt, Kristensen Lars Michael, Wells Lisa. Col- oured petri nets and CPN tools for modeling and validation of concurrent systems [ J ]. International Journal on Software Tools for Technology Transfer, 2007,9(3 ) :213-254.
  • 5Cohen B. Incentives Build Robustness in BitTorrent [ EB/ OL]. http://www, ittc. ku. edu/ niehaus/classes/750- s06/documents/BT-description, pdf, 2003-05-22.
  • 6Piatek M, Isdal T, Anderson T, et 8.1. Do incentives build robustness in BitTorrent? [C]//NSDI'07. 2007:1.
  • 7Bharambe A R, Herley C, Padmanabhan V N. Analyzing and improving a BitTorrent network' s performance mecha- nisms [ C ]//Proceeding of INFOCOM. 2006 : 1-12.
  • 8Locher T, Moor P, Schmid S, et al. Free riding in BitTor- rent is cheap[ C]//Fifth Workshop on Hot Topics in Net- works (HorNets-V). 2006:85-90.
  • 9Jun S, Ahamad M. Incentives in BitTorrent induce free rid- ing[ C ]//P2PECON' 05, 2005 : 116-121.
  • 10Huang K, Zhang D, Wang Li' E. An activeness-based seed choking algorithm for enhancing BitTorrent' s robust- ness [ C ]//Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing. 2009:376- 387.

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部