QoS-Aware Replanning of Composite Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
WS-replication: a framework for highly available web services
Proceedings of the 15th international conference on World Wide Web
Towards an Approach forWeb services Substitution
IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
An environment for flexible advanced compensations of Web service transactions
ACM Transactions on the Web (TWEB)
Deploying and managing Web services: issues, solutions, and directions
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed Management of Concurrent Web Service Transactions
IEEE Transactions on Services Computing
An Efficient Service Substitution Algorithm Based on Temporal Composite Behavior Graph
WISA '09 Proceedings of the 2009 Sixth Web Information Systems and Applications Conference
FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services
IEEE Transactions on Services Computing
Rule-Based Coordination of Distributed Web Service Transactions
IEEE Transactions on Services Computing
Analyzing Behavioral Substitution of Web Services Based on Pi-calculus
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Specification of Transactional Requirements for Web Services using Recoverability
International Journal of Information Technology and Web Engineering
Hi-index | 0.00 |
Nowadays, plenty of enterprises are willing to outsource their internal business processes as services and make them accessible via the Web. Toward some business process, Web service based application require more transactional support beyond traditional transactions, In this situation, direct substitution may violate the atomicity character of transaction. This will lead to the inconsistency of transaction Web service. Moreover, executed data were stored in the memory and could not be released which consequently result in the serious results such as "missing" of data. However, most of previous works on service replacement algorithms leak the cost analysis with compensation. In this paper, we extend the substitution framework by supporting compensation. A correlation analysis and behavior matching can be executed to obtain the range of cascading compensation and decide the range of substitution. Further more, we analyze the single node substitution cost and path substitution cost in details. After that, this paper presents a cost-benefit function which considers customer's preference and selects the optimal substitution strategy by regulating parameters at will.