Dynamic web service selection for reliable web service composition

This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often con...

Full description

Saved in:
Bibliographic Details
Main Authors: HWANG, San-Yih, LIM, Ee Peng, LEE, Chien-Hsiang, CHEN, Cheng-Hung
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2009
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/773
https://ink.library.smu.edu.sg/context/sis_research/article/1772/viewcontent/04663050.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1772
record_format dspace
spelling sg-smu-ink.sis_research-17722018-06-18T05:36:06Z Dynamic web service selection for reliable web service composition HWANG, San-Yih LIM, Ee Peng LEE, Chien-Hsiang CHEN, Cheng-Hung This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often constrain the sequences of invoking their operations and therefore propose to use finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each web service may fail with some probability. We show that the computation of aggregated reliabilities is equivalent to eigenvector computation and adopt the power method to efficiently derive aggregated reliabilities. In orchestrating a composite Web service, we propose two strategies to select Web services that are likely to successfully complete the execution of a given sequence of operations. A prototype that implements the proposed approach using BPEL for specifying the invocation order of a web service is developed and served as a testbed for comparing our proposed strategies and other baseline Web service selection strategies. 2009-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/773 info:doi/10.1109/TSC.2008.2 https://ink.library.smu.edu.sg/context/sis_research/article/1772/viewcontent/04663050.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Markov processes Reliability Web-based interaction Workflow management Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Markov processes
Reliability
Web-based interaction
Workflow management
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Markov processes
Reliability
Web-based interaction
Workflow management
Databases and Information Systems
Numerical Analysis and Scientific Computing
HWANG, San-Yih
LIM, Ee Peng
LEE, Chien-Hsiang
CHEN, Cheng-Hung
Dynamic web service selection for reliable web service composition
description This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often constrain the sequences of invoking their operations and therefore propose to use finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each web service may fail with some probability. We show that the computation of aggregated reliabilities is equivalent to eigenvector computation and adopt the power method to efficiently derive aggregated reliabilities. In orchestrating a composite Web service, we propose two strategies to select Web services that are likely to successfully complete the execution of a given sequence of operations. A prototype that implements the proposed approach using BPEL for specifying the invocation order of a web service is developed and served as a testbed for comparing our proposed strategies and other baseline Web service selection strategies.
format text
author HWANG, San-Yih
LIM, Ee Peng
LEE, Chien-Hsiang
CHEN, Cheng-Hung
author_facet HWANG, San-Yih
LIM, Ee Peng
LEE, Chien-Hsiang
CHEN, Cheng-Hung
author_sort HWANG, San-Yih
title Dynamic web service selection for reliable web service composition
title_short Dynamic web service selection for reliable web service composition
title_full Dynamic web service selection for reliable web service composition
title_fullStr Dynamic web service selection for reliable web service composition
title_full_unstemmed Dynamic web service selection for reliable web service composition
title_sort dynamic web service selection for reliable web service composition
publisher Institutional Knowledge at Singapore Management University
publishDate 2009
url https://ink.library.smu.edu.sg/sis_research/773
https://ink.library.smu.edu.sg/context/sis_research/article/1772/viewcontent/04663050.pdf
_version_ 1770570708050509824