Title
Dynamic Profit Optimization of Composite Web Services with SLAs
Author
Zivkovic, M.
Bosman, J.W.
van den Berg, J.L.
van der Mei, R.D.
Meeuwissen, H.B.
Nunez-Queija, R.
Publication year
2011
Abstract
In this paper we investigate sequential decision mechanisms for composite web services. After executing each sub-service within a sequential workflow, decisions are made whether to terminate or continue the execution of the workflow. These decisions are based on observed response times, expected rewards, and typical Service Level Agreement parameters such as costs, penalties, and agreed response–time objectives. We propose a model for the sequential decision–making process within which we explore a couple of decision algorithms. We benchmarked these algorithms against the profit made when executing the workflow without decision–making. We show that algorithm based on backward recursion principle of dynamic programming is optimal with respect to profit. Next, we analyse the structure of erroneous decisions for both algorithms and show that significant profit gains can be obtained by sequential decision making.
Subject
Communication & Information
PNS - Performance of Networks & Services
TS - Technical Sciences
Vital ICT Infrastructure
Informatics
Information Society
Service Oriented Architecture
Response Time
Percentile Service Level Agreements
Sequential Decision
Backward Recursion
Dynamic Programming
To reference this document use:
http://resolver.tudelft.nl/uuid:247d9de0-a3ff-441a-9812-88df93478035
DOI
https://doi.org/10.1109/glocom.2011.6133666
TNO identifier
447160
Source
2011 IEEE Global Telecommunications Conference (GLOBECOM 2011), 5-9 December 2011, Houston, TX, USA
Document type
conference paper