一种新型的基于节点类型识别机制的P2P网络拓扑构造协议

王浩云; 张顺颐; 龙华; 李君

doi:10.3724/SP.J.1146.2008.00067

一种新型的基于节点类型识别机制的P2P网络拓扑构造协议

doi: 10.3724/SP.J.1146.2008.00067

王浩云^{① 张顺颐,},
张顺颐,
龙华,
李君

基金项目:

国家863计划项目(2006AA01Z232)和江苏省高校研究生科研创新计划(CX07B-11OZ)资助课题

计量
- 文章访问数: 3415
- HTML全文浏览量: 83
- PDF下载量: 1119
- 被引次数: 0
出版历程
- 收稿日期: 2008-01-17
- 修回日期: 2008-08-07
- 刊出日期: 2008-12-19

A Novel Protocol Based on Type-Identifying Mechanism for the Topologies of P2P Networks

Wang Hao-Yun^{① 张顺颐
,},
Zhang Shun-Yi,
Long Hua,
Li Jun

摘要

摘要: 现有P2P网络拓扑构造协议大多是基于节点历史行为来决定拓扑的构造方式，在面对P2P节点复杂多变的行为时无法实时地保证拓扑的有效性。该文首先利用博弈论针对不同类型节点的交互行为及收益建立博弈模型。在此基础上，提出了基于节点类型跟踪识别机制的拓扑构造协议TATP。仿真实验表明，TATP协议即使在恶劣的P2P网络环境下也能够让善意节点开始聚集，将恶意节点排斥到网络边缘，使得P2P网络拓扑具有更好的有效性和安全性，同时协议的网络开销较小。
- P2P网络 /
- 节点 /
- 策略 /
- 拓扑 /
- 类型识别
Abstract: Most of the existing protocols construct P2P topologies based on the history of P2P nodes actions, however, they can not ensure the efficiency of the topologies in time, when facing the complexity and turbulence of P2P nodes strategies. This paper firstly builds the game model of the interactions and payoffs of various types of P2P nodes. In this foundation, this paper proposes the TATP based on the identification mechanism of P2P nodes types. The simulations show that the good nodes will begin to congregate and the bad ones will be excluded to the edge of the networks. The results also indicate that TATP will improve the efficiency and security of P2P topologies, with less network costs, even in the worst network environments.
- P /
- e /
- e /
- r

HTML全文

参考文献(1)

[1] Guo H, Lo K T, and Cheng C T. Overlay networksconstruction for multilayered live media streaming[C]. EighthIEEE International Symposium on Multimedia, San Diego,CA, USA, Dec. 11-13, 2006: 427-436. [2] Feldman M, Papadimitriou C, and Chuang J, et al..Free-riding and whitewashing in peer-to-peer systems[J].IEEE Journal on Selected Areas in Communications.2006,24(5):1010-1019 [3] Yang M, Feng Q, and Dai Y F, et al.. A multi-dimensionalreputation system combined with trust and incentivemechanisms in P2P file sharing systems[C]. 27thInternational Conference on Distributed Computing SystemsWorkshops, Toronto, Ont, Canada, June 22-29, 2007: 29. Lian Q, Zhang Z, and Yang M, et al.. An empirical study ofcollusion behavior in the maze P2P file-sharing system[C].27th International Conference on Distributed ComputingSystems, Toronto, Ont, Canada, June 22-29, 2007: 56. [4] Wang W Y, Zhao L, and Yan R X. Improving cooperation inpeer-to-peer systems using social networks[C]. 20thInternational on Parallel and Distributed ProcessingSysposium, Rhodes, Island, Greece, April, 25-29, 2006: 8. Fedotova N and Veltri L. Byzantine generals problem in thelight of P2P computing[C]. 2006 Third Annual InternationalConference on Mobile and Ubiquitous Systems: Networking Services, San Jose, CA, July, 17-21, 2006: 1-5. [5] Sears W, Yu Z, and Guan Y. An adaptive reputation-basedtrust framework for Peer-to-Peer applications[C]. FourthIEEE International Symposium on Network Computing andApplications, Cambridge, MA, USA, July, 27-29, 2005:13-20. [6] Xiao L, Liu Y H, and Ni M L. Improving unstructuredpeer-to-peer systems by adaptive connection establishment[J].IEEE Trans. on Computers.2005, 54(9):1091-1103 [7] 田慧荣, 邹仕洪, 王文东,等. 激励一致的自适应P2P 拓扑构造[J]. 软件学报, 2006, 17(4): 845-853.Tian H R, Zou S H, and Wang W D, et al.. Incentivecompatible adaptive topologies for P2P networks[J]. Journalof Software, 2006, 17(4): 845-853. [8] Chuang J. Designing incentive mechanisms for peer-to-peersystems[C]. First IEEE International Workshop on GridEconomics and Business Models, Seoul, Korea, April, 23,2004: 67-81. [9] Trinh A T. A game-theoretic analysis of trust management inP2P systems[C]. First International Conference onCommunications and Electronics, Hanoi, Vietnam, Oct.10-11, 2006: 130-134.

施引文献

资源附件(0)

访问统计