Stochastic bounds for composite Web services response times
In this paper, we propose bounding models, which provide upper and lower bounds on response time in composite Web service model, for alleviating the state explosion problem. The considered models have heterogeneous servers and the number of elementary Web services can be very large. More precisely, we study two types of composite Web services. First, we investigate the performance of a single composite Web service execution instance. Second, this assumption is relaxed (i.e. multiple composite Web services execution instances are considered). These models allows to find trade-off between the accuracy of the bounds and the computation complexity.
web services response time process coupling markov chain