A Probabilistic QoS Model and Computation Framework for Web Services-Based Workflows

29Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Web services promise to become a key enabling technology for B2B e-commerce. Several languages have been proposed to compose Web services into workflows. The QoS of the Web services-based workflows may play an essential role in choosing constituent Web services and determining service level agreement with their users. In this paper, we identify a set of QoS metrics in the context of Web services and propose a unified probabilistic model for describing QoS values of (atomic/composite) Web services. In our model, each QoS measure of a Web service is regarded as a discrete random variable with probability mass function (PMF). We describe a computation framework to derive QoS values of a Web services-based workflow. Two algorithms are proposed to reduce the sample space size when combining PMFs. The experimental results show that our computation framework is efficient and results in PMFs that are very close to the real model. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Hwang, S. Y., Wang, H., Srivastava, J., & Paul, R. A. (2004). A Probabilistic QoS Model and Computation Framework for Web Services-Based Workflows. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3288, 596–609. https://doi.org/10.1007/978-3-540-30464-7_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free