期刊文献+

一种Chord的分层资源定位模型 被引量:4

Hierarchical Resource Locating Model of Chord
下载PDF
导出
摘要 提出一种新型的基于Chord的分层资源定位模型,该模型由内外两层Chord环组成,内Chord环将各节点分组,组内节点自治,各组超级节点组成外Chord环完成组间路由,各节点采用精简路由表提高有效信息的存储.实验是使用开源P2P仿真工具PlanetSim来模拟整个模型在分层资源定位时的状况.实验表明改进后的模型提高了资源定位的效率,在结构化的P2P网络模型中值得推广. This paper proposes an improved Chord-based hierarchical resource locating model, in which the upper and lower layer both are structured Chord network, each group being self-governed Chord ring by its delegate. The requests, such as routing and query operations beyond their own groups, are completed by the aid of super nodes in the upper Chord ring. Every node makes use of the reduced routing table for storage of efficient information. Experiments are imitated to perform by exploiting the open-source P2P-imitated tool (PlanetSim). Experiment results indicate that the improved Chord improves resource orientation. So it is worth popularizing and applying in structured P2P network.
出处 《小型微型计算机系统》 CSCD 北大核心 2009年第1期83-86,共4页 Journal of Chinese Computer Systems
关键词 CHORD 分层 资源定位 精简路由表 chord hierarchy resource locating reduced routing table
  • 相关文献

参考文献12

  • 1Stoica Ion, Morris R, Karger D, et al. Chord: a scalable peer- to-peer lookup service for internet applications[C]. Proceeding of ACM SIGCOMM 2001, San Diego, California, USA, 2001.
  • 2Rathasamy S, Francis P, Handley M, et al. A scalable content- addressable network[C]. Proceedings of ACM SIGCOMM,San Diego, August 2001,149-160.
  • 3Ben Y Zhao, Jonh Kubiatowicz, Anthony D Joeph. Tapestry: an infrastructure for fault-tolerant wide-area location and routing[R]. U. C. Berkeley Technical Report UCB//CSD-01- 1141 ,April 2000.
  • 4Antony Rowstron, Peter Druschel. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems [C]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms. (MiddlewareNovember 2001), Heidelberg, November 2001,329-350.
  • 5Liang Da-ming. Research on P2P network resource locating model[D]. Zhejiang University, 2006.
  • 6KaZaA[EB/OL]. http://www. kazaa. com/. 2007.
  • 7Peng Zhuo,Duan Zhen-hua,Qi Jian-jun,et al. HP2P: a hybrid hierarchical P2P network[C]. Proceedings of the First International Conference on the Digital Society (ICDS'07), IEEE, 2007.
  • 8Mizrak A T, Cheng Y C, Kumar V,et al. Structured super-peers : leveraging heterogeneity to provide constant-time lookup [C]. Proc. of the 2nd Int'1 Workshop on Peer-to-Peer Systems, 2003.
  • 9Yuh-Jzer Joung, Jiaw-Chang Wang. Chord2: a two-layer chord for reducing maintenance overhead via heterogeneity[J]. Computer Networks,2007, 51:712-731.
  • 10Chen Gang, Wu Guo-xin, Yang Wang. G-Chord: an improved routing algorithm for Chord[J]. Journal of Southeast University,2007,37(1) :9-12.

二级参考文献1

共引文献14

同被引文献29

  • 1廖小飞,金海.P2P网络中资源搜索机制的研究[J].华中科技大学学报(自然科学版),2005,33(z1):86-89. 被引量:3
  • 2曹俊,宗平.Chord算法的研究和改进[J].科技资讯,2008,6(3):233-234. 被引量:3
  • 3陈刚,吴国新,杨望.G-Chord:一种基于Chord的路由改进算法[J].东南大学学报(自然科学版),2007,37(1):9-12. 被引量:9
  • 4王菁,杨寿保,郭磊涛,周金洋.基于延迟敏感的双向查询Chord系统[J].小型微型计算机系统,2007,28(4):604-608. 被引量:4
  • 5G. Cordasco, L. Gargano, M. Hammar, et al. F-Chord: im proved Uniform routing on Chord[C]//proc. 11^th Colloq. On Struc. Info and Commun. Complex June, 2004 : 223-225.
  • 6S. Yu, J. Yu, K. Kamil, et al. DR-Chord Fan efficient doub- le-ring Chord protocol [C]//Proceddings of th USENIX AN- NUAL Technical Conference June, 2004 : 234-236.
  • 7罗杰文.Peer to Peer综述.中科院计算技术研究所,2005.
  • 8M. Kutter, F. Jordan, F. Bossen. Digital signature of colorimages using amplitude modulation[C]//Proc. SPIE,1997,3022:518-526.
  • 9D. Kundur, D. Hatzinakos. A Robust Digital Image Water- marking Method Using Wavelet Based Fusion[C]//Proceedings of IEEE ICIP, 1997,1: 544-547.
  • 10Hartung F. Girod B. Fast pulic-key watermarking of compresed in: Proceeding of the 1997 International Conference on image process- ing. SantaBarbara, CA, USA: IEEE,1997:528-531.

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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