摘要
如何快速、准确和高效地发现满足用户需求的Web服务是现阶段急需解决的关键问题之一.文中针对现有的Web服务发现机制中存在的效率低下和查准率不高的两个问题,提出了一个新的语义Web服务发现框架.在该框架下,采用Petri网作为Web服务过程描述的形式化工具.首先,利用聚类技术,从服务的功能相似和过程相似两个层面对服务进行聚类预处理,从而在很大程度上降低服务的查找空间,提高服务的查找效率.进一步,针对服务请求中可能潜在的行为约束,建立基于Petri网的过程需求模型,将其与候选服务的过程模型进行比较,对满足功能需求的可行服务进一步筛选,从而提高查找的精确度.最后,利用仿真实验对所提出的方法进行验证.
The discovery of suitable Web services for a given user requirement is one of the central operations in Service-oriented Architectures. With the popularization of Web services, researches on minimizing the discovery duration and improving precision ration are getting more important. This paper proposes a mechanism to support semantic Web service discovery. Petri net is adopted as a modeling language for the specification of service process model. On the one hand, the methodology of service clustering groups similar services according to the functional similarity and process similarity. The utilization of service clustering can potentially enable service matchmaker to significantly reduce the overhead, deploy the discovery of candidate services quickly. On the other hand, for a service request, a service matchmaker compares the functionality compatibility and process consistency with the candidate services. It is an extension of previous functionality-driving service matchmaking approaches, thus leading to more accurate matchmaking. In the end, some simulation results are demonstrated to show the effectiveness of the proposed method.
出处
《计算机学报》
EI
CSCD
北大核心
2008年第8期1340-1353,共14页
Chinese Journal of Computers
基金
国家“八六三”高技术研究发展计划项目“可靠的服务组合方法及其验证技术研究”(2007AA01Z136)
国家“九七三”重点基础研究发展规划项目“语义网格的过程语义及其验证理论与服务集成技术”(2003CB316902)资助~~
关键词
服务发现
匹配
过程模型
PETRI网
聚类
service discovery
matchmaking
process model
Petri net
clustering
