Optimized decentralization of composite web services

Composite services are usually specified by means of orchestration models that capture control and data-flow relations between activities. Concrete services are then assigned to each activity based on various criteria. In mainstream service orchestration platforms, the orchestration model is executed by a centralized orchestrator through which all interactions are channeled. This architecture is not optimal in terms of communication overhead and has the usual problems of a single point of failure. In previous work, we proposed a method for executing service orchestrations in a decentralized manner while fulfilling collocation and separation constraints. However, this and similar methods for decentralized orchestration do not seek to optimize the communication overhead between services participating in the orchestration. This paper presents a method for optimizing the selection of services assigned to activities in a service orchestration in terms of QoS properties and communication overhead. The method takes into account the communication cost between pairs of services, the amount of data that these services need to exchange in the orchestration, and the collocation and separation constraints imposed by the service providers.

[1]  Sunil Chandra,et al.  Decentralized orchestration of composite web services , 2004, WWW Alt. '04.

[2]  Frank Leymann,et al.  E Role-based Decomposition of Business Processes using BPEL , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[3]  Oliver Kopp,et al.  Maintaining Data Dependencies across BPEL Process Fragments , 2008, Int. J. Cooperative Inf. Syst..

[4]  Claude Godart,et al.  Information Flow Control with Decentralized Service Compositions , 2007, IEEE International Conference on Web Services (ICWS 2007).

[5]  Vivek Sarkar,et al.  Decentralizing execution of composite web services , 2004, OOPSLA.

[6]  Marlon Dumas,et al.  Aggregate Quality of Service Computation for Composite Services , 2010, ICSOC.

[7]  Claude Godart,et al.  A Flexible Approach for Automatic Process Decentralization Using Dependency Tables , 2009, 2009 IEEE International Conference on Web Services.

[8]  Quan Z. Sheng,et al.  Facilitating the Rapid Development and Scalable Orchestration of Composite Web Services , 2004, Distributed and Parallel Databases.

[9]  Marlon Dumas,et al.  Structuring acyclic process models , 2010, Inf. Syst..

[10]  Claude Godart,et al.  Synchronization Solutions for Decentralized Service Orchestrations , 2007, Second International Conference on Internet and Web Applications and Services (ICIW'07).

[11]  Gerhard J. Woeginger,et al.  The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases , 1996, Math. Program..

[12]  Claude Godart,et al.  Towards decentralized service orchestrations , 2007, SAC '07.

[13]  Shazia Wasim Sadiq,et al.  Model Driven Distribution of Collaborative Business Processes , 2006, 2006 IEEE International Conference on Services Computing (SCC'06).

[14]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[15]  Claude Godart,et al.  Centralized versus Decentralized Conversation-based Orchestrations , 2007, The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007).

[16]  Samik Basu,et al.  A Framework for Optimal Decentralized Service-Choreography , 2009, 2009 IEEE International Conference on Web Services.

[17]  Refik Molva,et al.  The Pervasive Workflow: A Decentralized Workflow System Supporting Long-Running Transactions , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[18]  Claude Godart,et al.  Toward synchronization between decentralized orchestrations of composite web services , 2009, 2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[19]  Bernd Freisleben,et al.  Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.

[20]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[21]  Samik Basu,et al.  Optimum Decentralized Choreography for Web Services Composition , 2008, 2008 IEEE International Conference on Services Computing.

[22]  Gerhard Weikum,et al.  The Mentor project: steps towards enterprise-wide workflow management , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[23]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[24]  Quan Z. Sheng,et al.  The Self-Serv Environment for Web Services Composition , 2003, IEEE Internet Comput..