Abstract

A composite service can have its overall Quality of Service (QoS) measure computed with the QoS measures of its constituent services. In the stochastic case of QoS modeling, accurate computation for the probability distribution of the composite QoS measure is NP-hard because of the inherent complexities of probability value calculation for the function of discrete random variables. However, given reasonable assumptions on the monotony of the composite QoS function and on the independence of constituent QoS measures, we have proposed a lower bound approximation algorithm that computes the approximate value of the composite QoS distribution for admission test purpose in much lower-order complexity of time even in the worst case. The effectiveness of the proposed method is verified and compared against the naive algorithm using simulative trace data.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.