Qos-aware selection of web service compositions using Harmony Search algorithm

Abstract

Extensive use of web services has lead to introduce web service compositions to execute business workfiows. Since several function equivalent services, provided by different service providers, may be available in the Web, the problem of selection of web service compositions arises. QoS aware selection means considering the quality of the service composition in choosing constituent services. So a method is needed for computing the quality of a composition and determining the composition with the (almost) best quality. The resulting composite has optimal quality and satisfies user's quality constraints. In this paper, the problem of QoS aware selection of web service composition is modeled as an optimization problem. Then a variation of Harmony Search algorithm is used to find a near optimal composition. Harmony Search is a recently developed optimization algorithm that mimics the improvisation process. The proposed method based on Harmony Search has been applied to a large variety of composition schemas, generated by a simulation software, and the results show that the proposed method works faster, compared with other approaches.