Error recovery in asynchronous systems
IEEE Transactions on Software Engineering
Software safety in embedded computer systems
Communications of the ACM
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A meta modelng approach to workflow management systems supporting exception handling
Information Systems - Special issue on meta-modelling and methodology engineering
Exception Handling in Workflow Management Systems
IEEE Transactions on Software Engineering - special section on current trends in exception handling—part II
Exception handling: issues and a proposed notation
Communications of the ACM
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Enhancing the Fault Tolerance of Workflow Management Systems
IEEE Concurrency
Improving Backward Recovery in Workflow Systems
DASFAA '01 Proceedings of the 7th International Conference on Database Systems for Advanced Applications
Enterprise Integration Patterns: Designing, Building, and Deploying Messaging Solutions
Enterprise Integration Patterns: Designing, Building, and Deploying Messaging Solutions
Software Ecosystem: Understanding an Indispensable Technology and Industry
Software Ecosystem: Understanding an Indispensable Technology and Industry
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
Policy-Driven Exception-Management for Composite Web Services
CEC '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology
MonitoringWeb Service Networks in a Model-based Approach
ECOWS '05 Proceedings of the Third European Conference on Web Services
Automated Online Monitoring of Distributed Applications through External Monitors
IEEE Transactions on Dependable and Secure Computing
Recovery Policies for Enhancing Web Services Reliability
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Path-based faliure and evolution management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Stateful Detection in High Throughput Distributed Systems
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
A Fault Tolerance Approach for Enterprise Applications
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 2
An Integrated Approach for the Run-Time Monitoring of BPEL Orchestrations
ServiceWave '08 Proceedings of the 1st European Conference on Towards a Service-Based Internet
How to keep your head above water while detecting errors
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Fault-tolerant orchestration of transactional web services
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Designs of Bisimilar Petri Net Controllers With Fault Tolerance Capabilities
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Enterprise Application Integration (EAI) solutions comprise a set of specific-purpose processes that implement exogenous message workflows. The goal is to keep a number of applications' data in synchrony or to develop new functionality on top of them. Such solutions are prone to errors because they are highly distributed and usually involve applications that were not designed with integration concerns in mind. This has motivated many authors to work on provisioning EAI solutions with fault-tolerance capabilities. In this article we analyse EAI solutions from two orthogonal perspectives: viewpoint (orchestration versus choreography) and execution model (process- versus task-based model). A review of the literature shows that current proposals are bound to a specific viewpoint or execution model or have important limitations. To address the problem, we have devised an error monitor that can be used to provision EAI solutions with fault-tolerance capabilities. Our theoretical analysis proves that the algorithms we use are computationally tractable, and our experimental results prove that they are efficient enough to be used in situations in which the workload is very high.