期刊文献+

Chord算法性能及优化策略分析 被引量:7

Analysis of capability and advanced method of Chord
下载PDF
导出
摘要 Chord协议是一种典型的结构化P2P网络协议。在实际应用过程中,根据不同的环境需求,人们提出了各种Chord协议的修正版本,但是不同版本之间的异同为进一步对Chord协议的研究增加了困难。在分析了Chord协议的基础上,对其优点和"缺陷"作了概括性的总结,并根据Chord协议的缺陷,对各种Chord协议的修正方案进行了系统的分类,从而为较高层次上对Chord协议的研究提供了方便。 Chord protocol is a typical structurized P2P network protocol. In practical application, according to different environment demand, some revision editions for each kind of Chord protocol are proposed. But the differences between versions increased the difficulties in the Chord protocol research. Based on the analysis of Chord protocol, the merit and the flaw are summarized. According to the Chord agreement's flaw, emendation of Chord protocol is categorized, thus convenience is provided in the research of the Chord protocol in high level.
出处 《计算机工程与设计》 CSCD 北大核心 2008年第21期5454-5456,5463,共4页 Computer Engineering and Design
基金 甘肃省信息科学与技术人才培养基地基金项目(甘教高2002-40)
关键词 CHORD协议 点对点网络 One—hop Dual_Chord TaChord Chord protocol peer-to-peer network One_hop Dual Chord TaChord
  • 相关文献

参考文献8

二级参考文献36

  • 1Ion Stocia,Robert Morris,David Karger et al.Chord:A scalable Peerto-Peer lookup service for internet application[C].In:Proceedings of the2001 ACM SIGCOMM Conference,2001:149~160
  • 2Antony Rowstron,Peter Druschel.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems[C].In:Proceedings of the 18th IFIP/ACM International conference on Distributed Systems Platforms (Middleware 2001),2001-11
  • 3Sylvia Ratnasamy,Paul Francis,Mark Handley et al.A scalable content-addressable network[C].In:Proceedings of the 2001 ACM SIGCOMM Conference,2001
  • 4B Y Zha,J D Kubiatowicz,A D Joseph.Tapestry:An infrastructure for fault-tolerant wide-area location and routing[R].Tech Rep UCB/CSD-01-1141,UC Berkeley,2001-04
  • 5Anjali Gupta,Barbara Liskov,Rodrigo Rodrigues.One Hop Lookups for peer-to-peer overlays[C].In:the Proceedings of the 9th Workshop on Hot Topics in Operating Systems(HotOS-Ⅸ)
  • 6Anjali Gupta,Barbara Liskov,Rodrigo Rodrigues.Efficient routing for Peer-to-Peer overlays[C].In:Proceedings of 1st Symposium on Networked Systems Design and Implementation (NSDI'04),San Rancisco,California,2004-03
  • 7Frans Kaashoek,David R Karger.Koorde:A Simple Degree-optimal Hash Table[C].In:the Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPTPS'03)
  • 8Ben Leong,Barbara Liskov,Erik D Demaine.EpiChord:Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management[R].MIT Technical Report MIT-LCS-TR-963,2004-11
  • 9Ben Leong,Barbara Liskov,Erik D Demaine.EpiChord:Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management[C].In:Proceedings of the 12th International Conference on Networks (ICON),2004-11
  • 10KARGER D,LEHAMN E,LEIGHTOM F et al.Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the World Wide Web[C].In:Proceedings of the 29^th Annual ACM Symposium on Theory of Computing,El Paso,TX,1997-05:654~663

共引文献28

同被引文献55

  • 1陈欣.结构P2P网络Chord模型研究及其动态分析[J].福建电脑,2006,22(4):18-19. 被引量:2
  • 2陈春华.结构化P2P系统中覆盖图拓扑匹配的研究[J].计算机工程,2006,32(21):121-123. 被引量:5
  • 3Cai M,Frank M,Chen J,et al.MAAN: A multi-attribute addressable network for grid information services[C].Phoenix,AZ:4th Int'l Workshop on Grid Computing,2003:184-191.
  • 4Brighten Godfrey P, Stoica I.Heteroganeity and load balance in distributed Hash tables[C].Miami,FL, USA: IEEE INFOCOM, 2005:596-606.
  • 5Theoni Pitoura, Nikos Ntarmos,Peter Triantafillou.Replication, load balancing and efficient range query processing in DHTs[C]. EDBT,2006:131-148.
  • 6Krishna P Gummadi,Stefan Saroiu, Steven D Gribble.King: estimating latency between arbitrary internet end hosts [C]. Marseille,France:Proceedings of SIGCOMMIMW,2002.
  • 7Bharambe A, Agrawal M, Seshan Mercury. Supporting scalable multi-attribute range queries [C]. Portland, Oregon: Proceedings ofACM SIGCOMM,2004:353-366.
  • 8Theoni Pitoura, Peter Triantafillou. Self-join size estimation in large-scale distributed data systems[C]. ICDE,2008:764-773.
  • 9Stoica I,Morris R,Liben-Nowell D,et al.Chord:A scalable peerto-peer lookup protocol for internet applications[C].IEEE/ACM Transactions on Networking,2004,12(2):205-218.
  • 10Rowstron A,Druschel P.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems[C].18th IFIP/ACM Int Conference on Distributed System Platforms,2001:329-350.

引证文献7

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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