A New Algorithm for Selecting the Combination of Services based on Quality of Service Attribute and knapsack problem in Service-oriented Architecture
A New Algorithm for Selecting the Combination of Services based on Quality of Service Attribute and knapsack problem in Service-oriented Architecture
Aalia Hemmati1 Sima Emadi2
1) Iran, Islamic Azad university of Meybod Email:
2) Iran, Islamic Azad university of yazd Email:
IOI Code
:
XYCC-ABHGH
Publication :
International Conference on Science and Engineering(icesconf.com)
Abstract :
The need for combining web services is the result of complex and increasing needs of users and incapability of atomic web services in terms of removing user goals. One of the most important challenges in web services is the selection and composition of web services based on their quality features. In this research, for finding the optimum composition of services, local and global strategies were used. This algorithm first deleted the services with the low rate of combining (local -strategy) and then found the best composition from among the remaining ones based on qualitative parameters. The proposed algorithm in local strategies selected the services that had a higher rate of combining than the threshold and the global strategy used the 0_1 knapsack algorithm for the purpose of optimizing the compound service. Implementations and analysis showed that the proposed algorithm guaranteed the presentation of optimum compound service from users view. Also, results of the analysis demonstrated the optimization of local and global algorithms in compared with the existing manners.
Keywords : web service selection service composition global and local strategy knapsack problem 0 1