@InProceedings{Camara/Stochastic/2014,
AUTHOR = {C\'{a}mara, Javier and Moreno, Gabriel A. and Garlan, David},
TITLE = {Stochastic Game Analysis and Latency Awareness for Proactive Self-Adaptation},
YEAR = {2014},
MONTH = {2-3 June},
BOOKTITLE = {9th International Symposium on Software Engineering for Adaptive and Self-Managing Systems},
ADDRESS = {Hyderabad, India},
PDF = {http://acme.able.cs.cmu.edu/pubs/uploads/pdf/stochastic-proactive.pdf},
ABSTRACT = {Although different approaches to decision-making in self-
adaptive systems have shown their effectiveness in the past
by factoring in predictions about the system and its environment (e.g., resource availability), no proposal considers the
latency associated with the execution of tactics upon the target system. However, different adaptation tactics can take
different amounts of time until their effects can be observed.
In reactive adaptation, ignoring adaptation tactic latency
can lead to suboptimal adaptation decisions (e.g., activating a server that takes more time to boot than the transient
spike in traffic that triggered its activation). In proactive
adaptation, taking adaptation latency into account is necessary to get the system into the desired state to deal with
an upcoming situation. In this paper, we introduce a formal analysis technique based on model checking of stochastic multiplayer games (SMGs) that enables us to quantify
the potential benefits of employing different types of algorithms for self-adaptation. In particular, we apply this technique to show the potential benefit of considering adaptation tactic latency in proactive adaptation algorithms. Our
results show that factoring in tactic latency in decision making improves the outcome of adaptation. We also present an
algorithm to do proactive adaptation that considers tactic
latency, and show that it achieves higher utility than an algorithm that under the assumption of no latency is optimal.},
KEYWORDS = {Assurance, Landmark, Latency-aware, Model Checking, Self-adaptation} }
|
|