IEEE Intelligent Systems
QoS-Aware Replanning of Composite Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Exception Handling and Recovery of Semantic Web Services
ICNS '08 Proceedings of the Fourth International Conference on Networking and Services
A framework for QoS-aware binding and re-binding of composite web services
Journal of Systems and Software
Recovery mechanisms for semantic web services
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services
IEEE Transactions on Services Computing
Service Oriented Computing and Applications
OSIRIS Next: Flexible Semantic Failure Handling for Composite Web Service Execution
ICSC '10 Proceedings of the 2010 IEEE Fourth International Conference on Semantic Computing
Adaptation of service-based systems
Service research challenges and solutions for the future internet
Towards Functional Dynamic Reconfiguration for Service-Based Applications
SERVICES '11 Proceedings of the 2011 IEEE World Congress on Services
Dynamic recovery decision during composite web services execution
Proceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems
An automatic subdigraph renovation plan for failure recovery of composite semantic Web services
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Composite Web services are self-evidently failure-prone. A recovery process is required to survive the execution flow. We propose a method to recover a composite service from a failure. The method replaces a subdigraph of a composite service with its semantically similar one. Our work is motivated by a marked trade-off of multiple needs, i.e. to increase the replacement probability in a minimum delay, a high accuracy and yet no compromise in quality of service. To address the issues, we 1) broaden the subdigraph elimination starting point to even well-executed world-altering services, 2) calculate the prerequisites in an offline phase, and 3) rank the candidate replacements. Our preliminary result shows the efficiency of our method.