计算机应用与软件Issue(6)：30-33,65,5.DOI:10.3969/j.issn.1000-386x.2015.06.008
基于服务关系图的 Web 服务组合算法
WEB SERVICES COMPOSITION ALGORITHM BASED ON SERVICE RELATIONSHIP GRAPH
摘要
Abstract
Composite service modelling for QoS assurances becomes a key problem in Web services composition process.Therefore we propose a service relationships graph-based Web service composition algorithm.First,it constructs the service set into service relationships graph according to interface description of Web services so as to obtain the input/output dependence relation among Web services.At the same time,based on users’requests it formalises the service operation nodes and data nodes in the graph to AND nodes and OR nodes respectively,so that transforms the service relationship graph to AND/OR graph.Finally the search algorithm is applied to the AND/OR graph repeatedly until the composite service template with least cost meeting users requests is searched out.Through simulation experiment the performance of the search algorithm is evaluated in regard to both the service relationship graph and the users request under the condition of complexity variation,and the effectiveness of the algorithm is verified as well.关键词
Web 服务/Web 服务组合/服务关系图/与/或图/服务质量/算法Key words
Web service/Web service composition/Service relationships graph/AND/OR graph/Quality of service/Algorithm分类
信息技术与安全科学引用本文复制引用
袁玉倩,杨洁,薛桂香,于洋,阎刚..基于服务关系图的 Web 服务组合算法[J].计算机应用与软件,2015,(6):30-33,65,5.基金项目
河北省高等学校科学技术研究项目（Z2012164，QN20131118）。 （）
