Title
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. 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.
Year
DOI
Venue
2014
10.1109/TSE.2013.61
IEEE Transactions on Software Engineering
Keywords
Field
DocType
quality of service,software quality,multi objective optimization,motion pictures,approximation algorithms,optimization,polynomials
Randomized algorithm,Approximation algorithm,Mathematical optimization,Polynomial,Computer science,Response time,Quality of service,Multi-objective optimization,Theoretical computer science,Polynomial-time approximation scheme,Approximation error
Journal
Volume
Issue
ISSN
40
2
0098-5589
Citations 
PageRank 
References 
19
0.69
24
Authors
3
Name
Order
Citations
PageRank
Immanuel Trummer110217.67
Boi Faltings23586331.33
Walter Binder3107792.58