M. Weißbach, Philipp Chrszon, T. Springer, A. Schill
{"title":"Decentrally Coordinated Execution of Adaptations in Distributed Self-Adaptive Software Systems","authors":"M. Weißbach, Philipp Chrszon, T. Springer, A. Schill","doi":"10.1109/SASO.2017.20","DOIUrl":"https://doi.org/10.1109/SASO.2017.20","url":null,"abstract":"Software systems in domains like Smart Cities, the Internet of Things or autonomous cars are coined by a high degree of distribution across several independent computing devices and the requirement to be able to adjust themselves to varying situations in their operational environment. Self-adaptive software systems are a natural choice to implement such context-dependent software systems. A multitude of approaches already implement self-adaptive systems and some consider even distribution aspects.Yet, none of the existing solutions supports the coordination of adaptation operations spanning multiple independent nodes, which is necessary to ensure a consistent adaptation even in presence of network errors or node failures. In this paper, we tackle this challenge to execute adaptations in distributed self-adaptive software systems in a coordinated manner. We present a protocol that enables the self-adaptive software system to execute correlated adaptations on multiple nodes in a transactional manner ensuring an atomic and consistent transition of the distributed system from its source to the desired target configuration. The protocol is validated to be free of deadlocks for any given adaptation at any point in time using a model-checking approach. The performance of our approach is investigated in experiments that emulate the protocol's execution on real devices for different sizes of distributed applications and adaptation scenarios.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127626657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Embedding Verification Concerns in Self-Adaptive System Code","authors":"Sharmin Jahan, Allen Marshall, R. Gamble","doi":"10.1109/SASO.2017.21","DOIUrl":"https://doi.org/10.1109/SASO.2017.21","url":null,"abstract":"For a self-adaptive system, adaptive plans deployed at runtime should comply with critical requirements. The ability to assess plans is especially useful when the system operates for long periods without intervention. Dynamic compliance re-verification consumes enormous resources that may not be available. Plus, in many cases, re-verification of all requirements is unnecessary because the adaptive plan does not impact the associated state variables. If a plan can be configured dynamically from predefined parts, one method is to pre-check all possible plan combinations to determine if compliance could be violated. Unfortunately, this approach disallows runtime formulation of new functionality or new functionality integrations for self-adaptation. Thus, these new products will not be fully vetted prior to system deployment. However, if the deployed system has been verified to comply with critical requirements, then a verification process exists for each requirement. Our approach focuses on allowing the system to dynamically determine the potential for an adaptive plan to inhibit repeatability of the prior verification processes. If a verification process, such as a proof or certification, cannot be reused, there is a risk that requirement compliance can be violated. Our objective is to abstract verification concerns from the verification process and embed them as checkpoints within the code to provide a form of verification awareness. The checkpoints collect values as an adaptive plan is simulated, which are mined and visualized using ProM to determine the plan's potential to limit the reuse of the verification process.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PacketSkip: Skip Graph for Multidimensional Search in Structured Peer-to-Peer Systems","authors":"Andreas Disterhöft, Andreas Funke, Kalman Graffi","doi":"10.1109/SASO.2017.11","DOIUrl":"https://doi.org/10.1109/SASO.2017.11","url":null,"abstract":"The Internet is ubiquitous and nodes participating in it are becoming increasingly diverse and heterogeneous. Especially is this true in decentralized, overlay-based networks, which traditionally build upon the infrastructure of the Internet. An ability to search for nodes with specific capabilities becomes of growing interest, for example, to support the node capacity discovery in large scale, distributed networks, such as in peer-to-peer systems. With PacketSkip, we propose a distributed, ordered, multidimensional indexing structure based on a Skip Graph, which operates on top of popular distributed hash tables. Its purpose is to offer, among other functions, capacity-based, high dimensional range searches for peers and their dynamiccapacities. PacketSkip provides a very high search performance, also in comparison to other approaches, as well as low update and maintenance costs. Evaluations show that update and search durations are low and well scalable. Even in dynamic systems, its inner graph structure remains robust and stable.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121434892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self Adaptive Safe Provisioning of Wireless Power Using DCOPs","authors":"C. J. V. Leeuwen, K. Yıldırım, P. Pawełczak","doi":"10.1109/SASO.2017.16","DOIUrl":"https://doi.org/10.1109/SASO.2017.16","url":null,"abstract":"Wireless Power Transfer (WPT) technologies aim at getting rid of cables used by consumer devices for energy provision. As long distance WPT is becoming mature, the health impact of WPT becomes increasingly important to consider. In this paper we look at how to maximize the wireless power transfer to remote devices, while maintaining a safe level of electromagnetic radiation (EMR) for humans that are in the vicinity of the energy transmitters. Classically, this problem can be described as a centralized optimization problem of finding the optimal set of safe power levels at locations of human presence. Instead, we advocate to formulate this problem as an agent-based Distributed Constraint Optimization Problem (DCOP). As a solution to this problem we introduce CoCoA_WPT, a variant of the DCOP solver CoCoA. CoCoA_WPT provides a solution of similar quality to centralized solver even for a large scale network involving over a thousand nodes. Based on CoCoA_WPT, we propose a self-adaptive charging system: Transferring Energy Safely by Self-Adaptation (TESSA). TESSA keeps the charging network safe even when it is perturbed by environmental dynamics. We show that TESSA can reach on average up to 85% of the theoretical optimal maximum total transmitted power (calculated using centralized solution) while satisfying the EMR safety constraints.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126975501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}