期刊文献+

结构化P2P网络模型的改进 被引量:2

结构化P2P网络模型的改进
下载PDF
导出
摘要 文章通过对现有P2P网络[1,2]模型的分析,指出了现有网络模型的缺陷,并建立了一种节点分级网络模型(HNN)。HNN在继承了DHT算法路由的所有优点(如很强的鲁棒性)的同时,通过对网络节点带宽和位置信息的引入,解决了原有网络模型因哈希(HASHING)而引起的对实际网络拓扑结构的破坏问题,使虚拟网络模型更好地与实际网络的小世界特性相匹配。 By analyzing existing peer-to-peer network model, the shortcomings of the network are pointed out and a model of hierarchical nodes network (HNN)is built. While inheriting all advantages of DHT algorithm routing (e.g.Robust), HNN can resolve the topology stnlcture of real network destroyed by old network model because of hashing through the introduction of the bandwidth of network nodes and position, which match better virtual network model to the characteristics of actual network model.
作者 杨靖 何永洪
出处 《电信快报》 2005年第12期47-49,共3页 Telecommunications Information
关键词 P2P 节点分级 HNN 结构化覆盖网 P2P, node hierarchy, HNN, structured overlay network
  • 相关文献

参考文献5

  • 1LJ ZP, Huang JH, Huang DY. Zhuang L. Introduction to Peer-to-Peer networking technology and development.Telecommunications Science. 2003. 19(3):1-4(in Chinese with English abstract).
  • 2Fox G. Peer-to-Peer networks. Web Computing, 2001,3(3):75-77.
  • 3Ion Stoica, Robert Morris, David Karger. M.Frans Kaashoek, Hari Balakrishnan, Chord. A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceeding of ACM SIGCOMM 2001, San Diego.California. USA.
  • 4Sylvia Ratnasamy. Paul Fraacis, Mark Handley,Richard Karp, Scotl Shenker. A Scalable Content-Addressable NeP, vork. In Proceedings of ACM SIGCOMM2001. San Diego. California, USA.
  • 5Antony Rowstron and Peter Draschel. Pastry:Scalable,decentralized object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001 ).

同被引文献5

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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