The continuous evolution of information and communication technology (ICT) systems opens a broad range of potential applications in domains such as smart environments, transportation, and energy management. However, it also brings a dramatic increase in complexity: the envisioned ICT systems run in highly dynamic socio-technico-physical environments, often composed of thousands or even millions of connected heterogeneous components, including social networks, web services, mobile computational devices , data centers, and environmental sensors. Traditional centralized approaches hardly deal with those new requirements, especially as far as robustness, resiliency, and complexity are concerned. Rather, computation needs to be carried out in a fully distributed way, and each computational component needs to be autonomous, adaptive, able to perceive contextual information from its environment, and able to collaborate with other components to coordinate emerging complex behaviors. Coordination models and languages, traditionally introduced to tackle interactions in complex systems by suitably designed abstractions such as shared spaces and channels , play a key role in such future and emerging ICT systems. A coordination model simplifies the integration of heterogeneous components (processes, objects, agents, services) and makes the resulting ensemble more smoothly executed as a whole, forming a distributed software system with desired characteristics and functionalities. More specifically, due to the clear separation between computation and interaction they promote , coordination models provide a natural support for injecting self-adaption and self-organization into applications, allowing one to achieve very complex and robust behaviors in terms of a coherent and simple set of coordination rules and mechanisms. All of this is carried out by means of coordination abstractions, languages, algorithms, mechanisms, and middleware specifically focused on the management of component interactions. The " Coordination Models, languages and applications " (CM) track started in 1998 at the ACM Symposium on Applied Computing (SAC) as one of the main scientific events under the umbrella of Coordination, specifically focused to fill the gap between theory and applications. During the successful series of its 17 editions, we have witnessed the emergence of models, formalisms, and mechanisms supporting distributed systems in a number of application scenarios. Most contributions crosscut a number of contemporary software engineering approaches and fields, attracting researchers from many areas inside ICT systems, such as multiagent systems, embedded systems, mobile computing, and robotics. In particular, the latest editions featured an increasing interest in self-adaptive and self-organizing mechanisms and systems. As a result, we decided to foster the development of coordination models …
{"title":"Best ACM SAC Articles on Coordination and Self-Adaptation","authors":"J. Fernandez-Marquez, Mirko Viroli, G. Castelli","doi":"10.1145/2628613","DOIUrl":"https://doi.org/10.1145/2628613","url":null,"abstract":"The continuous evolution of information and communication technology (ICT) systems opens a broad range of potential applications in domains such as smart environments, transportation, and energy management. However, it also brings a dramatic increase in complexity: the envisioned ICT systems run in highly dynamic socio-technico-physical environments, often composed of thousands or even millions of connected heterogeneous components, including social networks, web services, mobile computational devices , data centers, and environmental sensors. Traditional centralized approaches hardly deal with those new requirements, especially as far as robustness, resiliency, and complexity are concerned. Rather, computation needs to be carried out in a fully distributed way, and each computational component needs to be autonomous, adaptive, able to perceive contextual information from its environment, and able to collaborate with other components to coordinate emerging complex behaviors. Coordination models and languages, traditionally introduced to tackle interactions in complex systems by suitably designed abstractions such as shared spaces and channels , play a key role in such future and emerging ICT systems. A coordination model simplifies the integration of heterogeneous components (processes, objects, agents, services) and makes the resulting ensemble more smoothly executed as a whole, forming a distributed software system with desired characteristics and functionalities. More specifically, due to the clear separation between computation and interaction they promote , coordination models provide a natural support for injecting self-adaption and self-organization into applications, allowing one to achieve very complex and robust behaviors in terms of a coherent and simple set of coordination rules and mechanisms. All of this is carried out by means of coordination abstractions, languages, algorithms, mechanisms, and middleware specifically focused on the management of component interactions. The \" Coordination Models, languages and applications \" (CM) track started in 1998 at the ACM Symposium on Applied Computing (SAC) as one of the main scientific events under the umbrella of Coordination, specifically focused to fill the gap between theory and applications. During the successful series of its 17 editions, we have witnessed the emergence of models, formalisms, and mechanisms supporting distributed systems in a number of application scenarios. Most contributions crosscut a number of contemporary software engineering approaches and fields, attracting researchers from many areas inside ICT systems, such as multiagent systems, embedded systems, mobile computing, and robotics. In particular, the latest editions featured an increasing interest in self-adaptive and self-organizing mechanisms and systems. As a result, we decided to foster the development of coordination models …","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"66 1","pages":"6:1-6:2"},"PeriodicalIF":2.7,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91335940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The evolution of smartphones has given rise to urban-area applications: applications that communicate in a city by means of the public (moving) infrastructure (e.g., buses and trams). In this setting, applications need to communicate with and discover each other using intermediaries that move around the city and transfer data between them. This requires programmers to scatter code that deals with routing messages to the correct place and deal with network failures all over their programs. Our approach allows the programmer to specify urban-area applications in a high-level manner without the burden of directly encoding communication using intermediaries. We present this as a translation from a high-level object-oriented programming paradigm to a low-level communication mechanism. This translation allows the programmer to restrict routing of messages to, for example, a certain number of hops, geographic areas, or even types of carrier devices. In addition, we show how high-level group messaging can be efficiently represented in the low-level communication. Finally, we document our experiences in setting up a small-scale real-world urban-area application.
{"title":"Programming Urban-Area Applications by Exploiting Public Transportation","authors":"Dries Harnie, E. G. Boix, T. D'Hondt, W. Meuter","doi":"10.1145/2619999","DOIUrl":"https://doi.org/10.1145/2619999","url":null,"abstract":"The evolution of smartphones has given rise to urban-area applications: applications that communicate in a city by means of the public (moving) infrastructure (e.g., buses and trams). In this setting, applications need to communicate with and discover each other using intermediaries that move around the city and transfer data between them. This requires programmers to scatter code that deals with routing messages to the correct place and deal with network failures all over their programs. Our approach allows the programmer to specify urban-area applications in a high-level manner without the burden of directly encoding communication using intermediaries. We present this as a translation from a high-level object-oriented programming paradigm to a low-level communication mechanism. This translation allows the programmer to restrict routing of messages to, for example, a certain number of hops, geographic areas, or even types of carrier devices. In addition, we show how high-level group messaging can be efficiently represented in the low-level communication. Finally, we document our experiences in setting up a small-scale real-world urban-area application.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"3 1","pages":"8:1-8:20"},"PeriodicalIF":2.7,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76810947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Diego Didona, P. Romano, Sebastiano Peluso, F. Quaglia
In this article, we introduce TAS (Transactional Auto Scaler), a system for automating the elastic scaling of replicated in-memory transactional data grids, such as NoSQL data stores or Distributed Transactional Memories. Applications of TAS range from online self-optimization of in-production applications to the automatic generation of QoS/cost-driven elastic scaling policies, as well as to support for what-if analysis on the scalability of transactional applications. In this article, we present the key innovation at the core of TAS, namely, a novel performance forecasting methodology that relies on the joint usage of analytical modeling and machine learning. By exploiting these two classically competing approaches in a synergic fashion, TAS achieves the best of the two worlds, namely, high extrapolation power and good accuracy, even when faced with complex workloads deployed over public cloud infrastructures. We demonstrate the accuracy and feasibility of TAS’s performance forecasting methodology via an extensive experimental study based on a fully fledged prototype implementation integrated with a popular open-source in-memory transactional data grid (Red Hat’s Infinispan) and industry-standard benchmarks generating a breadth of heterogeneous workloads.
在本文中，我们将介绍TAS (Transactional Auto Scaler)，这是一个用于自动伸缩复制内存中的事务数据网格(如NoSQL数据存储或分布式事务内存)的系统。TAS的应用范围从生产应用程序的在线自优化到QoS/成本驱动的弹性扩展策略的自动生成，以及支持对事务性应用程序的可伸缩性进行假设分析。在本文中，我们提出了TAS核心的关键创新，即一种新的性能预测方法，该方法依赖于分析建模和机器学习的联合使用。通过以协同方式利用这两种经典的竞争方法，TAS实现了两个世界的最佳效果，即高外推能力和良好的准确性，即使面对部署在公共云基础设施上的复杂工作负载也是如此。我们通过一项广泛的实验研究，证明了TAS性能预测方法的准确性和可行性，该实验研究基于一个完全成熟的原型实现，该原型实现集成了一个流行的开源内存事务数据网格(Red Hat的Infinispan)和行业标准基准，生成了广泛的异构工作负载。
{"title":"Transactional Auto Scaler: Elastic Scaling of Replicated In-Memory Transactional Data Grids","authors":"Diego Didona, P. Romano, Sebastiano Peluso, F. Quaglia","doi":"10.1145/2620001","DOIUrl":"https://doi.org/10.1145/2620001","url":null,"abstract":"In this article, we introduce TAS (Transactional Auto Scaler), a system for automating the elastic scaling of replicated in-memory transactional data grids, such as NoSQL data stores or Distributed Transactional Memories. Applications of TAS range from online self-optimization of in-production applications to the automatic generation of QoS/cost-driven elastic scaling policies, as well as to support for what-if analysis on the scalability of transactional applications.\u0000 In this article, we present the key innovation at the core of TAS, namely, a novel performance forecasting methodology that relies on the joint usage of analytical modeling and machine learning. By exploiting these two classically competing approaches in a synergic fashion, TAS achieves the best of the two worlds, namely, high extrapolation power and good accuracy, even when faced with complex workloads deployed over public cloud infrastructures.\u0000 We demonstrate the accuracy and feasibility of TAS’s performance forecasting methodology via an extensive experimental study based on a fully fledged prototype implementation integrated with a popular open-source in-memory transactional data grid (Red Hat’s Infinispan) and industry-standard benchmarks generating a breadth of heterogeneous workloads.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"13 1","pages":"11:1-11:32"},"PeriodicalIF":2.7,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90077570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Evangelia Kalyvianaki, Themistoklis Charalambous, S. Hand
Resource management of virtualized servers in data centers has become a critical task, since it enables cost-effective consolidation of server applications. Resource management is an important and challenging task, especially for multitier applications with unpredictable time-varying workloads. Work in resource management using control theory has shown clear benefits of dynamically adjusting resource allocations to match fluctuating workloads. However, little work has been done toward adaptive controllers for unknown workload types. This work presents a new resource management scheme that incorporates the Kalman filter into feedback controllers to dynamically allocate CPU resources to virtual machines hosting server applications. We present a set of controllers that continuously detect and self-adapt to unforeseen workload changes. Furthermore, our most advanced controller also self-configures itself without any a priori information and with a small 4.8% performance penalty in the case of high-intensity workload changes. In addition, our controllers are enhanced to deal with multitier server applications: by using the pair-wise resource coupling between tiers, they improve server response to large workload increases as compared to controllers with no such resource-coupling mechanism. Our approaches are evaluated and their performance is illustrated on a 3-tier Rubis benchmark website deployed on a prototype Xen-virtualized cluster.
{"title":"Adaptive Resource Provisioning for Virtualized Servers Using Kalman Filters","authors":"Evangelia Kalyvianaki, Themistoklis Charalambous, S. Hand","doi":"10.1145/2626290","DOIUrl":"https://doi.org/10.1145/2626290","url":null,"abstract":"Resource management of virtualized servers in data centers has become a critical task, since it enables cost-effective consolidation of server applications. Resource management is an important and challenging task, especially for multitier applications with unpredictable time-varying workloads. Work in resource management using control theory has shown clear benefits of dynamically adjusting resource allocations to match fluctuating workloads. However, little work has been done toward adaptive controllers for unknown workload types. This work presents a new resource management scheme that incorporates the Kalman filter into feedback controllers to dynamically allocate CPU resources to virtual machines hosting server applications. We present a set of controllers that continuously detect and self-adapt to unforeseen workload changes. Furthermore, our most advanced controller also self-configures itself without any a priori information and with a small 4.8% performance penalty in the case of high-intensity workload changes. In addition, our controllers are enhanced to deal with multitier server applications: by using the pair-wise resource coupling between tiers, they improve server response to large workload increases as compared to controllers with no such resource-coupling mechanism. Our approaches are evaluated and their performance is illustrated on a 3-tier Rubis benchmark website deployed on a prototype Xen-virtualized cluster.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"283 1","pages":"10:1-10:35"},"PeriodicalIF":2.7,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78110698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Adaptiveness in distributed parallel applications is a key feature to provide satisfactory performance results in the face of unexpected events such as workload variations and time-varying user requirements. The adaptation process is based on the ability to change specific characteristics of parallel components (e.g., their parallelism degree) and to guarantee that such modifications of the application configuration are effective and durable. Reconfigurations often incur a cost on the execution (a performance overhead and/or an economic cost). For this reason advanced adaptation strategies have become of paramount importance. Effective strategies must achieve properties like control optimality (making decisions that optimize the global application QoS), reconfiguration stability expressed in terms of the average time between consecutive reconfigurations of the same component, and optimizing the reconfiguration amplitude (number of allocated/deallocated resources). To control such parameters, in this article we propose a method based on a Cooperative Model-based Predictive Control approach in which application controllers cooperate to make optimal reconfigurations and taking account of the durability and amplitude of their control decisions. The effectiveness and the feasibility of the methodology is demonstrated through experiments performed in a simulation environment and by comparing it with other existing techniques.
{"title":"A Cooperative Predictive Control Approach to Improve the Reconfiguration Stability of Adaptive Distributed Parallel Applications","authors":"G. Mencagli, M. Vanneschi, E. Vespa","doi":"10.1145/2567929","DOIUrl":"https://doi.org/10.1145/2567929","url":null,"abstract":"Adaptiveness in distributed parallel applications is a key feature to provide satisfactory performance results in the face of unexpected events such as workload variations and time-varying user requirements. The adaptation process is based on the ability to change specific characteristics of parallel components (e.g., their parallelism degree) and to guarantee that such modifications of the application configuration are effective and durable. Reconfigurations often incur a cost on the execution (a performance overhead and/or an economic cost). For this reason advanced adaptation strategies have become of paramount importance. Effective strategies must achieve properties like control optimality (making decisions that optimize the global application QoS), reconfiguration stability expressed in terms of the average time between consecutive reconfigurations of the same component, and optimizing the reconfiguration amplitude (number of allocated/deallocated resources). To control such parameters, in this article we propose a method based on a Cooperative Model-based Predictive Control approach in which application controllers cooperate to make optimal reconfigurations and taking account of the durability and amplitude of their control decisions. The effectiveness and the feasibility of the methodology is demonstrated through experiments performed in a simulation environment and by comparing it with other existing techniques.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"67 1","pages":"2:1-2:27"},"PeriodicalIF":2.7,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78676945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ana Peleteiro-Ramallo, J. C. Burguillo, J. Arcos, J. Rodríguez-Aguilar
In this article we tackle the problem of maximizing cooperation among self-interested agents in a resource exchange environment. Our main concern is the design of mechanisms for maximizing cooperation among self-interested agents in a way that their profits increase by exchanging or trading with resources. Although dynamic coalition formation and partner switching (rewiring) have been shown to promote the emergence and maintenance of cooperation for self-interested agents, no prior work in the literature has investigated whether merging both mechanisms exhibits positive synergies that lead to increase cooperation even further. Therefore, we introduce and analyze a novel dynamic coalition formation mechanism, that uses partner switching, to help self-interested agents to increase their profits in a resource exchange environment. Our experiments show the effectiveness of our mechanism at increasing the agents’ profits, as well as the emergence of trading as the preferred behavior over different types of complex networks.
{"title":"Fostering Cooperation through Dynamic Coalition Formation and Partner Switching","authors":"Ana Peleteiro-Ramallo, J. C. Burguillo, J. Arcos, J. Rodríguez-Aguilar","doi":"10.1145/2567928","DOIUrl":"https://doi.org/10.1145/2567928","url":null,"abstract":"In this article we tackle the problem of maximizing cooperation among self-interested agents in a resource exchange environment. Our main concern is the design of mechanisms for maximizing cooperation among self-interested agents in a way that their profits increase by exchanging or trading with resources. Although dynamic coalition formation and partner switching (rewiring) have been shown to promote the emergence and maintenance of cooperation for self-interested agents, no prior work in the literature has investigated whether merging both mechanisms exhibits positive synergies that lead to increase cooperation even further. Therefore, we introduce and analyze a novel dynamic coalition formation mechanism, that uses partner switching, to help self-interested agents to increase their profits in a resource exchange environment. Our experiments show the effectiveness of our mechanism at increasing the agents’ profits, as well as the emergence of trading as the preferred behavior over different types of complex networks.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"21 1","pages":"1:1-1:31"},"PeriodicalIF":2.7,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78703156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jiaqing Luo, Bin Xiao, Qingjun Xiao, Jiannong Cao, M. Guo
BitTorrent (BT) is one of the most common Peer-to-Peer (P2P) file sharing protocols. Rather than downloading a file from a single source, the protocol allows users to join a swarm of peers to download and upload from each other simultaneously. Worms exploiting information from BT servers or trackers can cause serious damage to participating peers, which unfortunately has been neglected previously. In this article, we first present a new worm, called Adaptive BitTorrent worm (A-BT worm), which finds new victims and propagates sending forged requests to trackers. To reduce its abnormal behavior, the worm estimates the ratio of infected peers and adaptively adjusts its propagation speed. We then build a hybrid model to precisely characterize the propagation behavior of the worm. We also propose a statistical method to automatically detect the worm from the tracker by estimating the variance of the time intervals of requests. To slow down the worm propagation, we design a safe strategy in which the tracker returns secured peers when receives a request. Finally, we evaluate the accuracy of the hybrid model, and the effectiveness of our detection method and containment strategy through simulations.
{"title":"Modeling and Defending against Adaptive BitTorrent Worms in Peer-to-Peer Networks","authors":"Jiaqing Luo, Bin Xiao, Qingjun Xiao, Jiannong Cao, M. Guo","doi":"10.1145/2567925","DOIUrl":"https://doi.org/10.1145/2567925","url":null,"abstract":"BitTorrent (BT) is one of the most common Peer-to-Peer (P2P) file sharing protocols. Rather than downloading a file from a single source, the protocol allows users to join a swarm of peers to download and upload from each other simultaneously. Worms exploiting information from BT servers or trackers can cause serious damage to participating peers, which unfortunately has been neglected previously. In this article, we first present a new worm, called Adaptive BitTorrent worm (A-BT worm), which finds new victims and propagates sending forged requests to trackers. To reduce its abnormal behavior, the worm estimates the ratio of infected peers and adaptively adjusts its propagation speed. We then build a hybrid model to precisely characterize the propagation behavior of the worm. We also propose a statistical method to automatically detect the worm from the tracker by estimating the variance of the time intervals of requests. To slow down the worm propagation, we design a safe strategy in which the tracker returns secured peers when receives a request. Finally, we evaluate the accuracy of the hybrid model, and the effectiveness of our detection method and containment strategy through simulations.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"20 1","pages":"5:1-5:17"},"PeriodicalIF":2.7,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88985134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computing systems and networks become increasingly large and complex with a variety of compromises and vulnerabilities. The network security and privacy are of great concern today, where self-defense against different kinds of attacks in an autonomous and holistic manner is a challenging topic. To address this problem, we developed an innovative technology called Bionic Autonomic Nervous System (BANS). The BANS is analogous to biological nervous system, which consists of basic modules like cyber axon, cyber neuron, peripheral nerve and central nerve. We also presented an innovative self-defense mechanism which utilizes the Fuzzy Logic, Neural Networks, and Entropy Awareness, etc. Equipped with the BANS, computer and network systems can intelligently self-defend against both known and unknown compromises/attacks including denial of services (DoS), spyware, malware, and virus. BANS also enabled multiple computers to collaboratively fight against some distributed intelligent attacks like DDoS. We have implemented the BANS in practice. Some case studies and experimental results exhibited the effectiveness and efficiency of the BANS and the self-defense mechanism.
{"title":"Bionic Autonomic Nervous Systems for Self-Defense against DoS, Spyware, Malware, Virus, and Fishing","authors":"Yuan-Shun Dai, Yanping Xiang, Yi Pan","doi":"10.1145/2567924","DOIUrl":"https://doi.org/10.1145/2567924","url":null,"abstract":"Computing systems and networks become increasingly large and complex with a variety of compromises and vulnerabilities. The network security and privacy are of great concern today, where self-defense against different kinds of attacks in an autonomous and holistic manner is a challenging topic. To address this problem, we developed an innovative technology called Bionic Autonomic Nervous System (BANS). The BANS is analogous to biological nervous system, which consists of basic modules like cyber axon, cyber neuron, peripheral nerve and central nerve. We also presented an innovative self-defense mechanism which utilizes the Fuzzy Logic, Neural Networks, and Entropy Awareness, etc. Equipped with the BANS, computer and network systems can intelligently self-defend against both known and unknown compromises/attacks including denial of services (DoS), spyware, malware, and virus. BANS also enabled multiple computers to collaboratively fight against some distributed intelligent attacks like DDoS. We have implemented the BANS in practice. Some case studies and experimental results exhibited the effectiveness and efficiency of the BANS and the self-defense mechanism.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"28 1","pages":"4:1-4:20"},"PeriodicalIF":2.7,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77738282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Barna, Mark Shtern, Michael Smit, Vassilios Tzerpos, Marin Litoiu
Denial of Service (DoS) attacks overwhelm online services, preventing legitimate users from accessing a service, often with impact on revenue or consumer trust. Approaches exist to filter network-level attacks, but application-level attacks are harder to detect at the firewall. Filtering at this level can be computationally expensive and difficult to scale, while still producing false positives that block legitimate users. This article presents a model-based adaptive architecture and algorithm for detecting DoS attacks at the web application level and mitigating them. Using a performance model to predict the impact of arriving requests, a decision engine adaptively generates rules for filtering traffic and sending suspicious traffic for further review, where the end user is given the opportunity to demonstrate they are a legitimate user. If no legitimate user responds to the challenge, the request is dropped. Experiments performed on a scalable implementation demonstrate effective mitigation of attacks launched using a real-world DoS attack tool.
{"title":"Mitigating DoS Attacks Using Performance Model-Driven Adaptive Algorithms","authors":"C. Barna, Mark Shtern, Michael Smit, Vassilios Tzerpos, Marin Litoiu","doi":"10.1145/2567926","DOIUrl":"https://doi.org/10.1145/2567926","url":null,"abstract":"Denial of Service (DoS) attacks overwhelm online services, preventing legitimate users from accessing a service, often with impact on revenue or consumer trust. Approaches exist to filter network-level attacks, but application-level attacks are harder to detect at the firewall. Filtering at this level can be computationally expensive and difficult to scale, while still producing false positives that block legitimate users.\u0000 This article presents a model-based adaptive architecture and algorithm for detecting DoS attacks at the web application level and mitigating them. Using a performance model to predict the impact of arriving requests, a decision engine adaptively generates rules for filtering traffic and sending suspicious traffic for further review, where the end user is given the opportunity to demonstrate they are a legitimate user. If no legitimate user responds to the challenge, the request is dropped. Experiments performed on a scalable implementation demonstrate effective mitigation of attacks launched using a real-world DoS attack tool.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"4 1","pages":"3:1-3:26"},"PeriodicalIF":2.7,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90442699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the convergence of the Cyber-Physical World, user devices will act as proxies of the humans in the cyber world. They will be required to act in a vast information landscape, asserting the relevance of data spread in the cyber world, in order to let their human users become aware of the content they really need. This is a remarkably similar situation to what the human brain has to do all the time when deciding what information coming from the surrounding environment is interesting and what can simply be ignored. The brain performs this task using so called cognitive heuristics, i.e. simple, rapid, yet very effective schemes. In this article, we propose a new approach that exploits one of these heuristics, the recognition heuristic, for developing a self-adaptive system that deals with effective data dissemination in opportunistic networks. We show how to implement it and provide an extensive analysis via simulation. Specifically, results show that the proposed solution is as effective as state-of-the-art solutions for data dissemination in opportunistic networks, while requiring far less resources. Finally, our sensitiveness analysis shows how various parameters depend on the context where nodes are situated, and suggest corresponding optimal configurations for the algorithm.
{"title":"Design and Performance Evaluation of Data Dissemination Systems for Opportunistic Networks Based on Cognitive Heuristics","authors":"M. Conti, M. Mordacchini, A. Passarella","doi":"10.1145/2518017.2518018","DOIUrl":"https://doi.org/10.1145/2518017.2518018","url":null,"abstract":"In the convergence of the Cyber-Physical World, user devices will act as proxies of the humans in the cyber world. They will be required to act in a vast information landscape, asserting the relevance of data spread in the cyber world, in order to let their human users become aware of the content they really need. This is a remarkably similar situation to what the human brain has to do all the time when deciding what information coming from the surrounding environment is interesting and what can simply be ignored. The brain performs this task using so called cognitive heuristics, i.e. simple, rapid, yet very effective schemes. In this article, we propose a new approach that exploits one of these heuristics, the recognition heuristic, for developing a self-adaptive system that deals with effective data dissemination in opportunistic networks. We show how to implement it and provide an extensive analysis via simulation. Specifically, results show that the proposed solution is as effective as state-of-the-art solutions for data dissemination in opportunistic networks, while requiring far less resources. Finally, our sensitiveness analysis shows how various parameters depend on the context where nodes are situated, and suggest corresponding optimal configurations for the algorithm.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"40 1","pages":"12:1-12:32"},"PeriodicalIF":2.7,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78107695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：