P. Perez, Tomas Holderness du Chemin, E. Turpin, R. Clarke
{"title":"Citizen-Driven Flood Mapping in Jakarta: A Self-Organising Socio-technical System","authors":"P. Perez, Tomas Holderness du Chemin, E. Turpin, R. Clarke","doi":"10.1109/SASOW.2015.40","DOIUrl":"https://doi.org/10.1109/SASOW.2015.40","url":null,"abstract":"The PetaJakarta.org project aims at advancing our capacity to understand and promote the resilience of cities to both extreme weather events as a result of climate change and to long-term infrastructure transformation as a process of climate adaptation. PetaJakarta.org is a pioneering web-based platform that harnesses the power of social media by gathering, sorting, and displaying information about flooding for Jakarta residents and governmental agencies in real time. It allows situational information to be collected and disseminated by community members through their location enabled mobile devices, and shared with emergency response agencies. We argue that PetaJakarta.org is, in essence, a self-organizing socio-technical system that couples people, mobile technology and autonomous sensors in a complex network of information. As a consequence, we need to explore the various dimensions of computational justice that characterize this system in order to identify its opportunities and challenges.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115584197","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":"Network Attack Detection and Mitigation","authors":"Sangita Roy, A. Sairam","doi":"10.1109/SASOW.2015.33","DOIUrl":"https://doi.org/10.1109/SASOW.2015.33","url":null,"abstract":"Resource exhaustion attacks or denial of service attacks (DoS) have emerged as a major way to compromise the availability of servers and interrupt legitimate online services. IP trace back refers to the problem of identifying the source of such attacks. Packet marking is a general technique to trace back attackers. The main idea in packet marking is to insert some trace back data in each packet. The general technique used is to encode the IP address of the edge router into each incoming packet and store it in the 16-bit ID field of the IP packet header. Since information of a 32-bit field is converted to a 16-bit field, irrespective of the hash function used, collisions occur. This means there will be false positives (that is incorrectly identifying a legitimate user as attacker) and the problem will escalate as the size of the network increase. To avoid such collisions, we propose to explore the feasibility of using packet marks that is not directly dependant on the IP address of the packet.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127977397","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":"Automatically Repairing Stripped Executables with CFG Microsurgery","authors":"Scott E Friedman, D. Musliner","doi":"10.1109/SASOW.2015.21","DOIUrl":"https://doi.org/10.1109/SASOW.2015.21","url":null,"abstract":"BINSURGEON is a binary rewriting system that enhances stripped binary executables with repairs, defenses, and additional functionality. This involves making space-consuming changes to the program's control flow graph (CFG), recomputing instruction content, and relocating instructions, all while preserving functionality in the remainder of the program's control flow. BINSURGEON uses extendable rewrite templates that enable other systems to specify and parameterize program modifications, which allows BINSURGEON to be a fully-automatic component of a larger system. In this paper, we describe BINSURGEON in the context of the FUZZBOMB automated program analysis and repair system. We outline BIN Surgeon's general binary rewriting algorithm for modifying CFGs according to FUZZ Bomb's rewrite templates. We also review some of FUZZ Bomb's rewrite templates to demonstrate the diverse repair and defense strategies -- including stack protection, heap protection, CFI, pointer-checking, and more -- that are implemented by BINSURGEON to harden and repair vulnerable binaries.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115867189","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":"Incentive Mechanisms for Social Computing","authors":"Ognjen Scekic","doi":"10.1109/SASOW.2015.32","DOIUrl":"https://doi.org/10.1109/SASOW.2015.32","url":null,"abstract":"Human participation in hybrid collective adaptive systems (hCAS) is overgrowing conventional social computing where humans solve simple, independent tasks. Novel systems are attempting to leverage humans for more intellectually challenging tasks, involving longer lasting worker engagement and complex collaboration patterns. This poses the problem of finding, engaging, motivating, retaining and assessing workers, thus adapting the participating workforce. Existing incentive management techniques in use in socio-technical platforms are not suitable for the more intellectually-challenging tasks. In addition, each platform currently develops custom solutions and implements them anew. This approach is not portable, and effectively prevents reuse of common incentive logic and reputation transfer. Consequently, this prevents workers from comparing different platforms, hindering the competitiveness of the virtual labor market and making it less attractive to skilled workers. This research attempts to develop an end-to-end solution for programmable incentive management for hybrid CASs. In particular, it presents a model and framework for execution of programmable incentive mechanisms, and a high-level domain-specific language for encoding complex incentive strategies for socio-technical systems, encouraging a modular approach in building incentive strategies, cutting down development and adjustment time and creating a basis for development of standardized but tweak able incentives. The presented contributions are based on a comprehensive, multidisciplinary review of existing literature on incentives and real-world incentive practices in social computing milieu.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132430917","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}
Thomas J. Glazier, J. Cámara, B. Schmerl, D. Garlan
{"title":"Analyzing Resilience Properties of Different Topologies of Collective Adaptive Systems","authors":"Thomas J. Glazier, J. Cámara, B. Schmerl, D. Garlan","doi":"10.1109/SASOW.2015.14","DOIUrl":"https://doi.org/10.1109/SASOW.2015.14","url":null,"abstract":"Modern software systems are often compositions of entities that increasingly use self-adaptive capabilities to improve their behavior to achieve systemic quality goals. Self adaptive managers for each component system attempt to provide locally optimal results, but if they cooperated and potentially coordinated their efforts it might be possible to obtain more globally optimal results. The emergent properties that result from such composition and cooperation of self-adaptive systems are not well understood, difficult to reason about, and present a key challenge in the evolution of modern software systems. For example, the effects of coordination patterns and protocols on emergent properties, such as the resiliency of the collectives, need to be understood when designing these systems. In this paper we propose that probabilistic model checking of stochastic multiplayer games (SMG) provides a promising approach to analyze, understand, and reason about emergent properties in collectives of adaptive systems (CAS). Probabilistic Model Checking of SMGs is a technique particularly suited to analyzing emergent properties in CAS since SMG models capture: (i) the uncertainty and variability intrinsic to a CAS and its execution environment in the form of probabilistic and nondeterministic choices, and (ii) the competitive/cooperative aspects of the interplay among the constituent systems of the CAS. Analysis of SMGs allows us to reason about things like the worst case scenarios, which constitutes a new contribution to understanding emergent properties in CAS. We investigate the use of SMGs to show how they can be useful in analyzing the impact of communication topology for collections of fully cooperative systems defending against an external attack.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073844","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}
Jan Kantert, C. Ringwald, Georg von Zengen, Sven Tomforde, L. Wolf, C. Müller-Schloer
{"title":"Enhancing RPL for Robust and Efficient Routing in Challenging Environments","authors":"Jan Kantert, C. Ringwald, Georg von Zengen, Sven Tomforde, L. Wolf, C. Müller-Schloer","doi":"10.1109/SASOW.2015.6","DOIUrl":"https://doi.org/10.1109/SASOW.2015.6","url":null,"abstract":"In typical settings for Wireless Sensor Networks (WSNs), a potentially large set of nodes operates under strict requirements concerning energy consumption and packet delivery success. If non-reliable or even malicious nodes participate, standard protocols can suffer in performance which may result in a limited functionality of the whole network. This paper addresses this issue by establishing end-to-end trust relationships among nodes with the goal to isolate malicious nodes. In order to increase the scalability towards large-scale system sizes, we extend the mechanism with an adaptive signature mechanism as basis for the trust value distribution technique. Evaluations cover a theoretical discussion and a simulation-based setting. The results show that malicious nodes can be quickly isolated. Thereby, the already low additional effort for trust can be reduced significantly compared to reference solutions.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127094709","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":"An Ecosystem Approach for Testing Self-Organizing, Adaptive Systems","authors":"Georgi A. Markov, J. Fröhlich","doi":"10.1109/SASOW.2015.24","DOIUrl":"https://doi.org/10.1109/SASOW.2015.24","url":null,"abstract":"A test-ecosystem is a configurable, modularized and scalable technology platform which combines test-relevant building blocks like roles, processes, strategies, methods, tools and technology from multiple sources and multiple vendors. Our objective is to provide an end-to-end testing environment for self-organizing and adaptive systems. Users customize test-ecosystem instances to suit needs dependent on parameters like business goals, intended uses, interfaces and test-system properties relevant to the system under test. Two test-ecosystem instances are presented here to illustrate the approach for testing different, concrete, real-world, safety-critical, real-time systems.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129301614","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}
Axel Habermaier, Benedikt Eberhardinger, H. Seebach, Johannes Leupolz, W. Reif
{"title":"Runtime Model-Based Safety Analysis of Self-Organizing Systems with S#","authors":"Axel Habermaier, Benedikt Eberhardinger, H. Seebach, Johannes Leupolz, W. Reif","doi":"10.1109/SASOW.2015.26","DOIUrl":"https://doi.org/10.1109/SASOW.2015.26","url":null,"abstract":"Self-organizing systems present a challenge for model-based safety analysis techniques: At design time, the potential system configurations are unknown, making it necessary to postpone the safety analyses to runtime. At runtime, however, model checking based safety analysis techniques are often too time-consuming because of the large state spaces that have to be analyzed. Based on the S# framework's support for runtime model adaptation, we modularize runtime safety analyses by splitting them into two parts, modeling and analyzing the self-organizing and non-self-organizing parts separately. With some additional heuristics, the resulting state space reduction facilitates the use of model checking based safety analysis techniques to analyze the safety of self-organizing systems. We outline this approach on a self-organizing production cell, assessing the self-organization's impact on the overall safety of the system.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122562718","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":"Rule Conflicts in Holonic Institutions","authors":"Jie Jiang, J. Pitt, A. Diaconescu","doi":"10.1109/SASOW.2015.13","DOIUrl":"https://doi.org/10.1109/SASOW.2015.13","url":null,"abstract":"Large-scale self-organised systems, such as distributed community energy systems, have called for coordination approaches that are able to deal with issues such as heterogeneity, inter-dependence and dynamic variability. Holonic institutions have been proposed as an approach to converging the structuration required for multi-scale, multi-criteria optimisation in nested enterprises with the formal representation of institutionalised powers required for the minimal recognition of the rights to self-organise. A holonic institution is composed of interrelated sub-institutions, each of which may again be composed of interrelated sub-institutions, and may itself be nested in a supra-institution. With constituting components having possibly conflicting interests and values, a critical module of such holonic structures is conflict resolution, i.e., Each institution must be able to detect and resolve conflicts (1) between its own rules and that of the supra-institution (external), and (2) between its own rules and that of the individual members (internal). For this purpose, this paper presents a detailed analysis of rule conflicts that may exist in holonic institutions. By means of Event Calculus, we provide a preliminary formalisation of such conflicts.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116049921","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}
Eric van den Berg, Isil Sebuktekin, M. Tauil, A. Ghetie, Scott Alexander
{"title":"Self Adaptive Robust Resource Allocation for Prioritized TCP Flows in Wireless Networks","authors":"Eric van den Berg, Isil Sebuktekin, M. Tauil, A. Ghetie, Scott Alexander","doi":"10.1109/SASOW.2015.22","DOIUrl":"https://doi.org/10.1109/SASOW.2015.22","url":null,"abstract":"We describe and demonstrate a fully distributed algorithm that enables prioritized TCP flows to allocate network resources (bandwidth) among themselves. The algorithm does not require any explicit communication among the different TCP flows. It enables autonomous adaptation to loss of network resources due to cyber attack or failure, while ensuring that users receive prioritized utility from available network resources.","PeriodicalId":384469,"journal":{"name":"2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130340167","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}