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

结构化P2P路由表分析与改进

Analysis and Improvement of Structured P2P Routing Table
下载PDF
导出
摘要 在结构化P2P搜索算法中,chord算法是最为典型的。但该算法的fingertable中信息有冗余,同时转发次数比较多,因而效率不高。通过分析chord算法、fingertable结构,对冗余的信息进行删除,并对已搜索过的资源的后向节点进行保存而减少转发次数。通过理论分析,该算法提高了chord的查找效率。 In the structured P2P search algorithm,Chord algorithm is the most typical.But the finger table of algorithm information is redundancy,and forwarding more times,and the efficiency is not high.In this paper,through the analysis of the chord algorithm and finger table structured,redundant information is deleted,saving successor node.Through theoretical analysis,the algorithm can improve the searching efficiency of chord.
作者 王雅静
机构地区 山西财贸职业技术学院
出处 《电脑开发与应用》 2012年第8期24-25,29,共3页 Computer Development & Applications
关键词 结构化P2P网络 CHORD 路由表 structured P2P network chord routing table
分类号 TP29 [自动化与计算机技术—检测技术与自动化装置]
  • 相关文献

参考文献4

二级参考文献27

  • 1Stoica I,Morris R,Liben-Nowell D,et al.Chord:A scalable peerto-peer lookup protocol for internet applications[C].IEEE/ACM Transactions on Networking,2004,12(2):205-218.
  • 2Rowstron A,Druschel P.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems[C].18th IFIP/ACM Int Conference on Distributed System Platforms,2001:329-350.
  • 3Zhao Ben Y,Huang Ling,Jeremy Stribling,et al.Tapestry:A resilient global-scale overlay for service deployment[J].IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
  • 4Ratnasamy S,Francis P,Handley M.A scalable content-address able network[C].New York:Proc of ACM SIG-COMM,2001.
  • 5Xu J,Kumar A,Yu X.On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[C].IEEE J Sel Areas Commun,2004,22:151-163.
  • 6Cordasco G,Gargano L,Hammar M,et al.F-Chord:Improved uniform routing on Chord[C].Smolenice Castle,Slovakia:Proc 11th Colloq on Struc Info and Commun Complex,2004.
  • 7Yu S,Yu J,Kamil K,et al.DR-Chord-F an efficient double-ring chord protocol[C].Urumuqi,China:Proc 7th IEEE Int Conf Grid and Coop Comput,2007:16-18.
  • 8Stoica I,Morris R,Karger D,et al.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[C]//Proc.of ACM SIGCOMM'01.San Diego,California,USA:[s.n.],2001.
  • 9Row S.Pastry:Scalable,Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems[Z].[2008-06-21].http://www.research.microsoft.com/~antr/PAST/pastry.ps.
  • 10Gupta A,Liskov B,Rodrigues R.Efficient Routing for Peer-to-Peer Overlays[C]//Proceedings of the 1st Symposium on Networked Systems Design and Implementation.San Rancisco,California,USA:[s.n.],2004.

共引文献17

电脑开发与应用
2012年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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