On Composing a Reliable Composite Web Service: A Study of Dynamic Web Service Selection

Abstract

Dynamic Web service selection refers to determining a subset of component Web services to be invoked so as to orchestrate a composite Web service. Previous work in Web service selection usually assumes the invocations of Web service operations to be independent of one another. This assumption however does not hold in practice as both the composite and component Web services often impose some orderings on the invocation of their operations. Such orderings constrain the selection of component Web services to orchestrate the composite Web service. We therefore propose to use finite state machine (FSM) to model the invocation order of Web service operations. We define a measure, called aggregated reliability, to measure the probability that a given state in the composite Web service will lead to successful execution in the context where each component Web service may fail with some probability. We show that the computation of aggregated reliabilities is equivalent to eigenvector computation. The power method is hence adopted to efficiently derive aggregated reliabilities. In orchestrating a composite Web service, we propose two strategies to select component Web services that are likely to successfully complete the execution of a given sequence of operations. Our experiments on a synthetically generated set of Web service operation execution sequences show that our proposed strategies perform better than the baseline random selection strategy.