ACM Transactions on Autonomous and Adaptive Systems (TAAS)最新文献_第6页

Model-Based Response Planning Strategies for Autonomic Intrusion Protection 基于模型的自主入侵防御响应规划策略

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2018-04-16 DOI: 10.1145/3168446

Stefano Iannucci, S. Abdelwahed

{"title":"Model-Based Response Planning Strategies for Autonomic Intrusion Protection","authors":"Stefano Iannucci, S. Abdelwahed","doi":"10.1145/3168446","DOIUrl":"https://doi.org/10.1145/3168446","url":null,"abstract":"The continuous increase in the quantity and sophistication of cyberattacks is making it more difficult and error prone for system administrators to handle the alerts generated by intrusion detection systems (IDSs). To deal with this problem, several intrusion response systems (IRSs) have been proposed lately. IRSs extend the IDSs by providing an automatic response to the detected attack. Such a response is usually selected either with a static attack-response mapping or by quantitatively evaluating all available responses, given a set of predefined criteria. In this article, we introduce a probabilistic model-based IRS built on the Markov decision process (MDP) framework. In contrast to most existing approaches to intrusion response, the proposed IRS effectively captures the dynamics of both the defended system and the attacker and is able to compose atomic response actions to plan optimal multiobjective long-term response policies to protect the system. We evaluate the effectiveness of the proposed IRS by showing that long-term response planning always outperforms short-term planning, and we conduct a thorough performance assessment to show that the proposed IRS can be adopted to protect large distributed systems at runtime.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122090836","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}

引用次数: 21

Self-Organizing Control Mechanism Based on Collective Decision-Making for Information Uncertainty 基于信息不确定性集体决策的自组织控制机制

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2018-04-16 DOI: 10.1145/3183340

Naomi Kuze, D. Kominami, K. Kashima, T. Hashimoto, M. Murata

{"title":"Self-Organizing Control Mechanism Based on Collective Decision-Making for Information Uncertainty","authors":"Naomi Kuze, D. Kominami, K. Kashima, T. Hashimoto, M. Murata","doi":"10.1145/3183340","DOIUrl":"https://doi.org/10.1145/3183340","url":null,"abstract":"Because of the rapid growth in the scale and complexity of information networks, self-organizing systems are increasingly being used to realize novel network control systems that are highly scalable, adaptable, and robust. However, the uncertainty of information (with regard to incompleteness, vagueness, and dynamics) in self-organizing systems makes it difficult for them to work appropriately in accordance with the network state. In this study, we apply a model of the collective decision-making of animal groups to enable self-organizing control mechanisms to adapt to information uncertainty. Specifically, we apply a mathematical model of collective decision-making that is known as the effective leadership model (ELM). In the ELM, informed individuals (those who are experienced or well-informed) take the role of leading the others. In contrast, uninformed individuals (those who perceive only local information) follow neighboring individuals. As a result of the collective behavior of informed/uninformed individuals, the animal group achieves consensus. We consider a self-organizing control mechanism using potential-based routing with an optimal control, and propose a mechanism for determining a data-packet forwarding scheme based on the ELM. Through evaluation by simulation, we show that, in a situation in which the perceived information is incomplete and dynamic, nodes can forward data packets in accordance with the network state by applying the ELM.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"94 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120925570","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}

引用次数: 2

Flexible and Efficient Decision-Making for Proactive Latency-Aware Self-Adaptation 主动延迟感知自适应的灵活高效决策

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2018-04-16 DOI: 10.1145/3149180

Gabriel A. Moreno, J. Cámara, D. Garlan, B. Schmerl

{"title":"Flexible and Efficient Decision-Making for Proactive Latency-Aware Self-Adaptation","authors":"Gabriel A. Moreno, J. Cámara, D. Garlan, B. Schmerl","doi":"10.1145/3149180","DOIUrl":"https://doi.org/10.1145/3149180","url":null,"abstract":"Proactive latency-aware adaptation is an approach for self-adaptive systems that considers both the current and anticipated adaptation needs when making adaptation decisions, taking into account the latency of the available adaptation tactics. Since this is a problem of selecting adaptation actions in the context of the probabilistic behavior of the environment, Markov decision processes (MDPs) are a suitable approach. However, given all the possible interactions between the different and possibly concurrent adaptation tactics, the system, and the environment, constructing the MDP is a complex task. Probabilistic model checking has been used to deal with this problem, but it requires constructing the MDP every time an adaptation decision is made to incorporate the latest predictions of the environment behavior. In this article, we describe PLA-SDP, an approach that eliminates that runtime overhead by constructing most of the MDP offline. At runtime, the adaptation decision is made by solving the MDP through stochastic dynamic programming, weaving in the environment model as the solution is computed. We also present extensions that support different notions of utility, such as maximizing reward gain subject to the satisfaction of a probabilistic constraint, making PLA-SDP applicable to systems with different kinds of adaptation goals.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125890999","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}

引用次数: 34

Viable Algorithmic Options for Designing Reactive Robot Swarms 设计反应性机器人群的可行算法选择

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2018-04-16 DOI: 10.1145/3157087

T. Wareham, A. Vardy

{"title":"Viable Algorithmic Options for Designing Reactive Robot Swarms","authors":"T. Wareham, A. Vardy","doi":"10.1145/3157087","DOIUrl":"https://doi.org/10.1145/3157087","url":null,"abstract":"A central problem in swarm robotics is to design a controller that will allow the member robots of the swarm to collectively perform a given task. Of particular interest in massively distributed applications are reactive controllers with severely limited computational and sensory abilities. In this article, we give the results of the first computational complexity analysis of the reactive swarm design problem. Our core results are derived relative to a generalization of what is arguably the simplest possible type of reactive controller, the so-called computation-free controller proposed by Gauci et al., which operates in grid-based environments in a noncontinuous manner. We show that the design of a generalized computation-free swarm for an arbitrary given task in an arbitrary given environment is not polynomial-time solvable either in general or by the most desirable types of approximation algorithms (including evolutionary algorithms with high probabilities of producing correct solutions) but is solvable in effectively polynomial time relative to several types of restrictions on swarms, environments, and tasks. All of our results hold for the design of several more complex types of generalized computation-free swarms. Moreover, all of our intractability and inapproximability results hold for the design of any type of reactive swarm (including those based on the popular feed-forward neural network and Brooks-style subsumption controllers) operating in grid-based environments in a noncontinuous manner whose member robots satisfy two simple conditions. As such, our results give the first theoretical survey of the types of efficient exact and approximate solution algorithms that are and are not possible for designing several types of reactive swarms.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115645888","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}

引用次数: 8

Software Adaptation in Wireless Sensor Networks 无线传感器网络中的软件自适应

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2018-01-23 DOI: 10.1145/3145453

Mikhail Afanasov, L. Mottola, C. Ghezzi

{"title":"Software Adaptation in Wireless Sensor Networks","authors":"Mikhail Afanasov, L. Mottola, C. Ghezzi","doi":"10.1145/3145453","DOIUrl":"https://doi.org/10.1145/3145453","url":null,"abstract":"We present design concepts, programming constructs, and automatic verification techniques to support the development of adaptive Wireless Sensor Network (WSN) software. WSNs operate at the interface between the physical world and the computing machine and are hence exposed to unpredictable environment dynamics. WSN software must adapt to these dynamics to maintain dependable and efficient operation. However, developers are left without proper support to develop adaptive functionality in WSN software. Our work fills this gap with three key contributions: (i) design concepts help developers organize the necessary adaptive functionality and understand their relations, (ii) dedicated programming constructs simplify the implementations, (iii) custom verification techniques allow developers to check the correctness of their design before deployment. We implement dedicated tool support to tie the three contributions, facilitating their practical application. Our evaluation considers representative WSN applications to analyze code metrics, synthetic simulations, and cycle-accurate emulation of popular WSN platforms. The results indicate that our work is effective in simplifying the development of adaptive WSN software; for example, implementations are provably easier to test and to maintain, the run-time overhead of our dedicated programming constructs is negligible, and our verification techniques return results in a matter of seconds.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099579","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}

引用次数: 9

Performance and Cost Considerations for Providing Geo-Elasticity in Database Clouds 在数据库云中提供地理弹性的性能和成本考虑

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2017-12-18 DOI: 10.1145/3095891

Tian Guo, P. Shenoy

{"title":"Performance and Cost Considerations for Providing Geo-Elasticity in Database Clouds","authors":"Tian Guo, P. Shenoy","doi":"10.1145/3095891","DOIUrl":"https://doi.org/10.1145/3095891","url":null,"abstract":"Online applications that serve global workload have become a norm and those applications are experiencing not only temporal but also spatial workload variations. In addition, more applications are hosting their backend tiers separately for benefits such as ease of management. To provision for such applications, traditional elasticity approaches that only consider temporal workload dynamics and assume well-provisioned backends are insufficient. Instead, in this article, we propose a new type of provisioning mechanisms—geo-elasticity, by utilizing distributed clouds with different locations. Centered on this idea, we build a system called DBScale that tracks geographic variations in the workload to dynamically provision database replicas at different cloud locations across the globe. Our geo-elastic provisioning approach comprises a regression-based model that infers database query workload from spatially distributed front-end workload, a two-node open queueing network model that estimates the capacity of databases serving both CPU and I/O-intensive query workloads and greedy algorithms for selecting best cloud locations based on latency and cost. We implement a prototype of our DBScale system on Amazon EC2’s distributed cloud. Our experiments with our prototype show up to a 66% improvement in response time when compared to local elasticity approaches.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126102294","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}

引用次数: 0

MARC 马克

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2017-11-14 DOI: 10.1145/3127499

M. Ferroni, A. Corna, Andrea Damiani, Rolando Brondolin, J. Kubiatowicz, D. Sciuto, M. Santambrogio

引用次数: 7

On Ordering Multi-Robot Task Executions within a Cyber Physical System 在网络物理系统中排序多机器人任务执行

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2017-11-14 DOI: 10.1145/3124677

Tushar Semwal, S. S. Jha, S. B. Nair

{"title":"On Ordering Multi-Robot Task Executions within a Cyber Physical System","authors":"Tushar Semwal, S. S. Jha, S. B. Nair","doi":"10.1145/3124677","DOIUrl":"https://doi.org/10.1145/3124677","url":null,"abstract":"With robots entering the world of Cyber Physical Systems (CPS), ordering the execution of allocated tasks during runtime becomes crucial. This is so because, in the real world, there can be several physical tasks that use shared resources that need to be executed concurrently. In this article, we propose a mechanism to solve this issue of ordering task executions within a CPS that inherently handles mutual exclusion. The mechanism caters to a decentralized and distributed CPS comprising nodes such as computers, robots, and sensor nodes and uses mobile software agents that knit through them to aid the execution of the various tasks while also ensuring mutual exclusion of shared resources. The computations, communications, and control are achieved through these mobile agents. Physical execution of the tasks is performed by the robots in an asynchronous and pipelined manner without the use of a clock. The mechanism also features addition and deletion of tasks and insertion and removal of robots facilitating On-The-Fly Programming. As an application, a Warehouse Management System as a CPS has been implemented. The article concludes with the results and discussions on using the mechanism in both emulated and real-world environments.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127317281","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}

引用次数: 12

A Stepwise Auto-Profiling Method for Performance Optimization of Streaming Applications 流应用性能优化的逐步自动分析方法

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2017-11-14 DOI: 10.1145/3132618

Xunyun Liu, A. V. Dastjerdi, R. Calheiros, Chenhao Qu, R. Buyya

{"title":"A Stepwise Auto-Profiling Method for Performance Optimization of Streaming Applications","authors":"Xunyun Liu, A. V. Dastjerdi, R. Calheiros, Chenhao Qu, R. Buyya","doi":"10.1145/3132618","DOIUrl":"https://doi.org/10.1145/3132618","url":null,"abstract":"Data stream management systems (DSMSs) are scalable, highly available, and fault-tolerant systems that aggregate and analyze real-time data in motion. To continuously perform analytics on the fly within the stream, state-of-the-art DSMSs host streaming applications as a set of interconnected operators, with each operator encapsulating the semantic of a specific operation. For parallel execution on a particular platform, these operators need to be appropriately replicated in multiple instances that split and process the workload simultaneously. Because the way operators are partitioned affects the resulting performance of streaming applications, it is essential for DSMSs to have a method to compare different operators and make holistic replication decisions to avoid performance bottlenecks and resource wastage. To this end, we propose a stepwise profiling approach to optimize application performance on a given execution platform. It automatically scales distributed computations over streams based on application features and processing power of provisioned resources and builds the relationship between provisioned resources and application performance metrics to evaluate the efficiency of the resulting configuration. Experimental results confirm that the proposed approach successfully fulfills its goals with minimal profiling overhead.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126117935","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}

引用次数: 23

From DevOps to BizOps 从DevOps到BizOps

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2017-11-14 DOI: 10.1145/3139290

Marios Fokaefs, C. Barna, Marin Litoiu

{"title":"From DevOps to BizOps","authors":"Marios Fokaefs, C. Barna, Marin Litoiu","doi":"10.1145/3139290","DOIUrl":"https://doi.org/10.1145/3139290","url":null,"abstract":"Virtualization of resources in cloud computing has enabled developers to commission and recommission resources at will and on demand. This virtualization is a coin with two sides. On one hand, the flexibility in managing virtual resources has enabled developers to efficiently manage their costs; they can easily remove unnecessary resources or add resources temporarily when the demand increases. On the other hand, the volatility of such environment and the velocity with which changes can occur may have a greater impact on the economic position of a stakeholder and the business balance of the overall ecosystem. In this work, we recognise the business ecosystem of cloud computing as an economy of scale and explore the effect of this fact on decisions concerning scaling the infrastructure of web applications to account for fluctuations in demand. The goal is to reveal and formalize opportunities for economically optimal scaling that takes into account not only the cost of infrastructure but also the revenue from service delivery and eventually the profit of the service provider. The end product is a scaling mechanism that makes decisions based on both performance and economic criteria and takes adaptive actions to optimize both performance and profitability for the system.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114549569","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}

引用次数: 2