The Community for Technology Leaders
Green Image
Issue No. 03 - Third Quarter (2012 vol. 5)
ISSN: 1939-1374
pp: 358-372
Katsuya Oba , OGIS International, Inc., San Mateo
Yuji Yamano , OGIS International, Inc., San Mateo
Junichi Suzuki , University of Massachusetts Boston, Boston
Hiroshi Wada , National ICT Australia, Eveleigh and University of New South Wales, Sydney
ABSTRACT
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.
INDEX TERMS
Quality of service, Concrete, Throughput, Optimization, Service oriented architecture, Aggregates, Marketing and sales, multiobjective genetic algorithms., Optimization of services composition, quality of service, service-level agreements
CITATION
Katsuya Oba, Yuji Yamano, Junichi Suzuki, Hiroshi Wada, "E³: A Multiobjective Optimization Framework for SLA-Aware Service Composition", IEEE Transactions on Services Computing, vol. 5, no. , pp. 358-372, Third Quarter 2012, doi:10.1109/TSC.2011.6
108 ms
(Ver )