Article ID Journal Published Year Pages File Type
426002 Future Generation Computer Systems 2012 10 Pages PDF
Abstract

The quality of service (QoS)-aware service composition (QSC) problem is to find an execution plan of a service composition process which can ensure that the quality of service meets given user requirements. This paper proposes a branch and bound for execution plan selection (BB4EPS) algorithm to solve the QSC problem. In the proposed BB4EPS algorithm, a universal QoS model is used to evaluate the QoS parameters for service composition, and the QSC problem is modeled as an extended flexible constraint satisfaction framework, in which the utility function is applied to build the objective function. Numerical simulation results show that the proposed algorithm is feasible and effective.

► We propose a branch and bound for execution plan selection algorithm for service composition. ► A universal quality of service (QoS) model is built to evaluate the QoS parameters. ► The QoS-aware service composition (QSC) problem is modeled as an extended flexible constraint satisfaction framework. ► The utility function is applied to build the objective function.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , , ,