On Graph Reduction for QoS Prediction of Very Large Web Service Compositions

Abstract

In this paper, we investigate the question of QoS prediction of Web Service Composition (WSC) implementing a business process. We focus on the graph reduction technique and the prediction of the Service Response Time. In the graph reduction technique, we assume that a Web Service Composition can be represented as a graph. The main thesis is that the QoS of such a graph graph can be obtained from a composition of the ones of its nodes. Multiple graph reduction algorithms have been proposed in the literature. Our contribution is twofold. We propose first a fast algorithm based on graph reduction for the prediction of the Service Response Time of a Web Service Composition. In comparison to those existing in the literature, this algorithm uses less memory space and has a better time complexity. The obtained improvements are in particular significant on very large Web Service Composition where the number of services is huge. Our second contribution is an analysis of the graph reduction technique for QoS prediction that takes into account the unfolding of services. In such cases, we show that the prediction of QoS can lead to a NP-complete problem. We also provide an integer programming model for predicting the Service Response Time in this case.