Abstract
In distributed, service-oriented systems, in which several concrete service instances need to be composed in order to respond to a request, it is important to select service deployments in an optimal and efficient way. Quality of Service attributes of deployments and network links are taken into account to decide between workflows that are identical in terms of their functionality. Several heuristic approaches have been proposed to solve the resulting QoS-aware service selection problem, known to be NP-hard. In our previous work, motivated by two concrete application scenarios, we proposed a blackboard and a genetic algorithm and compared them in terms of solution quality, performance and scalability. In order to seamlessly run and evaluate further approaches and parallel versions of the current algorithms in a distributed environment, a general framework for service selection optimization has been implemented using Cloud Computing resources. A performance study on sequential and parallel blackboard and genetic algorithms for solving service selection problems has been carried out in the Cloud.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
