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

内容寻址网络中内容的有效定位 被引量：2

Efficient Content Location of Content Addressable Network
下载PDF
导出
摘要 P2P(Peer-to-Peer)的最基本的问题是如何高效地查找到存放文件的节点。本文提出在保持内容寻址网络(Content Addressable Network:CAN)现有特性的基础上建立一种更快捷有效的内容定位结构:基于快捷链接和最小距离的内容定位。本文首先介绍了内容寻址网络的基本工作原理,然后详细描述了基于快捷链接和最小距离进行内容定位的方法,并通过仿真证实了该方法很大程度上改善了 CAN 的性能。 A fundamental problem that confronts P2P (Peer-to-Peer) application is to efficiently locate the node that stores a particular data item. In order to solve the problem, an efficient content location method using fast link and minimum distance is proposed in this paper. At the beginning, basic architecture and the principle of CAN are introduced, then above content location method is elucidated in detail. At last, results of simulation are given.
作者 齐庆虎 李津生 洪佩琳 孙卫强
机构地区 中国科学技术大学电子工程与信息科学系
出处 《电路与系统学报》 CSCD 2004年第5期67-71,共5页 Journal of Circuits and Systems
基金 国家自然科学基金资助项目(90104011)
关键词 P2P 内容寻址网络 最小距离 快捷链接 P2P CAN minimum distance fast link
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献8

  • 1Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [A]. IFIP/ACM International Conference on Distributed Systems Platforms (Middle_ware) [C]. 2001.
  • 2Gnutella [OL]. http://gnutella.wego.com.
  • 3Rathasamy Sylvia, Francis Paul, et al. A Scalable Content-Addressable Network [S]. ACM SIG COMM'01, 2001.61.
  • 4Ratnasamy Sylvia Paul. A Scalable Content-Addressable Network. A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science [D]. Graduate Division of the University of California at Berkely, Fall 2002.
  • 5Rathasamy S, Francis P, Handley M, Karp R, Shenker S. A Scalable Content-Addressable Network [R]. ICSI Technical Report, 2001-01.
  • 6ROWSTRON A, DRUSCHEL P. Pastry: Scalable, distributed objectlocation and routing for large-scale peer-to-peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms (Middle ware 2001) [C]. 2001-11. 329-350.
  • 7Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications [A]. Proceedings ACM Sig Comm 2001 [C]. San Diego, CA, 2001-08.
  • 8Tang Chunqiang, Xu Zhichen, Dwarkadas Sandhya. Peer-to-Peer Information Retrieval Using Self-organizing Semantic Overlay Networks [S]. ACM SIGCOMM'03, 2003.

同被引文献19

  • 1蔡明,谢振平.一种改良的CAN查询策略[J].计算机应用研究,2005,22(7):81-83. 被引量：3
  • 2Jordi Pujol Ahullo, Marc Sanchez Artigas, Pedro Garcia Lopez. PlazetSim User and developer tutorial [ EB/ OL]. [2008 - 10 - 20]. http://ants, etse. urv. es/ planetsim.
  • 3RATHASAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network [ C ]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY: ACM, 2001:161 -172.
  • 4STOICA l, MORRIS R, KARGER D, et al. Chord: A scalable peer-to-peer lookup service for internet applications[ C]//Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY: ACM, 2001 : 149 - 160.
  • 5MAYMOUNKOV P, MAZIERES D. Kademlia: A peer- to-peer infmTnation system based on the XOR metric [ C ]//Revised Papers from the First International Workshop on Peer-to-Peer Systems. London, UK : Springer-Verlag, 2002 : 53 - 65.
  • 6NICHOLAS J A, HARVEY N, JONES M B, et al. SkipNet: A scalable overlay network with practical locality properties [ C ]//Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems. Berkeley, CA: USENIX Association, 2003: 29 - 38.
  • 7REN S S, GUO L, JIANG S, et al. SAT-match: A self- adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks [ C]//Proceedings of the 18th International Parallel and Distributed Processing Symposimn. New York: IEEE Press, 2004 : 83 - 91.
  • 8RATNASAMY S, STOICA I, SHENKER S. Routing algorithms for DHTs : Some open questions [ C ]//Revised Papers from the First International Workshop on Peer-to- Peer Systems. London, UK : Springer-Verlag, 2002 45 - 52.
  • 9ROWSTRON A, DRUSCHEL P. Pastry: Scalable, distributed object location and routing for large scale peer- to-peer systems [ C ]//Proceedings of the 18th IFIP/ ACM International Conference on Distributed System Platforms. New York : IEEE, 2001 : 329 - 350.
  • 10ZHAO B Y, KUBIATOWICZ J D, JOSE A D. Tapestry: An Infrastructure for Fault-tolerant Wide-area Loca- tion and Routing[ D]. Berkeley, CA: University of California at Berkeley, 2001.

引证文献2

二级引证文献1

电路与系统学报
2004年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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