Stochastic bounds for performance evaluation of web services

We propose new techniques to simplify the computation of the end to end delay for an evaluation of a Web services. These techniques allow us to simplify the model description to reduce the number of states of the underlying Markov chain. The simplification processes are associated with stochastic comparisons of random variables. Thus the simplified models are stochastic bounds for the original ones