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.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Volume | 5472 |
Pages (from-to) | 190-199 |
ISSN | 0302-9743 |
DOIs | |
Publication status | Published - 2009 |
Event | Service-Oriented Computing - ICSOC 2008 Workshops, ICSOC 2008 International Workshops - Sydney, Australia Duration: 1 Dec 2008 → 5 Dec 2008 Conference number: 6 |
Conference
Conference | Service-Oriented Computing - ICSOC 2008 Workshops, ICSOC 2008 International Workshops |
---|---|
Number | 6 |
Country/Territory | Australia |
City | Sydney |
Period | 01/12/2008 → 05/12/2008 |