Computing Maximum Task Execution Times — A Graph-BasedApproach
Real-Time Systems
Data Networks, Routing, Security, and Performance Optimization
Data Networks, Routing, Security, and Performance Optimization
Workflow management with service quality guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
IEEE Internet Computing
Distributed and Parallel Databases
Modeling and Evaluation of Distributed Workflow Algorithms
ISAS-SCI '01 Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics: Information Systems Development-Volume I - Volume I
A model for web services discovery with QoS
ACM SIGecom Exchanges
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Service Selection Algorithms for Web Services with End-to-End QoS Constraints
CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
QoS Aggregation for Web Service Composition using Workflow Patterns
EDOC '04 Proceedings of the Enterprise Distributed Object Computing Conference, Eighth IEEE International
Design and Evaluation of an Autonomic Workflow Engine
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
QoS-Aware Composition of Web Services: A Look at Selection Algorithms
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Model-driven methodology for building QoS-optimised web service compositions
DAIS'05 Proceedings of the 5th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Predicting service request rates for adaptive resource allocation in SOA
Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation
An Adaptive Heuristic Approach to Service Selection Problems in Dynamic Distributed Systems
GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
| Hi-index | 0.00 |
This paper discusses a combinatorial problem about the selection of candidates for Web service compositions. The problem occurs if we assume that a discovery process has identified several candidates for each task of a composition and if the selection must consider multiple criteria. We anticipate to use quality-of-service (QoS) categories as selection criteria and thus the problem is about optimising the QoS of compositions at their planning-phase. This paper will explain this problem and propose different heuristics as possible solutions. Based on a software simulation a performance evaluation of these heuristics is given.