基于本体的P2P网络资源搜索  

Ontology Based Matchmaking in P2P System

作　　者：姜旭[1] 蔡立志[1] 

机构地区：[1]上海市计算机软件评测重点实验室,上海200112

出　　处：《软件产业与工程》2011年第1期30-34,共5页

基　　金：国家863项目(2007AA010401)

摘　　要：集中式的网络资源本体解决了传统的基于资源属性的精确匹配方法的扩展性,但不适合具有分布式特性的P2P网络资源。本文提出了一种基于分布式本体的P2P网络资源匹配模型。在该模型中,全局本体由各个节点的独立的本地网络资源本体构成,网络资源匹配操作完全分布式地由节点自主控制,解决了集中式的网络资源本体的可扩展性问题,更适合P2P网络的资源匹配。Traditional keyword-based accurate matching in highly dynamic, heterogeneous P2P is less flexible and extendable. Resent research considered semantic connotation of resource in matchmaking, which makes the matching process more effective with nice flexibility. The shortcoming of such methods is that they all need maintain a centerlocated sharing otology. It＇s not suitable for decentralized P2P system. To address this problem, an ontology-based matchmaking model is presented, In this model, the global ontology is logically composed of local ontology. And the node could control the matching pattern, it＇s more extendable and flexible and suitable for P2P matchmaking.

关 键 词：本体 语义匹配 P2P CHORD 

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