期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

利用多级局部性实现可扩展的无结构P2P搜索 被引量：5

Exploiting Multi-Level Locality to Implement the Scalable Search in Unstructured P2P Network
在线阅读 下载PDF
导出
摘要 无结构P2P网络拓扑随着规模的增大会出现一定的统计特性,充分应用该现象提出了一种多级局部覆盖网络(multi-level local overlay,简称ML2O)的无结构P2P覆盖网,对ML2O中节点间的连接进行恰当的数学控制后,就能使产生的拓扑具有从微观到宏观的多个粒度上的局部性.理论分析表明,ML2O的网络直径和节点平均度都是网络规模n的对数,为其上建立可扩展的无结构P2P搜索奠定了基础.给出了应用ML2O多粒度局部特性的索引机制:首先以局部为单位建立信息索引;然后在局部索引的基础上建立更大粒度局部的索引,从而形成一棵索引树;最后提出了一种局部渗透定向搜索算法(local pervasion and directed search,简称LPDS).LPDS用局部渗透收集到的信息建立部分索引树,并在树上找到更接近搜索目标的下一跳.理论分析表明,LPDS搜索算法的平均搜索跳数和通信负载都是O(logn).模拟实验结果表明,ML2O上LPDS的可扩展性接近结构化P2P搜索,其鲁棒性接近无结构P2P搜索. Some statistical characteristic will emerge in unstructured P2P networks because of its large scale. Using above phenomena, an unstructured P2P overlay called Multi-Level Local Overlay, or ML20 is presented in this paper. The mathematical control on the links can generate a topology with locality in multiple scale. Theoretical analyses show that the diameter of network and the average degree of peers are all O（logn） where n is the size of peers. Based on the multi-level locality, a recursive indexing mechanism is devised in this paper, in which the index for larger locality is build from the indexes of smaller localities Finally, an unstructured P2P search algorithm called Local Pervasion and Directed Search, or LPDS is presented in this paper. LPDS will collect information from local scope by executing local pervasion. Moreover, a part of the index tree can be achieved from the collected information. LPDS can find the next hop approaching the destination in the partial index tree. Theoretical analyses show that the expectation of average search hops and communication loads produced by LPDS are all O（logn）. Experimental results illustrate the scalability of LPDS on ML2O is close to structured P2P search and its robustness is close to unstructured P2P search.
作者 李治军 姜守旭 李晓义
机构地区 哈尔滨工业大学计算机科学与技术学院
出处 《软件学报》 EI CSCD 北大核心 2011年第9期2104-2120,共17页 Journal of Software
基金 国家自然科学基金(60803148 60973124)
关键词 无结构P2P网络 多级局部性 索引机制 局部渗透定向搜索 unstructured P2P network multi-level locality index mechanism local pervasion and directed search
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献28

  • 1Meshkova E, Riihijavi J, Petrova M, Mahonen P. A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks, 2008,52(11):2097-2128. [doi:/10.1016/j.comnct.2008.03.006].
  • 2Risson J, Moors T. Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks, 2006,50(17): 3485-3521. [doi:/lO.lO16/j.comnet.2006.02.001].
  • 3Bisnik N, Ahouzeid AA. Optimizing random walk search algorithms in P2P networks, Computer Networks, 2007,51(6): 1499-1514. [doi:/10.1016/j.comnet.2006.08.004].
  • 4Ltl Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks. In: Proc. of the Supercomputing. 2002. [doi:/10.1145/514191.514206].
  • 5Cohen E, Shenker S. Replication strategies in unstructured peer to peer networks. SIGCOMM Computer Communication Review, 2002,32(4):177-190.[doi:/10.1145/964725.633043].
  • 6Terpstra WW, Kangasharju J, Leng C, Buchman AP. BubbleStorm: Resilient, probabilistic and exhaustive peer-to-peer search. In: Proc. of the SIGCOMM. 2007.
  • 7Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S. Making gnutella-like P2P systems scalable. In: Froc. of the SIGCOMM. 2003. 407-418. [doi:/10.1145/863955.864000].
  • 8Puttaswamy KPN, Sala A, Zhao BY. Searching for rare objects using index replication. In: Proc. of the 27th Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM). 2008. 1723-1731. [doi: / 10.1109/INFOCOM.2008,234].
  • 9Crespo A, Garcia-Molina H. Routing indices for peer-to-peer systems. In: Froc. of the 22nd Int'l Conf. on Distributed Computing Systems (ICDCS 2002). 2002.23-32. [doi:/10.1109/ICDCS.2002.1022239].
  • 10Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems. In: Proc. of the IEEE INFOCOM. 2003.2166-2176. [doi:/10.1109/INFCOM.2003.1209237].

同被引文献36

  • 1周建存,李又良.基于P2P的分簇自组织网络路由模型[J].科技咨询导报,2007(18):11-12. 被引量：1
  • 2汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究[J].计算机研究与发展,2007,44(9):1566-1571. 被引量：13
  • 3The Napster Protocol website[EB/OL].[2011-10-08].http://david.weekly.org/napster.php3.
  • 4The Gnutella Home page[EB/OL].[2011-10-01].http://www.gnutella.com.
  • 5Rowstron A,Druschel P.Pastry:Scalable,Decentralized ObjectLocation and Routing for Large-scale Peer-to-Peer ystems[C]//Proc,ofInt’l Conf,on Distribute Systems Platforms(Middle-ware).Heiderberg,Germany[:s.n.].2001.
  • 6Stcica l,Morris R,Rarger D,et a1.Chord:A Scalable Peer-to-Peerlookup Service for Internet Applications[C]//Proc of SIGCOMM’01.,USA[:s.n.],2001.
  • 7Ratnasamy S,Francis P,HandMy M,et a1.A Scalable Content—addressable Network[C]//Proc.of SIGCOMM’01.San Diego,CA,USA:[s.n.],2001.
  • 8Zhao B Y,Huang,et a1.Tpaestry:A Resilient Global-scale Over-lay for Service Deployment[J],IEEE Journal On Selected Areas in Com-munications,2004.22(1):41-53.
  • 9Amin R,Ashrafch S,Akhtar MB,et al.Analyzing Performance ofAd hoc Network Mobility Models in a Peer-to-Peer Network Applica-tion over Mobile Ad hoc Network 2010 International Conference onElectronics and Information Engineering(ICEIE 2010),344-348.
  • 10Ioannidis S,Marbach P.Absence of evidence as evidence of ab-sence:A simple mechanism for scalable P2P search.In:Proc.of the 28thAnnual Joint Conf.of the IEEE Computer and Communications Societies(INFOCOM).2009.

引证文献5

二级引证文献3

软件学报
2011年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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