Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
An approach for QoS-aware service composition based on genetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
QoS-Aware Replanning of Composite Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
High Performance Approach for Multi-QoS Constrained Web Services Selection
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
A journey to highly dynamic, self-adaptive service-based applications
Automated Software Engineering
Towards Data-Aware QoS-driven Adaptation for Service Orchestrations
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Efficient Multi-granularity Service Composition
ICWS '11 Proceedings of the 2011 IEEE International Conference on Web Services
Efficient Correlation-Aware Service Selection
ICWS '12 Proceedings of the 2012 IEEE 19th International Conference on Web Services
Hi-index | 0.00 |
Due to the highly dynamic nature of services (web services can enter or leave the system at any time, or change their characteristics), adaptation to change during service composition is necessary to meet user needs. Yet current approaches to change handling detect quality violations and service unavailability only after their occurrence (after executing the corresponding service), resulting in undesired situations at execution time from which recovery (usually through costly replanning) might not always be possible. In response, this paper presents a novel reactive selection algorithm, which adapts to changes in the environment efficiently while performing the selection, ensuring that the selected composite service is executable, satisfactory and optimal prior to execution. The algorithm's effectiveness is demonstrated via experimental results.