A probabilistic approach to modeling and estimating the QoS of web-services-based workflows

San Yih Hwang, Haojun Wang, Jian Tang, Jaideep Srivastava

Research output: Contribution to journalArticle

165 Citations (Scopus)

Abstract

Web services promise to become a key enabling technology for B2B e-commerce. One of the most-touted features of Web services is their capability to recursively construct a Web service as a workflow of other existing Web services. The quality of service (QoS) of Web-services-based workflows may be an essential determinant when selecting constituent Web services and determining the service-level agreement with users. To make such a selection possible, it is essential to estimate the QoS of a WS workflow based on the QoSs of its constituent WSs. In the context of WS workflow, this estimation can be made by a method called QoS aggregation. While most of the existing work on QoS aggregation treats the QoS as a deterministic value, we argue that due to some uncertainty related to a WS, it is more realistic to model its QoS as a random variable, and estimate the QoS of a WS workflow probabilistically. In this paper, we identify a set of QoS metrics in the context of WS workflows, and propose a unified probabilistic model for describing QoS values of a broader spectrum of atomic and composite Web services. Emulation data are used to demonstrate the efficiency and accuracy of the proposed approach.

Original languageEnglish
Pages (from-to)5484-5503
Number of pages20
JournalInformation Sciences
Volume177
Issue number23
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes

Fingerprint

Probabilistic Approach
Web services
Work Flow
Quality of Service
Web Services
Quality of service
Modeling
Aggregation
Agglomeration
Service Level Agreement
Emulation
Electronic Commerce
Random variables
Probabilistic Model
Estimate
Determinant
Random variable
Composite
Uncertainty
Metric

Keywords

  • QoS aggregation
  • Structural workflow
  • Web service composition
  • Web service QoS
  • Web services
  • Workflow QoS

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Cite this

A probabilistic approach to modeling and estimating the QoS of web-services-based workflows. / Hwang, San Yih; Wang, Haojun; Tang, Jian; Srivastava, Jaideep.

In: Information Sciences, Vol. 177, No. 23, 01.12.2007, p. 5484-5503.

Research output: Contribution to journalArticle

Hwang, San Yih ; Wang, Haojun ; Tang, Jian ; Srivastava, Jaideep. / A probabilistic approach to modeling and estimating the QoS of web-services-based workflows. In: Information Sciences. 2007 ; Vol. 177, No. 23. pp. 5484-5503.
@article{c24cd645eaf74f61a7076ba540ac0daa,
title = "A probabilistic approach to modeling and estimating the QoS of web-services-based workflows",
abstract = "Web services promise to become a key enabling technology for B2B e-commerce. One of the most-touted features of Web services is their capability to recursively construct a Web service as a workflow of other existing Web services. The quality of service (QoS) of Web-services-based workflows may be an essential determinant when selecting constituent Web services and determining the service-level agreement with users. To make such a selection possible, it is essential to estimate the QoS of a WS workflow based on the QoSs of its constituent WSs. In the context of WS workflow, this estimation can be made by a method called QoS aggregation. While most of the existing work on QoS aggregation treats the QoS as a deterministic value, we argue that due to some uncertainty related to a WS, it is more realistic to model its QoS as a random variable, and estimate the QoS of a WS workflow probabilistically. In this paper, we identify a set of QoS metrics in the context of WS workflows, and propose a unified probabilistic model for describing QoS values of a broader spectrum of atomic and composite Web services. Emulation data are used to demonstrate the efficiency and accuracy of the proposed approach.",
keywords = "QoS aggregation, Structural workflow, Web service composition, Web service QoS, Web services, Workflow QoS",
author = "Hwang, {San Yih} and Haojun Wang and Jian Tang and Jaideep Srivastava",
year = "2007",
month = "12",
day = "1",
doi = "10.1016/j.ins.2007.07.011",
language = "English",
volume = "177",
pages = "5484--5503",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "23",

}

TY - JOUR

T1 - A probabilistic approach to modeling and estimating the QoS of web-services-based workflows

AU - Hwang, San Yih

AU - Wang, Haojun

AU - Tang, Jian

AU - Srivastava, Jaideep

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Web services promise to become a key enabling technology for B2B e-commerce. One of the most-touted features of Web services is their capability to recursively construct a Web service as a workflow of other existing Web services. The quality of service (QoS) of Web-services-based workflows may be an essential determinant when selecting constituent Web services and determining the service-level agreement with users. To make such a selection possible, it is essential to estimate the QoS of a WS workflow based on the QoSs of its constituent WSs. In the context of WS workflow, this estimation can be made by a method called QoS aggregation. While most of the existing work on QoS aggregation treats the QoS as a deterministic value, we argue that due to some uncertainty related to a WS, it is more realistic to model its QoS as a random variable, and estimate the QoS of a WS workflow probabilistically. In this paper, we identify a set of QoS metrics in the context of WS workflows, and propose a unified probabilistic model for describing QoS values of a broader spectrum of atomic and composite Web services. Emulation data are used to demonstrate the efficiency and accuracy of the proposed approach.

AB - Web services promise to become a key enabling technology for B2B e-commerce. One of the most-touted features of Web services is their capability to recursively construct a Web service as a workflow of other existing Web services. The quality of service (QoS) of Web-services-based workflows may be an essential determinant when selecting constituent Web services and determining the service-level agreement with users. To make such a selection possible, it is essential to estimate the QoS of a WS workflow based on the QoSs of its constituent WSs. In the context of WS workflow, this estimation can be made by a method called QoS aggregation. While most of the existing work on QoS aggregation treats the QoS as a deterministic value, we argue that due to some uncertainty related to a WS, it is more realistic to model its QoS as a random variable, and estimate the QoS of a WS workflow probabilistically. In this paper, we identify a set of QoS metrics in the context of WS workflows, and propose a unified probabilistic model for describing QoS values of a broader spectrum of atomic and composite Web services. Emulation data are used to demonstrate the efficiency and accuracy of the proposed approach.

KW - QoS aggregation

KW - Structural workflow

KW - Web service composition

KW - Web service QoS

KW - Web services

KW - Workflow QoS

UR - http://www.scopus.com/inward/record.url?scp=34548649823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548649823&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2007.07.011

DO - 10.1016/j.ins.2007.07.011

M3 - Article

VL - 177

SP - 5484

EP - 5503

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 23

ER -