The Robustness of Periodic Orchestrations in Uncertain Evolving Environments

  • Jorge Castro
  • Joaquim Gabarro
  • Maria Serna
  • Alan Stewart
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9161)


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)\) [2]. 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.


Orchestrations Uncertainty Zero-sum games Stochastic games 


  1. 1.
    Benveniste, A., Jard, C., Kattepur, A., Rosario, S., Thywissen, J.A.: QoS-aware management of monotonic service orchestrations. Formal Methods Syst. Des. 44(1), 1–43 (2014)CrossRefzbMATHGoogle Scholar
  2. 2.
    Gabarro, J., Serna, M., Stewart, A.: Analysing web-orchestrations under stress using Uncertainty profiles. Comput. J. 57(11), 1591–1615 (2014)CrossRefGoogle Scholar
  3. 3.
    Levharit, D., Mirman, L.: The great fish war: an example using a dynamic cournot-nash solution. Bell J. Econ. 11, 322–334 (1980)MathSciNetCrossRefGoogle Scholar
  4. 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
  5. 5.
    Misra, J., Cook, W.: Computation orchestration: a basis for wide-area computing. Softw. Syst. Model. 6(1), 83–110 (2007)CrossRefGoogle Scholar
  6. 6.
    Owen, G.: Game Theory, 3rd edn. Academic Press, Sant Diego (2001)zbMATHGoogle Scholar
  7. 7.
    Rosario, S., Benveniste, A., Jard, C.: Flexible probabilistic QoS management of orchestrations. Int. J. Web Serv. Res. 7(2), 21–42 (2010)CrossRefGoogle Scholar
  8. 8.
    Shapley, L.: Stochatic games. In: PNAS, pp. 1095–1100 (1953)Google Scholar
  9. 9.
    Sorin, S.: New approaches and recent advances in two-person zero-sum repeated games. Ann. Int. Soc. Dyn. Games 7, 67–93 (2005). Advances in Dynamic GamesMathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Stewart, A., Gabarro, J., Keenan, A.: Reasoning about orchestrations of web services using partial correctness. Formal Aspects Comput. 25, 833–846 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 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
  12. 12.
    Wehrman, I., Kitchin, D., Cook, W., Misra, J.: A timed semantics of Orc. Theor. Comput. Sci. 402(2–3), 234–248 (2008)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Jorge Castro
    • 1
  • Joaquim Gabarro
    • 2
  • Maria Serna
    • 2
  • Alan Stewart
    • 3
  1. 1.LARCA Research Group, Computer Science DepartmentUPC BarcelonaBarcelonaSpain
  2. 2.ALBCOM Research Group, Computer Science DepartmentUPC BarcelonaBarcelonaSpain
  3. 3.School of Computer ScienceThe Queen’s University of BelfastBelfastUK

Personalised recommendations