Multi-Objective Quality-Driven Service Selection—A Fully Polynomial Time Approximation Scheme | IEEE Journals & Magazine | IEEE Xplore

Multi-Objective Quality-Driven Service Selection—A Fully Polynomial Time Approximation Scheme


Abstract:

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal....Show More

Abstract:

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A selection is Pareto-optimal if no other selection has better QoS values for some attributes and at least equivalent values for all others. Exact algorithms have been proposed that find all Pareto-optimal selections. They suffer however from exponential complexity. Randomized algorithms scale well but do not offer any formal guarantees on result precision. We present the first approximation scheme for QDSS. It aims at the sweet spot between exact and randomized algorithms: It combines polynomial complexity with formal result precision guarantees. A parameter allows to seamlessly trade result precision against efficiency. We formally analyze complexity and precision guarantees and experimentally compare our algorithm against exact and randomized approaches. Comparing with exact algorithms, our approximation scheme allows to reduce optimization time from hours to seconds. Its approximation error remains below 1.4 percent while randomized algorithms come close to the theoretical maximum.
Published in: IEEE Transactions on Software Engineering ( Volume: 40, Issue: 2, February 2014)
Page(s): 167 - 191
Date of Publication: 18 December 2013

ISSN Information:


1. Introduction

Software has moved from monolithic, static, and centralized structures to modular, dynamic, and distributed ones [1]. This shift has been supported by the development of new architectural paradigms. Service-oriented architectures (SOAs) [2] are currently among the most successful ones. They center around the abstraction of a service that encapsulates atomic functionality. SOA applications, also called workflows, consist of a set of tasks, each one associated with a required functionality, and a control flow between those tasks. For every task in the workflow, several services can be applicable that offer the same functionality. Executing a workflow requires a binding that maps workflow tasks to specific services.

Contact IEEE to Subscribe

References

References is not available for this document.