摘要
提出了一种不依赖于服务关系图、可支持实体之间继承与组合关系、高效的自动服务组合方法。该方法首先标记出必要的可满足服务,然后从中挑选出部分服务直接生成组合路径,从而减少时空开销,避免循环搜索与重复搜索。为达到局部优化的目标,标记可满足服务时运用了贪婪策略。仿真实验表明,该方法具有良好的时间复杂度,能够适用于大规模的语义服务组合。
Web service composition is the key technology to achieve the service-oriented computing. However, the research on composition approach with high efficiency is still a critical challenge for semantic, large scale web services. Unlike traditional graph based methods, an effective approach is proposed for automatic service composition which does not depend on service dependency graph and can support for inheritance and composition relationships between entities. Firstly, it marks out necessary and satisfied services, and then selects parts of them to generate a composition path directly. It can reduce the time and space overhead, avoid circulation and repetition search. To achieve the goal of local optimization, greedy strategy is used to mark satisfied services. Experimental results show that this approach has a good level of time complexity and can be applied to large-scale semantic service composition.
出处
《桂林理工大学学报》
CAS
北大核心
2012年第2期271-275,共5页
Journal of Guilin University of Technology
基金
广西科学研究与技术开发计划项目(桂科攻10100002-2)
广西教育厅科研项目(201010LX171
200911LX131)
关键词
WEB服务
服务组合
局部优化
贪婪算法
web service
service composition
local optimization
greedy algorithm
