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

发布时间：2018-05-11 20:26

本文选题：PP + 服务发现　；参考：《计算机科学》2013年04期

【摘要】：针对集中式和传统分布式服务注册与发现机制中存在的问题,提出一种新的服务组织模型。该模型归纳服务系统中各服务功能来建立语义树,依据此语义树产生的语义串对服务进行标识,采用改进的Kademlia算法将服务组织起来,形成按语义树聚集的、使用语义串进行结点发现的P2P覆盖网络,从而解决了单点失效、性能瓶颈问题,实现了不依赖注册中心和注册操作的、自发现的服务调用。它具有高可扩展性,能够支撑动态调度、模糊搜索等应用形式,已在某服务计算平台中成功应用,该平台已通过验收并连续运行近一年。
[Abstract]:Aiming at the problems in centralized and traditional distributed service registration and discovery mechanisms, a new service organization model is proposed. The model induces the service functions in the service system to establish the semantic tree, identifies the service according to the semantic string generated by the semantic tree, and uses the improved Kademlia algorithm to organize the service to form the semantic tree aggregation. P2P overlay network with semantic string is used for node discovery, which solves the single point failure and performance bottleneck problems, and realizes the self-discovery service invocation which does not depend on registry and registration operation. It has high scalability and can support dynamic scheduling, fuzzy search and other application forms. It has been successfully applied in a service computing platform. The platform has passed acceptance and run for nearly a year.
【作者单位】：解放军信息工程大学信息工程学院;
【基金】：国家863计划项目(2009AA012417)资助
【分类号】：TP393.02

【参考文献】