期刊文献+

一种基于本地聚类的P2P资源查找算法

Peer-to-peer resources search algorithm based on local clustering
下载PDF
导出
摘要 资源检索是P2P系统研究的热点之一,非结构化P2P资源查找普遍采用泛洪机制。随着查询请求的增加,消息数量呈指数增长,网络拥塞和带宽浪费严重,查询效率得不到保障。针对这一问题,给出了一种基于本地聚类的非结构化P2P资源查找算法。通过对资源特征向量的本地K-means聚类和相似链接的建立,有效地提高了资源检索效率,避免了查询消息的扩散对网络带宽的浪费。实验表明,该方法能有效缩短资源的平均检索长度,提高查找成功率。 Resources search has become a hot research issue in peer-to-peer (P2P) systems. In most unstructured P2P systems with flooding mechanism, with exponential growth of the number of messages, serious network congestion and waste of bandwidth result in low efficiency of resources search. This paper proposed an unstructured P2P resources search algorithm based on local clustering ( LC algorithm) , in which peers performed K-means clustering on local resources separately and then built similar-links between peers that own similar clusters. It avoided the waste of network bandwidth derives from the spread of searching messages and improved the performance of resources search. Experimental results demonstrate that this algorithm effectively shortens the average searching length and gets high success rate.
作者 苏茜 张学杰
出处 《计算机应用研究》 CSCD 北大核心 2009年第7期2508-2512,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(60573104)
关键词 对等系统 资源查找 聚类 peer-to-peer(P2P) systems resources search clustering
  • 相关文献

参考文献19

  • 1POUWELSE J, GARBACKI P, WANG J, et al. Tribler:a socialbased peer-to-peer system [ J ]. Concurrency and Computation: Practice and Experience, 2008, 20(2) : 127-138.
  • 2GAO Wen, HUO Long-she. Challenges on peer-to-peer live media streaming[ C]//Proc of MCAM. Berlin: Springer-Verlag, 2007:37- 41.
  • 3STOICA I, MORRIS R, KARGER D, et al. Chord: a scalable peer- to-peer lookup service for Intemet applications [ C ]//Proo of the ACM SIGCOMM 2001. New York: ACM Press, 2001 : 149- 160.
  • 4RATNASAMY S, FRANCIS P, HANDLEY M, et al. A scalable content-addressable network[ C]//Proc of the ACM SIGCOMM 2001. New York: ACM Press, 2001 : 161- 172.
  • 5ZHAO B Y, KUBIATOWICZ J, JOSEPH A D. Tapestry:an infrastructure for fault-tolerant wide-area location and routing, UCB/CSD- 01-1141 [ R ]. Berkely : University of California, 2001.
  • 6ROWSTRON A, DRUSCHEL P. Pastry : scalable, distributed object location and routing for large-scale peer-to-peer systems [ C ]//Proc of the 18th IFIP/ACM International Conference on Distributed Systems Platforms( Middleware 2001 ). Heidelberg: Springer-Verlag, 2001 : 329- 350.
  • 7RIEANU M. Peer-to-peer architecture case study: Gnutella network, TR-2001-26[ R]. Chicago: University of Chicago, 2001.
  • 8CLARK I, SANDBERG O, WILEY B, et al. Freenet: a distributed anonymous information storage and retrieval system [ C ]//Proc of ICSI Workshop on Design Issues in Anonymity and Unobservability. Berkeley : Springer, 2001:46 - 66.
  • 9MOY J. RFC 2328,. OSPF version 2[ S]. 1998.
  • 10REN Yi, SHA Chao-feng, QIAN Wei-ning, et al. Explore the small world phenomena in pure P2P information sharing systems[ C]//Proc of the 3rd Internatignal Symposium on Cluster Computing and the Grid. Washington : IEEE Computer Society, 2003 : 232- 239.

二级参考文献17

  • 1Napster. 2003. http://www.napster.com
  • 2Daswani N, Garcia-Molina H, Yang B. Open problems in data-sharing peer-to-peer systems. In: Calvanese D, Lenzerini M,Motwani R, eds. Proc. of the 9th Int'l Conf. on Database Theory (ICDT). Heidelberg: Springer-Verlag, 2003.1~15.
  • 3Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report,UCB/CSD-01-1141, Computer Science Division, U.C. Berkeley, 2001.
  • 4Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In:Guerraoui R, ed. Proc. of the Middleware 2001. Heidelberg: Springer-Verlag, 2001. 329~350.
  • 5Ramasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Govindan R, ed. Proc. of the ACM SIGCOMM 2001. ACM Press, 2001. 161-172.
  • 6Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Govindan, ed. Proc. of the ACM SIGCOMM 2001. ACM Press, 2001. 149-160.
  • 7Gnutella. 2003. http://gnutella.wego.com
  • 8Clarke I, Sandberg O, Wiley B, Hong TW. Freenet: A distributed anonymous information storage and retrieval system. In:Faderrath H, ed. Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability. Berkeley: Int'l Computer Science Institute
  • 9Yang B, Garcia-Molina H. Improving search in peer-to-peer networks. In: Sivilotti PAG, ed. Proc. of the Int'l Conf. on Distributed Computing Systems. IEEE Computer Society, 2002. 5-14.
  • 10Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I. Looking up data in p2p systems. Communications of the ACM, 2003,46(2):43-48.

共引文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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