期刊文献+

一种基于对等网络的高效查询机制

Efficient Query Mechanism Based on P2P Networks
下载PDF
导出
摘要 如何实现有效查询是对等应用的关键,在分析几种常见的查询算法的基础上,介绍双重指针分布式索引算法的实现过程。通过计算对等网络中文档的流行度和网络的连通状态,确定节点的有用性,进一步决定查询的路由。通过仿真实验,将该算法与几种常用算法在查询耗时、查询请求数量、更新信息数量上进行比较。 How to implement the efficient query is the key point of applications deployed on P2P networks. This paper analyses the shortage of several query algorithms, and presents the process of DDI, which means distributed searching with double indices. It discusses the popularity of documents and the linking status of the networks, and calculates the availability of the nodes in whole network, determines the route of query steps. It compares the items of time using, the quantity of query requests and update information by the emulate experiments.
出处 《计算机应用研究》 CSCD 北大核心 2007年第2期318-320,共3页 Application Research of Computers
关键词 对等网络 查询 DDI算法 有用性 P2P Query DDI Algorithm Availability
  • 相关文献

参考文献5

  • 1Taizo Yamada,Kenro Aihara,et al.A Distributed Index System for Efficient Query Processing in Peer-to-Peer Networks[J].IEEE,2003,(3):139-142.
  • 2Stoica I,Morris R,Karger D,et al.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[C].San Diego,CA:Proc.of SIGCOMM 2001 ACM,ACM Press,2001.149-160.
  • 3Rowstron A,Druschel P.Pastry Scalable Distributed Objection Location and Routing for Large-scale Peer-to-Peer Systems[C].Germany:Proc.of Middleware,Heidelberg,Spring,2001.329-350.
  • 4Ratnasamy S,Francis P,Handley M,et al.A Scalable Content-Addressable Network[C].San Diego,CA:Proc.of the SIGCOMM 2001 ACM,ACM Press,2001.161-172.
  • 5蔡明,谢振平.一种改良的CAN查询策略[J].计算机应用研究,2005,22(7):81-83. 被引量:3

二级参考文献7

  • 1Ratnasamy S, Francis P, Handley M, et al. A Scalable Content-Addressable Network[C]. Proc. of SIGCOMM 2001 ACM, San Diego,CA: ACM Press, 2001. 161-172.
  • 2Stoica I, Morris R, Karger D, et al. Chord: A Scalable Peer-to-Peer-Lookup Service for Internet Applications [C]. Proc. of SIGCOMM 2001 ACM, San Diego, CA: ACM Press, 2001. 149-160.
  • 3Rowstron A, Druschel P. Pastry Scalable Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems[C]. Proc. Middleware, Heidelberg, Germany: Springer, 2001.329-350.
  • 4Castro M, Drusehel P, Charlie Y,et al. Exploiting Network Proximity in Distributed Hash Tables [C]. Prec. of Int. Workshop on Future Directions in Distributed Computing, Bologna, Italy: Springer-Verlag,2002. 60-63.
  • 5Ratnasamy S Handley M, Karp R,et al. Topologically Aware Overlay Construction and Server Selection [C]. Proceedings of IEEE INFO-COM' 02, New York, NY : IEEE, 2002.1190-1199.
  • 6K Gummadi, R Gummadi, S Gribble, et al. The Impact of DHT Routing Geometry on Resilience and Proximity[C]. Proc. ACM SIGCOMM, Karlsruhe, Germany : ACM Press, 2003. 381-394.
  • 7Maymounkov P, Mazieres D, Kademlia A. Peer-to-Peer Information System Based on the XOR Metric [C]. IPTPS'02 Boston, MA. Heidelberg: Springer-Verlag, 2002.53-65.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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