Abstract
QoS-based service selection aims at finding the best component services that satisfy the end-to-end quality requirements. The problem can be modeled as a multi-dimension multi-choice 0-1 knapsack problem, which is known as NP-hard. Recently published solutions propose using linear programming techniques to solve the problem. However, the poor scalability of linear program solving methods restricts their applicability to small-size problems and renders them inappropriate for dynamic applications with run-time requirements. In this paper, we address this problem and propose a scalable QoS computation approach based on a heuristic algorithm, which decomposes the optimization problem into small sub-problems that can be solved more efficiently than the original problem. Experimental evaluations show that near-to-optimal solutions can be found using our algorithm much faster than using linear programming methods.
Originalsprog | Engelsk |
---|---|
Bogserie | Lecture Notes in Computer Science |
Vol/bind | 5472 |
Sider (fra-til) | 190-199 |
ISSN | 0302-9743 |
DOI | |
Status | Udgivet - 2009 |
Begivenhed | Service-Oriented Computing - ICSOC 2008 Workshops, ICSOC 2008 International Workshops - Sydney, Australien Varighed: 1 dec. 2008 → 5 dec. 2008 Konferencens nummer: 6 |
Konference
Konference | Service-Oriented Computing - ICSOC 2008 Workshops, ICSOC 2008 International Workshops |
---|---|
Nummer | 6 |
Land/Område | Australien |
By | Sydney |
Periode | 01/12/2008 → 05/12/2008 |
Bibliografisk note
Titel:Service-Oriented Computing - ICSOC 2008 Workshops
Oversat titel:
Oversat undertitel:
Forlag:
Springer Publishing Company
ISBN (Trykt):
978-3-642-01246-4
ISBN (Elektronisk):
Publikationsserier:
Lecture Notes in Computer Science, 0302-9743, 1611-3349, 5472
Redaktører:
George Feuerlicht
Winfried Lamersdorf