一种基于语义的super-peer网络构建方法  

An Approach to Framing the Semantics-Based Super-Peer Networks

作　　者：乔百友[1] 王国仁[1] 邢云龙[1] 王彩荣[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2008年第1期61-64,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(60473074;60573089);国家高技术研究发展计划项目(2006AA09Z139)

摘　　要：针对分类层次语义空间,提出了一种基于语义的super-peer网络构建方法.该方法根据peer上数据的语义信息,动态地将peer聚簇成不同的语义簇,语义簇之间建立适当的语义路由关系.每个语义簇由一个super-peer节点和一组peer节点组成,仅负责回答其语义子空间上的查询.查询首先根据其语义被路由到适合的语义簇中,然后被转发给包含结果的peer.实验结果表明,该方法在查找性能和开销之间取得了一个良好的平衡,具有较高的查找性能和较低的查找代价,提高了网络的可扩展性.An approach to framing the semantics-based super-peer networks is proposed aiming at the data semantic space consisting of taxonomic hierarchies. The approach can dynamically group peers into many semantic clusters based on their individual semantics of data object. Then, the semantic clusters are organized into a semantic overlay network with appropriate routing relations established between them. Each and every semantic cluster consists of a super-peer and a set of peer nodes, and only responsible for answering queries in its semantic sub-space. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, then forwarded to the specific peers that hold the relevant data objects. Experimental results indicated that the approach achieves a competitive trade-off between search efficiency and cost, thus offering higher search performance and lower search cost to enhance the network scalability.

关 键 词：SUPER-PEER 分类层次 语义查找 路由算法 语义簇 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]