Skip to main content

The Robustness of Periodic Orchestrations in Uncertain Evolving Environments

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9161))

Abstract

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.

J. Gabarro and M. Serna are partially supported by funds from the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grant TIN2013-46181-C2-1-R (COMMAS) and also by SGR 2014:1137 (ALBCOM) from AGAUR, Generalitat de Catalunya. J. Castro is partially supported by the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grants TIN2011-27479-C04-03 (BASMATI) and TIN2014-57226-P (APCOM) and by SGR 2014:890 (MACDA) from AGAUR, Generalitat de Catalunya.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Article  MATH  Google Scholar 

  2. Gabarro, J., Serna, M., Stewart, A.: Analysing web-orchestrations under stress using Uncertainty profiles. Comput. J. 57(11), 1591–1615 (2014)

    Article  Google Scholar 

  3. Levharit, D., Mirman, L.: The great fish war: an example using a dynamic cournot-nash solution. Bell J. Econ. 11, 322–334 (1980)

    Article  MathSciNet  Google Scholar 

  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. Misra, J., Cook, W.: Computation orchestration: a basis for wide-area computing. Softw. Syst. Model. 6(1), 83–110 (2007)

    Article  Google Scholar 

  6. Owen, G.: Game Theory, 3rd edn. Academic Press, Sant Diego (2001)

    MATH  Google Scholar 

  7. Rosario, S., Benveniste, A., Jard, C.: Flexible probabilistic QoS management of orchestrations. Int. J. Web Serv. Res. 7(2), 21–42 (2010)

    Article  Google Scholar 

  8. Shapley, L.: Stochatic games. In: PNAS, pp. 1095–1100 (1953)

    Google Scholar 

  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 Games

    Article  MathSciNet  MATH  Google Scholar 

  10. Stewart, A., Gabarro, J., Keenan, A.: Reasoning about orchestrations of web services using partial correctness. Formal Aspects Comput. 25, 833–846 (2013)

    Article  MathSciNet  MATH  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 

  12. Wehrman, I., Kitchin, D., Cook, W., Misra, J.: A timed semantics of Orc. Theor. Comput. Sci. 402(2–3), 234–248 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joaquim Gabarro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Castro, J., Gabarro, J., Serna, M., Stewart, A. (2015). The Robustness of Periodic Orchestrations in Uncertain Evolving Environments. In: Destercke, S., Denoeux, T. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2015. Lecture Notes in Computer Science(), vol 9161. Springer, Cham. https://doi.org/10.1007/978-3-319-20807-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20807-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20806-0

  • Online ISBN: 978-3-319-20807-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics