Sky-MCSP-R: An Efficient Graph-Based Web Service Composition Approach
Pengjiao Sun, Pengcheng Zhang, Wenrui Li, Xuejun Guo, Jun Feng · 2013
Aiming at optimizing Web service composition which satisfies user's multiple QoS constraints, an efficient graph-based Web service composition approach, named Skyline improved Multi Constraint Shortest Path-Relax (Sky-MCSP-R), is proposed. Firstly, the approach selects Skyline services from candidate service spaces, thus it can construct the model of Web service composition directly on these high quality candidate services, reducing the whole number of nodes of the model. Secondly, the approach uses MCSP-K algorithm which uses over constraint mechanism to compose basic services, and reduces the constraint intensity so to make algorithm MCSP-K produce as many feasible solutions as possible. Thirdly, the approach uses Relax algorithm to optimize the solutions. Experimental results show that the approach improves the efficiency of Web service composition and keeps a high optimization rate, reducing no solution phenomenons. The results also indicate that our approach is superior to previous approaches.