Robust execution of service workflows using redundancy and advance reservations


Stein, Sebastian, Payne, Terry and Jennings, Nick (2011) Robust execution of service workflows using redundancy and advance reservations. IEEE Transactions on Services Computing, 4, (2), 125-139. (doi:10.1109/TSC.2010.47).

Download

[img] PDF (Main Article) - Accepted Version
Download (1339Kb)
[img] PDF (Online Appendix) - Supplemental Material
Download (1123Kb)

Description/Abstract

In this paper, we develop a novel algorithm that allows service consumers to execute business processes (or workflows) of interdependent services in a dependable manner within tight time-constraints. In particular, we consider large inter-organisational service-oriented systems, where services are offered by external organisations that demand financial remuneration and where their use has to be negotiated in advance using explicit service-level agreements (as is common in Grids and cloud computing). Here, different providers often offer the same type of service at varying levels of quality and price. Furthermore, some providers may be less trustworthy than others, possibly failing to meet their agreements. To control this unreliability and ensure end-to-end dependability while maximising the profit obtained from completing a business process, our algorithm automatically selects the most suitable providers. Moreover, unlike existing work, it reasons about the dependability properties of a workflow, and it controls these by using service redundancy for critical tasks and by planning for contingencies. Finally, our algorithm reserves services for only parts of its workflow at any time, in order to retain flexibility when failures occur. We show empirically that our algorithm consistently outperforms existing approaches, achieving up to a 35-fold increase in profit and successfully completing most workflows, even when the majority of providers fail.

Item Type: Article
ISSNs: 1939-1374 (print)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 268519
Date Deposited: 18 Feb 2010 17:36
Last Modified: 14 Apr 2014 11:32
Research Funder: EPSRC
Projects:
Unknown (EP/C548051/1)
Funded by: EPSRC (EP/C548051/1)
UNSPECIFIED to UNSPECIFIED
Further Information:Google Scholar
ISI Citation Count:2
URI: http://eprints.soton.ac.uk/id/eprint/268519

Actions (login required)

View Item View Item