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 proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)
    34 Downloads (Pure)


    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 languageUndefined
    Title of host publicationProceedings of the Global Communications Conference, GLOBECOM 2011
    Place of PublicationUSA
    Number of pages6
    ISBN (Print)978-1-4244-9266-4
    Publication statusPublished - Dec 2011
    Event2011 IEEE Global Communications Conference, GLOBECOM 2011: Energizing Global Communications - Hilton Americas-Houston, Houston, United States
    Duration: 5 Dec 20119 Dec 2011

    Publication series

    PublisherIEEE Communications Society
    ISSN (Print)1930-529X


    Conference2011 IEEE Global Communications Conference, GLOBECOM 2011
    Abbreviated titleGLOBECOM
    Country/TerritoryUnited States
    Internet address


    • IR-82840
    • EWI-21985
    • METIS-293165

    Cite this