期刊文献+

PingPangRoll:一种基于乒乓映射的P2P资源发现方法

PingPangRoll:A P2P Resource Discovered Method Based on Ping-Pang Mapping
下载PDF
导出
摘要 资源发现方法严重影响着P2P系统的性能.提出了一个基于概率的称为PingPangRoll的穷举搜索算法,它结合了结构化和非结构化两者的优点.系统拓扑采用松散的随机多图结构,具有十分强的可缩放性.搜索的时候首先基于生日悖论理论计算出满足用户可靠性要求需要的数据、查询复制份数,然后通过乒乓映射将查询和数据复制精确地映射到网络节点中,以实现几乎穷举的搜索,从而克服非结构化P2P网络搜索覆盖范围有限,有资源查找不到的缺点. A resource discovered method gravely affects the performance of P2P system. This paper proposes a probabilistic and exhaustive search algorithm called PingPangRoll, which absorbs the merits of structured and unstructured P2P. The topology of system employs a relaxed random multigraph which is scalable. Firstly evaluate the necessary number of replica of data and query by the birthday paradox theory, which is required to satisfy the user's reliable requirement, and then map the replica of data and query onto peers in the network by Ping-Pang mapping to perform the exhaustive search. This algorithm overcomes the drawback that the search area is limited and some existing resources can not be found in the un- structured P2P.
出处 《微电子学与计算机》 CSCD 北大核心 2009年第1期67-71,75,共6页 Microelectronics & Computer
基金 国家自然科学基金项目(60673179) 浙江省自然科学基金项目(Z106727 Y105356)
关键词 对等网络 映射 生日悖论 随机多图 peer to peer mapping birthday paradox random multigraphs
  • 相关文献

参考文献7

  • 1Stoica R M, Karger D, Kaashoek M F, et al. Chord: a scalable peer - to- peer lookup service for Intemet applications[C]// Proceedings of ACM SIGCOMM' 01. New York, 2001.
  • 2蓝慧琴,钟诚,李智.一种改进的基于连通支配集的P2P搜索算法[J].微电子学与计算机,2006,23(10):20-21. 被引量:1
  • 3Zhao B Y, Kubiatowicz J D, Joseph A D. Tapestry: an infrastructure for fault - resilient wide - area location and routing[ R]. Technical Report UCB//CSD - 01 - 1141, U. C. Berkeley, 2001.
  • 4马慧,徐孟春,张德文,王春新.基于资源路由表的P2P资源查找机制研究[J].微电子学与计算机,2007,24(4):168-170. 被引量:5
  • 5Ferreira R A, Raxnanathan M K, Aware A, et al. Search with probabilistic guarantees in unstructured peer- to- peer networks[C]// In P2P. USA: Purdue University, 2005 : 165 - 172.
  • 6Bollobas B. Random graphs[M]. 2nd ed. UK: Cambridge University Press, 2001.
  • 7Bawa M, Garcia- Molina H, Gionis A, et al. Estimating aggregates on a peer- to- peer network[R]. USA: Stanford University, 2003.

二级参考文献14

  • 1王丹,于戈.P2P系统模型研究[J].计算机工程,2005,31(4):128-130. 被引量:29
  • 2何秀强,王寅峰,董小社,叶哲丽,郭华.基于P2P技术的网格资源发现中覆盖网络的构建[J].微电子学与计算机,2005,22(7):19-23. 被引量:4
  • 3孙帅,董小社,杨凡,何秀强.基于三层P2P结构的网格资源发现模型[J].微电子学与计算机,2005,22(8):127-129. 被引量:5
  • 4严蔚民,吴伟民.数据结构(C语言版)[M].北京:清华大学出版社,1997.
  • 5V Kalogeraki,D Gunopulos,D Zeinalipour-Yazti.A local search mechanism for peer-to-peer networks.In:Proc.11th Int'l Conf.Information and knowledge management,New York:ACM Press,2002:300~307
  • 6B Yang,H Garcia-Molina.Improving search in peer-topeer networks.In:Proc.22nd Int'l Conf.Distributed Computing Systems,Los Alamitos,CA:IEEE Computer Society Press,2002:5~15
  • 7A Crespo,H Garcia-Molina.Routing Indices for peer-topeer systems.In:Proc.22nd Int'l Conf.Distributed Computing Systems,Los Alamitos,CA:IEEE Computer Society Press,2002,23~35
  • 8Zhengyun Zhuang,Yuhao Liu,Li Xiao,Lionel M Ni.Hybrid periodical flooding in unstructured peer-to-peer networks.In:Proc.of the 2003 international conference on parallel processing,Los Alamitos,CA:IEEE Computer Society Press,2003:171~178
  • 9Qianbing Zheng,Wei Peng,Yongwen Wang,Xicheng Lu.An efficient broadcast algorithm based on connected dominating set in unstructured peer-to-peer network.In:Proc.of WISE 2004,LNCS 3306,Berlin Heidelberg:SpringerVerlag,2004:724~729
  • 10S Merugu,S Srinivasan,E Zegura.Adding structure to unstructured peer-to-peer networks:the role of overlay topology.In:Proc.of ACM Networked Group Communications,LNCS 2816,Berlin Heidelberg:Springer-Verlag,2003:83~94

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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