期刊文献+

Super-Peer网络中基于语义的分簇算法研究 被引量:1

Research of Semantic-based Clustering Algorithm for Super-peer Network
在线阅读 下载PDF
导出
摘要 在P2P网络中,利用共享数据的语义信息,将网络划分成不同的语义簇是提高网络查找性能、增强网络可扩展性的有效手段.然而现有的基于分类层次的语义分簇方法较少考虑簇之间的负载平衡问题,这必然会影响网络的性能.为此本文提出了两种针对分类层次语义空间的自组织语义分簇算法,即语义优先分簇算法SFCA和负载平衡优先分簇算法LBFCA,这两种算法能够根据网络的负载动态的将网络划分成不同的语义簇,并很好的保持了簇中数据的语义关系和簇之间的负载平衡.实验表明这两种分簇算法具有良好的性能和可扩展性. In a P2P network, partitioning the network into distinct semantic clusters can efficiently increase the efficiency of searching and enhance scalability of the network. However, existing semantic clustering approaches based on the taxonomy hierarchy take little account of load balancing problem among clusters, which inevitably compromise network performance. To solve the problem, two semantic-based self-organized algorithms aimed at taxonomy hierarchy semantic space are proposed in this paper :semantic first clustering algorithm (SFCA) and load balance first clustering algorithm (LBFCA),which can dynamically partition the network into distinct semantic clusters according to network loads, with semantic relationship among data in clusters and load balance among clusters all well maintained. The experiment indicates good performance and scalability of these two clustering algorithms.
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第2期213-218,共6页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60573089)资助 辽宁省自然科学基金项目(20052031)资助 国家"八六三"计划项目(2006AA09Z139)资助
关键词 P2P 语义分簇 分类层次 负载平衡 P2P semantic clustering taxonomy hierarchy load balance
作者简介 乔百友,男,1970年生,讲师,博士研究生,研究方向为P2P数据管理技术.E-mail:qiaobaiyou@ise.1ieu.edu.cn 王国仁,男,1966年生,教授,博士生导师,研究方向为数据库技术.
  • 相关文献

参考文献16

  • 1Gnutelliums LLC. Gnutella protocol specification version 0. 4 [EB/OL]. http ://www. limewire. com/developer/gnutella-protocol-0.4. pdf, 2004-02-18.
  • 2Clarke I,Sandberg O,Wiley B. Freenet:adistributed anonymous information storage and ret rleval system[C]. In:Proeeedings of t he ICSI Workshop on Design Issues in Anonymity and Un-observability, Berkeley, CA, 2000,46- 66.
  • 3Stolca I, Morris R ,Karger D,et al. Chord:a scalable peer-to-peer lookup service for internet applications[C]. In Proc. ACM SIGCOMM, August 2001.
  • 4Rowstron A, Druschel P. Pastry : scalable, distributed object location and routing for large-scale peer-to-peer systems [C]. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001 ), November 2001.
  • 5Ratnasamy S, Francis P, Hand ley M, et al. A scalable contentaddressable network [C]. In Proc. ACM SIGCOMM, August 2001.
  • 6Nejdl W,Wolf B,Qu C,et al. EDUTELLA: a P2P networking infrastructure based on RDF[C]. In WWW 11 Conference Proceedings, Hawaii, USA, May 2002.
  • 7KaZaA. http://www. kazaa. com.
  • 8Pireddu L,Nascimento M. Taxonomy-based routing indices for peer-to-peer networks[C]. In,Proceedings of the SIGIR Workshop on P2P IR. (2004).
  • 9Tempich C, Staab S, Wranik A. REMINDIN': semantic query routing in peer-to-peer networks based on social metaphors[C]. In: Proceedings of the 13th International Conference on World Wide Web (WWW'2004), 2004.
  • 10Bhattacharjee, et al. Efficient peer-to-peer searches using resultcaching[C]. In:Proceeding of the 2nd IPTPS. 2003.

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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