期刊文献+

对等网络中一种新的资源搜索机制的研究

A New Resource Search Mechanism in Peer-to-Peer Network
下载PDF
导出
摘要 本文中,我们对对等网络中的资源搜索机制进行了研究,提出一种名为指数-线性协议的新的资源搜索机制,来提高搜索机制的效率。该机制结合了指数机制和线性机制,能够有效的搜索到合适的资源,降低消耗。同时,我们创造性地提出使用OHT来减少大量冗余信息,以降低网络负载和提高效率。 In this work, we have done some researches on resource search mechanism in Peer-to-peer networks, and proposed a new resource search mechanism, namely Exponential-Linear protocol, to improve efficiency in search mechanism in P2P networks. It is consisted of Exponential mechanism and Linear mechanism. By organic combination, all fitful resources can be searched efficiently and wastes are lowered. Also in this paper, we proposed an OHT creatively to degrade a good deal of redundant messages to reduce load and...
出处 《微计算机信息》 北大核心 2008年第9期107-108,314,共3页 Control & Automation
基金 重庆市科委资助项目(D2004-18)
关键词 对等网络 对等 泛洪机制 资源搜索 指数-线性协议 OHT Peer-to-Peer networks P2P flooding mechanism Resource searching Exponential-Linear protocol OHT
  • 相关文献

参考文献8

  • 1蔡明,俞伟.一种改进的Peer-to-Peer资源定位方法[J].微计算机信息,2006,22(03X):108-109. 被引量:11
  • 2[2]S Saroiu,P K Gummadi;S D Gribble."A Measurement Study of Peer-to-PEER File Sharing Systems[C]."Proceedings of Multi-media Computing and Networking,2002.
  • 3[3]Gnutella.http://www.gnutella.com/
  • 4[4]S Ratnasamy,P Francis,M Handley et al."A scalable content-ad-dressable network[C]."In:ACM SIGCOMM01.2001-08.
  • 5[5]Napster.http://www.napster.com/
  • 6[6]K Sehelfthout,T Holvoet,"A pheromone-based coordination mech-anism applied in P2P[C]."In:Moro G,Sartori C,Singh M P eds.Pro-ceedings of the Second International Workshop on Agents and Peer-to-Peer Computing,2003:151-162.
  • 7[7]D Tsoumakos,et al."A Comparison of Peer-to-Peer Search Methods[J]."WebDB,2002.
  • 8[8]Marius Portmann,Aruna Seneviratne.Cost-effective broadcast for fully decentralized Peer-to-Peer networks[J]."Computer Com-munications,2003;269(11):1159~29

二级参考文献8

  • 1谈永新,黄锡鹏.一种新的快速自适应车牌定位方法[J].微计算机信息,2005,21(2):66-68. 被引量:14
  • 2P. Druschel AND A. Rowstron, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems.-In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Nov. 2001
  • 3S. Ratnasamy, S. Shenker AND I. Stoica, Routing Algorithms for DHT' s: Some Open Questions,-In Proceedings of the 1st International Workshop on Peer-to-Peer, 2002
  • 4F. Dabek, J.Y. Li, E. Sit, J. Robertson, M. F. Kaashoek AND R.Morris, Designing a DHT for low latency and high throughput,-In Proc. NSDI, 2004
  • 5I. Stoica, R. Morris, D. Karger, M. F. Kaashoek AND H.Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications.-In Proceedings of the ACM SIGCOMM ' 01 Conference, Aug. 2001
  • 6P. Druschel AND A. Rowstron, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems.-In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Nov. 2001
  • 7S. Ratnasamy, P. Francis, M. Handley, R. Karp AND S.Shenker, A scalable content-addressable network.-In Proc. ACM SIGCOMM, Aug.2001, pages 161-172
  • 8p2psim' s homepage http://pdos.csail.mit.edu/p2psim/

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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