Autor: |
Wada, Hiroshi, Suzuki, Junichi, Yamano, Yuji, Oba, Katsuya |
Zdroj: |
IEEE Transactions on Services Computing; Jul2012, Vol. 5 Issue 3, p358-372, 15p |
Abstrakt: |
In Service-Oriented Architecture, each application is often designed as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for each abstract service to fulfill its function. Since different concrete services may operate at different quality of service (QoS) measures, application developers are required to select an appropriate set of concrete services that satisfies a given Service-Level Agreement (SLA) when a number of concrete services are available for each abstract service. This problem, the QoS-aware service composition problem, is known NP-hard, which takes a significant amount of time and costs to find optimal solutions (optimal combinations of concrete services) from a huge number of possible solutions. This paper proposes an optimization framework, called E^3, to address the issue. By leveraging a multiobjective genetic algorithm, E^3 heuristically solves the QoS-aware service composition problem in a reasonably short time. The algorithm E^3 proposes can consider multiple SLAs simultaneously and produce a set of Pareto solutions, which have the equivalent quality to satisfy multiple SLAs. [ABSTRACT FROM PUBLISHER] |
Databáze: |
Complementary Index |
Externí odkaz: |
|