By Topic

E³: A Multiobjective Optimization Framework for SLA-Aware Service Composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wada, H. ; Sch. of Comput. Sci. & Eng., Univ. of New South Wales, Eveleigh, NSW, Australia ; Suzuki, J. ; Yamano, Y. ; Oba, K.

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 E3, to address the issue. By leveraging a multiobjective genetic algorithm, E3 heuristically solves the QoS-aware service composition problem in a reasonably short time. The algorithm E3 proposes can consider multiple SLAs simultaneously and produce a set of Pareto solutions, which have the equivalent quality to satisfy multiple SLAs.

Published in:

Services Computing, IEEE Transactions on  (Volume:5 ,  Issue: 3 )