李琦, 夏阳, 束长军, 王磊. 一种基于与或关系的Web服务组合算法研究[J]. 微电子学与计算机, 2010, 27(8): 222-225.
引用本文: 李琦, 夏阳, 束长军, 王磊. 一种基于与或关系的Web服务组合算法研究[J]. 微电子学与计算机, 2010, 27(8): 222-225.
LI Qi, XIA Yang, SHU Zhang-jun, WANG Lei. An Algorithm Based on AND-OR Relationship for Web Services Composition[J]. Microelectronics & Computer, 2010, 27(8): 222-225.
Citation: LI Qi, XIA Yang, SHU Zhang-jun, WANG Lei. An Algorithm Based on AND-OR Relationship for Web Services Composition[J]. Microelectronics & Computer, 2010, 27(8): 222-225.

一种基于与或关系的Web服务组合算法研究

An Algorithm Based on AND-OR Relationship for Web Services Composition

  • 摘要: Web服务组合的有效性取决于实时的网络环境,若仅提供一种较优的Web服务组合结果,在组合失效时需要重新提出服务组合请求.采用基于与或关系的Web服务组合算法,在筛选和匹配相关服务的同时,逐步生成以与或形式描述多种组合结果的Web服务组合图.通过对图的访问,可获取尽可能多的组合结果.若一种组合不可用,可有条件地选择其他的组合替代,提高了服务组合的请求与生成的效率.通过一个实例演示了这种方法的有效性.

     

    Abstract: The effectiveness of Web service composition depends on the real-time network environment, but most of the current service composition method is to provide an optimal result of Web service composition. The composition will have to be requested again when the combination fails. While selecting and matching related Web services for a specific Web service request, the composition method based on AND-OR Relationship is used to gradually builds Web service composition map in the form of AND-OR relationship. By accessing the plan, the composition results can be obtained as much as possible. If one combination is not available, other combination can be conditionally selected as an alternative, which improves the efficiency of requesting and generating of service compositions. The effectiveness of this method is demonstrated by an example.

     

/

返回文章
返回