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

Group Norms for Multi-Agent Organisations 多智能体组织的群体规范

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2882967

H. Aldewereld, Virginia Dignum, W. Vasconcelos

引用次数: 18

Controlling Negative Emergent Behavior by Graph Analysis at Runtime 运行时图分析控制消极突发行为

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2890507

Jan Kantert, Sven Tomforde, M. Kauder, Richard Scharrer, Sarah Edenhofer, J. Hähner, C. Müller-Schloer

{"title":"Controlling Negative Emergent Behavior by Graph Analysis at Runtime","authors":"Jan Kantert, Sven Tomforde, M. Kauder, Richard Scharrer, Sarah Edenhofer, J. Hähner, C. Müller-Schloer","doi":"10.1145/2890507","DOIUrl":"https://doi.org/10.1145/2890507","url":null,"abstract":"Self-organized systems typically consist of distributed autonomous entities. An increasing part of such systems is characterized by openness and heterogeneity of participants. For instance, open desktop computing grids provide a framework for unrestrictedly joining in. However, openness and heterogeneity present severe challenges to the overall system’s stability and efficiency since uncooperative and even malicious participants are free to join. A promising solution for this problem is to introduce technical trust as a basis; however, in turn, the utilization of trust opens space for negative emergent behavior. This article introduces a system-wide observation and control loop that influences the self-organized behavior to provide a performant and robust platform for benevolent participants. Thereby, the observation part is responsible for gathering information and deriving a system description. We introduce a graph-based approach to identify groups of suspicious or malicious agents and demonstrate that this clustering process is highly successful for the considered stereotype agent behaviors. In addition, the controller part guides the system behavior by issuing norms that make use of incentives and sanctions. We further present a concept for closing the control loop and show experimental results that highlight the potential benefit of establishing such a control loop.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131866796","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}

引用次数: 7

Modeling Robot Swarms Using Integrals of Birth-Death Processes 基于生灭过程积分的机器人群体建模

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2870637

Yara Khaluf, M. Dorigo

引用次数: 14

Trust-Based Decision Making in a Self-Adaptive Agent Organization 基于信任的自适应代理组织决策

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2839302

Kamilia Ahmadi, V. Allan

引用次数: 5

Inferring Software Component Interaction Dependencies for Adaptation Support 推断用于适配支持的软件组件交互依赖

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-02-03 DOI: 10.1145/2856035

N. Esfahani, E. Yuan, Kyle R. Canavera, S. Malek

{"title":"Inferring Software Component Interaction Dependencies for Adaptation Support","authors":"N. Esfahani, E. Yuan, Kyle R. Canavera, S. Malek","doi":"10.1145/2856035","DOIUrl":"https://doi.org/10.1145/2856035","url":null,"abstract":"A self-managing software system should be able to monitor and analyze its runtime behavior and make adaptation decisions accordingly to meet certain desirable objectives. Traditional software adaptation techniques and recent “models@runtime” approaches usually require an a priori model for a system’s dynamic behavior. Oftentimes the model is difficult to define and labor-intensive to maintain, and tends to get out of date due to adaptation and architecture decay. We propose an alternative approach that does not require defining the system’s behavior model beforehand, but instead involves mining software component interactions from system execution traces to build a probabilistic usage model, which is in turn used to analyze, plan, and execute adaptations. In this article, we demonstrate how such an approach can be realized and effectively used to address a variety of adaptation concerns. In particular, we describe the details of one application of this approach for safely applying dynamic changes to a running software system without creating inconsistencies. We also provide an overview of two other applications of the approach, identifying potentially malicious (abnormal) behavior for self-protection, and improving deployment of software components in a distributed setting for performance self-optimization. Finally, we report on our experiments with engineering self-management features in an emergency deployment system using the proposed mining approach.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122056023","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}

引用次数: 22

Enhancing Reliability of Workflow Execution Using Task Replication and Spot Instances 使用任务复制和Spot实例增强工作流执行的可靠性

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-02-03 DOI: 10.1145/2815624

Deepak Poola, K. Ramamohanarao, R. Buyya

{"title":"Enhancing Reliability of Workflow Execution Using Task Replication and Spot Instances","authors":"Deepak Poola, K. Ramamohanarao, R. Buyya","doi":"10.1145/2815624","DOIUrl":"https://doi.org/10.1145/2815624","url":null,"abstract":"Cloud environments offer low-cost computing resources as a subscription-based service. These resources are elastically scalable and dynamically provisioned. Furthermore, cloud providers have also pioneered new pricing models like spot instances that are cost-effective. As a result, scientific workflows are increasingly adopting cloud computing. However, spot instances are terminated when the market price exceeds the users bid price. Likewise, cloud is not a utopian environment. Failures are inevitable in such large complex distributed systems. It is also well studied that cloud resources experience fluctuations in the delivered performance. These challenges make fault tolerance an important criterion in workflow scheduling. This article presents an adaptive, just-in-time scheduling algorithm for scientific workflows. This algorithm judiciously uses both spot and on-demand instances to reduce cost and provide fault tolerance. The proposed scheduling algorithm also consolidates resources to further minimize execution time and cost. Extensive simulations show that the proposed heuristics are fault tolerant and are effective, especially under short deadlines, providing robust schedules with minimal makespan and cost.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133790202","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}

引用次数: 78

Connectivity Reestablishment in Self-Organizing Sensor Networks with Dumb Nodes 具有哑节点的自组织传感器网络连通性重建

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-01-13 DOI: 10.1145/2816820

Pushpendu Kar, Arijit Roy, S. Misra

{"title":"Connectivity Reestablishment in Self-Organizing Sensor Networks with Dumb Nodes","authors":"Pushpendu Kar, Arijit Roy, S. Misra","doi":"10.1145/2816820","DOIUrl":"https://doi.org/10.1145/2816820","url":null,"abstract":"In this work, we propose a scheme, named CoRAD, for the reestablishment of lost connectivity using sensor nodes with adjustable communication range in stationary wireless sensor networks (WSNs), when “dumb” behavior occurs some of the nodes. Due to the occurrence of such behavior, there may be temporary loss of connectivity between among the nodes. Such a phenomenon is different from the commonly known node isolation problem in stationary WSNs. The mere activation of intermediate sleep nodes cannot guarantee reestablishment of connectivity, because there may not exist neighbor nodes of the isolated nodes. On the contrary, the increase in communication range of a single sensor node may make it die quickly. Including this, a sensor node has maximum limit of increase in communication range that may not be sufficient to reestablish connectivity. Therefore, considering all these factors for self-organization of the network and isolated node re-connection, we propose a price-based scheme, which addresses the issue by activating intermediate sleep nodes or by adjusting the communication range of some of the other nodes in the network. The scheme also deactivates the additional activated nodes and reduces the increased communication range when the dumb nodes resume their normal behavior, upon the return of favorable environmental conditions. To implement the proposed scheme, CoRAD it is required to construct the network using GPS-enabled adjustable communication range sensor nodes. Through simulation we compare our proposed scheme with the existing topology management schemes -- LETC and A1 -- in the same scenario by considering the number of activated nodes, message overhead, and energy consumption. We find that the proposed scheme shows improved performance compared to the existing topology management schemes.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129431035","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}

引用次数: 19

Designing Adaptive Applications Deployed on Cloud Environments 设计部署在云环境中的自适应应用程序

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-01-13 DOI: 10.1145/2822896

P. Zoghi, Mark Shtern, Marin Litoiu, Hamoun Ghanbari

引用次数: 30

Just-in-Time Adaptive Algorithm for Optimal Parameter Setting in 802.15.4 WSNs 802.15.4 WSNs中参数最优设置的实时自适应算法

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-01-13 DOI: 10.1145/2818713

Simone Brienza, M. Roveri, Domenico De Guglielmo, G. Anastasi

引用次数: 12

Analyzing Latency-Aware Self-Adaptation Using Stochastic Games and Simulations 基于随机博弈和模拟的延迟感知自适应分析

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-01-13 DOI: 10.1145/2774222

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

{"title":"Analyzing Latency-Aware Self-Adaptation Using Stochastic Games and Simulations","authors":"J. Cámara, Gabriel A. Moreno, D. Garlan, B. Schmerl","doi":"10.1145/2774222","DOIUrl":"https://doi.org/10.1145/2774222","url":null,"abstract":"Self-adaptive systems must decide which adaptations to apply and when. In reactive approaches, adaptations are chosen and executed after some issue in the system has been detected (e.g., unforeseen attacks or failures). In proactive approaches, predictions are used to prepare the system for some future event (e.g., traffic spikes during holidays). In both cases, the choice of adaptation is based on the estimated impact it will have on the system. Current decision-making approaches assume that the impact will be instantaneous, whereas it is common that adaptations take time to produce their impact. Ignoring this latency is problematic because adaptations may not achieve their effect in time for a predicted event. Furthermore, lower impact but quicker adaptations may be ignored altogether, even if over time the accrued impact is actually higher. In this article, we introduce a novel approach to choosing adaptations that considers these latencies. To show how this improves adaptation decisions, we use a two-pronged approach: (i) model checking of Stochastic Multiplayer Games (SMGs) enables us to understand best- and worst-case scenarios of optimal latency-aware and non-latency-aware adaptation without the need to develop specific adaptation algorithms. However, since SMGs do not provide an algorithm to make choices at runtime, we propose a (ii) latency-aware adaptation algorithm to make decisions at runtime. Simulations are used to explore more detailed adaptation behavior and to check if the performance of the algorithm falls within the bounds predicted by SMGs. Our results show that latency awareness improves adaptation outcomes and also allows a larger set of adaptations to be exploited.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131122746","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}

引用次数: 31