基于语义查询的P2P路由模型研究  

Research on P2P routing model based on semantic query

作　　者：麦晋[1] 董健全[1] 

机构地区：[1]上海大学计算机工程与科学学院,上海200072

出　　处：《计算机工程与设计》2009年第18期4146-4150,共5页Computer Engineering and Design

基　　金：上海市重点学科建设基金项目(J50103)

摘　　要：针对结构化P2P网络路由模型中存在难以有效支持内容定位的问题,提出基于语义查询的P2P路由模型。利用概念向量来描述文档、节点、簇和查询请求;通过节点概念向量间的相似度聚成不同层次的语义簇,并采用基于概念相似度计算进行路由选取和转发的路由策略;利用节点的异构性,让性能好的超级节点承担更多的工作量,并引入服务节点便于快速导航语义簇中的语义类别。实验结果表明,该路由模型能有效提高系统的搜索效率。A fundamental problem that structured P2P routing model is how to efficiently locate the node according to the content of their resources. P2P routing model based on semantic query is proposed, and concept vectors is applied to describe documents, peers, clusters and queries. The peers that reposit similar documents are clustered into different levels of semantic clusters according to the similarities of peer concept vectors. It adopts concept similarity calculating to select and transmit routing policy, makes the heterogeneity of peers, chooses peers with great capability to take more work in routing, and introduces service peers to quickly navigate semantic category in semantic clusters. Experimental results show that the routing model effectively improves the efficiency of search.

关 键 词：P2P 概念向量 概念相似度 语义簇 路由 

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