umu.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Papadopoulos, AlessandroORCID iD iconorcid.org/0000-0002-1364-8127
Alternative names
Publications (5 of 5) Show all publications
Filieri, A., Maggio, M., Angelopoulos, K., D’ippolito, N., Gerostathopoulos, I., Hempel, A. B., . . . Vogel, T. (2017). Control Strategies for Self-Adaptive Software Systems. ACM Transactions on Autonomous and Adaptive Systems, 11(4), Article ID 24.
Open this publication in new window or tab >>Control Strategies for Self-Adaptive Software Systems
Show others...
2017 (English)In: ACM Transactions on Autonomous and Adaptive Systems, ISSN 1556-4665, E-ISSN 1556-4703, Vol. 11, no 4, article id 24Article in journal (Refereed) Published
Abstract [en]

The pervasiveness and growing complexity of software systems are challenging software engineering to design systems that can adapt their behavior to withstand unpredictable, uncertain, and continuously changing execution environments. Control theoretical adaptation mechanisms have received growing interest from the software engineering community in the last few years for their mathematical grounding, allowing formal guarantees on the behavior of the controlled systems. However, most of these mechanisms are tailored to specific applications and can hardly be generalized into broadly applicable software design and development processes.

This article discusses a reference control design process, from goal identification to the verification and validation of the controlled system. A taxonomy of the main control strategies is introduced, analyzing their applicability to software adaptation for both functional and nonfunctional goals. A brief extract on how to deal with uncertainty complements the discussion. Finally, the article highlights a set of open challenges, both for the software engineering and the control theory research communities.

Keywords
Self-adaptive software, control theory, non-functional properties, formal methods
National Category
Software Engineering Control Engineering
Identifiers
urn:nbn:se:umu:diva-135693 (URN)10.1145/3024188 (DOI)000395848000005 ()
Projects
Wallenberg Autonomous Systems and Software Program
Available from: 2017-06-02 Created: 2017-06-02 Last updated: 2018-06-09Bibliographically approved
Lakew, E. B., Papadopoulos, A. V., Maggio, M., Klein, C. & Elmroth, E. (2017). KPI-agnostic Control for Fine-Grained Vertical Elasticity. In: 2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID): . Paper presented at 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), MAY 14-17, 2017, Madrid, SPAIN (pp. 589-598). IEEE
Open this publication in new window or tab >>KPI-agnostic Control for Fine-Grained Vertical Elasticity
Show others...
2017 (English)In: 2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), IEEE , 2017, p. 589-598Conference paper, Published paper (Refereed)
Abstract [en]

Applications hosted in the cloud have become indispensable in several contexts, with their performance often being key to business operation and their running costs needing to be minimized. To minimize running costs, most modern virtualization technologies such as Linux Containers, Xen, and KVM offer powerful resource control primitives for individual provisioning - that enable adding or removing of fraction of cores and/or megabytes of memory for as short as few seconds. Despite the technology being ready, there is a lack of proper techniques for fine-grained resource allocation, because there is an inherent challenge in determining the correct composition of resources an application needs, with varying workload, to ensure deterministic performance.

This paper presents a control-based approach for the management of multiple resources, accounting for the resource consumption, together with the application performance, enabling fine-grained vertical elasticity. The control strategy ensures that the application meets the target performance indicators, consuming as less resources as possible. We carried out an extensive set of experiments using different applications – interactive with response-time requirements, as well as non-interactive with throughput desires – by varying the workload mixes of each application over time. The results demonstrate that our solution precisely provides guaranteed performance while at the same time avoiding both resource over- and under-provisioning.

Place, publisher, year, edition, pages
IEEE, 2017
Series
IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, ISSN 2376-4414
National Category
Computer Systems
Identifiers
urn:nbn:se:umu:diva-146250 (URN)10.1109/CCGRID.2017.71 (DOI)000426912900063 ()978-1-5090-6611-7 (ISBN)
Conference
17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), MAY 14-17, 2017, Madrid, SPAIN
Available from: 2018-05-16 Created: 2018-05-16 Last updated: 2018-06-09Bibliographically approved
Papadopoulos, A. V., Klein, C., Maggio, M., Dürango, J., Dellkrantz, M., Hernández-Rodriguez, F., . . . Årzén, K.-E. (2016). Control-based load-balancing techniques: Analysis and performance evaluation via a randomized optimization approach. Control Engineering Practice, 52, 24-34
Open this publication in new window or tab >>Control-based load-balancing techniques: Analysis and performance evaluation via a randomized optimization approach
Show others...
2016 (English)In: Control Engineering Practice, ISSN 0967-0661, E-ISSN 1873-6939, Vol. 52, p. 24-34Article in journal (Refereed) Published
Abstract [en]

Cloud applications are often subject to unexpected events like flashcrowds and hardware failures. Users that expect a predictable behavior may abandon an unresponsive application when these events occur. Researchers and engineers addressed this problem on two separate fronts: first, they introduced replicas - copies of the application with the same functionality - for redundancy and scalability; second, they added a self-adaptive feature called brownout inside cloud applications to bound response times by modulating user experience. The presence of multiple replicas requires a dedicated component to direct incoming traffic: a load-balancer. Existing load-balancing strategies based on response times interfere with the response time controller developed for brownout-compliant applications. In fact, the brownout approach bounds response times using a control action. Hence, the response time, that was used to aid load-balancing decision, is not a good indicator of how well a replica is performing. To fix this issue, this paper reviews some proposal for brownout-aware load-balancing and provides a comprehensive experimental evaluation that compares them. To provide formal guarantees on the load balancing performance, we use a randomized optimization approach and apply the scenario theory. We perform an extensive set of experiments on a real machine, extending the popular lighttpd web server and load-balancer, and obtaining a production-ready implementation. Experimental results show an improvement of the user experience over Shortest Queue First (SQF)-believed to be near-optimal in the non-adaptive case. The improved user experience is obtained preserving the response time predictability.

Place, publisher, year, edition, pages
Elsevier, 2016
Keywords
Load-balancing, Randomized optimization, Cloud control
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-119368 (URN)10.1016/j.conengprac.2016.03.020 (DOI)000377740300003 ()
Funder
Swedish Research Council, Cloud ControlSwedish Research Council, Power and temperature control for large-scale computing infrastructuresELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2016-04-18 Created: 2016-04-18 Last updated: 2018-06-07Bibliographically approved
Durango, J., Dellkrantz, M., Maggio, M., Klein, C., Papadopoulos, A. V., Hernandez-Rodriguez, F., . . . Arzen, K.-E. (2014). Control-theoretical load-balancing for cloud applications with brownout. In: 2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC): . Paper presented at IEEE 53rd Annual Conference on Decision and Control (CDC), DEC 15-17, 2014, Los Angeles, CA (pp. 5320-5327).
Open this publication in new window or tab >>Control-theoretical load-balancing for cloud applications with brownout
Show others...
2014 (English)In: 2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, p. 5320-5327Conference paper, Published paper (Refereed)
Abstract [en]

Cloud applications are often subject to unexpected events like flash crowds and hardware failures. Without a predictable behaviour, users may abandon an unresponsive application. This problem has been partially solved on two separate fronts: first, by adding a self-adaptive feature called brownout inside cloud applications to bound response times by modulating user experience, and, second, by introducing replicas - copies of the applications having the same functionalities - for redundancy and adding a load-balancer to direct incoming traffic. However, existing load-balancing strategies interfere with brownout self-adaptivity. Load-balancers are often based on response times, that are already controlled by the self-adaptive features of the application, hence they are not a good indicator of how well a replica is performing. In this paper, we present novel load-balancing strategies, specifically designed to support brownout applications. They base their decision not on response time, but on user experience degradation. We implemented our strategies in a self-adaptive application simulator, together with some state-of-the-art solutions. Results obtained in multiple scenarios show that the proposed strategies bring significant improvements when compared to the state-of-the-art ones.

National Category
Computer Systems Computer Engineering
Identifiers
urn:nbn:se:umu:diva-129842 (URN)10.1109/CDC.2014.7040221 (DOI)000370073805079 ()978-1-4673-6090-6 (ISBN)
Conference
IEEE 53rd Annual Conference on Decision and Control (CDC), DEC 15-17, 2014, Los Angeles, CA
Available from: 2017-01-16 Created: 2017-01-09 Last updated: 2018-06-09Bibliographically approved
Klein, C., Papadopoulos, A. V., Dellkrantz, M., Dürango, J., Maggio, M., Årzén, K.-E., . . . Elmroth, E. (2014). Improving Cloud Service Resilience using Brownout-Aware Load-Balancing. In: 2014 IEEE 33RD INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS): . Paper presented at 2014 IEEE 33RD INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), OCT 06-09, 2014, Nara, JAPAN (pp. 31-40). IEEE Computer Society
Open this publication in new window or tab >>Improving Cloud Service Resilience using Brownout-Aware Load-Balancing
Show others...
2014 (English)In: 2014 IEEE 33RD INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), IEEE Computer Society, 2014, p. 31-40Conference paper, Published paper (Refereed)
Abstract [en]

We focus on improving resilience of cloud services (e.g., e-commerce website), when correlated or cascading failures lead to computing capacity shortage. We study how to extend the classical cloud service architecture composed of a load-balancer and replicas with a recently proposed self-adaptive paradigm called brownout. Such services are able to reduce their capacity requirements by degrading user experience (e.g., disabling recommendations).

Combining resilience with the brownout paradigm is to date an open practical problem. The issue is to ensure that replica self-adaptivity would not confuse the load-balancing algorithm, overloading replicas that are already struggling with capacity shortage. For example, load-balancing strategies based on response times are not able to decide which replicas should be selected, since the response times are already controlled by the brownout paradigm.

In this paper we propose two novel brownout-aware load-balancing algorithms. To test their practical applicability, we extended the popular lighttpd web server and load-balancer, thus obtaining a production-ready implementation. Experimental evaluation shows that the approach enables cloud services to remain responsive despite cascading failures. Moreover, when compared to Shortest Queue First (SQF), believed to be near-optimal in the non-adaptive case, our algorithms improve user experience by 5%, with high statistical significance, while preserving response time predictability.

Place, publisher, year, edition, pages
IEEE Computer Society, 2014
Series
Symposium on Reliable Distributed Systems Proceedings, ISSN 1060-9857
Keywords
cloud, load-balancing, self-adaptation, control theory, statistical evaluation
National Category
Computer Systems Control Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-91327 (URN)000380439400004 ()978-1-4799-5584-8 (ISBN)
Conference
2014 IEEE 33RD INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), OCT 06-09, 2014, Nara, JAPAN
Projects
Cloud Control
Funder
Swedish Research CouncilELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsLinnaeus research environment CADICS
Available from: 2014-07-29 Created: 2014-07-29 Last updated: 2018-06-07Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-1364-8127

Search in DiVA

Show all publications