期刊文献+

基于信任的P2P拓扑进化机制 被引量:1

Effective Trust-based Topology Evolution Mechanism for P2P Networks
下载PDF
导出
摘要 现有的非结构Peer-to-Peer(P2P)系统缺乏对拓扑公平性的考虑,并且不能对某些节点的恶意行为进行有效的抑制。其主要原因在于构造的拓扑对节点信任度的不敏感性,忽略了P2P网络中各节点的异构性。据此,首先给出了基于反馈可信度的节点全局信任度计算模型,然后在此基础上提出了一种针对非结构化P2P网络的自适应拓扑进化机制。利用该机制,可使高可信节点占据拓扑的有利位置,低可信节点处于不利位置,从而体现拓扑的公平性。该机制同时能够对节点的恶意行为进行有效的抑制,并具有激励性质,鼓励节点提供更好的服务,以获得更高的响应率。分析和仿真结果表明,该机制较之现有机制,在拓扑的有效性和激励性上有较大的提高。 Current unstructured peer-to-peer (P2P) systems lack fair topology structures,and take no consideration for malicious behaviors of peers. The main reason is that the topology is not sensitive to peer's trust,and cannot accommodate heterogeneity of peers over the network. Thus, a feedback credibility based global trust model was presented. Then,based on the trust model, an adaptive topology evolution mechanism for unstructured P2P networks was proposed. Through this mechanism, trusted peers can migrate to the centric position,while untrusted peers to the edge of the topology, guaranteeing fairness during topology evolution. On the other hand, the mechanism can effectively counter the malicious behaviors of peers, and also has the incentive functionality, which incents peers to provide more high-quality services in order to get more return on services. Analysis and simulations show that, compared with the current topologies, the resulting topology mechanism is more effective and robust in combating the selfish or malicious behaviors of peers.
出处 《计算机科学》 CSCD 北大核心 2010年第1期95-98,166,共5页 Computer Science
基金 国家973重点基础研究发展规划项目基金(2005CB321800) 国家863高技术研究发展基金(2007AA010301) 国家杰出青年科学基金(60625203) 国家自然科学基金(60873204)资助
关键词 对等网络 自适应拓扑 信任 激励机制 P2P,Topology evolution,Trust,Incentive mechanism
  • 相关文献

参考文献9

  • 1Bawa M, Cooper B F, Crespo A, et al. Peer-to-Peer research at Stanford[J]. ACM SIGMOD Record, 2003,32(3): 23-28.
  • 2Dou W. The research on trust - aware P2P topologies and con - structing technologies[D]. Changsha: National University of Defense Technology, 2003.
  • 3Stoica I, Morris R, Karger D, et al. Chord: A sealable peer-to- peer lookup service for Intemet applications[R]TR-819. MIT,2001.
  • 4Ratnasamy S, et al. A Scalable Content - Addressable Network [C]// Proceeding of ACM SIGCOMM. NewYork: ACM Press, 2001:161-172.
  • 5Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems[C]//IFIP/ACM International Conference on Distributed Systems Platforms. Kluwer Academic Press, 2001 : 329-350.
  • 6Cooper B F, Garcia-Molina H. Ad hoc, self-supervising peer-to- peer search networks[R]. Stanford University,2003.
  • 7Liu Y, Zhuang Z H, Xiao L, et al. AOTO: Adaptive overlay topology optimization in unstructured P2P systems[C]//Proc, of the IEEE GLOBECOM 2003. San Francisco, 2003.
  • 8Xiao L, Liu Y, Ni L M. Improving unstructured peer - to - peer systems by adaptive connection establishment[J].IEEE Trans. on Computers,2005,54(9) :1091-1103.
  • 9Condie T,Kamvar S D, Garcia-Molina H. Adaptive peer-to-peer topologies[C]//Lambrix P, Duma C. eds. Proc. of the 4th Int'l Conf. on Peer-to-Peer Computing. New York: IEEE Press, 2004 : 53-62.

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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