期刊文献+

利用二叉排序树改进结构化P2P模型

Binary sort tree model for structured P2P improved mechanism
在线阅读 下载PDF
导出
摘要 P2P覆盖网络是一种对等网之间的逻辑连接构成的应用层网络,由于其易于构建、管理灵活、可扩展性强,在实现互联网上的多种应用中发挥着重要的作用。在研究Chord算法的基础上提出了一个BBSTC网络拓扑模型,介绍了网络节点的加入和退出的路由算法以及资源定位的步骤,通过仿真实验和分析表明此方案可以显著改善搜索结果的成功率和大大减少搜索所需的路由跳数,在目前结构化P2P环境中,该策略有一定的推广利用和研究价值。 P2P overlay network is a logical connection between the application layers consisting of networks,because of its easy to build,management flexibility,scalability,and in achieving a variety of applications on the Internet to play this important role. Based on the Chord algorithm this paper proposes a network topology model BBSTC,introduces the addition of network nodes and the routing algorithm from the Resource Locator,as well as the steps.Simulation experiments and analysis show that this program can significantly improve the success rate of search results and significantly reduce the routing hops of search.In the structured P2P environment,the strategy promotes the use and has certain research value.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第36期101-104,共4页 Computer Engineering and Applications
关键词 P2P CHORD 资源定位 Peer-to-Pee(rP2P) Chord resource locating
  • 相关文献

参考文献5

  • 1Qu C,Nejdl W,Kriesell M.Cayley DHTs-a group-theoretic framework for analyzing DHTS based on Cayley graphs[C]//Cao J.The Second International Symposium on Parallel and Distributed Processing and Applications.Berlin:Springer-Verlag Press,2004:914-925.
  • 2Shi S.Making Peer-to-Peer keyword searching feasible using multilevel artitioning[C]//3rd International Workshop on Peer-to-Peer Systems, Feburuary 2004: 400-408.
  • 3PUB180-1 Secure Hash Standard[S].National Institute of Standards and Technology FIPS,2005-04-07.
  • 4Stocia I,Morris R,Karger D,et al.Chord:A scalable peer-to-peer lookup service for Internet applications[J].Computer Communication Review, 2001,31 (4) : 149-160.
  • 5朱承,刘忠,张维明,肖卫东,阳东升,徐振宁.结构化P2P网络中基于流言传播的负载均衡[J].通信学报,2004,25(4):31-40. 被引量:16

二级参考文献11

  • 1MOTWANI R, RAGHAVAN P. Randomized Algorithms[M]. London: Cambridge University Press, 1995.
  • 2FREEDMAN M, MAZIERES D. Sloppy hashing and self-organize clusters[A]. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS ′03)[C]. Berkeley, 2003.45-55.
  • 3BYERS J, CONSIDINE J, MITZENMACHER M. Simple load balancing in distributed hashing tables[A]. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS′03)[C]. Berkeley, 2003.80-87.
  • 4RAO A, LAKSHMINARAYANAN K, SURANAET S, et al. Load balancing in structured p2p systems[A]. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS′03)[C]. Berkeley, 2003.68-79.
  • 5DATTA A, HAUSWIRTH M, ABERER K. Updates in highly unreliable, replicated peer-to-peer systems[A]. Proceedings of the ICDCS[C]. Providence, Rhode Island, 2003.76-87.
  • 6LUO J, EUGSTER P, HUBAUX J. Route driven gossip: probabilistic reliable multicast in ad hoc networks[A]. Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom 2003)[C]. San Franciso, 2003.2229-2239.
  • 7EUGSTER P, GUERRAOUI R, HANDURUKANDE S. Lightweight probabilistic broadcast[A]. Proceedings of The International Conference on Dependable Systems and Networks (DSN 2001)[C]. Sweden: Goteborg, 2001. 443-452.
  • 8KERMARREC A, MASSOULIE L, GANESH A. Reliable probabilistic communication in large-scope information dissemination systems[EB/OL]. MMSR-TR-2000-105, 2000. http://research.microsoft.com/camdis/PUBLIS/Kermarrec_techreport.pdf.
  • 9STOICA I, MORRIS R, KARGER D, et al. Chord: a scalable peer-to-peer lookup service for Internet applications[EB/OL]. TR-819,MIT LCS, 2001. http://www. pdos.lcs.mit.edu/chord/papers.
  • 10KARGER D, LEHMAN E, LEIGHTON F, et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web[A]. Proceedings of the 29th Annual ACM Symposium on Theory of Computing[C]. El Paso,Texas, 1997.654-663.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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