期刊文献+

一种新的Chord模型的设计

New Chord Model Design
下载PDF
导出
摘要 Chord是一种比较成功的结构化P2P路由算法.但是Chord算法没有考虑到逻辑覆盖网络与真实网络的差别,致使查询延时很大.因此提出一种新的Chord模型,把Chord环分为inter Chord和intra Chord,节点通过广播的方式选择是加入到in-tra Chord中还是加入到inter Chord中,使物理上邻近的节点在逻辑覆盖网中也相邻,从而达到提高查询延时的目的,也使Chord网络中路由表的数量有所减少,并提高系统的稳定性. Chord is a kind of simple load balancing algorithm and it is also a successful P2P routing algorithm. But it does not care about the difference between of logic overlay network and physical network, and its query latency stretch is very big. A new Chord model is proposed, it divided Chord into inter Chord and intra Chord,the node joins inter Chord or intra Chord via broadcasting. This modle can reduce the latency , routing tables and improve the system stability.
出处 《小型微型计算机系统》 CSCD 北大核心 2009年第10期1968-1971,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60503055)资助 黑龙江博士后科研启动基金项目(323630217)资助
关键词 P2P INTER CHORD INTRA CHORD BROADCASTING P2P inter chord intra chord broadcasting
  • 相关文献

参考文献9

  • 1Winter R, Zalm T, Schiller J. Random landmarking in mobile, topology-aware peer-to-peer networks [ C ]. Proceedings of the 10th IEEE International WorkShop on Future Trends of Distributed Computing Systems(FrDCS04) ,2004.
  • 2Zhang H, Goel A, Govindan R. Incrementally improving lookup latency in distributed hash table[ C]. ACM SIGMETRICS ,2003.
  • 3Xiong J, Zhang Y, Hong P,et al. Chord6:IPv6 based topology-aware chord[ C]. In Proceedings of the Joint International Confer- ence on Autonomic and Autonomous Systems and International Conference on Networking and Services ( ICAS/ICNS 2005 ), Aug 2005.
  • 4Hong F, Li M, Yu J,et al. PChord: improvement on chord to achieve better routing efficiency by exploiting proximity[ C]. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops ( ICDCSW05), June 2005.
  • 5Ion Stoica, Robert Morris, David Karger, et al. Chord: a scalable peer-to-peer lookup service for internet applications [ C ]. ACM SIGCOM M01 ,Aug. 2001. San Diego. California,USA.
  • 6Ratnaswamy S, Francis P, Handley M, et al. A scalable content-addressable network[ C]. In Proc. ACM SIGCOMM, Aug. 2001,161- 172.
  • 7Ben Y,Zhao John, Kubiatowicz D, et al. Tapestry: an infraslructure for fault-tolerant wide-area location and muting[ C]. U. C. Berkeley Technical Report UCB//CSD-01-1141, April 2000.
  • 8Antony Rowstron, Peter Druschel. Pastry: scalable, distributed object location and muting for large-scale peer-to-peer systems[ C]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms. ( Middleware November 2001 ), 2001.
  • 9http ://pdos. csail, mit. edu/P2Psim/,2007.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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