An Inheritance based Service Execution Planning Approach using Bully Election Algorithm

Abstract

Web service composition has gained tremendous interest with emerging application development. Automatic service composition is a key aspect in overcoming runtime problems that arise due to dynamic nature of runtime environment. In SOA, applications are formed through the combinations of independently developed web services that lead to emergence of different dependencies among the component services. The challenge of web service composition is to manage such kind of dependencies among web services when there is large number of services. In this paper, an inheritance based Bully Election approach is proposed for analyzing dependency among services and generating automatic service composition plan. It also identifies the coordinator service on which the execution of other services is dependent. Experimental result shows that the proposed approach is able to reduce the composition time complexity by including only the selected services on the composition plan.

Automated planning of process models: The construction of parallel splits and synchronizations

“…Other authors in these phases propose to calculate so called dependency coefficients for each action and suggest to parallelize two actions if their dependency coefficients are the same [49][50][51][52]. Dependency coefficients represent how many actions are dependent on the considered action or how many actions the considered action is dependent on.…”