Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
Application service placement in stochastic grid environments using learning and ant-based methods
Multiagent and Grid Systems - Special Issue on Nature inspired systems for parallel, asynchronous and decentralised environments
A heuristic approach to optimal service selection in service oriented architectures
WOSP '08 Proceedings of the 7th international workshop on Software and performance
Energy-Aware Design of Service-Based Applications
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
On optimal service selection in Service Oriented Architectures
Performance Evaluation
The Knowledge Engineering Review
Adaptation of service-based applications based on process quality factor analysis
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
SENECA – simulation of algorithms for the selection of web services for compositions
TES'05 Proceedings of the 6th international conference on Technologies for E-Services
End-to-end reliability of service oriented applications
Information Systems Frontiers
International Journal of Web Services Research
Task model-driven realization of interactive application functionality through services
ACM Transactions on Interactive Intelligent Systems (TiiS)
Hi-index | 0.00 |
When a composition of Web services is designed, available services are put together to form a defined flow of executions. In a discovery process, a trader proposes available Web services as potential candidates. In a succeeding selection, for each task a trader chooses one candidate to form the optimal composition due to selection criteria. This paper discusses how the selection can consider different Quality-of-Service (QoS) categories to determine the mostsuitable candidates for the composition. If more than one categoryis used for optimisation, a multi-dimensional optimisation problemarises. This mentions similarities to similar combinatorial problems.Then, possible solutions are proposed and their performance isevaluated.