Service selection algorithms for Web services with end-to-end QoS constraints

This paper studies the end-to-end QoS issues of composite services by utilizing a QoS broker that is responsible for selecting and coordinating the individual service component, and proposes two solution approaches to the service selection problem: the combinatorial approach, by modeling the problem as the Multiple Choice Knapsack Problem (MCKP), and the graph approach, as the constrained shortest path problem in the graph theory.