语义聚集的P2P服务组织模型  

P2P Organization Model for Service Clustering Based on Semantic Tree

作　　者：兰明敬[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《计算机科学》2013年第4期78-82,118,共6页Computer Science

基　　金：国家863计划项目(2009AA012417)资助

摘　　要：针对集中式和传统分布式服务注册与发现机制中存在的问题,提出一种新的服务组织模型。该模型归纳服务系统中各服务功能来建立语义树,依据此语义树产生的语义串对服务进行标识,采用改进的Kademlia算法将服务组织起来,形成按语义树聚集的、使用语义串进行结点发现的P2P覆盖网络,从而解决了单点失效、性能瓶颈问题,实现了不依赖注册中心和注册操作的、自发现的服务调用。它具有高可扩展性,能够支撑动态调度、模糊搜索等应用形式,已在某服务计算平台中成功应用,该平台已通过验收并连续运行近一年。Aiming at solving problems existing in centralized and traditional distributed service discovery mechanism,a new service organization model was proposed.It identifies service by semantic string that comes from a semantic tree based on services functions in the service system.With an improved algorithm based on Kademlia,the model organizes all the services to form a P2P overlay network in which nodes are gathered together according to the semantic tree and can be found using semantic strings.This model has solved the single point failure and bottleneck problem,can find and invoke service without service registry.It is highly scalable,and supports more high-level applications such as dynamic scheduling,fuzzy search.The approach has been successfully applied in a service computing platform,which has already been verified and well operating nearly a year.

关 键 词：P2P 服务发现 语义树 模糊搜索 

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