一种在Web服务合成中的最佳选择算法

AN ALGORITHM FOR BEST SELECTION IN SEMANTIC COMPOSITION OF WEB SERVICE

Web 服务的自动交互能让应用间的协作更加有效,但目前的 Web 服务合成技术仍需要许多手工操作,这将耗费不少时间。本文提出了一个最佳选择方法,能在服务合成过程中选择出最适当的服务。最佳选择算法基于 Dijkstra 算法,能根据给定的选择策略选择最适当的服务并配置到合成结果中。实验证明,算法虽然比不使用选择策略的算法花销时间稍多,但它能选出最佳的合成方案。

The automation of Web Services interoperation can bring considerable advantages to effective collaboration of applications. However,the state-of-the-art techniques for Web Services composition may still require a lot of manual efforts and thus is often time consuming. This paper proposes a method for best selection which can perform the most appropriate selection in composition process. An algorithm for best selection is developed which is derived from Dijkstra＇s algorithm. Given a selection policy such as minimum cost, the algorithm can find the most appropriate service and employ it in composition result. Experiments show that the algorithm proposed in this paper sometimes only takes a little more time than that without selection policy to select the best composition plan.