期刊文献+

一种Chord路由表的改进方法 被引量:1

在线阅读 下载PDF
导出
摘要 资源的高效查找是P2P网络研究中一个核心问题。针对P2P资源查找协议Chord的路由表信息冗余、查找效率不高的问题,提出了一种Chord路由表的改进方法。在不增加路由表长度的前提下,将路由表中的重复表项删除,进而增加经过科学定义且具较大覆盖面的有效路由信息。实验结果表明,该方法减少了平均查找跳数,提高了查找效率,使提高查找效率和控制路由表长度得到较好的统一。
作者 王必晴
机构地区 铜陵学院
出处 《铜陵学院学报》 2010年第3期69-70,共2页 Journal of Tongling University
基金 铜陵学院2009年度院级科研项目(编号:2009tlxy22)
  • 相关文献

参考文献2

二级参考文献19

  • 1张震,王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用,2006,42(11):147-152. 被引量:16
  • 2Stoica I,Morris R,Karger D,et al.Chord:a scalable Peer-to-Peer lookup service for Intemet application [C]//Proceedings of the 2001 ACM SIGCOMM Conference,2001,149-160.
  • 3Zhao B Y,Kubiatowicz J,Joseph A D.Tapestry:an infrastructure for fault-tolerant wide-area location and routing,CSD-01-1141[R].UC Berkeley, UCB, 2000.
  • 4Fu X D,Shi W S,Akkerman A.CANS:composable,adaptive network services infrastructure[C]//Proceedings of the 3rd USEN IX Symposium lnternet Technologies and Systems,2001.
  • 5Row S A,Druschel P.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, 2001.
  • 6Ganesan P,Manku G S.Optimal routing in Chord[D].Stanford University, SODA, 2004.
  • 7Gupta A,Liskov B,Rodrigues R.One hop lookups for peer-to-peer overlays [C]//Procedings of the 9th Workshop on Hot Topics in Operating Systems( HotOS-IX), 2003.
  • 8Gupta A,Liskov B,Rodrigues R.Efficient routing for peer-to-peer overlays[C]//Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI'04),San Rancisco, California,2004.
  • 9Saroiu S,Gummadi P K,Gribble S D.A measurement study of peer-to-peer file sharing systems[C]//Proceedings of the Multimedia Computing and Networking Conference,San Jose,California, USA, 2002.
  • 10ROWSTRON A,DRUSCHE P.Pastry:Scalable,distributed object location and routing for large.scale peer.to.peer systems. http://www.research.microsoft.com/~antr/PAST/pastry.ps . 2008

共引文献10

同被引文献17

  • 1曹俊,宗平.Chord算法的研究和改进[J].科技资讯,2008,6(3):233-234. 被引量:3
  • 2段世惠,王劲林.基于有限范围组播的Chord路由算法[J].计算机应用,2009,29(2):514-517. 被引量:6
  • 3张亮,邹福泰,马范援.Chord协议的最优路由表结构[J].上海交通大学学报,2005,39(8):1276-1279. 被引量:10
  • 4张浩,金海,聂江武,徐婕,章勤.Dual-Chord:一种更加有效的分布式哈希表[J].小型微型计算机系统,2006,27(8):1450-1454. 被引量:9
  • 5Fanning S. Napster Inc [ EB/OL]. http://free, nap- ster. com,2007-05-12.
  • 6Markatos E P. Tracing a large-scale peer-to-peer Sys- tem :an hour in the life of Gnutella[ R]. Los Alamitos : Computing and Grid,2002.
  • 7Ratnasamy S, Francis P, Handley M. Proceedings of ACM SIGCOMM01 [ C ]. USA : ACM Press,2001.
  • 8Stoica I,Morris R,Karger D,et al. Chord:a scalable peer to peer lookup service for Internet applications [ J ]. Com- puter Communication Review,2001,31 (4) :27-31.
  • 9Rowstron A, Druschel P. International Conference on Distributed Systems Platforms ( Middleware ) [ C ]. Ger- many : Springer, 2001.
  • 10Zhao Ben, Kubiatowicz J D ,Joseph A D. Technical Re- port No. UCB/CSD-01-1141 [ R], USA: University of California Berkeley,2001.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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