A refined service relationships graph generation algorithm for web services composition
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Composite service metamodel and auto composition
Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
Safe distribution of declarative processes
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Declarative modelling and safe distribution of healthcare workflows
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Reliable Web service selection in choreographed environments
Decision Support Systems
| Hi-index | 0.00 |
Typical solutions for Web services composition problem develop a single intermediary which mediates or choreographs computation and communication among the existing services to realize a target/goal service. However, such a centralized choreography mechanism can involve communication/computation overhead that can be reduced through its decentralized realization. With this as motivation, we study the problem of synthesizing a decentralized choreography strategy that will have an optimum overhead for service composition by developing a set of site-specific choreographers working concurrently to implement a desired goal service. Each communication/computation is quantified by a cost. We develop an algorithm that takes as input the existing services, the goal service, the costs and produces as an output a set of site-specific choreographers that optimally realize the goal service using the existing services. The contribution lies in the formulation of the optimal decentralized choreographer synthesis problem as well as its solution and extends our earlier work in two ways: decentralization of solution and its optimality.