期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于对等区域的改进的Chord资源路由算法 被引量：3

Improved Chord Resource Routing Algorithm Based on Opposite Regions
下载PDF
导出
摘要 给出一种基于对等区域的Chord网络资源路由算法。该算法在继承Chord算法简单、可靠、负载平衡等特点的基础上,在Chord环型结构中引入基于对等区域的搜索机制和区域管理机制,由超级节点统一转发区域成员节点状态信息,减少单个节点间由于路由信息失效而产生的无效转发,降低Chord网络的平均搜索长度,实现区域内超级节点选择的随机性,提高对等网络的资源搜索效率。 This paper proposes an improved Chord resource routing algorithm based on opposite regions. Inheriting the simple, reliable and load balancing characteristics of Chord algorithm, the algorithm introduces routing mechanism between regions and region management mechanism which transmits the states of nodes in a region uniformly by region leader in Chord ring-like topology structure. Compared with the traditional Chord algorithm, the algorithm reduces the invalid transmitting between nodes owing to invalid routing information, decreases the average routing path, realizes selecting region leader in a region randomly and improves the efficiency of routing in opposite system.
作者 李焰峰 李汉斌 张学杰
机构地区 云南大学信息学院
出处 《计算机工程》 CAS CSCD 北大核心 2009年第2期79-82,共4页 Computer Engineering
基金 国家自然科学基金资助项目(60573104)
关键词 P2P系统 CHORD网络 区域路由机制 区域管理机制 P2P system Chord network region routing mechanism region management mechanism
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-Peer Lookup Service for Intemet Applications[C]//Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, USA: ACM Press, 2001.
  • 2Federal Information Processing Standards Publication: Secure Hash Standard[Z]. (1995-04-17). http://www.itl.nist.gov/fipspubs/fip180- 1 .bryn.
  • 3Ganesan P, Manku G S. Optimal Routing in Chord[C]//Proceedings of the 15th Annual ACM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. Philadelphia, PA, USA: ACM Press, 176-185.
  • 4Gupta A, Liskov B, Rodrigues R. One Hop Lookups for Peer-to-Peer Overlays[C]//Proceedings of the 9th Conference on Hot Topics in Operating Systems. Usenix Association Berkeley, CA, USA :[s. n.], 2003.
  • 5Gupta A. Two Hop Lookups for Large Scale Peer-to-Peer Overlays[C]//Proceedings of IRIS Student Workshop. Cambridge, Massachusetts, USA: [s. n.], 2003.
  • 6Gnutella[Z]. [2007-10-20]. Http://guntella.wego.com/.
  • 7Saroiu S, Gummadi P K, Gribble S D, et al. A Measurement Study of Peer-to-Peer File Sharing Systems[C]//Proc. of Conf. on Multimedia Computing and Networking. San Jose, CA, USA: [s. n.], 2002.
  • 8Ripeanu M, Foster I, Iamnitchi A. Mapping the Gnutella Network: Properties of Large-scale Peer-to-Peer Systems and Implications for System Design[J]. Journal of IEEE Internet Computing, 2002, 6(1): 50-57.
  • 9Yang Beverly, Molina G H. Designing a Super-Peer Network[C]// Proceedings of the 19th International Conference on Data Engineering. Bangalore, India: [s. n.], 2003.
  • 10刘宝旭,孙笑庆,崔石,陆建强.Gnutella协议及数据包结构分析[J].计算机工程,2004,30(2):8-10. 被引量：8

二级参考文献8

  • 1[1]Napster. http://www. Napster.com/
  • 2[2]File Sharing Protocols:A Tutorial on Gnutella. Vincent Berk and George Cybenko,2001-03-06
  • 3[3]Gnutella Protocol.http://www. capnbry.net/gnutella/protocol.php
  • 4[4]Gnutella Forums.http://www.gnutellaforums.com/
  • 5[5]Use of the Gnutella Protocol in B2B Info-exchange Network.http://www. in foanarchy. org/story/2002/4/10/112223/265
  • 6[6]Bearshare Documentations.http://www.bearshare.com/help/contents.htm
  • 7[7]Parashar M,Arbeeny M A S,Bhat V,et al. Evaluating Security Mechanisms in Peer-to-Peer Applications. Department of Electrical and Computer Engineering, Rutgers University,2000
  • 8[8]Bellovin S M.Security Aspects of Napster and Gnutella. 9th Usenix Security Symposium Presentation, Denver, Colorado,2000-08

共引文献7

同被引文献26

  • 1刘业,杨鹏.基于自组织聚类的结构化P2P语义路由改进算法[J].软件学报,2006,17(2):339-348. 被引量：17
  • 2张浩,金海,聂江武,徐婕,章勤.Dual-Chord:一种更加有效的分布式哈希表[J].小型微型计算机系统,2006,27(8):1450-1454. 被引量：9
  • 3STOICA I, MORRI R, KARGER D,et al. Chord: A scalable peer - to - peer lookup service for Internet applications [ C ]//Annual Conference of the Special Interest Group on Data Communications (SIGCOMM 2001), 2001,149-160.
  • 4ROWSTRON A, DRUSCHEL P. Pastry: scalable, distributed object location and routing for large - scale peer - to - peer systems [ C ]//International Conference On Distributed Systems Platforms ( Middleware 2001 ), 2001,329-350.
  • 5RATNASAMY P, FRANCIS M, HANDLEY R Karp, et al. A scalable content - addressable network [ C ]//Annual Conference of the Special Interest Group on Data Communications ( SIGCOMM 2001 ) ,2001.
  • 6Ben Zhao, John Kubiatowicz, Anthony Joseph. Tapestry : an infrastructure for fault - tolerant wide - area location and routing [ Z ]. Technical Report UCB/CSD - 01 - 1141. Computer Science Division,2001.
  • 7GUPTA I, BIRMAN K, LINGA P, et al. Kelips : building an efficient and stable P2P DHT through increased memory and background overhead [C]//In: Proceedings of 2nd International Workshop on Peer- to -Peer Systems ( IPTP' 03 ) ,2003.
  • 8GUPTA A, LISKOV B, RODRIGUES R. One hop lookups for peer - to -peer overlays[C]//In the Proceedings of the 9th Workshop on Hot Topics in Operating Systems ( HotOS - IX) ,2003.
  • 9GANESAN P, MANKU G S. Optimal routing in Chord [ D ]. Stanford University, SODA 2004.
  • 10BEVERLY Y, HECTOR G M. Designing a super - peer network [C]//Proceedings 19th International Conference on Data Engineering,Volume, 5-8,2003,49-60.

引证文献3

二级引证文献5

计算机工程
2009年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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