A Scalable Approach for QoS-Based Web Service Selection
Service-Oriented Computing – ICSOC 2008 Workshops, volume 5472 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2009)DOI: 10.1007/978-3-642-01247-1_20
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.