Stepwise and asynchronous runtime optimization of web service compositions

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing research work considers runtime adaptation of service compositions as a viable tool to prevent violations of service level agreements. In previous work we have formalized the optimization problem of identifying the most suitable adaptations to prevent a predicted set of violations, and presented suitable algorithms to solve this problem. Here, we introduce the idea of stepwise optimization as a solution to the problem of how to deal with situations when the optimization result is not available in time, i.e., when decisions need to be taken before the optimization problem can be fully solved. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Leitner, P., Hummer, W., Satzger, B., & Dustdar, S. (2011). Stepwise and asynchronous runtime optimization of web service compositions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6997 LNCS, pp. 290–297). https://doi.org/10.1007/978-3-642-24434-6_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free