期刊文献+

Pastry网络模型的路由机制及改进 被引量:1

Routing Mechanism and Improvement of Pastry Peer-to-Peer Network
下载PDF
导出
摘要 在分析传统的Pastry路由算法的基础上,提出了一种适合于非结构化混合式网络的Pastry路由算法,通过引入索引节点、搜索节点,使得改进后的算法提高了查准率,并减少了网络上的通信量。性能分析表明,改进后的算法效果良好。 After introducing the routing mechanism of traditional Pastry P2P network model,this paper proposes a new routing algorithm based on unstructured hybrid network.It improves the precision,and reduces the traffic in the network by importing index-node and search-nod.The performance analysis shows that the new routing algorithm is more effective.
出处 《西华大学学报(自然科学版)》 CAS 2006年第1期27-30,共4页 Journal of Xihua University:Natural Science Edition
基金 四川省教育厅自然科学青年基金(编号:2004B012)
关键词 PASTRY P2P 路由算法 pastry P2P routing algorithm
  • 相关文献

参考文献4

  • 1Antony Rowstron and Peter Dnaschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[R]. IFIP/ACM Intematlonal Conference on Distributed Systems Platforms(Middleware 2001 ).
  • 2Yang B, Garcia-Molina H. Improving search in peer-to-peer networks. In: Sivilotti PAG, ed. Proc. of the Int' 1 Conf. on Distributed Computing Systems[C]. IEEE Computer Society,2002. 5-14.
  • 3Balakrishnan H,Kaashoek MF,Karger D,et al. Looking up data in p2p systems[M]. Communications of the ACM,2003.
  • 4Huang D. Y. ,Li Z. P. etc.. Active Distributed Peer-to-Peer Network Architecture[C]. In: International Conference on Communication Trehnology Proceedings, 2003.

同被引文献5

  • 1池静,方启泉.Bloom filter的研究和应用[J].河北建筑科技学院学报,2003,20(4):59-61. 被引量:4
  • 2伍玉伟.RSS:网络信息“聚合”利器[J].图书情报论坛,2006(1):72-73. 被引量:16
  • 3Balakrishnan H, Kaashoek M, Karger D, Morris R, Stoiea I. Looking Up Data in P2P Systems. Comm. of the ACM, February 2003
  • 4Ripeanu M. Peer - to - peer Architecture Case Study : Gnutella. In Proceedings of International Conference on P2P Computing, 2001
  • 5Bloom Filter. http://www. nist. gov/dads/HTML/bloomFilter, html( Accessed Aug. 18,2006 )

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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