Éric Piel, Alberto González-Sanchez, H. Groß, A. V. Gemund
An essential requirement for the operation of self-adaptive systems is information about their internal health state, i.e., the extent to which the constituent software and hardware components are still operating reliably. Accurate health information enables systems to recover automatically from (intermittent) failures in their components through selective restarting, or self-reconfiguration. This paper explores and assesses the utility of Spectrum-based Fault localisation (SFL) combined with automatic health monitoring for self-adaptive systems. Their applicability is evaluated through simulation of online diagnosis scenarios, and through implementation in an adaptive surveillance system inspired by our industrial partner. The results of the studies performed confirm that the combination of SFL with online monitoring can successfully provide health information and locate problematic components, so that adequate self-* techniques can be deployed.
{"title":"Spectrum-Based Health Monitoring for Self-Adaptive Systems","authors":"Éric Piel, Alberto González-Sanchez, H. Groß, A. V. Gemund","doi":"10.1109/SASO.2011.21","DOIUrl":"https://doi.org/10.1109/SASO.2011.21","url":null,"abstract":"An essential requirement for the operation of self-adaptive systems is information about their internal health state, i.e., the extent to which the constituent software and hardware components are still operating reliably. Accurate health information enables systems to recover automatically from (intermittent) failures in their components through selective restarting, or self-reconfiguration. This paper explores and assesses the utility of Spectrum-based Fault localisation (SFL) combined with automatic health monitoring for self-adaptive systems. Their applicability is evaluated through simulation of online diagnosis scenarios, and through implementation in an adaptive surveillance system inspired by our industrial partner. The results of the studies performed confirm that the combination of SFL with online monitoring can successfully provide health information and locate problematic components, so that adequate self-* techniques can be deployed.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129417384","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}
G. Valetto, Paul L. Snyder, Daniel J. Dubois, E. D. Nitto, N. M. Calcavecchia
A service network with decentralized ownership is a system where nodes offering a variety of services are administered by different organizations -- or even by a set of individuals. In such a context, nodes hosting services can dynamically enter and exit the system without prior notice, and there is no centralized point of control. If one wants to build into such a system the ability to direct incoming requests for the various hosted services to those nodes that can efficiently fulfill them, one option is to introduce in the system an entity that serves as a gateway to accept service requests, and is an intermediary to re-direct requests as needed. That implies that this intermediary is able to acquire and maintain accurate and up-to-date information on where it can direct incoming requests. Another option, which is the one we pursue in this paper, is to build the system as an overlay network, in which the nodes hosting instances of each of many different types of services can self-organize as "virtual clusters", and efficiently load-balance incoming requests amongst themselves. We describe our design and evaluation of a decentralized computing framework of this kind. We leverage a resilient peer-to-peer overlay that automatically re-configures its topology, responding to the number of different service types executing on the peer nodes, the dynamics of the participation of those nodes (peer churn), and the traffic coming into the system for the various services.
{"title":"A Self-Organized Load-Balancing Algorithm for Overlay-Based Decentralized Service Networks","authors":"G. Valetto, Paul L. Snyder, Daniel J. Dubois, E. D. Nitto, N. M. Calcavecchia","doi":"10.1109/SASO.2011.28","DOIUrl":"https://doi.org/10.1109/SASO.2011.28","url":null,"abstract":"A service network with decentralized ownership is a system where nodes offering a variety of services are administered by different organizations -- or even by a set of individuals. In such a context, nodes hosting services can dynamically enter and exit the system without prior notice, and there is no centralized point of control. If one wants to build into such a system the ability to direct incoming requests for the various hosted services to those nodes that can efficiently fulfill them, one option is to introduce in the system an entity that serves as a gateway to accept service requests, and is an intermediary to re-direct requests as needed. That implies that this intermediary is able to acquire and maintain accurate and up-to-date information on where it can direct incoming requests. Another option, which is the one we pursue in this paper, is to build the system as an overlay network, in which the nodes hosting instances of each of many different types of services can self-organize as \"virtual clusters\", and efficiently load-balance incoming requests amongst themselves. We describe our design and evaluation of a decentralized computing framework of this kind. We leverage a resilient peer-to-peer overlay that automatically re-configures its topology, responding to the number of different service types executing on the peer nodes, the dynamics of the participation of those nodes (peer churn), and the traffic coming into the system for the various services.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131758509","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}
Jonathan J. Hudson, J. Denzinger, Holger Kasinger, B. Bauer
An efficiency improvement advisor agent acts as a consultation service for a self-organizing multi-agent system that improves operational efficiency. It identifies recurrent tasks in past problems that allow the creation of so-called exception rules for individual agents to limit future inefficient behavior. There exists the danger that introduced rules could possibly infringe on the flexibility and therefore reliability of the system. In this paper, we present a dependable risk-aware efficiency improvement advisor that uses Monte Carlo simulation techniques in strategic analysis assessing the long-term potential and risks of prospective rules. Our experimental evaluation, for the domain of dynamic pickup and delivery problems, shows that the result is a minimal, yet effective, set of risk-averse exception rules. These rules can be provided to individual agents to reliably achieve an overall long-term improvement in efficiency while maintaining flexibility.
{"title":"Dependable Risk-Aware Efficiency Improvement for Self-Organizing Emergent Systems","authors":"Jonathan J. Hudson, J. Denzinger, Holger Kasinger, B. Bauer","doi":"10.1109/SASO.2011.12","DOIUrl":"https://doi.org/10.1109/SASO.2011.12","url":null,"abstract":"An efficiency improvement advisor agent acts as a consultation service for a self-organizing multi-agent system that improves operational efficiency. It identifies recurrent tasks in past problems that allow the creation of so-called exception rules for individual agents to limit future inefficient behavior. There exists the danger that introduced rules could possibly infringe on the flexibility and therefore reliability of the system. In this paper, we present a dependable risk-aware efficiency improvement advisor that uses Monte Carlo simulation techniques in strategic analysis assessing the long-term potential and risks of prospective rules. Our experimental evaluation, for the domain of dynamic pickup and delivery problems, shows that the result is a minimal, yet effective, set of risk-averse exception rules. These rules can be provided to individual agents to reliably achieve an overall long-term improvement in efficiency while maintaining flexibility.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923846","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}
Glenn A. Fink, C. Oehmen, J. Haack, A. McKinnon, E. Fulp, Michael B. Crouse
Providing security for enterprises is difficult due to the size and complexity of their computing and networking infrastructures. These environments consist of a large number of diverse systems and services that continually change, thus they are difficult to defend using current static-oriented defense mechanisms. This paper introduces a new security paradigm that mimics designs in nature to ensure the safety and soundness of infrastructures that are potentially very diverse and dynamic. Primary inspiration has come from ant colonies, social networking, and bioinformatics. The proposed framework combines these ideas to provide complex-adaptive security for computer systems, telecommunications, and critical Supervisory Control and Data Acquisition (SCADA) infrastructures.
{"title":"Bio-Inspired Enterprise Security","authors":"Glenn A. Fink, C. Oehmen, J. Haack, A. McKinnon, E. Fulp, Michael B. Crouse","doi":"10.1109/SASO.2011.33","DOIUrl":"https://doi.org/10.1109/SASO.2011.33","url":null,"abstract":"Providing security for enterprises is difficult due to the size and complexity of their computing and networking infrastructures. These environments consist of a large number of diverse systems and services that continually change, thus they are difficult to defend using current static-oriented defense mechanisms. This paper introduces a new security paradigm that mimics designs in nature to ensure the safety and soundness of infrastructures that are potentially very diverse and dynamic. Primary inspiration has come from ant colonies, social networking, and bioinformatics. The proposed framework combines these ideas to provide complex-adaptive security for computer systems, telecommunications, and critical Supervisory Control and Data Acquisition (SCADA) infrastructures.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127953931","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 propose A3SAN, a framework for context-aware, resource-aware, autonomic, and adaptive management of Sensor-Actuator Networks (SANSs). We introduce new techniques for autonomic network configuration and management in reaction to context and resource dynamics. We propose a novel approach for quantitative context representation and management based on Potential Fields that allows us to quantify interesting events spatiotemporally, and simplifies the fusionand grouping of concurrent contexts. Adaptability is achieved by associating each node in the network with a dynamic Node Affinity Profile, which determines its suitability to serve each event type. Different configuration and management tasks such as clustering, task allocation, and role assignment are carried out using a distributed variant of the Affinity Propagation algorithm. A Fuzzy Logic based decision-making engine provides effective context analysis and conflict resolution between competing tasks, enabling swift adaptation to context and resource dynamics. Using simulation, we evaluate the efficacy of these techniques, and their ability to achieve our goal of efficient and autonomous management of SANs.
{"title":"Towards Aware, Adaptive and Autonomic Sensor-Actuator Networks","authors":"M. ElGammal, M. Eltoweissy","doi":"10.1109/SASO.2011.43","DOIUrl":"https://doi.org/10.1109/SASO.2011.43","url":null,"abstract":"We propose A3SAN, a framework for context-aware, resource-aware, autonomic, and adaptive management of Sensor-Actuator Networks (SANSs). We introduce new techniques for autonomic network configuration and management in reaction to context and resource dynamics. We propose a novel approach for quantitative context representation and management based on Potential Fields that allows us to quantify interesting events spatiotemporally, and simplifies the fusionand grouping of concurrent contexts. Adaptability is achieved by associating each node in the network with a dynamic Node Affinity Profile, which determines its suitability to serve each event type. Different configuration and management tasks such as clustering, task allocation, and role assignment are carried out using a distributed variant of the Affinity Propagation algorithm. A Fuzzy Logic based decision-making engine provides effective context analysis and conflict resolution between competing tasks, enabling swift adaptation to context and resource dynamics. Using simulation, we evaluate the efficacy of these techniques, and their ability to achieve our goal of efficient and autonomous management of SANs.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809131","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}
J. Schmitt, Michael Roth, Rolf Kiefhaber, Florian Kluge, T. Ungerer
Organic Computing Systems feature self-organizing techniques to manage the rising complexity of distributed systems. This paper introduces an implementation of self-configuration, self-healing and self-optimization by means of an Organic Manager. The Organic Manager is based on an automated planner and integrated in a middleware. The Organic Manager unites formerly distributed self-x features to use synergetic effects. An evaluation with four scenarios compares the behavior of the system under two different planning models. We show that an automated planner can lead to an optimized system quickly and reliably.
{"title":"Using an Automated Planner to Control an Organic Middleware","authors":"J. Schmitt, Michael Roth, Rolf Kiefhaber, Florian Kluge, T. Ungerer","doi":"10.1109/SASO.2011.18","DOIUrl":"https://doi.org/10.1109/SASO.2011.18","url":null,"abstract":"Organic Computing Systems feature self-organizing techniques to manage the rising complexity of distributed systems. This paper introduces an implementation of self-configuration, self-healing and self-optimization by means of an Organic Manager. The Organic Manager is based on an automated planner and integrated in a middleware. The Organic Manager unites formerly distributed self-x features to use synergetic effects. An evaluation with four scenarios compares the behavior of the system under two different planning models. We show that an automated planner can lead to an optimized system quickly and reliably.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125865124","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}
Self-Modeling Systems are computing systems that have complete models of their own behavior, down to some level of detail, and that interpret those models to produce that behavior (in some applications, the interpreter itself is also modeled). Then when the system changes the models, it changes its own behavior. We have shown how our Wrappings integration infrastructure facilitates the construction, operation, and management of these systems, and the appropriate limitation of their variability. In this paper, we argue that the internal reflective processes are well-suited to representation by different languages, and that as more languages are used, each one can be simpler in definition and in its relationships to semiotically neighboring ones. Furthermore, the seeming proliferation of internal languages can be organized to have very little performance impact, since constant mappings can be made directly through partial evaluation. In computing terms, we are showing the useful separation into granularity and abstraction layers of the different kinds of activity descriptions needed in the models. We illustrate the methods and approach on CARS (Computational Architecture for Reflective Systems), a testbed for studying cooperating distributed embedded systems.
自我建模系统是一种计算系统，它对自己的行为有完整的模型，精确到某个细节级别，并解释这些模型以产生该行为(在某些应用程序中，解释器本身也被建模)。当系统改变模型时，它也改变了自己的行为。我们已经展示了我们的包装集成基础结构如何促进这些系统的构建、操作和管理，以及对其可变性的适当限制。在本文中，我们认为内部反思过程非常适合用不同的语言表示，并且随着使用更多的语言，每一种语言的定义及其与符号相邻语言的关系都可以更简单。此外，内部语言的表面扩散可以组织为对性能的影响很小，因为常数映射可以通过部分求值直接进行。在计算方面，我们展示了模型中需要的不同类型的活动描述的有用的粒度和抽象层的分离。本文以CARS (Computational Architecture for Reflective Systems)为例，阐述了研究协同分布式嵌入式系统的方法和途径。
{"title":"Layers of Languages for Self-Modeling Systems","authors":"C. Landauer","doi":"10.1109/SASO.2011.37","DOIUrl":"https://doi.org/10.1109/SASO.2011.37","url":null,"abstract":"Self-Modeling Systems are computing systems that have complete models of their own behavior, down to some level of detail, and that interpret those models to produce that behavior (in some applications, the interpreter itself is also modeled). Then when the system changes the models, it changes its own behavior. We have shown how our Wrappings integration infrastructure facilitates the construction, operation, and management of these systems, and the appropriate limitation of their variability. In this paper, we argue that the internal reflective processes are well-suited to representation by different languages, and that as more languages are used, each one can be simpler in definition and in its relationships to semiotically neighboring ones. Furthermore, the seeming proliferation of internal languages can be organized to have very little performance impact, since constant mappings can be made directly through partial evaluation. In computing terms, we are showing the useful separation into granularity and abstraction layers of the different kinds of activity descriptions needed in the models. We illustrate the methods and approach on CARS (Computational Architecture for Reflective Systems), a testbed for studying cooperating distributed embedded systems.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421069","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}
The growing popularity of grid and cloud computing has led to a renewed interest in resource control and coordination. The Actor model offers a convenient way for scheduling computations' access to resources by way of scheduling of the actor threads, however, efficient Actor implementations do not use a thread for each actor. This paper presents our work on integrating mechanisms for deadline assurance into an optimized implementation of Actors. We achieve this by using deadline-driven adaptive scheduling, which prioritizes individual message deliveries and method executions involved in a distributed computation. Additionally, a tuner dynamically balances the overhead of the control mechanisms against the extent of control exercised. Experiments shows that the approach offers effective support for timeliness requirements (for multimedia QoS, for example) at the cost of a relatively modest and adjustable overhead.
{"title":"Adaptive Scheduling and Overhead Tuning for Deadline Constrained Computations","authors":"Xinghui Zhao, Nadeem Jamali","doi":"10.1109/SASO.2011.32","DOIUrl":"https://doi.org/10.1109/SASO.2011.32","url":null,"abstract":"The growing popularity of grid and cloud computing has led to a renewed interest in resource control and coordination. The Actor model offers a convenient way for scheduling computations' access to resources by way of scheduling of the actor threads, however, efficient Actor implementations do not use a thread for each actor. This paper presents our work on integrating mechanisms for deadline assurance into an optimized implementation of Actors. We achieve this by using deadline-driven adaptive scheduling, which prioritizes individual message deliveries and method executions involved in a distributed computation. Additionally, a tuner dynamically balances the overhead of the control mechanisms against the extent of control exercised. Experiments shows that the approach offers effective support for timeliness requirements (for multimedia QoS, for example) at the cost of a relatively modest and adjustable overhead.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763522","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}
It is generally foreseen that the number of wirelessly connected networking devices will increase in the next decades, leading to a rise in the number of applications involving large-scale networks. A major building block for enabling self-* system properties in ad-hoc scenarios is the run-time discovery of neighboring devices and somewhat equivalently, the estimation of the local node density. This problem has been studied extensively before, mainly in the context of fully-connected, synchronized networks. In this paper, we propose a novel adaptive and decentralized solution, the NetDetect algorithm, to the problem of discovering neighbors in a dynamic wireless network. The main difference with existing state of the art is that we target dynamic scenarios, i.e., multihop mesh networks involving mobile devices. The algorithm exploits the beaconing communication mechanism, dynamically adapting the beacon rate of the devices in the network based on local estimates of neighbor densities. We evaluate NetDetect on a variety of networks with increasing levels of dynamics: fully-connected networks, static and mobile multi-hop mesh networks. Results show that NetDetect performs well in all considered scenarios, maintaining a high rate of neighbor discoveries and good estimate of the neighborhood density even in very dynamic situations. More importantly, the proposed solution is adaptive, tracking changes in the local environment of the nodes without any additional algorithmic reconfiguration. Comparison with existing approaches shows that the proposed scheme is efficient from both convergence time and energy perspectives.
{"title":"NetDetect: Neighborhood Discovery in Wireless Networks Using Adaptive Beacons","authors":"V. Iyer, Andrei Pruteanu, S. Dulman","doi":"10.1109/SASO.2011.14","DOIUrl":"https://doi.org/10.1109/SASO.2011.14","url":null,"abstract":"It is generally foreseen that the number of wirelessly connected networking devices will increase in the next decades, leading to a rise in the number of applications involving large-scale networks. A major building block for enabling self-* system properties in ad-hoc scenarios is the run-time discovery of neighboring devices and somewhat equivalently, the estimation of the local node density. This problem has been studied extensively before, mainly in the context of fully-connected, synchronized networks. In this paper, we propose a novel adaptive and decentralized solution, the NetDetect algorithm, to the problem of discovering neighbors in a dynamic wireless network. The main difference with existing state of the art is that we target dynamic scenarios, i.e., multihop mesh networks involving mobile devices. The algorithm exploits the beaconing communication mechanism, dynamically adapting the beacon rate of the devices in the network based on local estimates of neighbor densities. We evaluate NetDetect on a variety of networks with increasing levels of dynamics: fully-connected networks, static and mobile multi-hop mesh networks. Results show that NetDetect performs well in all considered scenarios, maintaining a high rate of neighbor discoveries and good estimate of the neighborhood density even in very dynamic situations. More importantly, the proposed solution is adaptive, tracking changes in the local environment of the nodes without any additional algorithmic reconfiguration. Comparison with existing approaches shows that the proposed scheme is efficient from both convergence time and energy perspectives.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114570335","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 tutorial gives an overview about mathematical modeling methods for complex and self-organizing systems. Modeling can be used for the analysis and optimization of existing systems and for the design and engineering of new systems. In this tutorial we classify modeling methods into macro-level modeling and micro-level modeling. By using a micro-level model, the behaviors of all entities of the system and the interactions between these entities have to be specified. The state space of such a model is the Cartesian product of the state spaces of each entity. For a macro level, many micro-level states are aggregated into a single macro-level state. The macro level model describes only the behavior of the variables of interest. Another classification for modeling methods is the time space: The advance of time can either be modeled discrete or continuous. This tutorial contains short introductions to some modeling methods (e.g. Markov chains, cellular automata, recurrence equations, differential equations) and a discussion about their possibilities for analysis, optimization, design and engineering of self-organizing systems. The applicability of the modeling methods are demonstrated in some use cases.
{"title":"Modeling and Application of Self-Organizing Systems","authors":"R. Holzer, H. Meer","doi":"10.1109/SASO.2011.38","DOIUrl":"https://doi.org/10.1109/SASO.2011.38","url":null,"abstract":"This tutorial gives an overview about mathematical modeling methods for complex and self-organizing systems. Modeling can be used for the analysis and optimization of existing systems and for the design and engineering of new systems. In this tutorial we classify modeling methods into macro-level modeling and micro-level modeling. By using a micro-level model, the behaviors of all entities of the system and the interactions between these entities have to be specified. The state space of such a model is the Cartesian product of the state spaces of each entity. For a macro level, many micro-level states are aggregated into a single macro-level state. The macro level model describes only the behavior of the variables of interest. Another classification for modeling methods is the time space: The advance of time can either be modeled discrete or continuous. This tutorial contains short introductions to some modeling methods (e.g. Markov chains, cellular automata, recurrence equations, differential equations) and a discussion about their possibilities for analysis, optimization, design and engineering of self-organizing systems. The applicability of the modeling methods are demonstrated in some use cases.","PeriodicalId":165565,"journal":{"name":"2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130010215","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
扫码关注我们
求助内容：
应助结果提醒方式：