The Robustness of Periodic Orchestrations in Uncertain Evolving Environments
A framework for assessing the robustness of long-duration repetitive orchestrations in uncertain evolving environments is proposed. The model assumes that service-based evaluation environments are stable over short time-frames only; over longer periods service-based environments evolve as demand fluctuates and contention for shared resources varies. The behaviour of a short-duration orchestration E in a stable environment is assessed by an uncertainty profile\(\mathcal U\) and a corresponding zero-sum angel-daemon game \(\varGamma (\mathcal U)\) . Here the angel-daemon approach is extended to assess evolving environments by means of a subfamily of stochastic games. These games are called strategy oblivious because their transition probabilities are strategy independent. It is shown that the value of a strategy oblivious stochastic game is well defined and that it can be computed by solving a linear system. Finally, the proposed stochastic framework is used to assess the evolution of the Gabrmn IT system.
KeywordsOrchestrations Uncertainty Zero-sum games Stochastic games
- 4.Misra, J.: A programming model for the orchestration of web services. In: 2nd International Conference on Software Engineering and Formal Methods, SEFM 2004, pp. 2–11. IEEE (2004)Google Scholar
- 8.Shapley, L.: Stochatic games. In: PNAS, pp. 1095–1100 (1953)Google Scholar
- 11.Vrieze, O.J.: Stochastic games, practical motivation and the orderfield property for special cases. In: Stochastic Games and Applications, 570 of NATO. Science, pp. 215–225 (2003)Google Scholar