A greedy approach for service composition

Nowadays, service oriented architecture provides a scalable framework for service composition. Today´s systems are tending to be large scaled, such as cloud workflows; in such systems, service composition algorithms play a critical role in composing multi-provider services by considering user desirable quality of services so as to fulfill business workflows. In this paper, we propose a greedy approach for mapping workflows to composed services considering all flow structures, such as joint, fork, loop and sequence, which are specified in workflow templates with various QoS parameters. We compare the presented approach with an ant colony optimization approach to show its performance and validity.