一种有效的Peer-to-Peer自适应拓扑进化协议
作者:
基金项目:

Supported by the National High-Tech Research and Development Plan of China under Grant No.2002AA4Z3120 (国家高技术研究发展计划(863))


An Efficient Adaptive Evolvement Protocol for Peer-to-Peer Topologies
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [34]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    现有的无结构Peer-to-Peer(P2P)系统缺乏对拓扑公平性的考虑,并且不能对某些节点的恶意行为进行有效的抑制.其主要原因在于构造的拓扑对节点可信度的不敏感性,忽略了节点在不同领域中可信度的区别.据此,首先给出了基于领域的P2P信任模型的定义,然后在此基础上提出了一种针对无结构化P2P网络的自适应拓扑进化协议.该协议可以针对具体的领域进行拓扑进化,使得领域内的高可信节点占据相应领域拓扑的有利位置,低可信节点处于不利位置,从而体现拓扑的公平性.该协议同时能够对节点的恶意行为进行有效的抑制,并具有激励性质,鼓励节点提供更好的服务,以获得更高的回报率.分析和仿真结果表明,该协议较之现有协议,在拓扑的有效性和安全性等方面有较大的提高.

    Abstract:

    Current unstructured peer-to-peer (P2P) systems lack fair topology structures, and take no consideration for vicious action of peers. The mainly reason is that the topologies are not sensitive to peer’s trust, and take no consideration for the trust computation of different domains. First, a domain-based P2P trust model is presented in this paper. Then, based on the trust model, a peer-level protocol for forming adaptive topologies for unstructured P2P networks is proposed. The protocol aims at the topologies evolution of embodied domains, and makes good peers locate good position and bad peers locate bad position in the corresponding domains, which guarantees the impartiality of topology. On the other hand, the protocol can restrain the vicious action of peers effectively, and also has the incentive capacity, which encourages peers to provide more authentic services in order to get more return on services. Analysis and simulations show that, compared with the current topologies, the resulting topologies are more efficient and more robust on security problems.

    参考文献
    [1]Bawa M,Cooper BF,Crespo A,Daswani N,Ganesan P,Garcia-Molina H,Kamvar S,Marti S,Schlosser M,Sun Q,Vinograd P,Yang B.Peer-to-Peer research at Stanford.ACM SIGMOD Record,2003,32(3):23-28.
    [2]Dou W.The research on trust-aware P2P topologies and constructing technologies[Ph.D.Thesis].Changsha:National University of Defense Technology,2003 (in Chinese with English abstract).
    [3]Sun Q,Garcia-Molina H.SLIC:A selfish link-based incentive mechanism for unstructured peer-to-peer networks.In:Lai TH,Okada K,eds.Proc.of the 24th IEEE Int'l Conf.on Distributed Computing Systems.New York:IEEE Press,2004.506-515.
    [4]Wang Y,Vassileva J.Bayesian network trust model in peer-to-peer networks.In:Moro G,ed.Proc.of the 2nd Int'l Workshop on Agents and Peer-to-Peer Computing.Berlin:Springer-Verlag,2004.23-34.
    [5]Condie T,Kamvar SD,Garcia-Molina H.Adaptive peer-to-peer topologies.In:Lambrix P,Duma C,eds.Proc.of the 4th Int'l Conf.on Peer-to-Peer Computing.New York:IEEE Press,2004.53-62.
    [6]Zhang Q,Zhang X,Wen XZ,Liu JR,Shan T.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
    [7]Chawathe Y,Ratnasamy S,Breslau L,Shenker S.Making Gnutella-like P2P systems scalable.In:Crowcroft J,Wetherall D,eds.Proc.of the Conf.on Applications,Technologies,Architectures,and Protocols for Computer Communications.New York:ACM Press,2003.407-418.
    [8]Bernardo EA.Huberman A.Free riding on Gnutella.Techniqal Report,SSL-00-63,Palo Alto:Xerox PARC,2000.
    [9]Cooper BF,Garcia-Molina H.Ad hoc,self-supervising peer-to-peer search networks.ACM Trans.on Information Systems,2005,23(2):169-200.
    [10]Lv Q,Ratsnasamy S,Shenker S.Can heterogeneity make Gnutella scalable? In:Druschel P,Kaashoek M F,Rowstron AIT,eds.Proc.of the 1st Int'l Workshop on P2P Systems.Berlin:Springer-Verlag,2002.94-103.
    [11]Sakaryan G,Unger H.Influence of the decentralized algorithms on topology evolution in P2P distributed networks.In:Unger H,Tutsch D,eds.Proc.of the Design,Analysis,and Simulation of Distributed Systems (DASD 2003).San Diego:SCS Press,2003.12-18.
    [12]Sakaryan G,Unger H.Topology evolution in P2P distributed networks.In:Hamza MH,ed.Proc.of the IASTED:Applied Informatics (AI 2003).Calgary:ACTA Press,2003.791-796.
    [13]Crespo A,Garcia-Molina H.Semantic overlay networks for P2P systems.In:Moro G,Bergamaschi S,Aberer K,eds.Proc.of the 3rd Int'l Workshop on Agents and Peer-to-Peer Computing.Berlin:Springer-Verlag,2004.1-13.
    [14]Song JT,Sha CF,Yang ZY,Zhu H.Study on construction and searching of semantic peer-to-peer networks.Journal of Computer Research and Development,2004,41(4):645-652 (in Chinese with English abstract).
    [15]Klampanos IA,Jose JM.An architecture for information retrieval over semi-collaborating peer-to-peer networks.In:Omicini A,Wainwright RL,eds.Proc.of the 2004 ACM Symp.on Applied Computing.New York:ACM Press,2004.1078-1083.
    [16]Asvanund A,Krishnan R.Content-Based community formation in hybrid peer-to-peer networks.In:Callan J,Fuhr N,Nejdl W,eds.Proc.of the SIGIR Workshop on Peer-to-Peer Information Retrieval,the 27th Annual Int'l ACM SIGIR Conf.New York:ACM Press,2004.24-34.
    [17]Loser A,Naumann F,Siberski W,Nejdl W,Thaden U.Semantic overlay clusters within super-peer networks.In:Aberer K,Koubarakis M,Kalogeraki V,eds.Proc.of the Int'l Workshop on Databases,Information Systems and Peer-to-Peer Computing.Berlin:Springer-Verlag,2003.33-47.
    [18]Wang Y,Vassileva J.Trust-Based community formation in peer-to-peer file sharing networks,In:Zhong N,ed.Proc.of the IEEE/ WIC/ACM Int'l Conf.on Web Intelligence (WI 2004).New York:IEEE Press,2004.341-348.
    [19]http://www.orkut.com
    [20]http://www.tribe.net
    [21]Kamvar S,Schlosser M,Garcia-Molina H.The EigenTrust algorithm for reputation management in P2P networks.In:Chen YFR,Kovacs L,Lawrence S,eds.Proc.of the 12th Int'l World Wide Web Conf.New York:ACM Press,2003.640-651.
    [22]Chen G,Lu RQ,Jin Z.Constructing virtual domain ontologies based on domain knowledge reuse.Journal of Software,2003,14(3):350-355 (in Chinese with English abstract).http://www.jos.org.cn/1000-9825/14/350.htm
    [23]Maedche A,Staab S.Measuring similarity between ontologies.In:Gomez-Perez A,Benjamins RV,eds.Proc.of the European Conf.on Knowledge Acquisition and Management.Berlin:Springer-Verlag,2002.251-263.
    [24]Daswani N,Garcia-Molina H.Query-Flood DoS attacks in Gnutella.In:Sandhu R,ed.Proc.of the ACM 9th Conf.on Computer and Communications Security.New York:ACM Press,2002.181-192.
    [25]Palmer C,Steffan J.Generating network topologies that obey power-law.In:Gavalas D,Greenwood D,Ghanbari M,eds.Proc.of the IEEE Global Telecommunication Conf.(GLOBECOM 2000).San Francisco:IEEE Press,2000.434-438.
    [26]Ripeanu M.Peer-to-Peer architecture case study:Gnutella network.Technical Report,TR-2001-26,Chicago:University of Chicago,2001.
    [27]Saroiu S,Gummadi PK,Gribble SD.A measurement study of peer-to-peer file sharing systems.In:Kienzle MG,ed.Proc.of the Multimedia Computing and Networking 2002 (MMCN 2002).Bellingham:SPIE Press,2002.156-170.
    [28]Schlosser M,Condie T,Kamvar S.Simulating a file-sharing P2P network.In:Proc.of the 1st Workshop on Semantics in P2P and Grid Computing.2002.http://www.stanford.edu/~sdkamvar/papers/simulator.pdf
    [29]Wilcox-O'Hearn B.Experiences deploying a large-scale emergent network.In:Druschel P,Kaashoek F,Rowstron A,eds.Proc.of the 1st Int'l Workshop on Peer-to-Peer Systems.Berlin:Springer-Verlag,2002.104-110.
    [30]Leake DB,Maguitman A,Cannas A.Assessing conceptual similarity to support concept mapping.In:Haller SM,Simmons G,eds.Proc.of the 15th Int'l Florida Artificial Intelligence Research Society Conf.Menlo Park:AAAI Press,2002.168-172.
    [2]窦文.信任敏感的P2P拓扑构造及其相关技术研究[博士学位论文].长沙:国防科学技术大学,2003.
    [6]张骞,张霞,文学志,刘积仁,Ting Shan.Peer-to-Peer环境下多粒度Trust模型构造.软件学报,2006,17(1):96-107.http://www.jos.org.cn/1000-9825/17/96.htm
    [14]宋建涛,沙朝锋,杨智应,朱洪.语义对等网构造及搜索机制的研究.计算机研究与发展,2005,41(4):645-652.
    [22]陈刚,陆汝钤,金芝.基于领域知识重用的虚拟领域本体构造.软件学报,2003,14(3):350-355.http://www.jos.org.cn/1000-9825/14/ 350.htm [1]根据文件流行频度(frequency)的降序对每个文件指定一个整数的阶次(rank),则频度与阶次的乘积近似为一个常数.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

张骞,张霞,刘积仁.一种有效的Peer-to-Peer自适应拓扑进化协议.软件学报,2007,18(2):400-411

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

京公网安备 11040202500063号