一种双层P2P结构的语义服务发现模型
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Basic Research Program of China under Grant No.2005CB321800 (国家重点基础研究发展计划(973)); the National Natural Science Foundation of China under Grant Nos.90412011, 60625203 (国家自然科学基金)


A Two Layered P2P Model for Semantic Service Discovery
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    在开放的Internet环境下,多本体共存是一种必然.同时,集中式的语义服务发现机制是整个面向服务计算的瓶颈,导致系统的可扩展性差.为了支持多本体共存并提高系统的可扩展性,提出一种双层P2P语义服务发现模型.该模型以本体社区为核心,将iVCE(Internet-based virtual computing environment)的核心概念集成到P2P模型中.基于该模型,提出一种分两个阶段、3个步骤的服务发现算法.除了在本体社区内以外,算法还可以实现跨社区的服务发现.在本体社区内,算法首先根据语义相似性选定相应的注册服务器,然后再利用逻辑推理来实施精确的服务匹配.而跨社区的服务发现则按照一定的策略实施.该模型适用于多本体共存的开放环境.实验结果表明,通过合理的参数配置,模型能在查全率和服务发现响应时间之间加以折衷,并取得较好的结果;另外,模型能够在不降低服务查全率的情况下降低注册服务节点的平均负载.

    Abstract:

    In open Internet environment, it is inevitable that multiple ontologies coexist. Centralized service discovery mechanism becomes the bottleneck of SOC (service oriented computing), which results in poor scalability of system. Aiming at solving these problems, a two layered P2P based model for semantic service discovery is proposed in this paper. The model is based on ontology community and integrates iVCE (Internet-based virtual computing environment) core concepts into a P2P model. Based on this model, a service discovery algorithm composed of two stages and three steps is proposed. It matches services across communities as well as within community. Within a community, algorithm locates registers holding service information with a high probability of satisfying a request firstly. Then it captures semantic matching between service advertisements and service requests by logical reasoning. Service discovery across communities occurs according to some policies. The model is suitable for opening environment with coexistent multiple ontologies. Experimental results show that given an appropriate setting, the model can make a tradeoff between recall and responding time. In addition, the model will release the mean load of registers efficiently while holding recall.

    参考文献
    相似文献
    引证文献
引用本文

刘志忠,王怀民,周斌.一种双层P2P结构的语义服务发现模型.软件学报,2007,18(8):1922-1932

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2007-03-01
  • 最后修改日期:2007-04-26
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号