Dynamic Profit Optimization of Composite Web Services with SLAs

Miroslav Zivkovic; J.W. Bosman; Hans Leo van den Berg; R.D. van der Mei; H.B. Meeuwissen; R. Nunez Queija

doi:10.1109/GLOCOM.2011.6133666

Dynamic Profit Optimization of Composite Web Services with SLAs

Miroslav Zivkovic, J.W. Bosman, Hans Leo van den Berg, R.D. van der Mei, H.B. Meeuwissen, R. Nunez Queija

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

7 Citations (Scopus)

43 Downloads (Pure)

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.

Original language	Undefined
Title of host publication	Proceedings of the Global Communications Conference, GLOBECOM 2011
Place of Publication	USA
Publisher	IEEE
Pages	1-6
Number of pages	6
ISBN (Print)	978-1-4244-9266-4
DOIs	https://doi.org/10.1109/GLOCOM.2011.6133666
Publication status	Published - Dec 2011
Event	2011 IEEE Global Communications Conference, GLOBECOM 2011: Energizing Global Communications - Hilton Americas-Houston, Houston, United States Duration: 5 Dec 2011 → 9 Dec 2011 http://globecom2011.ieee-globecom.org/index.html

Publication series

Name
Publisher	IEEE Communications Society
ISSN (Print)	1930-529X

Conference

Conference	2011 IEEE Global Communications Conference, GLOBECOM 2011
Abbreviated title	GLOBECOM
Country/Territory	United States
City	Houston
Period	5/12/11 → 9/12/11
Internet address	http://globecom2011.ieee-globecom.org/index.html

Keywords

IR-82840
EWI-21985
METIS-293165

Access to Document

10.1109/GLOCOM.2011.6133666

06133666

Cite this

@inproceedings{7b5130fd36494ae692d95e641fc5686f,

title = "Dynamic Profit Optimization of Composite Web Services with SLAs",

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.",

keywords = "IR-82840, EWI-21985, METIS-293165",

author = "Miroslav Zivkovic and J.W. Bosman and {van den Berg}, {Hans Leo} and {van der Mei}, R.D. and H.B. Meeuwissen and {Nunez Queija}, R.",

note = "10.1109/GLOCOM.2011.6133666 ; 2011 IEEE Global Communications Conference, GLOBECOM 2011 ; Conference date: 05-12-2011 Through 09-12-2011",

year = "2011",

month = dec,

doi = "10.1109/GLOCOM.2011.6133666",

language = "Undefined",

isbn = "978-1-4244-9266-4",

publisher = "IEEE",

pages = "1--6",

booktitle = "Proceedings of the Global Communications Conference, GLOBECOM 2011",

address = "United States",

url = "http://globecom2011.ieee-globecom.org/index.html",

}

Zivkovic, M, Bosman, JW, van den Berg, HL, van der Mei, RD, Meeuwissen, HB & Nunez Queija, R 2011, Dynamic Profit Optimization of Composite Web Services with SLAs. in Proceedings of the Global Communications Conference, GLOBECOM 2011. IEEE, USA, pp. 1-6, 2011 IEEE Global Communications Conference, GLOBECOM 2011, Houston, Texas, United States, 5/12/11. https://doi.org/10.1109/GLOCOM.2011.6133666

TY - GEN

T1 - Dynamic Profit Optimization of Composite Web Services with SLAs

AU - Zivkovic, Miroslav

AU - Bosman, J.W.

AU - van den Berg, Hans Leo

AU - van der Mei, R.D.

AU - Meeuwissen, H.B.

AU - Nunez Queija, R.

N1 - 10.1109/GLOCOM.2011.6133666

PY - 2011/12

Y1 - 2011/12

N2 - 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.

AB - 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.

KW - IR-82840

KW - EWI-21985

KW - METIS-293165

U2 - 10.1109/GLOCOM.2011.6133666

DO - 10.1109/GLOCOM.2011.6133666

M3 - Conference contribution

SN - 978-1-4244-9266-4

SP - 1

EP - 6

BT - Proceedings of the Global Communications Conference, GLOBECOM 2011

PB - IEEE

CY - USA

T2 - 2011 IEEE Global Communications Conference, GLOBECOM 2011

Y2 - 5 December 2011 through 9 December 2011

ER -