QoS decomposition for service composition using genetic algorithm
Applied Soft Computing
| Hi-index | 0.00 |
Web service composition is a flexible way for resource sharing and application integration. However, how to guarantee quality of service composition remains a challenging problem. This paper proposes a heuristic approach to optimizing service selection for composition so that the user’s QoS expectation is satisfied. Optimization is enforced for constraints in both local and global level. For each level, a mathematical model is established, and the corresponding heuristic algorithm to solve Web service selection problem by using convex hull frontiers method is proposed. Furthermore, Multiple Criteria Decision Making (MCDM) technique is applied to merge multiple dimensional resources in the heuristic algorithms. Finally, a case study demonstrates feasibility and efficiency of our method.