Two principles of enduring institutions for self-organising resource allocation are congruence of the allocation method to the resources available, and participation of those affected by the allocation (the appropriators) in selecting that method. However, the principles do not say anything explicitly about the fairness of the allocation method, or the outcomes. In this paper, we complement these principles with canons of distributive justice represented as legitimate claims, which are implemented as voting functions that determine the order in which resource requests are satisfied. The appropriators vote on the weight attached to the scoring functions, and so self-organise the allocation method. Experiments with a variation of the Linear Public Good game show that this pluralistic self-organising approach produces a better balance of utility and fairness (for agents that comply with the rules of the game) than monistic or fixed approaches.
{"title":"Self-Organising Common-Pool Resource Allocation and Canons of Distributive Justice","authors":"J. Pitt, J. Schaumeier, D. Busquets, S. Macbeth","doi":"10.1109/SASO.2012.31","DOIUrl":"https://doi.org/10.1109/SASO.2012.31","url":null,"abstract":"Two principles of enduring institutions for self-organising resource allocation are congruence of the allocation method to the resources available, and participation of those affected by the allocation (the appropriators) in selecting that method. However, the principles do not say anything explicitly about the fairness of the allocation method, or the outcomes. In this paper, we complement these principles with canons of distributive justice represented as legitimate claims, which are implemented as voting functions that determine the order in which resource requests are satisfied. The appropriators vote on the weight attached to the scoring functions, and so self-organise the allocation method. Experiments with a variation of the Linear Public Good game show that this pluralistic self-organising approach produces a better balance of utility and fairness (for agents that comply with the rules of the game) than monistic or fixed approaches.","PeriodicalId":126067,"journal":{"name":"2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122708358","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}
Engineering collective adaptive systems (CAS) is a challenging task. Concurrent systems, esp. when being large-scale, are known to be hard to design as the overall system behavior non-linearly results from local behavior and interactions. They are also hard to engineer and debug, as time dependent errors are often hard to reproduce. Simulation tools and environments are often used to assist in this task. From our experience in developing and using simulators for decentralized systems (in traffic, logistics and smart power grid management), we learned that a simulation environment should comply to the following quality criteria. First, from a software engineering point of view, a simulation environment itself must be designed up to the highest software quality standards - modularity, separation of concerns, test-driven development, guaranteed state consistency, etc. are particularly important quality criteria to ensure correctness, extensibility and manageability of the software. Second, the simulation environment must provide convenient support for using and extending the simulation environment, ease the visualization of solutions, and - since its use in scientific process - offer direct support for evaluating CAS through the set-up of experiments. In this paper, we present RinSim, an open source simulator that explicitly addresses these quality criteria, and targets the large family of transportation and logistics applications. RinSim separates the definition of the problem domain from the solution, has a modular design, is being developed in a test-driven way, etc. RinSim has been used and extended in a variety of cases within our research group, and served as the core platform in our educational program on multi-agent software development.
{"title":"RinSim: A Simulator for Collective Adaptive Systems in Transportation and Logistics","authors":"R. Lon, T. Holvoet","doi":"10.1109/SASO.2012.41","DOIUrl":"https://doi.org/10.1109/SASO.2012.41","url":null,"abstract":"Engineering collective adaptive systems (CAS) is a challenging task. Concurrent systems, esp. when being large-scale, are known to be hard to design as the overall system behavior non-linearly results from local behavior and interactions. They are also hard to engineer and debug, as time dependent errors are often hard to reproduce. Simulation tools and environments are often used to assist in this task. From our experience in developing and using simulators for decentralized systems (in traffic, logistics and smart power grid management), we learned that a simulation environment should comply to the following quality criteria. First, from a software engineering point of view, a simulation environment itself must be designed up to the highest software quality standards - modularity, separation of concerns, test-driven development, guaranteed state consistency, etc. are particularly important quality criteria to ensure correctness, extensibility and manageability of the software. Second, the simulation environment must provide convenient support for using and extending the simulation environment, ease the visualization of solutions, and - since its use in scientific process - offer direct support for evaluating CAS through the set-up of experiments. In this paper, we present RinSim, an open source simulator that explicitly addresses these quality criteria, and targets the large family of transportation and logistics applications. RinSim separates the definition of the problem domain from the solution, has a modular design, is being developed in a test-driven way, etc. RinSim has been used and extended in a variety of cases within our research group, and served as the core platform in our educational program on multi-agent software development.","PeriodicalId":126067,"journal":{"name":"2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131642886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Animation of Self-Organising Resource Allocation Using Presage2","authors":"S. Macbeth, J. Pitt, J. Schaumeier, D. Busquets","doi":"10.1109/SASO.2012.45","DOIUrl":"https://doi.org/10.1109/SASO.2012.45","url":null,"abstract":"This paper presents a demonstration of Presage2, a general purpose platform for developing animation and simulations of collective adaptive systems.","PeriodicalId":126067,"journal":{"name":"2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114095408","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 a study where small computer programs called digital organisms are evolved to construct communication networks in a virtual environment. Through the application of various selection pressures, we show how these organisms first evolve to build, and subsequently use, these networks for a collective communication task, specifically the efficient distribution of data among organisms. The results of our experiments demonstrate that evolutionary algorithms can discover behaviors for constructing networks that solve communication tasks, potentially leading to a new family of distributed algorithm where the underlying logical structure of the network automatically self-adapts to suit the application.
{"title":"Constructing Communication Networks with Evolved Digital Organisms","authors":"David B. Knoester, P. McKinley","doi":"10.1109/SASO.2012.34","DOIUrl":"https://doi.org/10.1109/SASO.2012.34","url":null,"abstract":"This paper describes a study where small computer programs called digital organisms are evolved to construct communication networks in a virtual environment. Through the application of various selection pressures, we show how these organisms first evolve to build, and subsequently use, these networks for a collective communication task, specifically the efficient distribution of data among organisms. The results of our experiments demonstrate that evolutionary algorithms can discover behaviors for constructing networks that solve communication tasks, potentially leading to a new family of distributed algorithm where the underlying logical structure of the network automatically self-adapts to suit the application.","PeriodicalId":126067,"journal":{"name":"2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129847407","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}
Most distributed applications involve some form of event-based interaction, often implemented using a publish-subscribe (pub-sub) infrastructure. To improve scalability, the acts of matching events against subscriptions and delivery them are performed collaboratively by a set of brokers connected into an overlay network. Recent research has proposed several approaches to support the self-adaptation of such overlay network to adapt it to changes in application traffic. However these approaches focus on the monitor, analyze, plan parts of the self-adaptation loop, without considering the issues that arise in the execution part. This paper proposes a set of primitives that fills the gap in the execution phase. Compared to existing work, our approach: (i) is transparent w.r.t. the routing policies of the middleware, (ii) preserves existing properties and guarantees of the middleware, such as no duplication of events, causal ordering, and minimal delays for the events delivered during a reconfiguration. We discuss the correctness of our primitives and implement them in a simulated environment to measure their cost in terms of network overhead.
{"title":"Reconfiguration Primitives for Self-Adapting Overlays in Distributed Publish-Subscribe Systems","authors":"E. D. Nitto, Daniel J. Dubois, Alessandro Margara","doi":"10.1109/SASO.2012.27","DOIUrl":"https://doi.org/10.1109/SASO.2012.27","url":null,"abstract":"Most distributed applications involve some form of event-based interaction, often implemented using a publish-subscribe (pub-sub) infrastructure. To improve scalability, the acts of matching events against subscriptions and delivery them are performed collaboratively by a set of brokers connected into an overlay network. Recent research has proposed several approaches to support the self-adaptation of such overlay network to adapt it to changes in application traffic. However these approaches focus on the monitor, analyze, plan parts of the self-adaptation loop, without considering the issues that arise in the execution part. This paper proposes a set of primitives that fills the gap in the execution phase. Compared to existing work, our approach: (i) is transparent w.r.t. the routing policies of the middleware, (ii) preserves existing properties and guarantees of the middleware, such as no duplication of events, causal ordering, and minimal delays for the events delivered during a reconfiguration. We discuss the correctness of our primitives and implement them in a simulated environment to measure their cost in terms of network overhead.","PeriodicalId":126067,"journal":{"name":"2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129263898","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
扫码关注我们
求助内容：
应助结果提醒方式：