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

一种改良的CAN查询策略 被引量：3

An Improved Query Strategy of Content-addressable Network
下载PDF
导出
摘要 CAN为一种具有可扩张性、失效恢复能力、完全自组织的一种P2P实现。但是由于其路由表的构造缺乏灵活性,结合物理拓扑的实现能力较弱。通过引入对其路由表及路由策略的改进,使之具有结合物理拓扑的实现能力,进而可以降低节点间通信的延时。 The CAN is scalable, fault-tolerant and completely self-organizing. Topology-aware construction wil l not be realized because of its route table's not flexible. According to expanding the routing strategy and the route table's construction method, we can satisfyingly enhance this ability and reduce the delay of peer's communication.
作者 蔡明 谢振平
机构地区 江南大学信息工程学院
出处 《计算机应用研究》 CSCD 北大核心 2005年第7期81-83,共3页 Application Research of Computers
关键词 P2P CAN 拓扑已知 P2P CAN Topology-aware
分类号 TP311.52 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献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.

同被引文献16

  • 1齐庆虎,李津生,洪佩琳,孙卫强.内容寻址网络中内容的有效定位[J].电路与系统学报,2004,9(5):67-71. 被引量：2
  • 2李运娣,冯勇.基于DHT的P2P搜索定位技术研究[J].计算机应用研究,2006,23(10):226-228. 被引量：19
  • 3石伟兴,林浒,雷为民.SIP PASTRY的设计与实现[J].小型微型计算机系统,2006,27(11):2012-2015. 被引量：2
  • 4Taizo Yamada,Kenro Aihara,et al.A Distributed Index System for Efficient Query Processing in Peer-to-Peer Networks[J].IEEE,2003,(3):139-142.
  • 5Stoica 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.
  • 6Rowstron 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.
  • 7Ratnasamy 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.
  • 8Ion Stoica,Robert Morris,David Karger,M.Frans Kaashoek,Hari Balakrishnan.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[EB/01].http://pdos.csail.mit.edu/papers/Chord:sigcomm01/Chord_sigcomm.pdf.
  • 9SHERMANA,LISIECKI P A, BERKEIMER A, et al. ACMS: Theakamai configuration management system[ C]//the 2nd Symposium onNetworked Systems Design & Implementation, Boston : USENIX,2005 :245 -258.
  • 10ZHANGR, HU Y C. Borg: A hybrid protocol for scalable application-level multicast in peer - to - peer networks [ C ] //Proc of Nossdav,New york,USA:ACM,2003:172 -179.

引证文献3

二级引证文献1

计算机应用研究
2005年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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