{"title":"A Distributed Population Management Approach for Mobile Agent Systems","authors":"B. Prosser, E. Fulp","doi":"10.1109/ACSOS49614.2020.00031","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00031","url":null,"abstract":"Many mobile agent systems rely on a population of software agents roaming a network of nodes (visitation sites) performing various tasks, such as monitoring security or measuring connectivity. For these systems, the number of agents in the population is critical for maintaining desired visitation rates throughout the network; however, the population distribution may change dramatically in reaction to an event, such as issues within the network or adversarial activity. As a result, population management is needed to ensure the number of agents in a system is available to achieve the system objectives. Although centralized management can be used to maintain agent populations, these approaches are not resilient to failure or scalable to large systems. This paper introduces a novel approach for managing the population of agents by governing the death and birth of agents through the distributed examination of the expected visitation rates. Nodes in the network individually monitor local visitation rates to determine if new agents should be created or destroyed, while queue management is used to distribute agents and dampen population oscillation (cyclical death and rebirth of all agents). Since these two population management components are available at every node, the agent population is maintained in a decentralized fashion. Experimental results demonstrate the proposed population management approach can appropriately manage an agent population under various conditions including sudden agent loss and attack situations.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133447030","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":"ENSURE: Efficient Scheduling and Autonomous Resource Management in Serverless Environments","authors":"Amoghavarsha Suresh, Gagan Somashekar, Anandh Varadarajan, Veerendra Ramesh Kakarla, Himanshu R Upadhyay, Anshul Gandhi","doi":"10.1109/ACSOS49614.2020.00020","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00020","url":null,"abstract":"An imminent challenge in the serverless computing landscape is the escalating cost of infrastructure needed to handle the growing traffic at scale. This work presents ENSURE, a function-level scheduler and autonomous resource manager designed to minimize provider resource costs while meeting customer performance requirements. ENSURE works by classifying incoming function requests at runtime and carefully regulating the resource usage of colocated functions on each invoker. Beyond a single invoker, ENSURE elastically scales capacity, using concepts from operations research, in response to varying workload traffic to prevent cold starts. Finally, ENSURE schedules requests by concentrating load on an adequate number of invokers to encourage reuse of active hosts (thus further avoiding cold starts) and allow unneeded capacity to provably and gracefully time out. We implement ENSURE on Apache OpenWhisk and show that, across several serverless applications and compared to existing baselines, ENSURE significantly improves resource efficiency, by as much as 52%, while providing acceptable application latency.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"518 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133634393","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}
Muhammad Wajahat, Bharath Balasubramanian, Anshul Gandhi, Gueyoung Jung, S. Narayanan
{"title":"MERIT: Model-driven Rehoming for VNF Chains","authors":"Muhammad Wajahat, Bharath Balasubramanian, Anshul Gandhi, Gueyoung Jung, S. Narayanan","doi":"10.1109/ACSOS49614.2020.00035","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00035","url":null,"abstract":"Network service providers often run service chains of Virtual Network Functions (VNFs) on privately owned clouds with limited capacity. These specialized service chains need to meet strict Service Level Objectives (SLOs), especially along the lines of availability (e.g., First responder services). Hence, VNFs in such thinly provisioned clouds may need to be frequently moved, or rehomed, when reacting to various cloud events like hotspots, failures and upgrades. In this paper, we perform a detailed measurement study to show that naive strategies for rehoming, applied uniformly across all VNFs of the service chain, are often sub-optimal when considering different metrics like the user-perceived service downtime and the provider-incurred time delay to complete the rehoming. We propose a novel ModEl-driven RehomIng Technique (MERIT) for VNF chains and empirically analyze the effect of various system parameters on different rehoming actions. Based on our analysis, we develop generic rehoming cost models and further, design and implement an autonomous rehoming system based on MERIT that identifies and executes the optimal rehoming action for each VNF in a service chain. Our experimental results on OpenStack using real-world chains show that MERIT can reduce the chain rehoming delay by up to 47% and the chain downtime by up to 49%.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795087","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":"Automated Management of Collections of Autonomic Systems","authors":"Thomas J. Glazier, D. Garlan, B. Schmerl","doi":"10.1109/ACSOS49614.2020.00029","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00029","url":null,"abstract":"Many applications have taken advantage of cloud provided autonomic capabilities, commonly auto-scaling, to harness easily available compute capacity to maintain performance against defined quality objectives. This has caused the management complexity of enterprise applications to increase. It is now common for an application to be a collection of autonomic sub-systems. Combining individual autonomic systems to create an application can lead to behaviors that negatively impact the global aggregate utility of the application and in some cases can be conflicting and self-destructive. Commonly, human administrators address these behaviors as part of a design time analysis of the situation or a run time mitigation of the undesired effects. However, the task of controlling and mitigating undesirable behaviors is complex and error prone. To handle the complexity of managing a collection of autonomic systems we have previously proposed an automated approach to the creation of a higher level autonomic management system, referred to as a Meta-Manager. In this paper, we improve upon prior work with a more streamlined and understandable formal representation of the approach, expand its capabilities to include global knowledge, and test its potential applicability and effectiveness by managing the complexity of a collection of autonomic systems in a case study of a major outage suffered by the Google Cloud Platform.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122494477","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":"ACSOS 2020 Index","authors":"","doi":"10.1109/acsos49614.2020.00048","DOIUrl":"https://doi.org/10.1109/acsos49614.2020.00048","url":null,"abstract":"","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122961088","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}
Joseph Hirsch, Martin Neumayer, Hella Ponsar, Oliver Kosak, W. Reif
{"title":"Deadlock Avoidance for Multiple Tasks in a Self-Organizing Production Cell","authors":"Joseph Hirsch, Martin Neumayer, Hella Ponsar, Oliver Kosak, W. Reif","doi":"10.1109/ACSOS49614.2020.00040","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00040","url":null,"abstract":"Deadlocks represent situations in which two participants are waiting for each other to finish an activity so that neither of them will ever finish. Deadlocks can occur in complex computer-integrated systems, such as flexible and self-organizing production systems. As deadlocks bring production to halt, methods for deadlock control in production systems are widely studied. Yet most algorithms proposed are not suited for the use in decentral multi-agent systems, as they require central control or can not handle concurrency. Other algorithms can be used in a decentral fashion but assume that only one type of product will be manufactured at a time. But in times of mass customization, where customers choose a product from a variety of options, support for several product types is required. To meet both the requirements of mass customization and decentral multi-agent systems, we present a new decentralized approach for avoiding deadlocks in a self-organizing production cell, where several types of products are being manufactured in parallel. Our approach is based solely on local knowledge and does not assume central control. We evaluate our approach in terms of effectiveness and message overhead to conclude that it avoids starvation and deadlocks with a reasonable message overhead.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114722766","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}
Sven Tomforde, Sarra M. Alqahtani, E. Bartocci, Jacob Beal, C. Landauer, Peter Lewis, Grace Liu, D. Menascé, George Mason, Bivas Mitra, Huasong Shan, Xiaoyun Zhu
{"title":"ACSOS 2020 Committees","authors":"Sven Tomforde, Sarra M. Alqahtani, E. Bartocci, Jacob Beal, C. Landauer, Peter Lewis, Grace Liu, D. Menascé, George Mason, Bivas Mitra, Huasong Shan, Xiaoyun Zhu","doi":"10.1109/acsos49614.2020.00011","DOIUrl":"https://doi.org/10.1109/acsos49614.2020.00011","url":null,"abstract":"Research Papers Sven Tomforde, Christian-Albrechts-Universität zu Kiel, Germany Timothy Wood, The George Washington University, USA Ahmed Ali-Eldin, UMass Amherst, USA Sarra Alqahtani, Wake Forest University Ozalp Babaoglu, Alma Mater Studiorum Università di Bologna, Italy Ezio Bartocci Jacob Beal, BBN Christian Becker, University of Mannheim Kirstie Bellman, Aerospace Corporation Robert Birke, ABB Future Labs Jean Botev, University of Luxembourg, Luxembourg Sara Bouchenak, INSA-Lyon Marco Brocanelli, Wayne State University Antonio Bucchiarone, Fondazione Bruno Kessler, Trento, Italy Giacomo Cabri, Università di Modena e Reggio Emilia, Italy Abhishek Chandra, University of Minnesota Lucy Cherkasova, ARM Research Siobhán Clarke, Trinity College Dublin, Ireland Christian López Del Álamo, La Salle University Joerg Denzinger, University of Calgary, Canada Ada Diaconescu, LTCI Lab, Telecom Paris, Institute Politechnqie de Paris, France Ivana Dusparic, Trinity College Dublin, Ireland Schahram Dustdar, TU Wien Markus Esch, Saarland University of Applied Sciences, Germany Lukas Esterle, Aarhus University, Denmark Antonio Filieri, Imperial College London, UK Jose Fortes, University of Florida, USA Rose Gamble, University of Tulsa Anshul Gandhi, Stony Brook University Kurt Geihs, Universität Kassel, Germany Marie-Pierre Gleizes, IRIT Université de Toulouse Christian Gruhl, Universität Kassel, Germany Xiaohui Gu, NC State University Tian Guo, Worcester Polytechnic Institute, USA Sebastian Götz, Technische Universität Dresden, Germany Heiko Hamann, University of Lübeck Rui Han, Beijing Institute of Technology Jinho Hwang, IBM Research David Irwin, UMass Amherst Mark Jelasity, University of Szeged Jeffrey Kephart, IBM Thomas J Watson Research Center George Kesidis, Penn State University David King Christian Krupitzer, University of Würzburg, Germany Philippe Lalanda, University of Grenoble Alpes","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132263354","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":"Message from the Program Committee Chairs: ACSOS 2020","authors":"","doi":"10.1109/acsos49614.2020.00006","DOIUrl":"https://doi.org/10.1109/acsos49614.2020.00006","url":null,"abstract":"","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402332","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":"Hierarchical Scaling of Microservices in Kubernetes","authors":"Fabiana Rossi, V. Cardellini, F. L. Presti","doi":"10.1109/ACSOS49614.2020.00023","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00023","url":null,"abstract":"In the last years, we have seen the increasing adoption of the microservice architectural style where applications satisfy user requests by invoking a set of independently deployable services. Software containers and orchestration tools, such as Kubernetes, have simplified the development and management of microservices. To manage containers’ horizontal elasticity, Kubernetes uses a decentralized threshold-based policy that requires to set thresholds on system-oriented metrics (i.e., CPU utilization). This might not be well-suited to scale latency-sensitive applications, which need to express requirements in terms of response time. Moreover, being a fully decentralized solution, it may lead to frequent and uncoordinated application reconfigurations.In this paper, we present me-kube (Multi-level Elastic Kubernetes), a Kubernetes extension that introduces a hierarchical architecture for controlling the elasticity of microservice-based applications. At higher level, a centralized per-application component coordinates the run-time adaptation of subordinated distributed components, which, in turn, locally control the adaptation of each microservice. Then, we propose novel proactive and reactive hierarchical control policies, based on queuing theory. To show that me-kube provides general mechanisms, we also integrate reinforcement learning-based scaling policies. Using me-kube, we perform a large set of experiments, aimed to show the advantages of a hierarchical control over the default Kubernetes autoscaler.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"85 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884480","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}
Cody Kinneer, R. V. Tonder, D. Garlan, Claire Le Goues
{"title":"Building Reusable Repertoires for Stochastic Self-* Planners","authors":"Cody Kinneer, R. V. Tonder, D. Garlan, Claire Le Goues","doi":"10.1109/ACSOS49614.2020.00045","DOIUrl":"https://doi.org/10.1109/ACSOS49614.2020.00045","url":null,"abstract":"Plan reuse is a promising approach for enabling self-* systems to effectively adapt to unexpected changes, such as evolving existing adaptation strategies after an unexpected change using stochastic search. An ideal self-* planner should be able to reuse repertoires of adaptation strategies, but this is challenging due to the evaluation overhead. For effective reuse, a repertoire should be both (a) likely to generalize to future situations, and (b) cost effective to evaluate. In this work, we present an approach inspired by chaos engineering for generating a diverse set of adaptation strategies to reuse, and we explore two analysis approaches based on clone detection and syntactic transformation for constructing repertoires of adaptation strategies that are likely to be amenable to reuse in stochastic search self-*planners. An evaluation of the proposed approaches on a simulated system inspired by Amazon Web Services shows planning effectiveness improved by up to 20% and reveals tradeoffs in planning timeliness and optimality.","PeriodicalId":310362,"journal":{"name":"2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)","volume":"1074 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122887691","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}