Danilo Pianini, Sascia Virruso, R. Menezes, Andrea Omicini, Mirko Viroli
In today’s data-intensive world, the need for data organization has increased dramatically. Distributed systems are dealing with unheard amounts of data arising primarily from the popularization of pervasive computing applications and the so-called “data-in-the-cloud” paradigm. Naturally, agent-coordination systems are affected by this data-increase phenomenon as they are often used as the basis for pervasive-computing frameworks and cloud-computing systems. There have been a few works on coordination system to include data self-organization (e.g. Swarm Linda) however they generally organize their data based on naive approaches where items are either completely similar or dissimilar (1|0 approach for matching of data). Although this approach is useful, in general-purpose systems where the diversity of data items is large, data items will rarely be considered as plainly similar, leading to a situation where data does not self-organize well. In this paper we move towards a general-purpose approach to organization based on an ontology-defined concept relationship in WordNet. In our approach, data items are seen as concepts that have relation to other concepts: tuples are driven towards one-another at rates that are proportional to the strength of tuple relationship. We demonstrate that this approach leads to a good mechanism to self-organize data in data-intensive environments.
{"title":"Self Organization in Coordination Systems Using a WordNet-Based Ontology","authors":"Danilo Pianini, Sascia Virruso, R. Menezes, Andrea Omicini, Mirko Viroli","doi":"10.1109/SASO.2010.35","DOIUrl":"https://doi.org/10.1109/SASO.2010.35","url":null,"abstract":"In today’s data-intensive world, the need for data organization has increased dramatically. Distributed systems are dealing with unheard amounts of data arising primarily from the popularization of pervasive computing applications and the so-called “data-in-the-cloud” paradigm. Naturally, agent-coordination systems are affected by this data-increase phenomenon as they are often used as the basis for pervasive-computing frameworks and cloud-computing systems. There have been a few works on coordination system to include data self-organization (e.g. Swarm Linda) however they generally organize their data based on naive approaches where items are either completely similar or dissimilar (1|0 approach for matching of data). Although this approach is useful, in general-purpose systems where the diversity of data items is large, data items will rarely be considered as plainly similar, leading to a situation where data does not self-organize well. In this paper we move towards a general-purpose approach to organization based on an ontology-defined concept relationship in WordNet. In our approach, data items are seen as concepts that have relation to other concepts: tuples are driven towards one-another at rates that are proportional to the strength of tuple relationship. We demonstrate that this approach leads to a good mechanism to self-organize data in data-intensive environments.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125658124","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}
Numerous applications can be formulated as a resource allocation problem, which require a distributed solving method especially when dynamic environments are considered. According to such methods, a solution does not only consist in an optimal allocation, but needs a sequence of transactions leading from a given initial allocation to an optimal one. Up to now, studies have been based on ideal contexts. Indeed, agents are omniscient and/or have complete communication abilities. Most of the time, these assumptions are not plausible. We propose in this paper a multi-agent system in which agents elaborate themselves optimal allocations by means of local negotiations. This self-organized system is based on a more realistic context, where provided solutions can be viewed as emergent phenomena. Agents have a limited perception of their environment and restricted communication abilities. We show that the individual rationality, does not allow the achievement of socially optimal allocations, and we propose a more suitable criterion: the sociability. Our method provides a sequence of transactions leading to an optimal allocation, according to any communication networks.
{"title":"Agent-Based Approach for Network Allocation Problems","authors":"A. Nongaillard, P. Mathieu","doi":"10.1109/SASO.2010.12","DOIUrl":"https://doi.org/10.1109/SASO.2010.12","url":null,"abstract":"Numerous applications can be formulated as a resource allocation problem, which require a distributed solving method especially when dynamic environments are considered. According to such methods, a solution does not only consist in an optimal allocation, but needs a sequence of transactions leading from a given initial allocation to an optimal one. Up to now, studies have been based on ideal contexts. Indeed, agents are omniscient and/or have complete communication abilities. Most of the time, these assumptions are not plausible. We propose in this paper a multi-agent system in which agents elaborate themselves optimal allocations by means of local negotiations. This self-organized system is based on a more realistic context, where provided solutions can be viewed as emergent phenomena. Agents have a limited perception of their environment and restricted communication abilities. We show that the individual rationality, does not allow the achievement of socially optimal allocations, and we propose a more suitable criterion: the sociability. Our method provides a sequence of transactions leading to an optimal allocation, according to any communication networks.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125261651","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}
Load-Balancing is a significant problem in heterogeneous distributed systems. Nowadays we face an extreme growth of computer systems and their complexities requiring advanced intelligent solutions for load-balancing that lead to autonomic self-organizing infrastructures. There is still a need to prove that real use cases can benefit from self-* approaches. We developed a pattern, called SILBA, for such an infrastructure based on decentralized control, intelligent and exchangeable policies for load-balancing, and black-board based communication mechanisms. Different types of algorithms (both intelligent and unintelligent) were plugged into SILBA. In this paper, we present one particular use-case – a Call Center that is operated in a Cloud environment.
{"title":"Applying Swarm Intelligence Algorithms for Dynamic Load Balancing to a Cloud Based Call Center","authors":"Vesna Šešum-Čavić, E. Kühn","doi":"10.1109/SASO.2010.19","DOIUrl":"https://doi.org/10.1109/SASO.2010.19","url":null,"abstract":"Load-Balancing is a significant problem in heterogeneous distributed systems. Nowadays we face an extreme growth of computer systems and their complexities requiring advanced intelligent solutions for load-balancing that lead to autonomic self-organizing infrastructures. There is still a need to prove that real use cases can benefit from self-* approaches. We developed a pattern, called SILBA, for such an infrastructure based on decentralized control, intelligent and exchangeable policies for load-balancing, and black-board based communication mechanisms. Different types of algorithms (both intelligent and unintelligent) were plugged into SILBA. In this paper, we present one particular use-case – a Call Center that is operated in a Cloud environment.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132654081","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}
This paper describes how software is able to autonomously adapt its security mechanisms based on knowledge from security ontology. Security adaptation is required because a software’s environment changes during run-time. Thus, all security requirements cannot be defined beforehand. To achieve security adaptation, we have combined a security ontology that defines security mechanisms, security objectives, and high level security measurements. The run-time security adaptation utilises this security ontology to adapt security mechanisms or their parameters to fulfil security requirements for each environment and usage situation. The novelty of this approach comes from the utilisation of ontologies and security measurements, which makes adaptation flexible. We validate our security adaptation with a case study in a smart space environment. The case study proves that security adaptation is able to work autonomously without other user actions.
{"title":"Ontology-Based Security Adaptation at Run-Time","authors":"Antti Evesti, E. Ovaska","doi":"10.1109/SASO.2010.11","DOIUrl":"https://doi.org/10.1109/SASO.2010.11","url":null,"abstract":"This paper describes how software is able to autonomously adapt its security mechanisms based on knowledge from security ontology. Security adaptation is required because a software’s environment changes during run-time. Thus, all security requirements cannot be defined beforehand. To achieve security adaptation, we have combined a security ontology that defines security mechanisms, security objectives, and high level security measurements. The run-time security adaptation utilises this security ontology to adapt security mechanisms or their parameters to fulfil security requirements for each environment and usage situation. The novelty of this approach comes from the utilisation of ontologies and security measurements, which makes adaptation flexible. We validate our security adaptation with a case study in a smart space environment. The case study proves that security adaptation is able to work autonomously without other user actions.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128130897","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}
We consider a wireless system in which a base station allocates bandwidth to users, based on their bandwidth requests in time frames. We design a self-tuning mechanism for the case when users may cheat by requesting more bandwidth than what they truly need, in order to relieve congestion for themselves when the system is overloaded. Our self-tuning mechanism guarantees that the system will automatically converge to the optimal throughput and fairness, even if cheating users are present. According to our results, it is possible to design an uncheatable allocation mechanism, in which self-tuning guarantees that the best strategy for each user is to play honestly.
{"title":"A Self-Tuning Protocol for Optimal Bandwidth Allocation in Wireless Networks","authors":"A. Faragó, Dung T. Tran","doi":"10.1109/SASO.2010.22","DOIUrl":"https://doi.org/10.1109/SASO.2010.22","url":null,"abstract":"We consider a wireless system in which a base station allocates bandwidth to users, based on their bandwidth requests in time frames. We design a self-tuning mechanism for the case when users may cheat by requesting more bandwidth than what they truly need, in order to relieve congestion for themselves when the system is overloaded. Our self-tuning mechanism guarantees that the system will automatically converge to the optimal throughput and fairness, even if cheating users are present. According to our results, it is possible to design an uncheatable allocation mechanism, in which self-tuning guarantees that the best strategy for each user is to play honestly.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666958","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}
At a tactical level, insurgents planning attacks with Improvised Explosive Devices (IEDs) are constrained in their choice of target by the specific location of their safe house or weapons cache, the geographic context in which they operate, and the pattern of potential targets as it presents itself at a given time. Geographic profiling in law-enforcement already takes advantage of similar constraints to identify possible origin locations of serial offenders. We show how geographic profiling of past IED events can significantly enhance our ability to identify areas at risk for future attacks. Specifically, we introduce three tightly coupled swarming pattern analysis models (profiling, clustering, forecasting) that refine each others' conclusions dynamically and point to systematic evaluation experiments that confirm the research hypothesis.
{"title":"Swarming Pattern Analysis to Identify IED Threat","authors":"Sven A. Brueckner, Steve Brophy, Elizabeth Downs","doi":"10.1109/SASO.2010.39","DOIUrl":"https://doi.org/10.1109/SASO.2010.39","url":null,"abstract":"At a tactical level, insurgents planning attacks with Improvised Explosive Devices (IEDs) are constrained in their choice of target by the specific location of their safe house or weapons cache, the geographic context in which they operate, and the pattern of potential targets as it presents itself at a given time. Geographic profiling in law-enforcement already takes advantage of similar constraints to identify possible origin locations of serial offenders. We show how geographic profiling of past IED events can significantly enhance our ability to identify areas at risk for future attacks. Specifically, we introduce three tightly coupled swarming pattern analysis models (profiling, clustering, forecasting) that refine each others' conclusions dynamically and point to systematic evaluation experiments that confirm the research hypothesis.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115210490","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}
Pub Date : 2010-09-27DOI: 10.1080/08839514.2012.653659
J. Fernandez-Marquez, J. Arcos, G. Serugendo
Localizing dynamically changing diffuse event sources in real environments is still an open problem in Wireless Sensor Networks (WSN). The dynamism of the environment, the energy limitations of the sensors, and the noise associated to the sensor's measurements is a challenge that a realistic solution has to deal with. In this paper we propose a decentralized approach to detect diffuse event sources in dynamic and noisy environments, using a Wireless Sensor Network infrastructure and following a gradient-based strategy.
{"title":"A Decentralized Approach for Detecting Dynamically Changing Diffuse Event Sources in Noisy WSN Environments","authors":"J. Fernandez-Marquez, J. Arcos, G. Serugendo","doi":"10.1080/08839514.2012.653659","DOIUrl":"https://doi.org/10.1080/08839514.2012.653659","url":null,"abstract":"Localizing dynamically changing diffuse event sources in real environments is still an open problem in Wireless Sensor Networks (WSN). The dynamism of the environment, the energy limitations of the sensors, and the noise associated to the sensor's measurements is a challenge that a realistic solution has to deal with. In this paper we propose a decentralized approach to detect diffuse event sources in dynamic and noisy environments, using a Wireless Sensor Network infrastructure and following a gradient-based strategy.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128376906","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}
Florian Dötsch, J. Denzinger, Holger Kasinger, B. Bauer
In this paper we present a self-organizing emergent multi-agent system designed for the decentralized real time control of water distribution networks. The agents, which are associated with every pump, tank, and water tower of such a distribution network, interact by means of a decentralized coordination mechanism based on digital info chemicals. In particular, they utilize a biologically-inspired coordination strategy, called indirect defense, which is used by certain plants in nature in order to get rid of herbivores. The experiments, which we have conducted on several different water distribution networks including one real-world municipal distribution network, demonstrate that the presented variants of our approach are able to achieve a self-organizing emergent solution comparable to the decisions made by inexperienced as well as experienced human operators, but with a higher flexibility, robustness, scalability, adaptivity, and autonomy.
{"title":"Decentralized Real-Time Control of Water Distribution Networks Using Self-Organizing Multi-agent Systems","authors":"Florian Dötsch, J. Denzinger, Holger Kasinger, B. Bauer","doi":"10.1109/SASO.2010.20","DOIUrl":"https://doi.org/10.1109/SASO.2010.20","url":null,"abstract":"In this paper we present a self-organizing emergent multi-agent system designed for the decentralized real time control of water distribution networks. The agents, which are associated with every pump, tank, and water tower of such a distribution network, interact by means of a decentralized coordination mechanism based on digital info chemicals. In particular, they utilize a biologically-inspired coordination strategy, called indirect defense, which is used by certain plants in nature in order to get rid of herbivores. The experiments, which we have conducted on several different water distribution networks including one real-world municipal distribution network, demonstrate that the presented variants of our approach are able to achieve a self-organizing emergent solution comparable to the decisions made by inexperienced as well as experienced human operators, but with a higher flexibility, robustness, scalability, adaptivity, and autonomy.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816121","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}
A completely evolvable genotype-phenotype mapping (ceGPM) is studied with respect to its capability of improving the flexibility of artificial evolution. By letting mutation affect not only controller genotypes, but also the mapping from genotype to phenotype, the future e effects of mutation can change over time. In this way, the need for prior parameter adaptation can be reduced. Experiments indicate that the ceGPM is capable of robustly adapting to a benchmark behavior. A comparison to a related approach shows significant improvements in evolvability.
{"title":"Evolvability in Evolutionary Robotics: Evolving the Genotype-Phenotype Mapping","authors":"L. König, H. Schmeck","doi":"10.1109/SASO.2010.27","DOIUrl":"https://doi.org/10.1109/SASO.2010.27","url":null,"abstract":"A completely evolvable genotype-phenotype mapping (ceGPM) is studied with respect to its capability of improving the flexibility of artificial evolution. By letting mutation affect not only controller genotypes, but also the mapping from genotype to phenotype, the future e effects of mutation can change over time. In this way, the need for prior parameter adaptation can be reduced. Experiments indicate that the ceGPM is capable of robustly adapting to a benchmark behavior. A comparison to a related approach shows significant improvements in evolvability.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123324350","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}
Frederic Armetta, Mohammed Haddad, S. Hassas, H. Kheddouci
Overlay topologies are often used in unstructured peer-to-peer networks in order to improve the global performance. Various research works dealing with communication issues of dynamic networks gave much interest to overlay topologies to get a better network organization. In fact, the use of such structures aim to decrease the impact of network dynamics while improving its scalability. Moreover, overlays offer a better management of data flows over the network. Recently, some overlays offering scale-free and/or small-world properties have been proposed. However, most of these works focus on structural aspects and do not give much importance the data carried by peers. In this paper, we show the complementarity of self-organization in overlay topologies and self-organizing search algorithms. We improve an existing approach of scale-free overlay topology by introducing mechanisms to take into account the utility of the information on peers and by a novel ant inspired approach based on foraging. We show how the combination of structural and semantic topological aspects with an ant inspired search algorithm is well adapted especially for rare information in the peer-to-peer network.
{"title":"Self-Organized Routing for Unstructured Peer-to-Peer Networks","authors":"Frederic Armetta, Mohammed Haddad, S. Hassas, H. Kheddouci","doi":"10.1109/SASO.2010.29","DOIUrl":"https://doi.org/10.1109/SASO.2010.29","url":null,"abstract":"Overlay topologies are often used in unstructured peer-to-peer networks in order to improve the global performance. Various research works dealing with communication issues of dynamic networks gave much interest to overlay topologies to get a better network organization. In fact, the use of such structures aim to decrease the impact of network dynamics while improving its scalability. Moreover, overlays offer a better management of data flows over the network. Recently, some overlays offering scale-free and/or small-world properties have been proposed. However, most of these works focus on structural aspects and do not give much importance the data carried by peers. In this paper, we show the complementarity of self-organization in overlay topologies and self-organizing search algorithms. We improve an existing approach of scale-free overlay topology by introducing mechanisms to take into account the utility of the information on peers and by a novel ant inspired approach based on foraging. We show how the combination of structural and semantic topological aspects with an ant inspired search algorithm is well adapted especially for rare information in the peer-to-peer network.","PeriodicalId":370044,"journal":{"name":"2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123543761","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：