摘要
在分析Web服务与现有Web服务组合算法特点的基础上,提出元Web服务概念和分布式Web服务组合算法.借助元Web服务,该算法能够直接为服务请求与分布组合节点之间建立有效地索引机制,最大限度地降低无效服务可组合性分析次数,提高了服务组合效率.另外,该算法是完全透明于各分布结点的具体服务组合算法,现有服务组合算法能够有效地实现与该算法集成.与传统集中式服务组合算法相比,该算法将各分布服务组合结点映射成一个普通的Web服务,从而有效地降低了算法设计复杂度和执行复杂度.实验验证了该算法能够有效地提高Web服务组合效率.
After analyzing the nature and composition of Web service, the concept of meta Web services and distributed web services composition algorithm are proposed. By virtue of meta Web services, this algorithm can offer effective index mechanism between request and distributed composition serv- er, degrade the analyzing times of invalid Web services composition and improve the efficiency of Web service composition. In addition, this algorithm is transparent to traditional centralized algorithm in all distributed server, so it is very effective integrate between these two. Comparing with current works, the algorithm maps all distributed composition server as a traditional Web service, which effectively decrease the complexity of algorithm. Finally, this paper validates the efficiency of this algorithm in improving the performance of Web services composition based on pointed experiments.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2010年第10期18-21,30,共5页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家自然科学基金资助项目(60573101)
关键词
WEB服务
WEB服务组合
组合算法
分布式算法
面向服务架构
Web services
Web services composition
composition algorithm
distributed algorithm
service-oriented architecture
