期刊文献+

结构化P2P网络拓扑匹配技术综述 被引量:6

Survey on topology-matching techniques in structured P2P networks
下载PDF
导出
摘要 结构化P2P网络中由DHT(分布式哈希表)来决定网络中资源的映射位置,这种方式在系统的可扩展性和资源的定位速度上都有了很大的提高。但是,在利用DHT构建覆盖网络时,并没有过多地考虑底层物理拓扑结构,因而产生了逻辑拓扑与物理拓扑的失配问题,造成了很多不必要的路由,降低了资源定位的效率。针对这种情况进行了大量的文献调研,对结构化P2P网络拓扑匹配现有的算法进行了介绍,分析了各种算法的优缺点,并在现有算法的基础上进一步展开研究。 In the structured P2P networks, the location of the resources in the network is decided by DHT( distributed hash table). This method make a great improvement in the system scalability and the speed of searching resources. But, when building the overlay network with DHT, it doesn' t take the physical topology into consideration. As a result, there are a lot of redundant massages in the network and a low efficiency in the search resources because of the mismatching problem between logical topology and physical topology. Considering these problems, this paper introduced several topology-matching techniques and compares among them. Based on the survey, this paper outlined this future research directions.
出处 《计算机应用研究》 CSCD 北大核心 2009年第8期2807-2809,2826,共4页 Application Research of Computers
基金 全国教育科学"十一五"规划教育部重点课题(DCA060097)
关键词 对等网络 结构化对等网络 对等网络拓扑 拓扑匹配 P2P structured P2P P2P network topology topology match
  • 相关文献

参考文献1

二级参考文献18

  • 1Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.161-172.
  • 2Stoica I,Morris R,Karger D,Kaashoek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for Internet applications.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.149-160.
  • 3Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for large-scale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware 2001).Heidelberg:Springer-Verlag,2001.329-350.
  • 4Zhao BY,Huang L,Stribling J,Rhea SC,Joseph AD,Kubiatowicz J.Tapestry:A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
  • 5Malkhi D,Maor M,Ratajczak D.Viceroy:A scalable and dynamic emulation of butterfly.In:Ricciardi A,ed.Proc.of the 21st Annual Symp.on Principles of Distributed Computing.New York:ACM Press,2002.182-192.
  • 6Shen HY,Xu CZ,Ghen G.Cycloid:A constant-degree and lookup-efficient P2P overlay network.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 18th Int'l Parallel and Distributed Processing Symp.(IPDPS 2004).New York:IEEE Press,2004.26-30.
  • 7Xu Z,Tang C,Zhang Z.Building topology-aware overlays using global soft-state.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 23rd Int'l Conf.on Distributed Computing Systems (ICDCS 2003).New York:IEEE Press,2003.500-508.
  • 8Ratnasamy S,Handley M,Karp R,Shenker S.Topologically-Aware overlay construction and server selection.In:Proc.of the IEEE INFOCOM.New York:IEEE Press,2002.1190-1199.
  • 9Winter R,Zahn T,Schiller J.Random land-marking in mobile,topology-aware peer-to-peer networks.In:Proc.of the 10th IEEE Int'l Workshop on Future Trends of Distributed Computing Systems (FTDCS 2004).New York:IEEE Press,2004.319-324.
  • 10Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions.In:Druschel P,ed.Proc.of the 1st Int'l Workshop on P2P Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.45-52.

共引文献40

同被引文献35

引证文献6

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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