Cost-Benefit Analysis for Adaptive Web Service Substitution with Compensation

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.

[1]  Yehia Taher,et al.  Towards an Approach forWeb services Substitution , 2006, 2006 10th International Database Engineering and Applications Symposium (IDEAS'06).

[2]  Vasant Honavar,et al.  On Context-Specific Substitutability of Web Services , 2007, IEEE International Conference on Web Services (ICWS 2007).

[3]  Brian D. Davison,et al.  Introduction to special section on adversarial issues in Web search , 2008, TWEB.

[4]  Tao Yu,et al.  Adaptive algorithms for finding replacement services in autonomic distributed business processes , 2005, Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005..

[5]  Li Kuang,et al.  Analyzing Behavioral Substitution of Web Services Based on Pi-calculus , 2010, 2010 IEEE International Conference on Web Services.

[6]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[7]  Qing Li,et al.  FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services , 2010, IEEE Transactions on Services Computing.

[8]  Athman Bouguettaya,et al.  Deploying and managing Web services: issues, solutions, and directions , 2008, The VLDB Journal.

[9]  Maria Luisa Villani,et al.  QoS-aware replanning of composite Web services , 2005, IEEE International Conference on Web Services (ICWS'05).

[10]  Ricardo Jiménez-Peris,et al.  WS-replication: a framework for highly available web services , 2006, WWW '06.

[11]  Bin Zhang,et al.  An Efficient Service Substitution Algorithm Based on Temporal Composite Behavior Graph , 2009, 2009 Sixth Web Information Systems and Applications Conference.

[12]  Peter Dolog,et al.  An environment for flexible advanced compensations of Web service transactions , 2008, TWEB.

[13]  Wolf-Tilo Balke,et al.  Distributed Management of Concurrent Web Service Transactions , 2009, IEEE Transactions on Services Computing.

[14]  Norbert Ritter,et al.  Rule-Based Coordination of Distributed Web Service Transactions , 2010, IEEE Transactions on Services Computing.