Web service selection algorithm for dynamic service composition using LSLO approach

Web service selection among a collection of functionally identical Web services for runtime service composition is a challenging issue. In this paper, a local selection and local optimization approach for Web service selection based on linear programming is proposed. This approach formulates the problem of selecting best candidate Web service from each service class as an assignment problem of linear programming. The approach uses a heap data structure to place the services in an appropriate order for composition based on the highest quality score. The proposed approach can help in improving the composition time, quality of the generated composite Web service and the transmission delay by forwarding only a few numbers of selected services to the composer.