一种基于A*算法的Web Services动态组合策略
Dynamic Web Services Composition Strategy Based on A-Star Algorithm
-
摘要: 随着Web Services应用的发展, 服务的动态组合技术为解决信息共享和应用协作的问题带来了新的方案, 然而生成适应符合客户Qos需求的组合方案是耗时的优化问题.文中通过构建Qos驱动的服务组合依赖图模型, 提出了基于A*算法的启发式的最佳路径组合方法.该算法适用于存在多输入的Web Services动态组合情况并能够生成具有最小代价的简单调用序列.实验表明, 该算法适用于多输入的Web Services动态组合情况, 并且具有较好的运行效率.Abstract: With the development of web services, the dynamic composition technique of web service provides a new solution to solve the problem of information sharing and the application cooperating.However, generating the composition plan to meet QoS requirement of client is a time-consuming optimization problem.To solve the problem in a timely manner, this paper presents a heuristic method based on A-star algorithm by modeling the Qos-drived dependency graph.The algorithm can be applied to the situation with multi-inputs to generate a simpler calling sequence with lowest cost.The experiment shows that our method has good efficiency.