首页 > 最新文献

2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops最新文献

英文 中文
Growing Self-Organized Design of Efficient and Robust Complex Networks 高效鲁棒复杂网络的成长自组织设计
Y. Hayashi
A self-organization of efficient and robust networks is important for a future design of communication or transportation systems, however both characteristics are incompatible in many real networks. Recently, it has been found that the robustness of onion-like structure with positive degree-degree correlations is optimal against intentional attacks. We show that, by biologically inspired copying, an onion-like network emerges in the incremental growth with functions of proxy access and reinforced connectivity on a space. The proposed network consists of the backbone of tree-like structure by copyings and the peripheral by adding shortcut links between low degree nodes to enhance the connectivity. It has the fine properties of the statistically self-averaging unlike the conventional duplication-divergence model, exponential-like degree distribution without overloaded hubs, strong robustness against both malicious attacks and random failures, and the efficiency with short paths counted by the number of hops as mediators and by the Euclidean distances. The adaptivity to heal over and to recover the performance of networking is also discussed for a change of environment in such disasters or battlefields on a geographical map. These properties will be useful for a resilient and scalable infrastructure of network systems even in emergent situations or poor environments.
高效且健壮的网络自组织对于未来通信或运输系统的设计非常重要,然而在许多实际网络中,这两种特征是不相容的。最近,研究发现,具有正度相关的洋葱状结构对故意攻击的鲁棒性是最佳的。我们表明,通过生物学启发的复制,一个类似洋葱的网络在增量增长中出现,具有代理访问和增强空间连通性的功能。该网络由树状结构的主干网络和通过在低度节点之间添加快捷链路来增强连通性的外围网络组成。它与传统的重复发散模型不同,具有统计自平均的优良特性,无过载集线器的指数型度分布,对恶意攻击和随机故障的鲁棒性强,以及通过跳数作为中介和欧几里得距离计算短路径的效率。本文还讨论了在地理地图上这种灾难或战场环境变化时,网络自愈和恢复性能的适应性。即使在紧急情况或恶劣环境中,这些属性对于网络系统的弹性和可扩展基础设施也很有用。
{"title":"Growing Self-Organized Design of Efficient and Robust Complex Networks","authors":"Y. Hayashi","doi":"10.1109/SASO.2014.17","DOIUrl":"https://doi.org/10.1109/SASO.2014.17","url":null,"abstract":"A self-organization of efficient and robust networks is important for a future design of communication or transportation systems, however both characteristics are incompatible in many real networks. Recently, it has been found that the robustness of onion-like structure with positive degree-degree correlations is optimal against intentional attacks. We show that, by biologically inspired copying, an onion-like network emerges in the incremental growth with functions of proxy access and reinforced connectivity on a space. The proposed network consists of the backbone of tree-like structure by copyings and the peripheral by adding shortcut links between low degree nodes to enhance the connectivity. It has the fine properties of the statistically self-averaging unlike the conventional duplication-divergence model, exponential-like degree distribution without overloaded hubs, strong robustness against both malicious attacks and random failures, and the efficiency with short paths counted by the number of hops as mediators and by the Euclidean distances. The adaptivity to heal over and to recover the performance of networking is also discussed for a change of environment in such disasters or battlefields on a geographical map. These properties will be useful for a resilient and scalable infrastructure of network systems even in emergent situations or poor environments.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"1 1","pages":"50-59"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85715470","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}
引用次数: 10
Social Capital as a Complexity Reduction Mechanism for Decision Making in Large Scale Open Systems 社会资本作为大规模开放系统决策复杂性降低机制
Patricio E. Petruzzi, D. Busquets, J. Pitt
A common requirement of distributed multi-agent systems is for the agents themselves to negotiate pairwise agreements on performing a joint action. In systems with endogenous resources, the cost of computing the decision-making has to be taken into account. If the computational resources expended in negotiating an optimal solution exceed the marginal benefits gained from that negotiation, then it would be more expedient and efficient to use the memory of past interactions to short-cut the complexity of decision-making in joint or collective actions of this kind. In social systems, it has been observed that social capital is an attribute of individuals that enhances their ability to solve collective action problems. In this paper, we define a new computational framework for representing and reasoning about electronic social capital, in which actions enhance or diminish three different forms of social capital (individual trustworthiness, social network, and institutions), and a decision-making model which uses social capital to decide whether to cooperate or defect in strategic games. A set of scenarios are presented where we believe that social capital can support effective collective action sustained over time, avoid suboptimal dominant strategies, and short-cut the computational costs involved in repetitious solving of strategic games.
分布式多智能体系统的一个常见需求是,代理本身就执行联合操作进行两两协商。在具有内生资源的系统中,必须考虑计算决策的成本。如果在协商一个最优解决方案时所花费的计算资源超过了从该协商中获得的边际效益,那么在这种联合或集体行动中,利用过去相互作用的记忆来缩短决策的复杂性将是更方便和有效的。在社会系统中,人们观察到社会资本是个体的一种属性,它增强了个体解决集体行动问题的能力。在本文中,我们定义了一个新的计算框架来表示和推理电子社会资本,其中行动增强或减少三种不同形式的社会资本(个人可信度、社会网络和制度),以及一个决策模型,该模型使用社会资本来决定在战略博弈中是合作还是背叛。我们提出了一系列情景,在这些情景中,我们相信社会资本可以支持长期持续的有效集体行动,避免次优优势策略,并缩短重复解决战略博弈所涉及的计算成本。
{"title":"Social Capital as a Complexity Reduction Mechanism for Decision Making in Large Scale Open Systems","authors":"Patricio E. Petruzzi, D. Busquets, J. Pitt","doi":"10.1109/SASO.2014.27","DOIUrl":"https://doi.org/10.1109/SASO.2014.27","url":null,"abstract":"A common requirement of distributed multi-agent systems is for the agents themselves to negotiate pairwise agreements on performing a joint action. In systems with endogenous resources, the cost of computing the decision-making has to be taken into account. If the computational resources expended in negotiating an optimal solution exceed the marginal benefits gained from that negotiation, then it would be more expedient and efficient to use the memory of past interactions to short-cut the complexity of decision-making in joint or collective actions of this kind. In social systems, it has been observed that social capital is an attribute of individuals that enhances their ability to solve collective action problems. In this paper, we define a new computational framework for representing and reasoning about electronic social capital, in which actions enhance or diminish three different forms of social capital (individual trustworthiness, social network, and institutions), and a decision-making model which uses social capital to decide whether to cooperate or defect in strategic games. A set of scenarios are presented where we believe that social capital can support effective collective action sustained over time, avoid suboptimal dominant strategies, and short-cut the computational costs involved in repetitious solving of strategic games.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"15 1","pages":"145-150"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86892426","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}
引用次数: 9
Dynamic Adaptation of the Traffic Management System CarDemo 交通管理系统CarDemo的动态适配
Arnaud Cordier, R. Domingues, Anthony Labaere, N. Noel, Adrien Thiery, Thomas Cerqueus, S. Clarke, P. Idziak, Hui Song, P. Perry, Anthony Ventresque
This paper demonstrates how we applied a constraint-based dynamic adaptation approach on CarDemo, a traffic management system. The approach allows domain experts to describe the adaptation goals as declarative constraints, and automatically plan the adaptation decisions to satisfy these constraints. We demonstrate how to utilise this approach to realise the dynamic switch of routing services of the traffic management system, according to the change of global system states and user requests.
本文演示了我们如何在交通管理系统CarDemo上应用基于约束的动态适应方法。该方法允许领域专家将适应目标描述为声明性约束,并自动规划适应决策以满足这些约束。我们演示了如何利用这种方法,根据全局系统状态和用户请求的变化,实现交通管理系统路由服务的动态切换。
{"title":"Dynamic Adaptation of the Traffic Management System CarDemo","authors":"Arnaud Cordier, R. Domingues, Anthony Labaere, N. Noel, Adrien Thiery, Thomas Cerqueus, S. Clarke, P. Idziak, Hui Song, P. Perry, Anthony Ventresque","doi":"10.1109/SASO.2014.40","DOIUrl":"https://doi.org/10.1109/SASO.2014.40","url":null,"abstract":"This paper demonstrates how we applied a constraint-based dynamic adaptation approach on CarDemo, a traffic management system. The approach allows domain experts to describe the adaptation goals as declarative constraints, and automatically plan the adaptation decisions to satisfy these constraints. We demonstrate how to utilise this approach to realise the dynamic switch of routing services of the traffic management system, according to the change of global system states and user requests.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"43 1","pages":"193-194"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91528171","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}
引用次数: 2
Interwoven Systems: Self-Improving Systems Integration 交织系统:自我改进的系统集成
K. Bellman, Sven Tomforde, R. Würtz
Current trends in information and communication technology show that systems are increasingly influencing each other -- which is seldom completely anticipated at design-time. As a result, mastering system integration with traditional methods becomes infeasible due to the resulting complexity. In this paper we argue that self-improving system integration is the most promising solution to counter the resulting challenges. Thereby, we highlight the different aspects of such a process with special attention to the optimisation question and discuss how approaches from the domain of self-organising systems -- in particular Organic and Autonomic Computing -- will be beneficial when researching possible solutions.
当前信息和通信技术的趋势表明,系统之间的相互影响越来越大——在设计时很少能完全预料到这一点。因此,由于系统集成的复杂性,用传统方法来掌握系统集成变得不可行。在本文中,我们认为自我改进的系统集成是应对由此带来的挑战的最有希望的解决方案。因此,我们强调了这一过程的不同方面,特别关注优化问题,并讨论了自组织系统领域的方法——特别是有机和自主计算——在研究可能的解决方案时是如何有益的。
{"title":"Interwoven Systems: Self-Improving Systems Integration","authors":"K. Bellman, Sven Tomforde, R. Würtz","doi":"10.1109/SASOW.2014.21","DOIUrl":"https://doi.org/10.1109/SASOW.2014.21","url":null,"abstract":"Current trends in information and communication technology show that systems are increasingly influencing each other -- which is seldom completely anticipated at design-time. As a result, mastering system integration with traditional methods becomes infeasible due to the resulting complexity. In this paper we argue that self-improving system integration is the most promising solution to counter the resulting challenges. Thereby, we highlight the different aspects of such a process with special attention to the optimisation question and discuss how approaches from the domain of self-organising systems -- in particular Organic and Autonomic Computing -- will be beneficial when researching possible solutions.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"81 1","pages":"123-127"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83246513","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}
引用次数: 37
"Self-Improving System Integration" - Preface for the SISSY14 Workshop “自我完善的系统集成”——SISSY14研讨会序言
K. Bellman, Sven Tomforde, R. Würtz
Self-Improving System Integration -- Preface for the SISSY14 Workshop.
自我完善的系统集成——SISSY14研讨会前言。
{"title":"\"Self-Improving System Integration\" - Preface for the SISSY14 Workshop","authors":"K. Bellman, Sven Tomforde, R. Würtz","doi":"10.1109/SASOW.2014.20","DOIUrl":"https://doi.org/10.1109/SASOW.2014.20","url":null,"abstract":"Self-Improving System Integration -- Preface for the SISSY14 Workshop.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"4 1","pages":"122-122"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79083916","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}
引用次数: 3
Plug-and-Play Hyper-heuristics: An Extended Formulation 即插即用超启发式:一个扩展公式
Patricia Ryser-Welch, J. Miller
Hyper-heuristics is a very active field that is developing all the time. This area of bio-inspired intelligent systems covers a wide range of algorithms selection techniques. This type of self-organising mechanism uses heuristics to optimise heuristics. Many discussions focus on the quality of solutions of the problems obtained from the hyper-heuristics, very little discussion concentrates on the generated algorithms themselves. Some hyper-heuristic frameworks tend to be highly constrained, their limited instruction sets prevent the state-of-the-art algorithms from being expressed. In addition, often the generated algorithms are not human-readable. In this paper, we propose a possible extension of some existing hyper-heuristic formulations, so that some of the current open issues can be addressed and it becomes possible to produce self-organizing heuristics that adapt themselves automatically to the environment when the class of problems changes. This together with the analysis of the evolved algorithms, may lead to human-competitive results.
超启发式是一个非常活跃的领域,一直在发展。生物智能系统的这一领域涵盖了广泛的算法选择技术。这种类型的自组织机制使用启发式来优化启发式。许多讨论集中在从超启发式中获得的问题解的质量上,很少讨论集中在生成的算法本身。一些超启发式框架往往是高度受限的,它们有限的指令集阻止了最先进的算法的表达。此外,生成的算法通常不是人类可读的。在本文中,我们提出了一些现有的超启发式公式的可能扩展,从而可以解决一些当前开放的问题,并且可以产生自组织启发式,当问题类别发生变化时自动适应环境。再加上对进化算法的分析,可能会产生与人类竞争的结果。
{"title":"Plug-and-Play Hyper-heuristics: An Extended Formulation","authors":"Patricia Ryser-Welch, J. Miller","doi":"10.1109/SASO.2014.33","DOIUrl":"https://doi.org/10.1109/SASO.2014.33","url":null,"abstract":"Hyper-heuristics is a very active field that is developing all the time. This area of bio-inspired intelligent systems covers a wide range of algorithms selection techniques. This type of self-organising mechanism uses heuristics to optimise heuristics. Many discussions focus on the quality of solutions of the problems obtained from the hyper-heuristics, very little discussion concentrates on the generated algorithms themselves. Some hyper-heuristic frameworks tend to be highly constrained, their limited instruction sets prevent the state-of-the-art algorithms from being expressed. In addition, often the generated algorithms are not human-readable. In this paper, we propose a possible extension of some existing hyper-heuristic formulations, so that some of the current open issues can be addressed and it becomes possible to produce self-organizing heuristics that adapt themselves automatically to the environment when the class of problems changes. This together with the analysis of the evolved algorithms, may lead to human-competitive results.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"1 1","pages":"179-180"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75811472","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}
引用次数: 4
Self-Managing Pervasive Computing 自我管理普适计算
P. Lalanda, J. Mccann, A. Diaconescu
The focus of this tutorial is to provide a synopsis of self-managing computing also known as Autonomic Computing. In doing so, we will introduce the techniques that enable computer systems to manage themselves so as to minimise the need for human input. This will also discuss how self-managing systems can address some of the issues resulting from the ever-increasing complexity of software administration and the growing difficulty encountered by software administrators in performing their job effectively.
本教程的重点是提供自我管理计算(也称为自主计算)的概要。在此过程中,我们将介绍使电脑系统能够自我管理的技术,以尽量减少对人工输入的需要。本文还将讨论自管理系统如何处理由于软件管理日益增加的复杂性和软件管理员在有效地执行其工作时遇到的日益增长的困难而产生的一些问题。
{"title":"Self-Managing Pervasive Computing","authors":"P. Lalanda, J. Mccann, A. Diaconescu","doi":"10.1109/SASOW.2014.42","DOIUrl":"https://doi.org/10.1109/SASOW.2014.42","url":null,"abstract":"The focus of this tutorial is to provide a synopsis of self-managing computing also known as Autonomic Computing. In doing so, we will introduce the techniques that enable computer systems to manage themselves so as to minimise the need for human input. This will also discuss how self-managing systems can address some of the issues resulting from the ever-increasing complexity of software administration and the growing difficulty encountered by software administrators in performing their job effectively.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"14 1","pages":"5-5"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82503902","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}
引用次数: 0
Towards Software Evolution for Embedded Systems Based on MAPE Loop Encapsulation 基于MAPE循环封装的嵌入式系统软件进化研究
Hiroyuki Nakagawa, Takumitsu Kudo, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga
Software evolution is an essential activity that adapts existing software to changes in requirements. Because of recent rapid requirements changes, systems are strongly required to evolve even if the target systems are embedded systems, whose implementation code is generally hard to be changed. This paper discusses the feasibility of applying self-adaptation mechanism for software evolution. We use the MAPE loop mechanism to evolve embedded systems without changing code inside the existing systems. This paper also reports preliminary results that we experimentally evolved a cleaning robot by following our approach. Our demonstrations show a part of additional behaviors as the results of software evolution that makes the cleaning robot possible to move obstacles. We also discuss the future directions of software evolution for embedded systems with the self-adaptive mechanism.
软件演进是使现有软件适应需求变化的基本活动。由于最近需求的快速变化,即使目标系统是嵌入式系统(其实现代码通常很难更改),也强烈要求系统进行发展。本文讨论了应用自适应机制进行软件进化的可行性。我们使用MAPE循环机制来发展嵌入式系统,而无需更改现有系统中的代码。本文还报道了我们通过实验进化出清洁机器人的初步结果。我们的演示展示了一部分额外的行为,作为软件进化的结果,使清洁机器人能够移动障碍物。讨论了基于自适应机制的嵌入式系统软件发展的未来方向。
{"title":"Towards Software Evolution for Embedded Systems Based on MAPE Loop Encapsulation","authors":"Hiroyuki Nakagawa, Takumitsu Kudo, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga","doi":"10.1109/SASO.2014.45","DOIUrl":"https://doi.org/10.1109/SASO.2014.45","url":null,"abstract":"Software evolution is an essential activity that adapts existing software to changes in requirements. Because of recent rapid requirements changes, systems are strongly required to evolve even if the target systems are embedded systems, whose implementation code is generally hard to be changed. This paper discusses the feasibility of applying self-adaptation mechanism for software evolution. We use the MAPE loop mechanism to evolve embedded systems without changing code inside the existing systems. This paper also reports preliminary results that we experimentally evolved a cleaning robot by following our approach. Our demonstrations show a part of additional behaviors as the results of software evolution that makes the cleaning robot possible to move obstacles. We also discuss the future directions of software evolution for embedded systems with the self-adaptive mechanism.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"16 1","pages":"203-204"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88292838","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}
引用次数: 1
Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation 基于在线模型估计的虚拟化应用运行时垂直扩展
Simon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne M. Holler, Rean Griffith
Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocation is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime "vertical scaling" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocation and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.
虚拟化数据中心中的应用程序在性能(例如,延迟或吞吐量)方面经常受到服务水平目标(slo)的约束。为了实现这些slo,有必要为应用程序分配足够的不同类型的资源(CPU、内存、I/O等)。但是,应用程序性能和资源分配之间的关系是复杂的,并且取决于多种因素,包括应用程序体系结构、系统配置和工作负载需求。在本文中,我们提出了一种基于模型的方法,通过运行应用程序的单个虚拟机(vm)的运行时“垂直扩展”(即添加或删除资源)来确保应用程序性能有效地满足用户定义的SLO。描述资源分配和观察到的应用程序性能之间关系的分层性能模型使用资源需求估计技术自动提取和在线更新。然后在反馈控制器中使用这样的模型来动态地调整单个vm的虚拟cpu数量。我们在VMware vSphere平台上实现了控制器,并在使用真实电子邮件和群件服务器的案例研究中对其进行了评估。实验结果表明,我们的方法允许托管应用程序在工作负载需求变化的情况下实现SLO满足,同时避免了最先进的基于阈值的控制器通常观察到的振荡。
{"title":"Runtime Vertical Scaling of Virtualized Applications via Online Model Estimation","authors":"Simon Spinner, Samuel Kounev, Xiaoyun Zhu, Lei Lu, Mustafa Uysal, Anne M. Holler, Rean Griffith","doi":"10.1109/SASO.2014.29","DOIUrl":"https://doi.org/10.1109/SASO.2014.29","url":null,"abstract":"Applications in virtualized data centers are often subject to Service Level Objectives (SLOs) regarding their performance (e.g., latency or throughput). In order to fulfill these SLOs, it is necessary to allocate sufficient resources of different types (CPU, memory, I/O, etc.) to an application. However, the relationship between the application performance and the resource allocation is complex and depends on multiple factors including application architecture, system configuration, and workload demands. In this paper, we present a model-based approach to ensure that the application performance meets the user-defined SLO efficiently by runtime \"vertical scaling\" (i.e., adding or removing resources) of individual virtual machines (VMs) running the application. A layered performance model describing the relationship between the resource allocation and the observed application performance is automatically extracted and updated online using resource demand estimation techniques. Such a model is then used in a feedback controller to dynamically adapt the number of virtual CPUs of individual VMs. We have implemented the controller on top of the VMware vSphere platform and evaluated it in a case study using a real-world email and groupware server. The experimental results show that our approach allows the managed application to achieve SLO satisfaction in spite of workload demand variation while avoiding oscillations commonly observed with state-of-the-art threshold-based controllers.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"23 1","pages":"157-166"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78943607","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}
引用次数: 49
On Intention-Propagation-Based Prediction in Autonomously Self-Adapting Navigation 基于意向传播的自主自适应导航预测研究
L. Varga
It is widely believed that road traffic as a whole self-adapts to the current situation to make travel times shorter by avoiding congestions, if the autonomously operating navigation devices exploit real-time traffic information. The classical theoretical models do not have definite answer if car navigation based on real-time data is able to self-adapt and produce better traffic or not. The novel theoretical approach to study this belief is the online routing game model. Current commercial car navigation systems are modelled with the class of simple naive online routing games. It is already proved that simple naive online routing games may show undesirable phenomena. One of the approaches to improve car navigation is intention-propagation-based prediction where agents share their intention and can forecast future travel times. In this paper we prove that in spite of exploiting prediction in online routing games, the phenomena studied in simple naive online routing games are still possible, although in a different way. With these results we point out where improvements are needed in collective adaptive systems composed of navigation devices.
人们普遍认为,如果自主操作的导航设备利用实时交通信息,那么道路交通作为一个整体会自我适应当前的情况,从而通过避免拥堵来缩短出行时间。基于实时数据的汽车导航是否能够自适应并产生更好的交通效果,经典的理论模型并没有给出明确的答案。研究这一信念的新颖理论方法是在线路由博弈模型。目前的商用车导航系统是用一类简单的在线路由游戏来建模的。已经证明,简单幼稚的网络路由游戏可能会出现不良现象。改进汽车导航的方法之一是基于意图传播的预测,其中智能体共享他们的意图并可以预测未来的旅行时间。在本文中,我们证明了尽管在在线路由游戏中利用了预测,但在简单的朴素在线路由游戏中研究的现象仍然是可能的,尽管方式不同。通过这些结果,我们指出了在由导航设备组成的集体自适应系统中需要改进的地方。
{"title":"On Intention-Propagation-Based Prediction in Autonomously Self-Adapting Navigation","authors":"L. Varga","doi":"10.12694/scpe.v16i3.1098","DOIUrl":"https://doi.org/10.12694/scpe.v16i3.1098","url":null,"abstract":"It is widely believed that road traffic as a whole self-adapts to the current situation to make travel times shorter by avoiding congestions, if the autonomously operating navigation devices exploit real-time traffic information. The classical theoretical models do not have definite answer if car navigation based on real-time data is able to self-adapt and produce better traffic or not. The novel theoretical approach to study this belief is the online routing game model. Current commercial car navigation systems are modelled with the class of simple naive online routing games. It is already proved that simple naive online routing games may show undesirable phenomena. One of the approaches to improve car navigation is intention-propagation-based prediction where agents share their intention and can forecast future travel times. In this paper we prove that in spite of exploiting prediction in online routing games, the phenomena studied in simple naive online routing games are still possible, although in a different way. With these results we point out where improvements are needed in collective adaptive systems composed of navigation devices.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"84 1","pages":"38-43"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79151247","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}
引用次数: 23
期刊
2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1