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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.