Publications

2021 [ nach oben ]

A Machine Learning-based Workflow for Automatic Detection of Anomalies in Machine Tools. M. Züfle; F. Moog; V. Lesch; C. Krupitzer; S. Kounev; in ISA Transactions (2021).
(in press)
[ Abstract ] [ BibTeX ] [ URL ]
 
Despite the increased sensor-based data collection in Industry 4.0, the practical use of this data is still in its infancy. In contrast, academic literature provides several approaches to detect machine failures but, in most cases, relies on simulations and vast amounts of training data. Since it is often not practical to collect such amounts of data in an industrial context, we propose an approach to detect the current production mode and machine degradation states on a comparably small data set. Our approach integrates domain knowledge about manufacturing systems into a highly generalizable end-to-end workflow ranging from raw data processing, phase segmentation, data resampling, and feature extraction to machine tool anomaly detection. The workflow applies unsupervised clustering techniques to identify the current production mode and supervised classification models for detecting the present degradation. A resampling strategy and classical machine learning models enable the workflow to handle small data sets and distinguish between normal and abnormal machine tool behavior. To the best of our knowledge, there exists no such end-to-end workflow in the literature that uses the entire machine signal as input to identify anomalies for individual tools. Our evaluation with data from a real multi-purpose machine shows that the proposed workflow detects anomalies with an average F1-score of almost 93%.
@article{zuefle2021anomalydetection, abstract = {Despite the increased sensor-based data collection in Industry 4.0, the practical use of this data is still in its infancy. In contrast, academic literature provides several approaches to detect machine failures but, in most cases, relies on simulations and vast amounts of training data. Since it is often not practical to collect such amounts of data in an industrial context, we propose an approach to detect the current production mode and machine degradation states on a comparably small data set. Our approach integrates domain knowledge about manufacturing systems into a highly generalizable end-to-end workflow ranging from raw data processing, phase segmentation, data resampling, and feature extraction to machine tool anomaly detection. The workflow applies unsupervised clustering techniques to identify the current production mode and supervised classification models for detecting the present degradation. A resampling strategy and classical machine learning models enable the workflow to handle small data sets and distinguish between normal and abnormal machine tool behavior. To the best of our knowledge, there exists no such end-to-end workflow in the literature that uses the entire machine signal as input to identify anomalies for individual tools. Our evaluation with data from a real multi-purpose machine shows that the proposed workflow detects anomalies with an average F1-score of almost 93%.}, author = {Züfle, Marwin and Moog, Felix and Lesch, Veronika and Krupitzer, Christian and Kounev, Samuel}, journal = {ISA Transactions}, keywords = {Cyber-Physical_Systems descartes statistical_estimation_and_machine_learning Industry_4_0 prediction}, note = {(in press)}, title = {A Machine Learning-based Workflow for Automatic Detection of Anomalies in Machine Tools}, year = 2021 }

Performance Impact Analysis of Securing MQTT Using TLS. T. Prantl; L. Iffländer; S. Herrnleben; S. Engel; S. Kounev; C. Krupitzer; in 2021 ACM/SPEC International Conference on Performance Engineering (ICPE) (2021).
[ BibTeX ]
 
@inproceedings{PrTeIfHeDmKo2021-ICPE-MQTT_TLS, author = {Prantl, Thomas and Iffländer, Lukas and Herrnleben, Stefan and Engel, Simon and Kounev, Samuel and Krupitzer, Christian}, booktitle = {2021 ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {Performance Security t_short descartes MQTT sss-group Pub/Sub TLS IoT}, month = {April}, series = {ICPE'21}, title = {Performance Impact Analysis of Securing MQTT Using TLS}, year = 2021 }

Auswirkungen der COVID-19-Pandemie auf Sportlerinnen und Sportler in Deutschland. C. Zinner; M. Matzka; R. Leppich; S. Kounev; H.-C. Holmberg; B. Sperlich; in 53. asp Jahrestagung (2021).
[ BibTeX ]
 
@article{zinner2021auswirkungen, author = {Zinner, Christoph and Matzka, Manuel and Leppich, Robert and Kounev, Samuel and Holmberg, Hans-Christian and Sperlich, Billy}, journal = {53. asp Jahrestagung}, keywords = {t_extendedabstract descartes t_interdisciplinary}, title = {Auswirkungen der COVID-19-Pandemie auf Sportlerinnen und Sportler in Deutschland}, year = 2021 }

RIP StrandHogg: A Practical StrandHogg Attack Detection Method on Android. J. Stang; A. Dmitrienko; S. Roth; in 14th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec) (2021).
[ Abstract ] [ BibTeX ]
 
StrandHogg vulnerabilities affect Android’s multitasking system and threaten up to 90% of Android platforms, which translates to millions of affected users. Existing countermeasures require modification of the OS, have usability drawbacks, or are limited to the detection of certain attack versions. In this work, we aim to develop a generic, efficient, and usability-friendly attack detection method, which does not require OS modifications and can be employed by apps installed on any vulnerable Android platform. To achieve our goal, we analyze StrandHogg attack techniques and develop two countermeasures, one using Machine Learning and the other one using ActivityCounter – a reliable attack indicator, which we could synthetically engineer. Our first approach achieves an average F1 score of 92% across all attack variations, while ActivityCounter shows superior performance and efficiently detects all attack versions without false positives. ActivityCounter is the first solution without practical limitations, which can be easily deployed in practice and protect millions of affected users.
@inproceedings{stang2021strandhogg, abstract = {StrandHogg vulnerabilities affect Android’s multitasking system and threaten up to 90% of Android platforms, which translates to millions of affected users. Existing countermeasures require modification of the OS, have usability drawbacks, or are limited to the detection of certain attack versions. In this work, we aim to develop a generic, efficient, and usability-friendly attack detection method, which does not require OS modifications and can be employed by apps installed on any vulnerable Android platform. To achieve our goal, we analyze StrandHogg attack techniques and develop two countermeasures, one using Machine Learning and the other one using ActivityCounter – a reliable attack indicator, which we could synthetically engineer. Our first approach achieves an average F1 score of 92% across all attack variations, while ActivityCounter shows superior performance and efficiently detects all attack versions without false positives. ActivityCounter is the first solution without practical limitations, which can be easily deployed in practice and protect millions of affected users.}, author = {Stang, Jasper and Dmitrienko, Alexandra and Roth, Sascha}, booktitle = {14th ACM Conference on Security and Privacy in Wireless and Mobile Networks (WiSec)}, keywords = {StrandHogg sss-group security Detection Android}, title = {RIP StrandHogg: A Practical StrandHogg Attack Detection Method on Android}, year = 2021 }

SARDE: A Framework for Continuous and Self-Adaptive Resource Demand Estimation. J. Grohmann; S. Eismann; A. Bauer; S. Spinner; J. Blum; N. Herbst; S. Kounev; in ACM Transactions on Autonomous and Adaptive Systems (2021). 15(2)
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
Resource demands are crucial parameters for modeling and predicting the performance of software systems. Currently, resource demand estimators are usually executed once for system analysis. However, the monitored system, as well as the resource demand itself, are subject to constant change in runtime environments. These changes additionally impact the applicability, the required parametrization as well as the resulting accuracy of individual estimation approaches. Over time, this leads to invalid or outdated estimates, which in turn negatively influence the decision-making of adaptive systems. In this article, we present SARDE, a framework for self-adaptive resource demand estimation in continuous environments. SARDE dynamically and continuously tunes, selects, and executes an ensemble of resource demand estimation approaches to adapt to changes in the environment. This creates an autonomous and unsupervised ensemble estimation technique, providing reliable resource demand estimations in dynamic environments. We evaluate SARDE using two realistic datasets. One set of different micro-benchmarks reflecting different possible system states and one dataset consisting of a continuously running application in a changing environment. Our results show that by continuously applying online optimization, selection and estimation, SARDE is able to efficiently adapt to the online trace and reduce the model error using the resulting ensemble technique.
@article{GrEiBaSpBlHeKo2021-TaaS-SARDE, abstract = {Resource demands are crucial parameters for modeling and predicting the performance of software systems. Currently, resource demand estimators are usually executed once for system analysis. However, the monitored system, as well as the resource demand itself, are subject to constant change in runtime environments. These changes additionally impact the applicability, the required parametrization as well as the resulting accuracy of individual estimation approaches. Over time, this leads to invalid or outdated estimates, which in turn negatively influence the decision-making of adaptive systems. In this article, we present SARDE, a framework for self-adaptive resource demand estimation in continuous environments. SARDE dynamically and continuously tunes, selects, and executes an ensemble of resource demand estimation approaches to adapt to changes in the environment. This creates an autonomous and unsupervised ensemble estimation technique, providing reliable resource demand estimations in dynamic environments. We evaluate SARDE using two realistic datasets. One set of different micro-benchmarks reflecting different possible system states and one dataset consisting of a continuously running application in a changing environment. Our results show that by continuously applying online optimization, selection and estimation, SARDE is able to efficiently adapt to the online trace and reduce the model error using the resulting ensemble technique.}, address = {New York, NY, USA}, author = {Grohmann, Johannes and Eismann, Simon and Bauer, Andr{é} and Spinner, Simon and Blum, Johannes and Herbst, Nikolas and Kounev, Samuel}, journal = {ACM Transactions on Autonomous and Adaptive Systems}, keywords = {descartes algorithms resource Self-adaptive learning sys:relevantfor:se-group demand performance self-tuning estimation systems optimization statistical_estimation_and_machine_learning machine prediction t_journalmagazine}, month = {jun}, number = 2, publisher = {Association for Computing Machinery}, title = {SARDE: A Framework for Continuous and Self-Adaptive Resource Demand Estimation}, volume = 15, year = 2021 }

A Predictive Maintenance Methodology: Predicting the Time-to-Failure of Machines in Industry 4.0. M. Züfle; J. Agne; J. Grohmann; I. Dörtoluk; S. Kounev; in Proceedings of the 21st IEEE IES International Conference on Industrial Informatics (2021).
(to appear)
[ BibTeX ]
 
@inproceedings{ZuAgGrDoKo-INDIN2021-PdM, author = {Züfle, Marwin and Agne, Joachim and Grohmann, Johannes and Dörtoluk, Ibrahim and Kounev, Samuel}, booktitle = {Proceedings of the 21st IEEE IES International Conference on Industrial Informatics}, keywords = {Internet_of_Things Cyber-Physical_Systems t_full descartes statistical_estimation_and_machine_learning prediction}, month = {July}, note = {(to appear)}, publisher = {IEEE}, series = {INDIN'21}, title = {A Predictive Maintenance Methodology: Predicting the Time-to-Failure of Machines in Industry 4.0}, year = 2021 }

Establishing a cardiac training group for patients with heart failure: the “HIP-in-Würzburg” study. G. Güder; J. Wilkesmann; N. Scholz; R. Leppich; P. Düking; B. Sperlich; C. Rost; S. Frantz; C. Morbach; F. Sahiti; others; in Clinical Research in Cardiology (2021). 1–10.
[ BibTeX ]
 
@article{guder2021establishing, author = {G{ü}der, G{ü}lmisal and Wilkesmann, Joana and Scholz, Nina and Leppich, Robert and D{ü}king, Peter and Sperlich, Billy and Rost, Christian and Frantz, Stefan and Morbach, Caroline and Sahiti, Floran and others}, journal = {Clinical Research in Cardiology}, keywords = {descartes medicine t_journalmagazine}, pages = {1–10}, publisher = {Springer}, title = {Establishing a cardiac training group for patients with heart failure: the “HIP-in-W{ü}rzburg” study}, year = 2021 }

Recommendations for Data-Driven Degradation Estimation with Case Studies from Manufacturing and Dry-Bulk Shipping. N. Finke; M. Mohr; A. Lontke; M. Züfle; S. Kounev; R. Möller; in RCIS (2021). 189–204.
[ BibTeX ]
 
@inproceedings{finke2021recommendations, author = {Finke, Nils and Mohr, Marisa and Lontke, Alexander and Z{ü}fle, Marwin and Kounev, Samuel and M{ö}ller, Ralf}, booktitle = {RCIS}, keywords = {descartes statistical_estimation_and_machine_learning prediction}, organization = {Springer}, pages = {189–204}, title = {Recommendations for Data-Driven Degradation Estimation with Case Studies from Manufacturing and Dry-Bulk Shipping}, year = 2021 }

ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning. O. Lutz; H. Chen; H. Fereidooni; C. Sendner; A. Dmitrienko; A. R. Sadeghi; F. Koushanfar; in ArXiv | arXiv:2103.12607v1 (2021).
[ Abstract ] [ BibTeX ] [ URL ]
 
Ethereum smart contracts are automated decentralized applications on the blockchain that describe the terms of the agreement between buyers and sellers, reducing the need for trusted intermediaries and arbitration. However, the deployment of smart contracts introduces new attack vectors into the cryptocurrency systems. In particular, programming flaws in smart contracts can be and have already been exploited to gain enormous financial profits. It is thus an emerging yet crucial issue to detect vulnerabilities of different classes in contracts in an efficient manner. Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable, or train individual classifiers for each specific vulnerability, or demonstrate multi-class vulnerability detection without extensibility consideration. To overcome the scalability and generalization limitations of existing works, we propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for Ethereum smart contracts that support lightweight transfer learning on unseen security vulnerabilities, thus is extensible and generalizable. ESCORT leverages a multi-output NN architecture that consists of two parts: (i) A common feature extractor that learns the semantics of the input contract; (ii) Multiple branch structures where each branch learns a specific vulnerability type based on features obtained from the feature extractor. Experimental results show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract. When extended to new vulnerability types, ESCORT yields an average F1-score of 93%. To the best of our knowledge, ESCORT is the first framework that enables transfer learning on new vulnerability types with minimal modification of the DNN model architecture and re-training overhead.
@article{lutz2021escort, abstract = {Ethereum smart contracts are automated decentralized applications on the blockchain that describe the terms of the agreement between buyers and sellers, reducing the need for trusted intermediaries and arbitration. However, the deployment of smart contracts introduces new attack vectors into the cryptocurrency systems. In particular, programming flaws in smart contracts can be and have already been exploited to gain enormous financial profits. It is thus an emerging yet crucial issue to detect vulnerabilities of different classes in contracts in an efficient manner. Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable, or train individual classifiers for each specific vulnerability, or demonstrate multi-class vulnerability detection without extensibility consideration. To overcome the scalability and generalization limitations of existing works, we propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for Ethereum smart contracts that support lightweight transfer learning on unseen security vulnerabilities, thus is extensible and generalizable. ESCORT leverages a multi-output NN architecture that consists of two parts: (i) A common feature extractor that learns the semantics of the input contract; (ii) Multiple branch structures where each branch learns a specific vulnerability type based on features obtained from the feature extractor. Experimental results show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract. When extended to new vulnerability types, ESCORT yields an average F1-score of 93%. To the best of our knowledge, ESCORT is the first framework that enables transfer learning on new vulnerability types with minimal modification of the DNN model architecture and re-training overhead.}, author = {Lutz, Oliver and Chen, Huili and Fereidooni, Hossein and Sendner, Christoph and Dmitrienko, Alexandra and Sadeghi, Ahmad Reza and Koushanfar, Farinaz}, journal = {ArXiv | arXiv:2103.12607v1}, keywords = {technical-reports sss-group security cryptography}, month = {mar}, title = {ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning}, year = 2021 }

SuanMing: Explainable Prediction of Performance Degradations in Microservice Applications. J. Grohmann; M. Straesser; A. Chalbani; S. Eismann; Y. Arian; N. Herbst; N. Peretz; S. Kounev; in Proceedings of the 12th ACM/SPEC International Conference on Performance Engineering (ICPE) (2021).
Acceptance Rate: 29%
[ Abstract ] [ BibTeX ] [ Download ]
 
Application performance management (APM) tools are useful to observe the performance properties of an application during production. However, APM is normally purely reactive, that is, it can only report about current or past performance degradation. Although some approaches capable of predictive application monitoring have been proposed, they can only report a predicted degradation but cannot explain its root-cause, making it hard to prevent the expected degradation. In this paper, we present SuanMing---a framework for predicting performance degradation of microservice applications running in cloud environments. SuanMing is able to predict future root causes for anticipated performance degradations and therefore aims at preventing performance degradations before they actually occur. We evaluate SuanMing on two realistic microservice applications, TeaStore and TrainTicket, and we show that our approach is able to predict and pinpoint performance degradations with an accuracy of over 90%.
@inproceedings{GrStChEiArHePeKo2021-ICPE, abstract = {Application performance management (APM) tools are useful to observe the performance properties of an application during production. However, APM is normally purely reactive, that is, it can only report about current or past performance degradation. Although some approaches capable of predictive application monitoring have been proposed, they can only report a predicted degradation but cannot explain its root-cause, making it hard to prevent the expected degradation. In this paper, we present SuanMing—a framework for predicting performance degradation of microservice applications running in cloud environments. SuanMing is able to predict future root causes for anticipated performance degradations and therefore aims at preventing performance degradations before they actually occur. We evaluate SuanMing on two realistic microservice applications, TeaStore and TrainTicket, and we show that our approach is able to predict and pinpoint performance degradations with an accuracy of over 90\%.}, address = {New York, NY, USA}, author = {Grohmann, Johannes and Straesser, Martin and Chalbani, Avi and Eismann, Simon and Arian, Yair and Herbst, Nikolas and Peretz, Noam and Kounev, Samuel}, booktitle = {Proceedings of the 12th ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {t_full descartes statistical_estimation_and_machine_learning prediction performance}, month = {April}, note = {Acceptance Rate: 29%}, organization = {ACM}, title = {SuanMing: Explainable Prediction of Performance Degradations in Microservice Applications}, year = 2021 }

Buzzy: Towards Realistic DBMS Benchmarking via Tailored, Representative, Synthetic Workloads. J. Domaschka; S. Eismann; M. Leznik; J. Grohmann; S. Kounev; D. Seybold; in Companion of the ACM/SPEC International Conference on Performance Engineering (2021). (Vol. ICPE ’21) 175–178.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Distributed Database Management Systems (DBMS) are a crucial component of modern IT applications. Understanding their performance and non-functional properties is of paramount importance. Yet, benchmarking distributed DBMS has proven to be difficult in practice. Either, a realistic workload is often mapped to a synthetic workload without knowing if this mapping is correct or available workload traces are replayed. While the latter approach provides more realistic results, real-world traces are hard to obtain and their scope is limited in time scale and variance.We propose collecting real-world traces and then applying data generation techniques to synthesize similar realistic traces based on it. Based in this approach, we can obtain workloads for benchmarking, exhibit variability with respect to different aspects of interest while still being similar to the original traces. Varying generation parameters, we are able to support benchmarking what-if scenarios with hypothetical workloads and introduced anomalies.
@inproceedings{domaschka2021buzzy, abstract = {Distributed Database Management Systems (DBMS) are a crucial component of modern IT applications. Understanding their performance and non-functional properties is of paramount importance. Yet, benchmarking distributed DBMS has proven to be difficult in practice. Either, a realistic workload is often mapped to a synthetic workload without knowing if this mapping is correct or available workload traces are replayed. While the latter approach provides more realistic results, real-world traces are hard to obtain and their scope is limited in time scale and variance.We propose collecting real-world traces and then applying data generation techniques to synthesize similar realistic traces based on it. Based in this approach, we can obtain workloads for benchmarking, exhibit variability with respect to different aspects of interest while still being similar to the original traces. Varying generation parameters, we are able to support benchmarking what-if scenarios with hypothetical workloads and introduced anomalies.}, address = {New York, NY, USA}, author = {Domaschka, Jörg and Eismann, Simon and Leznik, Mark and Grohmann, Johannes and Kounev, Samuel and Seybold, Daniel}, booktitle = {Companion of the ACM/SPEC International Conference on Performance Engineering}, keywords = {t_visionposition descartes}, pages = {175–178}, publisher = {Association for Computing Machinery}, title = {Buzzy: Towards Realistic DBMS Benchmarking via Tailored, Representative, Synthetic Workloads}, volume = {ICPE '21}, year = 2021 }

Utility-based Vehicle Routing Integrating User Preferences. V. Lesch; M. Hadry; S. Kounev; C. Krupitzer; in Proceedings of 3rd International Workshop on Pervasive Computing for Vehicular Systems (PerVehicle), 2021 (2021).
To appear
[ BibTeX ] [ Download ]
 
@inproceedings{lesch2021utility, author = {Lesch, Veronika and Hadry, Marius and Kounev, Samuel and Krupitzer, Christian}, booktitle = {Proceedings of 3rd International Workshop on Pervasive Computing for Vehicular Systems (PerVehicle), 2021}, keywords = {descartes intelligent_transportation_systems cyber-physical_systems internet_of_things t_workshop}, month = {March}, note = {To appear}, publisher = {IEEE}, title = {Utility-based Vehicle Routing Integrating User Preferences}, year = 2021 }

Towards a Group Encryption Scheme Benchmark: A View on Centralized Schemes with focus on IoT. T. Prantl; P. Ten; L. Iffländer; S. Herrnleben; A. Dmitrenko; S. Kounev; C. Krupitzer; in 2021 ACM/SPEC International Conference on Performance Engineering (ICPE) (2021).
[ BibTeX ]
 
@inproceedings{PrTeIfHeDmKo2021-ICPE-GroupEncryptionCentralizedBenchmark, author = {Prantl, Thomas and Ten, Peter and Iffländer, Lukas and Herrnleben, Stefan and Dmitrenko, Alexandra and Kounev, Samuel and Krupitzer, Christian}, booktitle = {2021 ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {Security t_short descartes sss-group Benchmark Energy\_Efficiency Group\_Encyrption\_Scheme}, month = {April}, series = {ICPE'21}, title = {Towards a Group Encryption Scheme Benchmark: A View on Centralized Schemes with focus on IoT}, year = 2021 }

Serverless Applications:Why, When, and How?. S. Eismann; S. Joel; E. van Eyk; M. Schwinger; J. Grohmann; N. Herbst; C. Abad; A. Iosup; in IEEE Software (2021). 38(1) 32–39.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Serverless computing shows good promise for efficiency and ease-of-use. Yet, there are only a few, scattered and sometimes conflicting reports on questions such as Why do so many companies adopt serverless?, When are serverless applications well suited?, and How are serverless applications currently implemented? To address these questions, we analyze 89 serverless applications from open-source projects, industrial sources, academic literature, and scientific computing—the most extensive study to date.
@article{eismann2020serverless, abstract = {Serverless computing shows good promise for efficiency and ease-of-use. Yet, there are only a few, scattered and sometimes conflicting reports on questions such as Why do so many companies adopt serverless?, When are serverless applications well suited?, and How are serverless applications currently implemented? To address these questions, we analyze 89 serverless applications from open-source projects, industrial sources, academic literature, and scientific computing—the most extensive study to date.}, author = {Eismann, Simon and Joel, Scheuner and van Eyk, Erwin and Schwinger, Maximilian and Grohmann, Johannes and Herbst, Nikolas and Abad, Cristina and Iosup, Alexandru}, journal = {IEEE Software}, keywords = {myown descartes t_journalmagazine}, number = 1, pages = {32–39}, title = {Serverless Applications:Why, When, and How?}, volume = 38, year = 2021 }

Libra: A Benchmark for Time Series Forecasting Methods. A. Bauer; M. Züfle; S. Eismann; J. Grohmann; N. Herbst; S. Kounev; in Proceedings of the 12th ACM/SPEC International Conference on Performance Engineering (ICPE) (2021).
[ BibTeX ] [ DOI ] [ Download ]
 
@inproceedings{bauer2021benchmark, address = {New York, NY, USA}, author = {Bauer, Andr{é} and Z{ü}fle, Marwin and Eismann, Simon and Grohmann, Johannes and Herbst, Nikolas and Kounev, Samuel}, booktitle = {Proceedings of the 12th ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {timeseries t_full descartes metrics_and_benchmarking_methodologies forecasting benchmark}, month = {April}, organization = {ACM}, title = {Libra: A Benchmark for Time Series Forecasting Methods}, year = 2021 }

A Comparison of Mechanisms for Compensating Negative Impacts of System Integration. V. Lesch; C. Krupitzer; K. Stubenrauch; N. Keil; C. Becker; S. Kounev; M. Segata; in Future Generation Computer Systems (2021). 116 117–131.
[ BibTeX ] [ DOI ] [ Download ]
 
@article{lesch2020comparison, author = {Lesch, Veronika and Krupitzer, Christian and Stubenrauch, Kevin and Keil, Nico and Becker, Christian and Kounev, Samuel and Segata, Michele}, journal = {Future Generation Computer Systems}, keywords = {descartes intelligent_transportation_systems cyber-physical_systems internet_of_things compensation system_integration t_journalmagazine platooning}, month = {March}, pages = {117-131}, title = {A Comparison of Mechanisms for Compensating Negative Impacts of System Integration}, volume = 116, year = 2021 }

All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers. C. Hagen; C. Weinert; C. Sendner; A. Dmitrienko; T. Schneider; in Network and Distributed System Security Symposium (NDSS) (2021).
(To Appear)
[ BibTeX ] [ URL ]
 
@inproceedings{DBLP:conf/ndss/2021, author = {Hagen, Christoph and Weinert, Christian and Sendner, Christoph and Dmitrienko, Alexandra and Schneider, Thomas}, booktitle = {Network and Distributed System Security Symposium (NDSS)}, keywords = {accepted sss-group dblp}, note = {(To Appear)}, publisher = {The Internet Society}, title = {All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers}, year = 2021 }

A Simulation-based Optimization Framework for Online Adaptation of Networks. S. Herrnleben; J. Grohmann; P. Rygielski; V. Lesch; C. Krupitzer; S. Kounev; in Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools), H. Song, D. Jiang (eds.) (2021). 513–532.
[ Abstract ] [ BibTeX ] [ DOI ] [ Download ]
 
Today's data centers face a rapid change of deployed services, growing complexity, and increasing performance requirements. Customers expect not only round-the-clock availability of the hosted services but also high responsiveness. Besides optimizing software architectures and deployments, networks have to be adapted to handle the changing and volatile demands. Approaches from self-adaptive systems can be used for optimizing data center networks to continuously meet Service Level Agreements (SLAs) between data center operators and customers. However, existing approaches focus only on specific objectives like topology design, power optimization, or traffic engineering. In this paper, we present an extensible framework that analyzes networks using different types of simulation and adapts them subject to multiple objectives using various adaptation techniques. Analyzing each suggested adaptation ensures that performance requirements and SLAs are continuously met. We evaluate our framework w.r.t. (i) general requirements and assessments of languages and frameworks for adaptation models, (ii) finding Pareto-optimal solutions considering a multi-dimensional cost model, and (iii) scalability. The evaluation shows that our approach detects the bottlenecks and the violated SLAs correctly, outputs valid and cost-optimal adaptations, and keeps the runtime for the adaptation process constant even with increasing network size and an increasing number of alternative configurations.
@inproceedings{HeGrRyLeKrKo2020-SIMUtools-Network-Online-Adaptation, abstract = {Today's data centers face a rapid change of deployed services, growing complexity, and increasing performance requirements. Customers expect not only round-the-clock availability of the hosted services but also high responsiveness. Besides optimizing software architectures and deployments, networks have to be adapted to handle the changing and volatile demands. Approaches from self-adaptive systems can be used for optimizing data center networks to continuously meet Service Level Agreements (SLAs) between data center operators and customers. However, existing approaches focus only on specific objectives like topology design, power optimization, or traffic engineering. In this paper, we present an extensible framework that analyzes networks using different types of simulation and adapts them subject to multiple objectives using various adaptation techniques. Analyzing each suggested adaptation ensures that performance requirements and SLAs are continuously met. We evaluate our framework w.r.t. (i) general requirements and assessments of languages and frameworks for adaptation models, (ii) finding Pareto-optimal solutions considering a multi-dimensional cost model, and (iii) scalability. The evaluation shows that our approach detects the bottlenecks and the violated SLAs correctly, outputs valid and cost-optimal adaptations, and keeps the runtime for the adaptation process constant even with increasing network size and an increasing number of alternative configurations.}, address = {Cham}, author = {Herrnleben, Stefan and Grohmann, Johannes and Rygielski, Pitor and Lesch, Veronika and Krupitzer, Christian and Kounev, Samuel}, booktitle = {Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools)}, editor = {Song, Houbing and Jiang, Dingde}, keywords = {myown t_full descartes networking}, month = {August}, pages = {513–532}, publisher = {Springer International Publishing}, series = {SIMUtools 2020}, title = {A Simulation-based Optimization Framework for Online Adaptation of Networks}, year = 2021 }

SPEC Research Group Newsletter, vol. 3 no. 2. S. Kounev; A. van Hoorn; A. Bauer; (2021, April).
Published by Standard Performance Evaluation Corporation (SPEC)
[ BibTeX ] [ URL ] [ Download ]
 
@misc{SPEC-RG-NEWSLETTER-10, author = {Kounev, Samuel and van Hoorn, Andre and Bauer, Andr{é}}, keywords = {t_other descartes SPEC}, month = {April}, note = {Published by Standard Performance Evaluation Corporation (SPEC)}, title = {{SPEC Research Group Newsletter, vol. 3 no. 2}}, year = 2021 }

2020 [ nach oben ]

Model-based Performance Predictions for SDN-based Networks: A Case Study. S. Herrnleben; P. Rygielski; J. Grohmann; S. Eismann; T. Hossfeld; S. Kounev; in Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems (2020).
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Emerging paradigms for network virtualization like Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) form new challenges for accurate performance modeling and analysis tools. Therefore, performance modeling and prediction approaches that support SDN or NFV technologies help system operators to analyze the performance of a data center and its corresponding network. The Descartes Network Infrastructures (DNI) offers a high-level descriptive language to model SDN-based networks, which can be transformed into various predictive modeling formalisms. However, these modeling concepts have not yet been evaluated in a realistic scenario. In this paper, we present an extensive case study evaluating the DNI modeling capabilities, the transformations to predictive models, and the performance prediction using the OMNeT++ and SimQPN simulation frameworks. We present five realistic scenarios of a content distribution network (CDN), compare the performance predictions with real-world measurements, and discuss modeling gaps and calibration issues causing mispredictions in some scenarios.
@inproceedings{HeRyGrEiHoKo-MMB2020-Model-based-SDN-Performance, abstract = {Emerging paradigms for network virtualization like Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) form new challenges for accurate performance modeling and analysis tools. Therefore, performance modeling and prediction approaches that support SDN or NFV technologies help system operators to analyze the performance of a data center and its corresponding network. The Descartes Network Infrastructures (DNI) offers a high-level descriptive language to model SDN-based networks, which can be transformed into various predictive modeling formalisms. However, these modeling concepts have not yet been evaluated in a realistic scenario. In this paper, we present an extensive case study evaluating the DNI modeling capabilities, the transformations to predictive models, and the performance prediction using the OMNeT++ and SimQPN simulation frameworks. We present five realistic scenarios of a content distribution network (CDN), compare the performance predictions with real-world measurements, and discuss modeling gaps and calibration issues causing mispredictions in some scenarios.}, address = {Cham}, author = {Herrnleben, Stefan and Rygielski, Piotr and Grohmann, Johannes and Eismann, Simon and Hossfeld, Tobias and Kounev, Samuel}, booktitle = {Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems}, keywords = {t_full descartes SDN}, month = {March}, publisher = {Springer}, series = {MMB 2020}, title = {{Model-based Performance Predictions for SDN-based Networks: A Case Study}}, year = 2020 }

Evaluating the Privacy of Contact Discovery. C. Sendner; Thesis; University of Würzburg. (2020, July).
[ Abstract ] [ BibTeX ]
 
Currently deployed contact discovery of mobile messengers is based on the transmission of phone numbers to the service provider. This information is private and anonymized by hashing them. In this work, we show, that this anonymization is pseudo-anonymous and can easily be broken by an attacker. For that, we develop two hash reversal techniques: one using brute-force approach and another one using look-up databases. We provide generic architectures for each of the ap- proaches. Additionally, we provide and compare two instantiations for each. Furthermore, we evaluate and compare them to the third approach based on rainbow tables. The evaluation shows near instant lookup-times of under 0.1 ms using in-memory lookup databases, this approach is however costly in terms of memory – it would require over 10 TB RAM, which would be difficult to obtain. Our brute-force approach shows an astonishing performance, being able to reverse any mobile number in under 100 seconds using consumer-level hardware. The rainbow tables produce lookup-times of 4.5 minutes with a success rate of over 99.99%. The results of our evaluation demonstrate, that hash reversals of mobile phone numbers are practical and near instant. Thus, an attacker can easily reverse hash digests of mobile phone numbers and de-anonymize personally identifiable information – like phone numbers transmitted to the service provider of mobile messenger apps.
@mastersthesis{sendner2020contactdiscovery, abstract = {Currently deployed contact discovery of mobile messengers is based on the transmission of phone numbers to the service provider. This information is private and anonymized by hashing them. In this work, we show, that this anonymization is pseudo-anonymous and can easily be broken by an attacker. For that, we develop two hash reversal techniques: one using brute-force approach and another one using look-up databases. We provide generic architectures for each of the ap- proaches. Additionally, we provide and compare two instantiations for each. Furthermore, we evaluate and compare them to the third approach based on rainbow tables. The evaluation shows near instant lookup-times of under 0.1 ms using in-memory lookup databases, this approach is however costly in terms of memory – it would require over 10 TB RAM, which would be difficult to obtain. Our brute-force approach shows an astonishing performance, being able to reverse any mobile number in under 100 seconds using consumer-level hardware. The rainbow tables produce lookup-times of 4.5 minutes with a success rate of over 99.99%. The results of our evaluation demonstrate, that hash reversals of mobile phone numbers are practical and near instant. Thus, an attacker can easily reverse hash digests of mobile phone numbers and de-anonymize personally identifiable information – like phone numbers transmitted to the service provider of mobile messenger apps.}, author = {Sendner, Christoph}, keywords = {thesis thesis_supervised_by_sss_member thesis_supervised_by_SSS_member sss-group}, month = {July}, school = {University of W{ü}rzburg}, title = {Evaluating the Privacy of Contact Discovery}, type = {Master Thesis}, year = 2020 }

Quantifying measurement quality and load distribution in Tor. A. Greubel; S. Pohl; S. Kounev; in Proceedings of the 36th Annual Computer Security Applications Conference (ACSAC 2020) (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
Tor is a widely used anonymization network. Traffic is routed over different relay nodes to conceal the communication partners. However, if a single relay handles too much traffic, de-anonymization attacks are possible. The Tor Load Balancing Mechanism (TLBM) is responsible for balanced and secure load distribution. It must verify that relays cannot attract more traffic than they should by lying about their self-reported bandwidth. This work shows that the current bandwidth measurement method used for bandwidth verification is not suitable to verify the bandwidth of many relays. Most importantly, multiple measurements of high-bandwidth relays are uncorrelated to each other. Furthermore, we analyze the current load distribution in Tor. We show that the current load distribution reduces the resources necessary for several large-scale de-anonymization attacks by more than 80%. Additionally, as Tor favors fast relays during path selection, verifiable relays only handle a small fraction of Tor’s traffic. More precisely, we show that only 7.21% of all paths consist of entry and exit relays verifiable by measurements. We discuss these results’ security implications and argue that future TLBM research should focus at least as much on secure load distribution as on high traffic performance.
@article{greubel2020quantifying, abstract = {Tor is a widely used anonymization network. Traffic is routed over different relay nodes to conceal the communication partners. However, if a single relay handles too much traffic, de-anonymization attacks are possible. The Tor Load Balancing Mechanism (TLBM) is responsible for balanced and secure load distribution. It must verify that relays cannot attract more traffic than they should by lying about their self-reported bandwidth. This work shows that the current bandwidth measurement method used for bandwidth verification is not suitable to verify the bandwidth of many relays. Most importantly, multiple measurements of high-bandwidth relays are uncorrelated to each other. Furthermore, we analyze the current load distribution in Tor. We show that the current load distribution reduces the resources necessary for several large-scale de-anonymization attacks by more than 80\%. Additionally, as Tor favors fast relays during path selection, verifiable relays only handle a small fraction of Tor’s traffic. More precisely, we show that only 7.21\% of all paths consist of entry and exit relays verifiable by measurements. We discuss these results’ security implications and argue that future TLBM research should focus at least as much on secure load distribution as on high traffic performance.}, author = {Greubel, Andre and Pohl, Steffen and Kounev, Samuel}, journal = {Proceedings of the 36th Annual Computer Security Applications Conference (ACSAC 2020)}, keywords = {balancing t_full TLBM descartes tor}, title = {Quantifying measurement quality and load distribution in Tor}, year = 2020 }

LegIoT: Ledgered Trust Management Platform for IoT. J. Neureither; A. Dmitrienko; D. Koisser; F. Brasser; A.-R. Sadeghi; in European Symposium on Research in Computer Security (ESORICS) (2020).
[ Abstract ] [ BibTeX ]
 
We investigate and address the currently unsolved problem of trust establishment in large-scale Internet of Things (IoT) networks where heterogeneous devices and mutually mistrusting stakeholders are involved. We design, prototype and evaluate LegIoT, a novel, probabilistic trust management system that enables secure, dynamic and flexible(yet inexpensive) trust relationships in large IoT networks. The core component of LegIoT is a novel graph-based scheme that allows network devices (graph nodes) to re-use the already existing trust associations(graph edges) very efficiently; thus, significantly reducing the number of individually conducted trust assessments. Since no central trusted third party exists, LegIoT leverages Distributed Ledger Technology(DLT) to create and manage the trust relation graph in a decentralized manner.The trust assessment among devices can be instantiated by any appropriate assessment technique, for which we focus on remote attestation(integrity verification) in this paper. We prototyped LegIoT for Hyper-ledger Sawtooth and demonstrated through evaluation that the number of trust assessments in the network can be significantly reduced – e.g.,by a factor of 20 for a network of 400 nodes and factor 5 for 1000 nodes.
@inproceedings{neureither2020legiot, abstract = {We investigate and address the currently unsolved problem of trust establishment in large-scale Internet of Things (IoT) networks where heterogeneous devices and mutually mistrusting stakeholders are involved. We design, prototype and evaluate LegIoT, a novel, probabilistic trust management system that enables secure, dynamic and flexible(yet inexpensive) trust relationships in large IoT networks. The core component of LegIoT is a novel graph-based scheme that allows network devices (graph nodes) to re-use the already existing trust associations(graph edges) very efficiently; thus, significantly reducing the number of individually conducted trust assessments. Since no central trusted third party exists, LegIoT leverages Distributed Ledger Technology(DLT) to create and manage the trust relation graph in a decentralized manner.The trust assessment among devices can be instantiated by any appropriate assessment technique, for which we focus on remote attestation(integrity verification) in this paper. We prototyped LegIoT for Hyper-ledger Sawtooth and demonstrated through evaluation that the number of trust assessments in the network can be significantly reduced – e.g.,by a factor of 20 for a network of 400 nodes and factor 5 for 1000 nodes.}, author = {Neureither, Jens and Dmitrienko, Alexandra and Koisser, David and Brasser, Ferdinand and Sadeghi, Ahmad-Reza}, booktitle = {European Symposium on Research in Computer Security (ESORICS)}, keywords = {remote-attestation blockchain trust-management sss-group}, title = {LegIoT: Ledgered Trust Management Platform for IoT}, year = 2020 }

Strategies for the Security Assessment of IoT Devices by Certification Authorities. M. A. Finke; Thesis; University of Würzburg; Am Hubland, Informatikgebäude, 97074 Würzburg, Germany. (2020, May).
[ Abstract ] [ BibTeX ]
 
The Internet of Things (IoT) is a global infrastructure that interconnects physical and virtual things based on evolving information and communication technologies. Along with the rise of the IoT, multiple unprecedented forms of security issues and attacks have emerged. While their limited resources disallow the utilization of computing-intensive security measures, the services of IoT devices represent an attractive target for vulnerability exploitation. Certification Authorities (CAs) have responded to the trend and offer security assessments and certification for IoT devices. To ensure qualitative and fair certification, security testing requires well-defined strategies. This bachelor thesis analyzes the existing IoT security assessment models and proposes a novel, CA oriented Testing Guide Model (TGM) for standardized and reproducible assessments. The TGM describes a complete security assessment approach for application in IoT device security certification procedures of CAs. As part of the bachelor thesis, the TGM is specified, implemented, and its applicability evaluated with the help of existing IoT devices. CAs account for the security of certified products. The certification of devices that (subsequently) prove to be insecure can lead to a consumer's loss of trust in the CA. Therefore, the decision for issuing certificates must be comprehensible and made carefully. For the risk estimation of security issues and vulnerabilities, it is common to make use of numerical scoring systems. Well-defined scoring systems allow precise and reproducible estimations. In addition to the introduction of the TGM, this bachelor thesis analyzes the scoring systems established in the field of IT security in regard to their applicability for the scoring of IoT related vulnerabilities, complete IoT devices, and for the specific requirements of CAs. This thesis uncovers incompatibilities and insufficiencies in the existing systems that disallow application for the scoring of IoT devices and for application by CAs. To counter these issues, the thesis introduces a novel Security Scoring System (SSS) for rating IoT devices based on the risks of their vulnerabilities, services, and operational contexts. The SSS is integrated into the TGM, implemented in software, and evaluated with a comparison to the existing scoring systems. To summarize, the contributions of this bachelor thesis are two novel models for the security assessment of devices of the IoT: the TGM and the SSS. The models are intended to find application for CAs and both standardize and improve the security testing and assessment procedures.
@mastersthesis{finke2020strategies, abstract = {The Internet of Things (IoT) is a global infrastructure that interconnects physical and virtual things based on evolving information and communication technologies. Along with the rise of the IoT, multiple unprecedented forms of security issues and attacks have emerged. While their limited resources disallow the utilization of computing-intensive security measures, the services of IoT devices represent an attractive target for vulnerability exploitation. Certification Authorities (CAs) have responded to the trend and offer security assessments and certification for IoT devices. To ensure qualitative and fair certification, security testing requires well-defined strategies. This bachelor thesis analyzes the existing IoT security assessment models and proposes a novel, CA oriented Testing Guide Model (TGM) for standardized and reproducible assessments. The TGM describes a complete security assessment approach for application in IoT device security certification procedures of CAs. As part of the bachelor thesis, the TGM is specified, implemented, and its applicability evaluated with the help of existing IoT devices. CAs account for the security of certified products. The certification of devices that (subsequently) prove to be insecure can lead to a consumer's loss of trust in the CA. Therefore, the decision for issuing certificates must be comprehensible and made carefully. For the risk estimation of security issues and vulnerabilities, it is common to make use of numerical scoring systems. Well-defined scoring systems allow precise and reproducible estimations. In addition to the introduction of the TGM, this bachelor thesis analyzes the scoring systems established in the field of IT security in regard to their applicability for the scoring of IoT related vulnerabilities, complete IoT devices, and for the specific requirements of CAs. This thesis uncovers incompatibilities and insufficiencies in the existing systems that disallow application for the scoring of IoT devices and for application by CAs. To counter these issues, the thesis introduces a novel Security Scoring System (SSS) for rating IoT devices based on the risks of their vulnerabilities, services, and operational contexts. The SSS is integrated into the TGM, implemented in software, and evaluated with a comparison to the existing scoring systems. To summarize, the contributions of this bachelor thesis are two novel models for the security assessment of devices of the IoT: the TGM and the SSS. The models are intended to find application for CAs and both standardize and improve the security testing and assessment procedures.}, address = {Am Hubland, Informatikgebäude, 97074 Würzburg, Germany}, author = {Finke, Moritz Anton}, keywords = {Security thesis_supervised_by_SSS_member sss-group IoT}, month = {may}, school = {University of Würzburg}, title = {Strategies for the Security Assessment of IoT Devices by Certification Authorities}, type = {Bachelor Thesis}, year = 2020 }

Contact Tracing by Giant Data Collectors: Opening Pandora’s Box of Threats to Privacy, Sovereignty and National Security A. Boutet; C. Castelluccia; M. Cunche; A. Dmitrienko; V. Iovino; M. Miettinen; T. D. Nguyen; V. Roca; A.-R. Sadeghi; S. Vaudenay; I. Visconti; M. Vuagnoux; (2020).
[ Abstract ] [ BibTeX ] [ URL ]
 
Many countries have introduced digital contact tracing apps to fight the COVID-19 pandemic. Such apps help to identify contacts between potentially infectious persons automatically and thus bear the promise of reducing the burden on manual contact tracers and increase tracing accuracy in situations in which people have difficulties identifying with whom they have been in contact. A number of different proposals for digital contact tracing systems have been made or deployed, ranging from heavily centralized to completely decentralized approaches, each with its own advantages and disadvantages in terms of tracing effectiveness and impact on user privacy. During the phase of highly dynamic evolution of these approaches, surprisingly, Google and Apple established an unprecedented friendship and agreed on a very special scheme for contact tracing, realizing this in the form of an API called GAEN that they quickly integrated into their mobile operating systems. A multitude of nationally rolled out tracing apps are now based on the GAEN approach. In this paper, we revisit such apps and the GAEN API on which they are built. In particular, we point out a number of very problematic aspects and threats that the GAEN approach creates through its security and privacy weaknesses but also through the threats that it poses on technological sovereignty and the public health system.
@techreport{boutet2020contact, abstract = {Many countries have introduced digital contact tracing apps to fight the COVID-19 pandemic. Such apps help to identify contacts between potentially infectious persons automatically and thus bear the promise of reducing the burden on manual contact tracers and increase tracing accuracy in situations in which people have difficulties identifying with whom they have been in contact. A number of different proposals for digital contact tracing systems have been made or deployed, ranging from heavily centralized to completely decentralized approaches, each with its own advantages and disadvantages in terms of tracing effectiveness and impact on user privacy. During the phase of highly dynamic evolution of these approaches, surprisingly, Google and Apple established an unprecedented friendship and agreed on a very special scheme for contact tracing, realizing this in the form of an API called GAEN that they quickly integrated into their mobile operating systems. A multitude of nationally rolled out tracing apps are now based on the GAEN approach. In this paper, we revisit such apps and the GAEN API on which they are built. In particular, we point out a number of very problematic aspects and threats that the GAEN approach creates through its security and privacy weaknesses but also through the threats that it poses on technological sovereignty and the public health system.}, author = {Boutet, Antoine and Castelluccia, Claude and Cunche, Mathieu and Dmitrienko, Alexandra and Iovino, Vincenzo and Miettinen, Markus and Nguyen, Thien Duc and Roca, Vincent and Sadeghi, Ahmad-Reza and Vaudenay, Serge and Visconti, Ivan and Vuagnoux, Martin}, institution = {{EPFL, Switzerland ; Inria, France ; JMU W{ü}rzburg, Germany ; University of Salerno, Italy ; base23, Geneva, Switzerland ; Technical University of Darmstadt, Germany}}, keywords = {tracing data technical-reports international-conference-workshop-papers-book-chapters sss-group contracts collector}, month = {dec}, title = {{Contact Tracing by Giant Data Collectors: Opening Pandora's Box of Threats to Privacy, Sovereignty and National Security}}, type = {University works}, year = 2020 }

Survey and Experimental Comparison of RGB-D Indoor Robot Navigation Methods Supported by ROS and Their Expansion via Fusion with Wheel Odometry and IMU Data. F. Spiess; J. Friesslich; K. Tobias; S. Kounev; N. Strobel; in IJMERR, (P. R. (Chunhui) Yang, ed.) (2020). 9(12) 1532–1540.
[ Abstract ] [ BibTeX ] [ URL ]
 
This paper presents an experimental evaluation and comparison of selected Visual Odometry (VO) and Visual-SLAM (V-SLAM) algorithms for indoor mobile robot navigation supported by the Robot Operating System (ROS). The focus is on algorithms involving RGB-D cameras. Since RGB-D cameras integrate color and depth information, they output coherent measurement data and facilitate an efficient processing pipeline. The various underlying methods of vision-based algorithms are described and evaluated on two datasets covering different indoor situations as well as various lighting and movement conditions. In general, V-SLAM algorithms yielded better results. They were superior with respect to handling drift, in particular when loop closures were involved. However, the results confirmed that VO algorithms could outperform V-SLAM methods under certain circumstances. This happened when there was a very good match between an algorithm’s design objectives and the situation at hand. While the experiments showed that there is no single best algorithm for every scenario, ORB-SLAM2 is recommended as a robust stand-alone RGB-D based localization method available under ROS. Furthermore, we observed that the position estimation error could be reduced by around 67% on average when combining vision-based position estimates with sensor data obtained from wheel odometry and an inertial measurement unit (IMU), respectively. This clearly demonstrates the potential of sensor fusion techniques. The best results in case of sensor fusion were obtained with RGB-DSLAMv2.
@article{yang2020survey, abstract = {This paper presents an experimental evaluation and comparison of selected Visual Odometry (VO) and Visual-SLAM (V-SLAM) algorithms for indoor mobile robot navigation supported by the Robot Operating System (ROS). The focus is on algorithms involving RGB-D cameras. Since RGB-D cameras integrate color and depth information, they output coherent measurement data and facilitate an efficient processing pipeline. The various underlying methods of vision-based algorithms are described and evaluated on two datasets covering different indoor situations as well as various lighting and movement conditions. In general, V-SLAM algorithms yielded better results. They were superior with respect to handling drift, in particular when loop closures were involved. However, the results confirmed that VO algorithms could outperform V-SLAM methods under certain circumstances. This happened when there was a very good match between an algorithm’s design objectives and the situation at hand. While the experiments showed that there is no single best algorithm for every scenario, ORB-SLAM2 is recommended as a robust stand-alone RGB-D based localization method available under ROS. Furthermore, we observed that the position estimation error could be reduced by around 67% on average when combining vision-based position estimates with sensor data obtained from wheel odometry and an inertial measurement unit (IMU), respectively. This clearly demonstrates the potential of sensor fusion techniques. The best results in case of sensor fusion were obtained with RGB-DSLAMv2.}, author = {Spiess, Florian and Friesslich, Jonas and Tobias, Kaupp and Kounev, Samuel and Strobel, Norbert}, editor = {Yang, Prof Richard (Chunhui)}, journal = {IJMERR}, keywords = {comparison descartes robotics survey sys:relevantfor:se-group rgb}, month = {dec}, number = 12, pages = {1532-1540}, title = {Survey and Experimental Comparison of RGB-D Indoor Robot Navigation Methods Supported by ROS and Their Expansion via Fusion with Wheel Odometry and IMU Data}, volume = 9, year = 2020 }

Elasticity of Cloud Platforms. N. Herbst; A. Bauer; S. Kounev; in Systems Benchmarking: For Scientists and Engineers, S. Kounev, K.-D. Lange, J. von Kistowski (eds.) (2020). 319–340.
[ BibTeX ]
 
@inproceedings{bauer2020bookelasticity, author = {Herbst, Nikolas and Bauer, Andr{é} and Kounev, Samuel}, booktitle = {{Systems Benchmarking: For Scientists and Engineers}}, editor = {Kounev, Samuel and Lange, Klaus-Dieter and von Kistowski, J{ó}akim}, keywords = {cloud descartes metrics_and_benchmarking_methodologies elasticity t_bookchapter}, month = 1, organization = {Springer}, pages = {319-340}, title = {{Elasticity of Cloud Platforms}}, year = 2020 }

Baloo: Measuring and Modeling the Performance Configurations of Distributed DBMS. J. Grohmann; D. Seybold; S. Eismann; M. Leznik; S. Kounev; J. Domaschka; in 2020 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) (2020). 1–8.
Acceptance Rate: 27%
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Correctly configuring a distributed database management system (DBMS) deployed in a cloud environment for maximizing performance poses many challenges to operators. Even if the entire configuration spectrum could be measured directly, which is often infeasible due to the multitude of parameters, single measurements are subject to random variations and need to be repeated multiple times. In this work, we propose Baloo, a framework for systematically measuring and modeling different performance-relevant configurations of distributed DBMS in cloud environments. Baloo dynamically estimates the required number of configurations, as well as the number of required measurement repetitions per configuration based on a desired target accuracy. We evaluate Baloo based on a data set consisting of 900 DBMS configuration measurements conducted in our private cloud setup. Our evaluation shows that the highly configurable framework is able to achieve a prediction error of up to 12% while saving 80% of the measurement effort. We also publish all code and the acquired data set to foster future research.
@inproceedings{GrSeEiLeKoDo2020-MASCOTS-DBMSPerformance, abstract = {Correctly configuring a distributed database management system (DBMS) deployed in a cloud environment for maximizing performance poses many challenges to operators. Even if the entire configuration spectrum could be measured directly, which is often infeasible due to the multitude of parameters, single measurements are subject to random variations and need to be repeated multiple times. In this work, we propose Baloo, a framework for systematically measuring and modeling different performance-relevant configurations of distributed DBMS in cloud environments. Baloo dynamically estimates the required number of configurations, as well as the number of required measurement repetitions per configuration based on a desired target accuracy. We evaluate Baloo based on a data set consisting of 900 DBMS configuration measurements conducted in our private cloud setup. Our evaluation shows that the highly configurable framework is able to achieve a prediction error of up to 12% while saving 80% of the measurement effort. We also publish all code and the acquired data set to foster future research.}, author = {Grohmann, Johannes and Seybold, Daniel and Eismann, Simon and Leznik, Mark and Kounev, Samuel and Domaschka, Jörg}, booktitle = {2020 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, keywords = {myown t_full performance_modeling descartes statistical_estimation_and_machine_learning prediction performance automated_model_learning}, month = {November}, note = {Acceptance Rate: 27%}, pages = {1–8}, publisher = {IEEE}, series = {MASCOTS '20}, title = {Baloo: Measuring and Modeling the Performance Configurations of Distributed DBMS}, year = 2020 }

Testbed for Security Testing of Smart Contracts. L. Denk; Thesis; University of Würzburg. (2020, November).
[ Abstract ] [ BibTeX ]
 
Ethereum, one of the most popular decentralized blockchain-based platforms [1], manages cryptocurrency worth more than 40 billion US Dollars [2]. A lot of the money is controlled by autonomous programs, so called smart contracts. They are executed on the platform and everyone can call their functions; vulnerabilities are therefore easily exploited. The immutable nature of the blockchain sharpens the problem even further by prohibiting belated bug fixes. In fact, there were several cases where attackers were able to steal cryptocurrency worth several millions of US Dollar [3]. This emphasises the need of soundly testing a smart contract before deployment. Unfortunately, existing security analysing tools each cover a different subsets of vulnerabilities [4]. Moreover, even when they test for the same security issues, they often find different results. A solid test run should therefore contain several tools, which makes the whole procedure very laborious. For these reasons, we provide a testbed which runs on a virtual machine (VM) with several smart contract security analysing tools integrated. It does not only offer a command line- but also an intuitive web interface. Both interfaces allow the user to analyse his contract with all the underlying tools in a single step. Additionally, our testbed provides a detailed report for each of the tools’ test runs as well as an overview of the overall security issues the different tools found. Our evaluation shows that our testbed identifies significantly more potential security issues than each of the compared smart contract analysing tools individually does. Indeed, we found 92% of our analysed contracts as potentially being vulnerable, while even the most sensitive tool only flagged 76% of its successfully analysed contracts. Furthermore, we observed that occasionally, two tools testing for the same vulnerability, contradict themselves in more than 81% of the contracts successfully analysed by both tools
@mastersthesis{denk2020testbed, abstract = {Ethereum, one of the most popular decentralized blockchain-based platforms [1], manages cryptocurrency worth more than 40 billion US Dollars [2]. A lot of the money is controlled by autonomous programs, so called smart contracts. They are executed on the platform and everyone can call their functions; vulnerabilities are therefore easily exploited. The immutable nature of the blockchain sharpens the problem even further by prohibiting belated bug fixes. In fact, there were several cases where attackers were able to steal cryptocurrency worth several millions of US Dollar [3]. This emphasises the need of soundly testing a smart contract before deployment. Unfortunately, existing security analysing tools each cover a different subsets of vulnerabilities [4]. Moreover, even when they test for the same security issues, they often find different results. A solid test run should therefore contain several tools, which makes the whole procedure very laborious. For these reasons, we provide a testbed which runs on a virtual machine (VM) with several smart contract security analysing tools integrated. It does not only offer a command line- but also an intuitive web interface. Both interfaces allow the user to analyse his contract with all the underlying tools in a single step. Additionally, our testbed provides a detailed report for each of the tools’ test runs as well as an overview of the overall security issues the different tools found. Our evaluation shows that our testbed identifies significantly more potential security issues than each of the compared smart contract analysing tools individually does. Indeed, we found 92% of our analysed contracts as potentially being vulnerable, while even the most sensitive tool only flagged 76% of its successfully analysed contracts. Furthermore, we observed that occasionally, two tools testing for the same vulnerability, contradict themselves in more than 81% of the contracts successfully analysed by both tools}, author = {Denk, Lukas}, keywords = {thesis_supervised_by_SSS_member sss-group smart-contracts security secure}, month = {November}, school = {University of W{ü}rzburg}, title = {Testbed for Security Testing of Smart Contracts}, type = {Bachelor Thesis}, year = 2020 }

All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers. C. Hagen; C. Weinert; C. Sendner; A. Dmitrienko; T. Schneider; in Cryptology ePrint Archive, Report 2020/1119 (2020).
[ BibTeX ] [ URL ]
 
@article{cryptoeprint:2020:1119, author = {Hagen, Christoph and Weinert, Christian and Sendner, Christoph and Dmitrienko, Alexandra and Schneider, Thomas}, journal = {Cryptology ePrint Archive, Report 2020/1119}, keywords = {technical-reports sss-group security}, title = {All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers}, year = 2020 }

SIMPL: Secure IoT Management Platform. T. Prantl; A. E. Ben Yahya; A. Dmitrienko; S. Kounev; F. Lipp; D. Hock; C. Rathfelder; M. Hofherr; in ITG Workshop on IT Security (ITSec) (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
The proliferation of IoT devices is increasing at a fast pace, whether for private or business use. However,despite their growing popularity, their safe operation is often not guaranteed. To tackle the security challenges of modern IoT environments, the German Federal Ministry of Education and Research is funding the SIMPL project in order to support research in this area. The contribution of this paper is to introduce the main goal, objectives, and key features of SIMPL
@inproceedings{PrYaDmKoLiHoRaHo2020-ITSec-SIMPL, abstract = {The proliferation of IoT devices is increasing at a fast pace, whether for private or business use. However,despite their growing popularity, their safe operation is often not guaranteed. To tackle the security challenges of modern IoT environments, the German Federal Ministry of Education and Research is funding the SIMPL project in order to support research in this area. The contribution of this paper is to introduce the main goal, objectives, and key features of SIMPL}, author = {Prantl, Thomas and Ben Yahya, Ala Eddine and Dmitrienko, Alexandra and Kounev, Samuel and Lipp, Fabian and Hock, David and Rathfelder, Christoph and Hofherr, Martin}, booktitle = {ITG Workshop on IT Security (ITSec)}, keywords = {SIMPL myown descartes internet_of_things t_workshop}, title = {SIMPL: Secure IoT Management Platform}, year = 2020 }

Predicting Performance Degradations of Black-box Microservice Applications M. Straesser; (2020).
[ BibTeX ] [ URL ] [ Download ]
 
@presentation{straesser2020talk, author = {Straesser, Martin}, keywords = {t_talk descartes microservice performance_prediction sys:relevantfor:se-group}, title = {Predicting Performance Degradations of Black-box Microservice Applications}, year = 2020 }

A Framework for Time Series Preprocessing and History-based Forecasting Method Recommendation. M. Züfle; S. Kounev; in Proceedings of the 15th Conference on Computer Science and Information Systems (FedCSIS): Data Mining Competition of the International Symposium on Advanced Artificial Intelligence in Applications (2020).
[ BibTeX ] [ Download ]
 
@inproceedings{ZuKo-AAIA2020-Framework, author = {Z{ü}fle, Marwin and Kounev, Samuel}, booktitle = {Proceedings of the 15th Conference on Computer Science and Information Systems (FedCSIS): Data Mining Competition of the International Symposium on Advanced Artificial Intelligence in Applications}, keywords = {t_short descartes statistical_estimation_and_machine_learning prediction online_monitoring_and_forecasting}, month = {September}, title = {A Framework for Time Series Preprocessing and History-based Forecasting Method Recommendation}, year = 2020 }

REACT: A Model-Based Runtime Environment for Adapting Communication Systems. M. Pfannemüller; M. Breitbach; C. Krupitzer; M. Weckesser; C. Becker; B. Schmerl; A. Schürr; in Proceedings of the IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS 2020) (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
Trends such as the Internet of Things or edge computing lead to a growing number of networked devices. Hence, it is becoming increasingly important to manage communication systems at runtime. Adding self-adaptive capabilities is one approach to reduce administrative effort and cope with changing execution contexts. Existing frameworks for building self-adaptive software can help to reduce development effort in general. Yet, they are neither tailored towards the use in communication systems nor easily usable without profound knowledge in self-adaptive systems development. In this paper, we propose REACT, a reusable, model-based runtime environment to complement communication systems with adaptive behavior. It addresses the heterogeneity and distribution aspects of networks and reduces development effort. REACT empowers developers of communication systems to add adaptive behavior without having experience in self-adaptive systems development. We show the effectiveness and efficiency of our prototype in an experimental evaluation based on two distinct use cases from the communication systems domain: cloud resource management and software-defined networking. The first use case includes a comparison with Rainbow, which represents a state-of-the-art model-based framework for building self-adaptive systems. The second use case applies REACT in a sophisticated, real-world communication system scenario.
@conference{acsos2020:react, abstract = {Trends such as the Internet of Things or edge computing lead to a growing number of networked devices. Hence, it is becoming increasingly important to manage communication systems at runtime. Adding self-adaptive capabilities is one approach to reduce administrative effort and cope with changing execution contexts. Existing frameworks for building self-adaptive software can help to reduce development effort in general. Yet, they are neither tailored towards the use in communication systems nor easily usable without profound knowledge in self-adaptive systems development. In this paper, we propose REACT, a reusable, model-based runtime environment to complement communication systems with adaptive behavior. It addresses the heterogeneity and distribution aspects of networks and reduces development effort. REACT empowers developers of communication systems to add adaptive behavior without having experience in self-adaptive systems development. We show the effectiveness and efficiency of our prototype in an experimental evaluation based on two distinct use cases from the communication systems domain: cloud resource management and software-defined networking. The first use case includes a comparison with Rainbow, which represents a state-of-the-art model-based framework for building self-adaptive systems. The second use case applies REACT in a sophisticated, real-world communication system scenario.}, author = {Pfannemüller, Martin and Breitbach, Martin and Krupitzer, Christian and Weckesser, Markus and Becker, Christian and Schmerl, Bradley and Schürr, Andy}, booktitle = {Proceedings of the IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS 2020)}, keywords = {t_full descartes cyber-physical_systems internet_of_things sys:relevantfor:se-group self-adaptive-systems}, title = {REACT: A Model-Based Runtime Environment for Adapting Communication Systems}, year = 2020 }

An Overview of Design Patterns for Self-Adaptive Systems in the Context of the Internet of Things. C. Krupitzer; T. Temizer; T. Prantl; C. Raibulet; in IEEE Access (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
The Internet of Things (IoT) requires the integration of all available, highly specialized, and heterogeneous devices, ranging from embedded sensor nodes to servers in the cloud. The self-adaptive research domain provides adaptive capabilities that can support the integration in IoT systems. However, developing such systems is a challenging, error-prone, and time-consuming task. In this context, design patterns propose already used and optimized solutions to specific problems in various contexts. Applying design patterns might help to reuse existing knowledge about similar development issues. However, so far, there is a lack of taxonomies on design patterns for self-adaptive systems. To tackle this issue, in this paper, we provide a taxonomy on design patterns for self-adaptive systems that can be transferred to support adaptivity in IoT systems. Besides describing the taxonomy and the design patterns, we discuss their applicability in an Industrial IoT case study.
@article{ieeeaccess2020:sasdesignpatterns, abstract = {The Internet of Things (IoT) requires the integration of all available, highly specialized, and heterogeneous devices, ranging from embedded sensor nodes to servers in the cloud. The self-adaptive research domain provides adaptive capabilities that can support the integration in IoT systems. However, developing such systems is a challenging, error-prone, and time-consuming task. In this context, design patterns propose already used and optimized solutions to specific problems in various contexts. Applying design patterns might help to reuse existing knowledge about similar development issues. However, so far, there is a lack of taxonomies on design patterns for self-adaptive systems. To tackle this issue, in this paper, we provide a taxonomy on design patterns for self-adaptive systems that can be transferred to support adaptivity in IoT systems. Besides describing the taxonomy and the design patterns, we discuss their applicability in an Industrial IoT case study.}, author = {Krupitzer, Christian and Temizer, Timur and Prantl, Thomas and Raibulet, Claudia}, journal = {IEEE Access}, keywords = {descartes cyber-physical_systems internet_of_things t_journalmagazine sys:relevantfor:se-group self-adaptive-systems}, title = {An Overview of Design Patterns for Self-Adaptive Systems in the Context of the Internet of Things}, year = 2020 }

Detection of Software Vulnerabilities in Smart Contracts using Deep Learning. O. Lutz; Thesis; University of Würzburg. (2020, October).
[ Abstract ] [ BibTeX ]
 
Der Missbrauch von Programmierfehlern in Kryptowährungsplattformen kann zu großen wirtschaftlichen Schäden fuhren. Deshalb wird in dieser Arbeit analysiert, wie Deep-Learning genutzt werden kann, um Schwachstellen in Ethereum Smart Contracts aufzudecken. Als Ergebnis ist ein Framework entwickelt worden, das sich um die Datengewinnung, Vorklassifizierung und Modellbildung kummert. Mit diesem Framework können Deep-Learning-Modelle entwickelt, trainiert und evaluiert werden, um einen KI-Scanner zu erstellen. Selbst bei einfachen neuronalen Netz-Architekturen erreicht der KI-Scanner, der acht verschiedene Arten von Schwachstellen erkennen kann, eine Genauigkeit von 98%. Dieser KI-Scanner kann zur weiteren Verwendung eingesetzt werden. Er kann jedoch auch um Schwachstellentypen erweitert werden, um ein noch mächtigeres Tool zu bilden.
@mastersthesis{lutz2020detection, abstract = {Der Missbrauch von Programmierfehlern in Kryptowährungsplattformen kann zu großen wirtschaftlichen Schäden fuhren. Deshalb wird in dieser Arbeit analysiert, wie Deep-Learning genutzt werden kann, um Schwachstellen in Ethereum Smart Contracts aufzudecken. Als Ergebnis ist ein Framework entwickelt worden, das sich um die Datengewinnung, Vorklassifizierung und Modellbildung kummert. Mit diesem Framework können Deep-Learning-Modelle entwickelt, trainiert und evaluiert werden, um einen KI-Scanner zu erstellen. Selbst bei einfachen neuronalen Netz-Architekturen erreicht der KI-Scanner, der acht verschiedene Arten von Schwachstellen erkennen kann, eine Genauigkeit von 98%. Dieser KI-Scanner kann zur weiteren Verwendung eingesetzt werden. Er kann jedoch auch um Schwachstellentypen erweitert werden, um ein noch mächtigeres Tool zu bilden.}, author = {Lutz, Oliver}, keywords = {deep-learning thesis_supervised_by_SSS_member sss-group smart-contracts}, month = {October}, school = {University of W{ü}rzburg}, title = {Detection of Software Vulnerabilities in Smart Contracts using Deep Learning}, type = {Master Thesis}, year = 2020 }

Mind the GAP: Security & Privacy Risks of Contact Tracing Apps. L. Baumgärtner; A. Dmitrienko; B. Freisleben; A. Gruler; J. Höchst; J. Kühlberg; M. Mezini; M. Miettinen; A. Muhamedagic; T. D. Nguyen; A. Penning; D. F. Pustelnik; F. Roos; A.-R. Sadeghi; M. Schwarz; C. Uhl; in ArXiv (2020).
[ Abstract ] [ BibTeX ] [ URL ]
 
Contact tracing apps running on mobile devices promise to reduce the manual effort required for identifying infection chains and to increase the tracing accuracy in the presence of COVID-19. Several contract tracing apps have been proposed or deployed in practice. Also Google and Apple have announced their joint effort of providing an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP". Some countries have already decided or are planning to base their contact tracing apps on GAP. Several researchers have pointed out potential privacy and security risks related to most of the contact tracing approaches proposed until now, including those that claim privacy protection and are based on GAP. This report makes a first attempt towards providing empirical evidence in real-world scenarios for two such risks discussed in the literature: one concerning privacy, and the other one concerning security. In particular, we focus on a practical analysis of GAP, given that it is the foundation of several tracing apps. We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that principally can generate fake contacts with the potential of significantly affecting the accuracy of an app-based contact tracing system. For both types of attack, we have built tools that can be easily used on mobile phones or Raspberry Pis (e.g., Bluetooth sniffers). We hope that our findings provide valuable input in the process of testing and certifying contact tracing apps, e.g., as planned for the German Corona-Warn-App, ultimately guiding improvements for secure and privacy-preserving design and implementation of digital contact tracing systems.
@article{mindthegap, abstract = {Contact tracing apps running on mobile devices promise to reduce the manual effort required for identifying infection chains and to increase the tracing accuracy in the presence of COVID-19. Several contract tracing apps have been proposed or deployed in practice. Also Google and Apple have announced their joint effort of providing an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP". Some countries have already decided or are planning to base their contact tracing apps on GAP. Several researchers have pointed out potential privacy and security risks related to most of the contact tracing approaches proposed until now, including those that claim privacy protection and are based on GAP. This report makes a first attempt towards providing empirical evidence in real-world scenarios for two such risks discussed in the literature: one concerning privacy, and the other one concerning security. In particular, we focus on a practical analysis of GAP, given that it is the foundation of several tracing apps. We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that principally can generate fake contacts with the potential of significantly affecting the accuracy of an app-based contact tracing system. For both types of attack, we have built tools that can be easily used on mobile phones or Raspberry Pis (e.g., Bluetooth sniffers). We hope that our findings provide valuable input in the process of testing and certifying contact tracing apps, e.g., as planned for the German Corona-Warn-App, ultimately guiding improvements for secure and privacy-preserving design and implementation of digital contact tracing systems.}, author = {Baumgärtner, Lars and Dmitrienko, Alexandra and Freisleben, Bernd and Gruler, Alexander and Höchst, Jonas and Kühlberg, Joshua and Mezini, Mira and Miettinen, Markus and Muhamedagic, Anel and Nguyen, Thien Duc and Penning, Alvar and Pustelnik, Dermot Frederik and Roos, Filipp and Sadeghi, Ahmad-Reza and Schwarz, Michael and Uhl, Christian}, journal = {ArXiv}, keywords = {technical-reports sss-group}, month = {jun}, title = {Mind the GAP: Security & Privacy Risks of Contact Tracing Apps}, year = 2020 }

Optimizing Parametric Dependencies for Incremental Performance Model Extraction. S. Voneva; M. Mazkatli; J. Grohmann; A. Koziolek; in Companion of the 14th European Conference Software Architecture (ECSA 2020), H. Muccini, P. Avgeriou, B. Buhnova, J. Cámara, M. Caporuscio, M. Franzago, A. Koziolek, P. Scandurra, C. Trubiani, D. Weyns, U. Zdun (eds.) (2020). (Vol. 1269) 228–240.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Model-based performance prediction in agile software development promises to evaluate design alternatives and to reduce the cost of performance tests. To minimize the differences between a real software and its performance model, parametric dependencies are introduced. They express how the performance model parameters (such as loop iteration count, branch transition probabilities, resource demands, and external service call arguments) depend on impacting factors like the input data. The approaches that perform model-based performance prediction in agile software development have two major shortcomings: they are either costly because they do not update the performance models automatically after each commit, or do not consider more complex parametric dependencies than linear. This work extends an approach for continuous integration of performance model during agile development. Our extension aims to optimize the learning of parametric dependencies with a genetic programming algorithm to be able to detect non-linear dependencies. The case study results show that using genetic programming enables detecting more complex dependencies and improves the accuracy of the updated performance model.
@inproceedings{VoMaGrKo-ECSA-Dependencies, abstract = {Model-based performance prediction in agile software development promises to evaluate design alternatives and to reduce the cost of performance tests. To minimize the differences between a real software and its performance model, parametric dependencies are introduced. They express how the performance model parameters (such as loop iteration count, branch transition probabilities, resource demands, and external service call arguments) depend on impacting factors like the input data. The approaches that perform model-based performance prediction in agile software development have two major shortcomings: they are either costly because they do not update the performance models automatically after each commit, or do not consider more complex parametric dependencies than linear. This work extends an approach for continuous integration of performance model during agile development. Our extension aims to optimize the learning of parametric dependencies with a genetic programming algorithm to be able to detect non-linear dependencies. The case study results show that using genetic programming enables detecting more complex dependencies and improves the accuracy of the updated performance model.}, address = {Cham}, author = {Voneva, Sonya and Mazkatli, Manar and Grohmann, Johannes and Koziolek, Anne}, booktitle = {Companion of the 14th European Conference Software Architecture ({ECSA} 2020)}, editor = {Muccini, Henry and Avgeriou, Paris and Buhnova, Barbora and C{{á}}mara, Javier and Caporuscio, Mauro and Franzago, Mirco and Koziolek, Anne and Scandurra, Patrizia and Trubiani, Catia and Weyns, Danny and Zdun, Uwe}, keywords = {myown descartes statistical_estimation_and_machine_learning parametric_dependencies prediction performance t_workshop}, month = {September}, pages = {228–240}, publisher = {Springer}, series = {Communications in Computer and Information Science}, title = {Optimizing Parametric Dependencies for Incremental Performance Model Extraction}, volume = 1269, year = 2020 }

Mind the GAP: Security & Privacy Risks of Contact Tracing Apps. L. Baumgärtner; A. Dmitrienko; B. Freisleben; J. Höchst; M. Mezini; M. Miettinen; T. D. Nguyen; A. Penning; F. Roos; A.-R. Sadeghi; M. Schwarz; C. Uhl; (2020).
Accepted to TrustCom 2020, Security Track
[ BibTeX ]
 
@inproceedings{baumgartner2020security, author = {Baumgärtner, Lars and Dmitrienko, Alexandra and Freisleben, Bernd and Höchst, Jonas and Mezini, Mira and Miettinen, Markus and Nguyen, Thien Duc and Penning, Alvar and Roos, Filipp and Sadeghi, Ahmad-Reza and Schwarz, Michael and Uhl, Christian}, keywords = {sss-group}, month = {September}, note = {Accepted to TrustCom 2020, Security Track}, title = {Mind the GAP: Security & Privacy Risks of Contact Tracing Apps}, year = 2020 }

Intra-individual physiological response of recreational runners to different training mesocycles: a randomized cross-over study. P. Düking; H.-C. Holmberg; P. Kunz; R. Leppich; B. Sperlich; in European Journal of Applied Physiology (2020). 1–9.
[ BibTeX ]
 
@article{duking2020intra, author = {D{ü}king, Peter and Holmberg, Hans-Christer and Kunz, Philipp and Leppich, Robert and Sperlich, Billy}, journal = {European Journal of Applied Physiology}, keywords = {myown t_full descartes sport t_interdisciplinary t_journalmagazine}, pages = {1–9}, publisher = {Springer}, title = {Intra-individual physiological response of recreational runners to different training mesocycles: a randomized cross-over study}, year = 2020 }

Incremental Calibration of Architectural Performance Models with Parametric Dependencies. M. Mazkatli; D. Monschein; J. Grohmann; A. Koziolek; in 2020 IEEE International Conference on Software Architecture (ICSA 2020) (2020). 23–34.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Architecture-based Performance Prediction (AbPP) allows evaluation of the performance of systems and to answer what-if questions without measurements for all alternatives. A difficulty when creating models is that Performance Model Parameters (PMPs, such as resource demands, loop iteration numbers and branch probabilities) depend on various influencing factors like input data, used hardware and the applied workload. To enable a broad range of what-if questions, Performance Models (PMs) need to have predictive power beyond what has been measured to calibrate the models. Thus, PMPs need to be parametrized over the influencing factors that may vary. Existing approaches allow for the estimation of parametrized PMPs by measuring the complete system. Thus, they are too costly to be applied frequently, up to after each code change. They do not keep also manual changes to the model when recalibrating. In this work, we present the Continuous Integration of Performance Models (CIPM), which incrementally extracts and calibrates the performance model, including parametric dependencies. CIPM responds to source code changes by updating the PM and adaptively instrumenting the changed parts. To allow AbPP, CIPM estimates the parametrized PMPs using the measurements (generated by performance tests or executing the system in production) and statistical analysis, e.g., regression analysis and decision trees. Additionally, our approach responds to production changes (e.g., load or deployment changes) and calibrates the usage and deployment parts of PMs accordingly. For the evaluation, we used two case studies. Evaluation results show that we were able to calibrate the PM incrementally and accurately.
@inproceedings{MaMoGrKo2020-ICSA, abstract = {Architecture-based Performance Prediction (AbPP) allows evaluation of the performance of systems and to answer what-if questions without measurements for all alternatives. A difficulty when creating models is that Performance Model Parameters (PMPs, such as resource demands, loop iteration numbers and branch probabilities) depend on various influencing factors like input data, used hardware and the applied workload. To enable a broad range of what-if questions, Performance Models (PMs) need to have predictive power beyond what has been measured to calibrate the models. Thus, PMPs need to be parametrized over the influencing factors that may vary. Existing approaches allow for the estimation of parametrized PMPs by measuring the complete system. Thus, they are too costly to be applied frequently, up to after each code change. They do not keep also manual changes to the model when recalibrating. In this work, we present the Continuous Integration of Performance Models (CIPM), which incrementally extracts and calibrates the performance model, including parametric dependencies. CIPM responds to source code changes by updating the PM and adaptively instrumenting the changed parts. To allow AbPP, CIPM estimates the parametrized PMPs using the measurements (generated by performance tests or executing the system in production) and statistical analysis, e.g., regression analysis and decision trees. Additionally, our approach responds to production changes (e.g., load or deployment changes) and calibrates the usage and deployment parts of PMs accordingly. For the evaluation, we used two case studies. Evaluation results show that we were able to calibrate the PM incrementally and accurately.}, author = {Mazkatli, Manar and Monschein, David and Grohmann, Johannes and Koziolek, Anne}, booktitle = {2020 IEEE International Conference on Software Architecture (ICSA 2020)}, keywords = {myown modeling t_full descartes statistical_estimation_and_machine_learning Automated_model_learning prediction performance}, month = {March}, pages = {23–34}, publisher = {IEEE}, title = {Incremental Calibration of Architectural Performance Models with Parametric Dependencies}, year = 2020 }

An Automated Forecasting Framework based on Method Recommendation for Seasonal Time Series. A. Bauer; M. Züfle; J. Grohmann; N. Schmitt; N. Herbst; S. Kounev; in Proceedings of the ACM/SPEC International Conference on Performance Engineering (2020). 48–55.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Due to the fast-paced and changing demands of their users, computing systems require autonomic resource management. To enable proactive and accurate decision-making for changes causing a particular overhead, reliable forecasts are needed. In fact, choosing the best performing forecasting method for a given time series scenario is a crucial task. Taking the "No-Free-Lunch Theorem" into account, there exists no forecasting method that performs best on all types of time series. To this end, we propose an automated approach that (i) extracts characteristics from a given time series, (ii) selects the best-suited machine learning method based on recommendation, and finally, (iii) performs the forecast. Our approach offers the benefit of not relying on a single method with its possibly inaccurate forecasts. In an extensive evaluation, our approach achieves the best forecasting accuracy.
@inproceedings{BaZuGrScHeKo-ICPE20-Seasonal-Forecast, abstract = {Due to the fast-paced and changing demands of their users, computing systems require autonomic resource management. To enable proactive and accurate decision-making for changes causing a particular overhead, reliable forecasts are needed. In fact, choosing the best performing forecasting method for a given time series scenario is a crucial task. Taking the "No-Free-Lunch Theorem" into account, there exists no forecasting method that performs best on all types of time series. To this end, we propose an automated approach that (i) extracts characteristics from a given time series, (ii) selects the best-suited machine learning method based on recommendation, and finally, (iii) performs the forecast. Our approach offers the benefit of not relying on a single method with its possibly inaccurate forecasts. In an extensive evaluation, our approach achieves the best forecasting accuracy.}, address = {New York, NY, USA}, author = {Bauer, Andr{é} and Z{ü}fle, Marwin and Grohmann, Johannes and Schmitt, Norbert and Herbst, Nikolas and Kounev, Samuel}, booktitle = {Proceedings of the ACM/SPEC International Conference on Performance Engineering}, keywords = {Online_monitoring_and_forecasting t_short descartes Prediction PRISMA}, month = {April}, pages = {48–55}, publisher = {Association for Computing Machinery (ACM)}, series = {ICPE '20}, title = {{An Automated Forecasting Framework based on Method Recommendation for Seasonal Time Series}}, year = 2020 }

An IoT Network Emulator for Analyzing the Influence of Varying Network Quality. S. Herrnleben; R. Ailabouni; J. Grohmann; T. Prantl; C. Krupitzer; S. Kounev; in Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools) (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
IoT devices often communicate over wireless or cellular networks with varying connection quality. These fluctuations are caused, among others, by the free-space path loss (FSPL), buildings, topological obstacles, weather, and mobility of the receiver. Varying signal quality affects bandwidth, transmission delays, packet loss, and jitter. Mobile IoT applications exposed to varying connection characteristics have to handle such variations and take them into account during development and testing. However, tests in real mobile networks are complex and challenging to reproduce. Therefore, network emulators can be used to simulate the behavior of real-world networks by adding artificial disturbance. However, existing network emulators often require a lot of technical knowledge and complex setup. Integrating such emulators into automated software testing pipelines could be a challenging task. In this paper, we propose a framework for emulating IoT networks with varying quality characteristics. An existing base emulator is used and integrated into our framework enabling the user to utilize it without extensive network expertise and configuration effort. The evaluation proves that our framework can simulate a variety of different network quality characteristics as well as emulating real-world network traces.
@inproceedings{HeAiGrPrKrKo2020-SIMUtools-IoT-Network-Emulator, abstract = {IoT devices often communicate over wireless or cellular networks with varying connection quality. These fluctuations are caused, among others, by the free-space path loss (FSPL), buildings, topological obstacles, weather, and mobility of the receiver. Varying signal quality affects bandwidth, transmission delays, packet loss, and jitter. Mobile IoT applications exposed to varying connection characteristics have to handle such variations and take them into account during development and testing. However, tests in real mobile networks are complex and challenging to reproduce. Therefore, network emulators can be used to simulate the behavior of real-world networks by adding artificial disturbance. However, existing network emulators often require a lot of technical knowledge and complex setup. Integrating such emulators into automated software testing pipelines could be a challenging task. In this paper, we propose a framework for emulating IoT networks with varying quality characteristics. An existing base emulator is used and integrated into our framework enabling the user to utilize it without extensive network expertise and configuration effort. The evaluation proves that our framework can simulate a variety of different network quality characteristics as well as emulating real-world network traces.}, author = {Herrnleben, Stefan and Ailabouni, Rudy and Grohmann, Johannes and Prantl, Thomas and Krupitzer, Christian and Kounev, Samuel}, booktitle = {Proceedings of the 12th EAI International Conference on Simulation Tools and Techniques (SIMUtools)}, keywords = {myown t_full descartes internet_of_things networking}, month = {August}, series = {SIMUtools 2020}, title = {An IoT Network Emulator for Analyzing the Influence of Varying Network Quality}, year = 2020 }

A Taxonomy of Techniques for SLO Failure Prediction in Software Systems. J. Grohmann; N. Herbst; A. Chalbani; Y. Arian; N. Peretz; S. Kounev; in Computers (2020). 9(1) 10.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ]
 
Failure prediction is an important aspect of self-aware computing systems. Therefore, a multitude of different approaches has been proposed in the literature over the past few years. In this work, we propose a taxonomy for organizing works focusing on the prediction of Service Level Objective (SLO) failures. Our taxonomy classifies related work along the dimensions of the prediction target (e.g., anomaly detection, performance prediction, or failure prediction), the time horizon (e.g., detection or prediction, online or offline application), and the applied modeling type (e.g., time series forecasting, machine learning, or queueing theory). The classification is derived based on a systematic mapping of relevant papers in the area. Additionally, we give an overview of different techniques in each sub-group and address remaining challenges in order to guide future research.
@article{grohmann2020-MDPI-taxonomy, abstract = {Failure prediction is an important aspect of self-aware computing systems. Therefore, a multitude of different approaches has been proposed in the literature over the past few years. In this work, we propose a taxonomy for organizing works focusing on the prediction of Service Level Objective (SLO) failures. Our taxonomy classifies related work along the dimensions of the prediction target (e.g., anomaly detection, performance prediction, or failure prediction), the time horizon (e.g., detection or prediction, online or offline application), and the applied modeling type (e.g., time series forecasting, machine learning, or queueing theory). The classification is derived based on a systematic mapping of relevant papers in the area. Additionally, we give an overview of different techniques in each sub-group and address remaining challenges in order to guide future research.}, author = {Grohmann, Johannes and Herbst, Nikolas and Chalbani, Avi and Arian, Yair and Peretz, Noam and Kounev, Samuel}, journal = {Computers}, keywords = {descartes performance t_journalmagazine se2 automated_model_learning}, number = 1, pages = 10, publisher = {Multidisciplinary Digital Publishing Institute (MDPI)}, title = {A Taxonomy of Techniques for SLO Failure Prediction in Software Systems}, volume = 9, year = 2020 }

Towards a Self-Aware Prediction of Critical States. M. Züfle; in Organic Computing: Doctoral Dissertation Colloquium 2020, S. Tomforde, C. Krupitzer (eds.) (2020).
(to appear)
[ BibTeX ]
 
@incollection{zufle2020towards, author = {Z{ü}fle, Marwin}, booktitle = {Organic Computing: Doctoral Dissertation Colloquium 2020}, editor = {Tomforde, Sven and Krupitzer, Christian}, keywords = {descartes Self-aware-computing statistical_estimation_and_machine_learning prediction online_monitoring_and_forecasting t_bookchapter}, month = {jul}, note = {(to appear)}, title = {Towards a Self-Aware Prediction of Critical States}, year = 2020 }

Learning to Learn in Collective Adaptive Systems: Mining Design Pattern for Data-driven Reasoning. M. D’Angelo; S. Ghahremani; S. Gerasimou; J. Grohmann; I. Nunes; S. Tomforde; E. Pournaras; in 2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C) (2020). 121–126.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Engineering collective adaptive systems (CAS) with learning capabilities is a challenging task due to their multidimensional and complex design space. Data-driven approaches for CAS design could introduce new insights enabling system engineers to manage the CAS complexity more cost-effectively at the design-phase. This paper introduces a systematic approach to reason about design choices and patterns of learning-based CAS. Using data from a systematic literature review, reasoning is performed with a novel application of data-driven methodologies such as clustering, multiple correspondence analysis and decision trees. The reasoning based on past experience as well as supporting novel and innovative design choices are demonstrated.
@conference{DaGhGeGrNuToPo2020-eCas-LearningInCAS, abstract = {Engineering collective adaptive systems (CAS) with learning capabilities is a challenging task due to their multidimensional and complex design space. Data-driven approaches for CAS design could introduce new insights enabling system engineers to manage the CAS complexity more cost-effectively at the design-phase. This paper introduces a systematic approach to reason about design choices and patterns of learning-based CAS. Using data from a systematic literature review, reasoning is performed with a novel application of data-driven methodologies such as clustering, multiple correspondence analysis and decision trees. The reasoning based on past experience as well as supporting novel and innovative design choices are demonstrated.}, author = {D'Angelo, Mirko and Ghahremani, Sona and Gerasimou, Simos and Grohmann, Johannes and Nunes, Ingrid and Tomforde, Sven and Pournaras, Evangelos}, booktitle = {2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C)}, keywords = {Statistical_estimation_and_machine_learning myown descartes t_workshop}, pages = {121–126}, publisher = {IEEE}, title = {Learning to Learn in Collective Adaptive Systems: Mining Design Pattern for Data-driven Reasoning}, year = 2020 }

SPEC Research Group Newsletter, vol. 3 no. 1. S. Kounev; A. van Hoorn; A. Bauer; N. Herbst; (2020, April).
Published by Standard Performance Evaluation Corporation (SPEC)
[ BibTeX ] [ URL ] [ Download ]
 
@misc{kounev2020research, author = {Kounev, Samuel and van Hoorn, Andre and Bauer, Andr{é} and Herbst, Nikolas}, keywords = {t_other descartes se2}, month = {April}, note = {Published by Standard Performance Evaluation Corporation (SPEC)}, title = {{SPEC Research Group Newsletter, vol. 3 no. 1}}, year = 2020 }

A Review of Serverless Use Cases and their Characteristics S. Eismann; J. Scheuner; E. van Eyk; M. Schwinger; J. Grohmann; N. Herbst; C. Abad; A. Iosup; (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
The serverless computing paradigm promises many desirable properties for cloud applications - low-cost, fine-grained deployment, and management-free operation. Consequently, the paradigm has underwent rapid growth: there currently exist tens of serverless platforms and all global cloud providers host serverless operations. To help tune existing platforms, guide the design of new serverless approaches, and overall contribute to understanding this paradigm, in this work we present a long-term, comprehensive effort to identify, collect, and characterize serverless use cases. We survey 89 use cases, sourced from white and grey literature, and from consultations with experts in areas such as scientific computing. We study each use case using 24 characteristics, including general aspects, but also workload, application, and requirements. When the use cases employ workflows, we further analyze their characteristics. Overall, we hope our study will be useful for both academia and industry, and encourage the community to further share and communicate their use cases.
@techreport{eismann2020review, abstract = {The serverless computing paradigm promises many desirable properties for cloud applications - low-cost, fine-grained deployment, and management-free operation. Consequently, the paradigm has underwent rapid growth: there currently exist tens of serverless platforms and all global cloud providers host serverless operations. To help tune existing platforms, guide the design of new serverless approaches, and overall contribute to understanding this paradigm, in this work we present a long-term, comprehensive effort to identify, collect, and characterize serverless use cases. We survey 89 use cases, sourced from white and grey literature, and from consultations with experts in areas such as scientific computing. We study each use case using 24 characteristics, including general aspects, but also workload, application, and requirements. When the use cases employ workflows, we further analyze their characteristics. Overall, we hope our study will be useful for both academia and industry, and encourage the community to further share and communicate their use cases.}, author = {Eismann, Simon and Scheuner, Joel and van Eyk, Erwin and Schwinger, Maximilian and Grohmann, Johannes and Herbst, Nikolas and Abad, Cristina and Iosup, Alexandru}, keywords = {myown descartes t_techreport}, month = {June}, publisher = {SPEC RG}, title = {A Review of Serverless Use Cases and their Characteristics}, year = 2020 }

Toward a Framework for Self-Learning Adaptation Planning through Optimization. V. Lesch; in Organic Computing: Doctoral Dissertation Colloquium 2020 (2020).
To appear
[ BibTeX ]
 
@incollection{lesch2020toward, author = {Lesch, Veronika}, booktitle = {Organic Computing: Doctoral Dissertation Colloquium 2020}, keywords = {myown self-aware-computing industry_4_0 optimization t_full descartes intelligent_transportation_systems cyber-physical_systems}, note = {To appear}, title = {Toward a Framework for Self-Learning Adaptation Planning through Optimization}, year = 2020 }

The impact of the German strategy for containment of Coronavirus SARS-CoV-2 on the training characteristics, physical activity, sleep of highly trained kayakers and canoeists: A retrospective observational study. C. Zinner; M. Matzka; R. Leppich; S. Kounev; H. Holmberg; B. Sperlich; in Frontiers in Sports and Active Living (2020). 2 127.
[ BibTeX ]
 
@article{zinner2020impact, author = {Zinner, Christoph and Matzka, Manuel and Leppich, Robert and Kounev, Samuel and Holmberg, HC and Sperlich, Billy}, journal = {Frontiers in Sports and Active Living}, keywords = {myown t_full descartes t_interdisciplinary t_journalmagazine health covid19}, pages = 127, publisher = {Frontiers}, title = {The impact of the German strategy for containment of Coronavirus SARS-CoV-2 on the training characteristics, physical activity, sleep of highly trained kayakers and canoeists: A retrospective observational study}, volume = 2, year = 2020 }

Introduction to the Special Issue ``Applications in Self-Aware Computing Systems and their Evaluation’’. C. Krupitzer; B. Eberhardinger; I. Gerostathopoulos; C. Raibulet; (2020).
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
The joint 1st Workshop on Evaluations and Measurements in Self-Aware Computing Systems (EMSAC 2019) and Workshop on Self-Aware Computing (SeAC) was held as part of the FAS* conference alliance in conjunction with the 16th IEEE International Conference on Autonomic Computing (ICAC) and the 13th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) in Umea, Sweden on 20 June 2019. The goal of this one-day workshop was to bring together researchers and practitioners from academic environments and from the industry to share their solutions, ideas, visions, and doubts in self-aware computing systems in general and in the evaluation and measurements of such systems in particular. The workshop aimed to enable discussions, partnerships, and collaborations among the participants. This special issue follows the theme of the workshop. It contains extended versions of workshop presentations as well as additional contributions.
@misc{KrEbGeRa2020_Computers_seacSI, abstract = {The joint 1st Workshop on Evaluations and Measurements in Self-Aware Computing Systems (EMSAC 2019) and Workshop on Self-Aware Computing (SeAC) was held as part of the FAS* conference alliance in conjunction with the 16th IEEE International Conference on Autonomic Computing (ICAC) and the 13th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) in Umea, Sweden on 20 June 2019. The goal of this one-day workshop was to bring together researchers and practitioners from academic environments and from the industry to share their solutions, ideas, visions, and doubts in self-aware computing systems in general and in the evaluation and measurements of such systems in particular. The workshop aimed to enable discussions, partnerships, and collaborations among the participants. This special issue follows the theme of the workshop. It contains extended versions of workshop presentations as well as additional contributions.}, author = {Krupitzer, Christian and Eberhardinger, Benedikt and Gerostathopoulos, Ilias and Raibulet, Claudia}, journal = {MDPI Computers}, keywords = {descartes se2}, number = 1, publisher = {MDPI}, title = {{Introduction to the Special Issue ``Applications in Self-Aware Computing Systems and their Evaluation''}}, volume = 9, year = 2020 }

Microservices: A Performance Tester’s Dream or Nightmare?. S. Eismann; C.-P. Bezemer; W. Shang; D. Okanovic; A. van Hoorn; in Proceedings of the 2020 ACM/SPEC International Conference on Performance Engineering (ICPE) (2020).
Acceptance Rate: 23.4% (15/64)
[ Abstract ] [ BibTeX ] [ Download ]
 
In recent years, there has been a shift in software development towards microservice-based architectures, which consist of small services that focus on one particular functionality. Many companies are migrating their applications to such architectures to reap the benefits of microservices, such as increased flexibility, scalability and a smaller granularity of the offered functionality by a service. On the one hand, the benefits of microservices for functional testing are often praised, as the focus on one functionality and their smaller granularity allow for more targeted and more convenient testing. On the other hand, using microservices has their consequences (both positive and negative) on other types of testing, such as performance testing. Performance testing is traditionally done by establishing the baseline performance of a software version, which is then used to compare the performance testing results of later software versions. However, as we show in this paper, establishing such a baseline performance is challenging in microservice applications. In this paper, we discuss the benefits and challenges of microservices from a performance testers point of view. Through a series of experiments on the TeaStore application, we demonstrate how microservices affect the performance testing process, and we demonstrate that it is not straightforward to achieve reliable performance testing results for a microservice application.
@inproceedings{EiBeShOkHo2020-ICPE-ServerlessWorkflows, abstract = {In recent years, there has been a shift in software development towards microservice-based architectures, which consist of small services that focus on one particular functionality. Many companies are migrating their applications to such architectures to reap the benefits of microservices, such as increased flexibility, scalability and a smaller granularity of the offered functionality by a service. On the one hand, the benefits of microservices for functional testing are often praised, as the focus on one functionality and their smaller granularity allow for more targeted and more convenient testing. On the other hand, using microservices has their consequences (both positive and negative) on other types of testing, such as performance testing. Performance testing is traditionally done by establishing the baseline performance of a software version, which is then used to compare the performance testing results of later software versions. However, as we show in this paper, establishing such a baseline performance is challenging in microservice applications. In this paper, we discuss the benefits and challenges of microservices from a performance testers point of view. Through a series of experiments on the TeaStore application, we demonstrate how microservices affect the performance testing process, and we demonstrate that it is not straightforward to achieve reliable performance testing results for a microservice application.}, author = {Eismann, Simon and Bezemer, Cor-Paul and Shang, Weiyi and Okanovic, Dusan and van Hoorn, Andre}, booktitle = {Proceedings of the 2020 ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {t_full descartes se2}, month = {April}, note = {{Acceptance Rate: 23.4% (15/64)}}, series = {ICPE'20}, title = {{Microservices: A Performance Tester's Dream or Nightmare?}}, year = 2020 }

Beyond Microbenchmarks: The SPEC-RG Vision for A Comprehensive Serverless Benchmark. E. van Eyk; J. Scheuner; S. Eismann; C. Abad; A. Iosup; in Companion of the 2020 ACM/SPEC International Conference on Performance Engineering (2020).
[ Abstract ] [ BibTeX ] [ Download ]
 
Serverless computing services, such as Function-as-a-Service (FaaS), hold the attractive promise of a high level of abstraction and high performance, combined with the minimization of operational logic. Several large ecosystems of serverless platforms, both open- and closed-source, aim to realize this promise. Consequently, a lucrative market has emerged. However, the performance trade-offs of these systems are not well-understood. Moreover, it is exactly the high level of abstraction and the opaqueness of the operational-side that make performance evaluation studies of serverless platforms challenging. Learning from the history of IT platforms, we argue that a benchmark for serverless platforms could help address this challenge. We envision a comprehensive serverless benchmark, which we contrast to the narrow focus of prior work in this area. We argue that a comprehensive benchmark will need to take into account more than just runtime overhead, and include notions of cost, realistic workloads, more (open-source) platforms, and cloud integrations. Finally, we show through preliminary real-world experiments how such a benchmark can help compare the performance overhead when running a serverless workload on state-of-the-art platforms.
@inproceedings{10.1145/3185768.3186293, abstract = {Serverless computing services, such as Function-as-a-Service (FaaS), hold the attractive promise of a high level of abstraction and high performance, combined with the minimization of operational logic. Several large ecosystems of serverless platforms, both open- and closed-source, aim to realize this promise. Consequently, a lucrative market has emerged. However, the performance trade-offs of these systems are not well-understood. Moreover, it is exactly the high level of abstraction and the opaqueness of the operational-side that make performance evaluation studies of serverless platforms challenging. Learning from the history of IT platforms, we argue that a benchmark for serverless platforms could help address this challenge. We envision a comprehensive serverless benchmark, which we contrast to the narrow focus of prior work in this area. We argue that a comprehensive benchmark will need to take into account more than just runtime overhead, and include notions of cost, realistic workloads, more (open-source) platforms, and cloud integrations. Finally, we show through preliminary real-world experiments how such a benchmark can help compare the performance overhead when running a serverless workload on state-of-the-art platforms.}, author = {van Eyk, Erwin and Scheuner, Joel and Eismann, Simon and Abad, Cristina and Iosup, Alexandru}, booktitle = {Companion of the 2020 ACM/SPEC International Conference on Performance Engineering}, keywords = {t_visionposition Metrics_and_benchmarking_methodologies Performance descartes SPEC}, title = {{Beyond Microbenchmarks: The SPEC-RG Vision for A Comprehensive Serverless Benchmark}}, year = 2020 }

Towards Self-Aware Multirotor Formations. D. Kaiser; V. Lesch; J. Rothe; M. Strohmeier; F. Spiess; C. Krupitzer; S. Montenegro; S. Kounev; in Computers (2020). 9(7)
Special Issue on Self-Aware Computing
[ BibTeX ] [ Download ]
 
@article{Kaiser2020Towards, author = {Kaiser, Dennis and Lesch, Veronika and Rothe, Julian and Strohmeier, Michael and Spiess, Florian and Krupitzer, Christian and Montenegro, Sergio and Kounev, Samuel}, journal = {Computers}, keywords = {Internet_of_Things Cyber-Physical_Systems Design_of_software_and_systems Analytical_and_simulation-based_analysis Simulation descartes Self-aware-computing t_journalmagazine Intelligent_Transportation_Systems}, month = {Februar}, note = {Special Issue on Self-Aware Computing}, number = 7, publisher = {MDPI}, title = {{Towards Self-Aware Multirotor Formations}}, volume = 9, year = 2020 }

Methodological Principles for Reproducible Performance Evaluation in Cloud Computing. A. V. Papadopoulos; L. Versluis; A. Bauer; N. Herbst; J. von Kistowski; A. Ali-Eldin; C. L. Abad; J. N. Amaral; P. Tuma; A. Iosup; in Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, M. Felderer, W. Hasselbring, R. Rabiser, R. Jung (eds.) (2020). (Vol. P-300) 93–94.
[ BibTeX ] [ URL ] [ Download ]
 
@inproceedings{DBLP:conf/se/PapadopoulosVBH20, author = {Papadopoulos, Alessandro Vittorio and Versluis, Laurens and Bauer, Andr{{é}} and Herbst, Nikolas and von Kistowski, J{{ó}}akim and Ali{-}Eldin, Ahmed and Abad, Cristina L. and Amaral, Jos{{é}} Nelson and Tuma, Petr and Iosup, Alexandru}, booktitle = {Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria}, editor = {Felderer, Michael and Hasselbring, Wilhelm and Rabiser, Rick and Jung, Reiner}, keywords = {t_extendedabstract descartes se2}, pages = {93–94}, publisher = {Gesellschaft f{{ü}}r Informatik e.V.}, series = {{LNI}}, title = {{Methodological Principles for Reproducible Performance Evaluation in Cloud Computing}}, volume = {{P-300}}, year = 2020 }

Time Series Forecasting for Self-Aware Systems. A. Bauer; M. Züfle; N. Herbst; A. Zehe; A. Hotho; S. Kounev; in Proceedings of the IEEE (2020). 108(7) 1068–1093.
[ BibTeX ] [ DOI ]
 
@article{BaZuHeZeHoKo-PIEEE-Forecasting, author = {Bauer, Andr{é} and Z{ü}fle, Marwin and Herbst, Nikolas and Zehe, Albin and Hotho, Andreas and Kounev, Samuel}, journal = {Proceedings of the IEEE}, keywords = {Telescope Metrics_and_benchmarking_methodologies Online_monitoring_and_forecasting descartes Self-aware-computing Prediction Elasticity t_journalmagazine}, month = 7, number = 7, pages = {1068 - 1093}, title = {{Time Series Forecasting for Self-Aware Systems}}, volume = 108, year = 2020 }

A Concept for Crowd-sensed Prediction of Mobile Network Connectivity. S. Herrnleben; B. Zeidler; M. Züfle; C. Krupitzer; S. Kounev; in GI/ITG Workshop on Machine Learning in the Context of Communication Networks 2020 (2020).
[ BibTeX ]
 
@inproceedings{HeZeZuKrKo-FGMLN2020-Prediction-of-Mobile-Network-Connectivity, author = {Herrnleben, Stefan and Zeidler, Bernd and Z{ü}fle, Marwin and Krupitzer, Christian and Kounev, Samuel}, booktitle = {GI/ITG Workshop on Machine Learning in the Context of Communication Networks 2020}, keywords = {Internet_of_Things Networking descartes Cloud Prediction Automated_model_learning Application-aware Self-adaptive-systems t_workshop}, month = {February}, title = {{A Concept for Crowd-sensed Prediction of Mobile Network Connectivity}}, year = 2020 }

Energy Efficiency Analysis of Compiler Optimizations on the SPEC CPU 2017 Benchmark Suite. N. Schmitt; J. Bucek; K.-D. Lange; S. Kounev; in Proceedings of the 11th ACM/SPEC International Conference on Performance Engineering (ICPE 2020) (2020).
[ BibTeX ] [ URL ] [ Download ]
 
@inproceedings{ScLaBuKo-ICPE20-SPEC-CPU2017, address = {New York, NY, USA}, author = {Schmitt, Norbert and Bucek, James and Lange, Klaus-Dieter and Kounev, Samuel}, booktitle = {Proceedings of the 11th ACM/SPEC International Conference on Performance Engineering (ICPE 2020)}, keywords = {myown Performance descartes SPEC t_wip Power-energy_efficient_computing Power}, month = {April}, publisher = {ACM}, title = {{Energy Efficiency Analysis of Compiler Optimizations on the SPEC CPU 2017 Benchmark Suite}}, year = 2020 }

A Survey on Predictive Maintenance for Industry 4.0 C. Krupitzer; T. Wagenhals; M. Züfle; V. Lesch; D. Schäfer; A. Mozaffarin; J. Edinger; C. Becker; S. Kounev; (2020).
[ BibTeX ] [ URL ] [ Download ]
 
@techreport{Krupitzer2020ASurveyPdM, author = {Krupitzer, Christian and Wagenhals, Tim and Z{ü}fle, Marwin and Lesch, Veronika and Sch{ä}fer, Dominik and Mozaffarin, Amin and Edinger, Janick and Becker, Christian and Kounev, Samuel}, institution = {Universit{ä}t W{ü}rzburg and University of Mannheim and Syntax Systems GmbH and MOZYS Engineering GmbH}, journal = {arXiv}, keywords = {Internet_of_Things Survey Cyber-Physical_Systems Online_monitoring_and_forecasting descartes Prediction Industry_4_0 t_techreport Reliability}, month = {feb}, title = {{A Survey on Predictive Maintenance for Industry 4.0}}, year = 2020 }

To Fail Or Not To Fail: Predicting Hard Disk Drive Failure Time Windows. M. Züfle; C. Krupitzer; F. Erhard; J. Grohmann; S. Kounev; in Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems (2020). 19–36.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Due to the increasing size of today's data centers as well as the expectation of 24/7 availability, the complexity in the administration of hardware continuously icreases. Techniques as the Self-Monitoring, Analysis, and Reporting Technology (S.M.A.R.T.) support the monitoring of the hardware. However, those techniques often lack algorithms for intelligent data analytics. Especially, the integration of machine learning to identify potential failures in advance seems to be promising to reduce administration overhead. In this work, we present three machine learning approaches to (i) identify imminent failures, (ii) predict time windows for failures, as well as (iii) predict the exact time-to-failure. In a case study with real data from 369 hard disks, we achieve an F1-score of up to 98.0% and 97.6% for predicting potential failures with two or multiple time windows, respectively, and a hit rate of 84.9% (with a mean absolute error of 4.5 hours) for predicting the time-to-failure.
@inproceedings{ZuKrErGrKo-MMB2020-ToFailOrNotToFail, abstract = {Due to the increasing size of today's data centers as well as the expectation of 24/7 availability, the complexity in the administration of hardware continuously icreases. Techniques as the Self-Monitoring, Analysis, and Reporting Technology (S.M.A.R.T.) support the monitoring of the hardware. However, those techniques often lack algorithms for intelligent data analytics. Especially, the integration of machine learning to identify potential failures in advance seems to be promising to reduce administration overhead. In this work, we present three machine learning approaches to (i) identify imminent failures, (ii) predict time windows for failures, as well as (iii) predict the exact time-to-failure. In a case study with real data from 369 hard disks, we achieve an F1-score of up to 98.0% and 97.6% for predicting potential failures with two or multiple time windows, respectively, and a hit rate of 84.9% (with a mean absolute error of 4.5 hours) for predicting the time-to-failure.}, address = {Cham}, author = {Z{ü}fle, Marwin and Krupitzer, Christian and Erhard, Florian and Grohmann, Johannes and Kounev, Samuel}, booktitle = {Proceedings of the 20th International GI/ITG Conference on Measurement, Modelling and Evaluation of Computing Systems}, keywords = {Statistical_estimation_and_machine_learning Internet_of_Things Cyber-Physical_Systems Performance t_full descartes Prediction PRISMA Reliability}, month = {March}, pages = {19–36}, publisher = {Springer}, series = {MMB 2020}, title = {{To Fail Or Not To Fail: Predicting Hard Disk Drive Failure Time Windows}}, year = 2020 }

Telescope: An Automatic Feature Extraction and Transformation Approach for Time Series Forecasting on a Level-Playing Field. A. Bauer; M. Züfle; N. Herbst; S. Kounev; V. Curtef; in Proceedings of the 36th International Conference on Data Engineering (ICDE) (2020).
[ BibTeX ] [ Download ]
 
@inproceedings{BaZuHeKoCu-ICDE-Telescope, author = {Bauer, Andr{é} and Z{ü}fle, Marwin and Herbst, Nikolas and Kounev, Samuel and Curtef, Valentin}, booktitle = {Proceedings of the 36th International Conference on Data Engineering (ICDE)}, keywords = {Tool Telescope Online_monitoring_and_forecasting t_short descartes Prediction}, month = {April}, title = {Telescope: An Automatic Feature Extraction and Transformation Approach for Time Series Forecasting on a Level-Playing Field}, year = 2020 }

A Survey on Human Machine Interaction in Industry 4.0 C. Krupitzer; S. Müller; V. Lesch; M. Züfle; J. Edinger; A. Lemken; D. Schäfer; S. Kounev; C. Becker; (2020).
[ BibTeX ] [ URL ] [ Download ]
 
@techreport{Krupitzer2020ASurvey, author = {Krupitzer, Christian and M{ü}ller, Sebastian and Lesch, Veronika and Z{ü}fle, Marwin and Edinger, Janick and Lemken, Alexander and Sch{ä}fer, Dominik and Kounev, Samuel and Becker, Christian}, institution = {Universit{ä}t W{ü}rzburg and University of Mannheim and ioxp GmbH and Syntax Systems GmbH}, journal = {arXiv}, keywords = {Survey descartes Industry_4_0 t_techreport}, month = {feb}, title = {{A Survey on Human Machine Interaction in Industry 4.0}}, year = 2020 }

Predicting the Costs of Serverless Workflows. S. Eismann; J. Grohmann; E. van Eyk; N. Herbst; S. Kounev; in Proceedings of the 2020 ACM/SPEC International Conference on Performance Engineering (ICPE) (2020). 265–276.
Acceptance Rate: 23.4% (15/64)
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Function-as-a-Service (FaaS) platforms enable users to run arbitrary functions without being concerned about operational issues, while only paying for the consumed resources. Individual functions are often composed into workflows for complex tasks. However, the pay-per-use model and nontransparent reporting by cloud providers make it challenging to estimate the expected cost of a workflow, which prevents informed business decisions. Existing cost-estimation approaches assume a static response time for the serverless functions, without taking input parameters into account. In this paper, we propose a methodology for the cost prediction of serverless workflows consisting of input-parameter sensitive function models and a monte-carlo simulation of an abstract workflow model. Our approach enables workflow designers to predict, compare, and optimize the expected costs and performance of a planned workflow, which currently requires time-intensive experimentation. In our evaluation, we show that our approach can predict the response time and output parameters of a function based on its input parameters with an accuracy of 96.1%. In a case study with two audio-processing workflows, our approach predicts the costs of the two workflows with an accuracy of 96.2%.
@inproceedings{EiGrEyHeKo2020-ICPE-ServerlessWorkflows, abstract = {Function-as-a-Service (FaaS) platforms enable users to run arbitrary functions without being concerned about operational issues, while only paying for the consumed resources. Individual functions are often composed into workflows for complex tasks. However, the pay-per-use model and nontransparent reporting by cloud providers make it challenging to estimate the expected cost of a workflow, which prevents informed business decisions. Existing cost-estimation approaches assume a static response time for the serverless functions, without taking input parameters into account. In this paper, we propose a methodology for the cost prediction of serverless workflows consisting of input-parameter sensitive function models and a monte-carlo simulation of an abstract workflow model. Our approach enables workflow designers to predict, compare, and optimize the expected costs and performance of a planned workflow, which currently requires time-intensive experimentation. In our evaluation, we show that our approach can predict the response time and output parameters of a function based on its input parameters with an accuracy of 96.1%. In a case study with two audio-processing workflows, our approach predicts the costs of the two workflows with an accuracy of 96.2%.}, address = {New York, NY, USA}, author = {Eismann, Simon and Grohmann, Johannes and van Eyk, Erwin and Herbst, Nikolas and Kounev, Samuel}, booktitle = {Proceedings of the 2020 ACM/SPEC International Conference on Performance Engineering (ICPE)}, keywords = {t_full descartes se2}, month = {April}, note = {{Acceptance Rate: 23.4% (15/64)}}, pages = {265–276}, publisher = {Association for Computing Machinery (ACM)}, series = {ICPE '20}, title = {Predicting the Costs of Serverless Workflows}, year = 2020 }

Evaluating the Performance of a State-of-the-Art Group-oriented Encryption Scheme for Dynamic Groups in an IoT Scenario. T. Prantl; P. Ten; L. Iffländer; A. Dmitrenko; S. Kounev; C. Krupitzer; in 2020 IEEE 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) (2020).
Acceptance Rate: 27%
[ Abstract ] [ BibTeX ]
 
New emerging technologies, such as autonomous driving, intelligent buildings, and smart cities, are promising to revolutionize user experience and offer new services. The world has to undergo large scale deployment of billions of things — cost-efficient intelligent sensors that will be interconnected into extensive networks and will collect and supply data to intelligent algorithms — to make it happen. To date, however, it is challenging to secure such an infrastructure for many-fold reasons, such as resource constraints of things, large scale deployment, manyto-many communication patterns, and dynamically changing communication groups. All these factors rule out most of the state-of-the-art encryption and key-management techniques. Group encryption algorithms are well-suitable for many-tomany communication patterns typical for IoT networks, and many of them can deal with dynamic groups. There are, however, very few constructions that could potentially fulfill the computational and storage constraints of IoT devices while providing sufficient scalability for large networks. The promising candidates, such as construction by Nishat et al. [1], were not evaluated using IoT platforms and under constraints typical for IoT networks. In this paper, we aim to fill this gap and present the evaluation of a state-of-the-art group-oriented encryption scheme by Nishat et al. to identify its applicability to IoT systems. In detail, we provide a measurement workflow, a revised version of the approach, and describe a reproducible hardware testbed. Using this evaluation environment, we analyze the performance of the encryption scheme in a typical IoT scenario from a group member perspective. The results show that all calculation times can be assumed to be constant and are always below 2 seconds. The memory requirement for permanent parameters can also be considered to be constant and are below 8.5 kbit in each case. However, the information that has to be stored temporarily for group updates has turned out to be the bottleneck of the scheme, since their memory requirements increase linearly with the group size.
@inproceedings{PrTeIfDmKo2020-MASCOTS-GroupEncryption, abstract = {New emerging technologies, such as autonomous driving, intelligent buildings, and smart cities, are promising to revolutionize user experience and offer new services. The world has to undergo large scale deployment of billions of things — cost-efficient intelligent sensors that will be interconnected into extensive networks and will collect and supply data to intelligent algorithms — to make it happen. To date, however, it is challenging to secure such an infrastructure for many-fold reasons, such as resource constraints of things, large scale deployment, manyto-many communication patterns, and dynamically changing communication groups. All these factors rule out most of the state-of-the-art encryption and key-management techniques. Group encryption algorithms are well-suitable for many-tomany communication patterns typical for IoT networks, and many of them can deal with dynamic groups. There are, however, very few constructions that could potentially fulfill the computational and storage constraints of IoT devices while providing sufficient scalability for large networks. The promising candidates, such as construction by Nishat et al. [1], were not evaluated using IoT platforms and under constraints typical for IoT networks. In this paper, we aim to fill this gap and present the evaluation of a state-of-the-art group-oriented encryption scheme by Nishat et al. to identify its applicability to IoT systems. In detail, we provide a measurement workflow, a revised version of the approach, and describe a reproducible hardware testbed. Using this evaluation environment, we analyze the performance of the encryption scheme in a typical IoT scenario from a group member perspective. The results show that all calculation times can be assumed to be constant and are always below 2 seconds. The memory requirement for permanent parameters can also be considered to be constant and are below 8.5 kbit in each case. However, the information that has to be stored temporarily for group updates has turned out to be the bottleneck of the scheme, since their memory requirements increase linearly with the group size.}, author = {Prantl, Thomas and Ten, Peter and Iffländer, Lukas and Dmitrenko, Alexandra and Kounev, Samuel and Krupitzer, Christian}, booktitle = {2020 IEEE 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, keywords = {Internet_of_Things myown Security t_full descartes Group_Encryption sss-group Performance_Evaluation}, month = {November}, note = {Acceptance Rate: 27\%}, series = {MASCOTS '20}, title = {Evaluating the Performance of a State-of-the-Art Group-oriented Encryption Scheme for Dynamic Groups in an IoT Scenario}, year = 2020 }

2019 [ nach oben ]

Towards Testing the Performance Influence of Hypervisor Hypercall Interface Behavior. L. Beierlieb; L. Iffländer; S. Kounev; A. Milenkoski; in Proceedings of the 10th Symposium on Software Performance 2019 (SSP’19) (2019).
[ Abstract ] [ BibTeX ] [ Download ]
 
With the continuing rise of cloud technology hypervisors play a vital role in the performance and reliability of current services. Hypervisors offer so-called hypercall interfaces for communication with the hosted virtual machines. These interfaces require thorough robustness to assure performance, security, and reliability. Existing research focusses on finding hypercall-related vulnerabilities. In this work, we discuss open challenges regarding hypercall interfaces. To address these challenges, we propose an extensive framework architecture to perform robustness testing on hypercall interfaces. This framework supports test campaigns and modeling of hypercall interfaces.
@inproceedings{Beierlieb_2019_TowardsTestingthePerformanceInfluenceofHypervisorHypercallInterfaceBehavior, abstract = {With the continuing rise of cloud technology hypervisors play a vital role in the performance and reliability of current services. Hypervisors offer so-called hypercall interfaces for communication with the hosted virtual machines. These interfaces require thorough robustness to assure performance, security, and reliability. Existing research focusses on finding hypercall-related vulnerabilities. In this work, we discuss open challenges regarding hypercall interfaces. To address these challenges, we propose an extensive framework architecture to perform robustness testing on hypercall interfaces. This framework supports test campaigns and modeling of hypercall interfaces.}, author = {Beierlieb, Lukas and Iffländer, Lukas and Kounev, Samuel and Milenkoski, Aleksandar}, booktitle = {Proceedings of the 10th Symposium on Software Performance 2019 (SSP'19)}, keywords = {myown Performance Security t_short descartes EvIDencE HInjector Isolation Instrumentation_profiling_and_workload_characterization Virtualization}, month = 11, title = {Towards Testing the Performance Influence of Hypervisor Hypercall Interface Behavior}, year = 2019 }

Discrete-Time Analysis of the Blockchain Distributed Ledger Technology. S. Geissler; T. Prantl; S. Lange; F. Wamser; T. Hossfeld; in Proceedings of the 31st International Teletraffic Congress (ITC) (2019).
[ BibTeX ]
 
@inproceedings{GePrLaWaHo2019-ITC-Blockchain, author = {Geissler, Stefan and Prantl, Thomas and Lange, Stanislav and Wamser, Florian and Hossfeld, Tobias}, booktitle = {Proceedings of the 31st International Teletraffic Congress (ITC)}, keywords = {Networking Performance Security t_full descartes}, month = {August}, title = {Discrete-Time Analysis of the Blockchain Distributed Ledger Technology}, year = 2019 }

Methodological Principles for Reproducible Performance Evaluation in Cloud Computing. A. V. Papadopoulos; L. Versluis; A. Bauer; N. Herbst; J. von Kistowski; A. Ali-Eldin; C. Abad; J. N. Amaral; P. Tuma; A. Iosup; in IEEE Transactions on Software Engineering (2019). 1–1.
[ BibTeX ] [ Download ]
 
@article{PaVeBaHeKiAEAbAmTuIo2019-TSE-MethodologicalPrinciples, author = {Papadopoulos, Alessandro Vittorio and Versluis, Laurens and Bauer, Andr{é} and Herbst, Nikolas and von Kistowski, J{ó}akim and Ali-Eldin, Ahmed and Abad, Cristina and Amaral, J. Nelson and Tuma, Petr and Iosup, Alexandru}, journal = {IEEE Transactions on Software Engineering}, keywords = {Metrics_and_benchmarking_methodologies Performance descartes Cloud t_journalmagazine SPEC}, month = {July}, pages = {1-1}, title = {Methodological Principles for Reproducible Performance Evaluation in Cloud Computing}, year = 2019 }

Measuring, Rating, and Predicting the Energy Efficiency of Servers. J. von Kistowski; (2019, March).
[ BibTeX ] [ URL ]
 
@phdthesis{Kistowski2019-phd, author = {von Kistowski, J{ó}akim}, keywords = {Supervised_PhD_Thesis descartes Prediction LIMBO Power}, month = {March}, school = {University of W{ü}rzburg, Germany}, title = {Measuring, Rating, and Predicting the Energy Efficiency of Servers}, year = 2019 }

The Organic Computing Doctoral Dissertation Colloquium: Status and Overview in 2019. C. Krupitzer; S. Tomforde; in Proceedings of the INFORMATIK 2019 (Workshop-Beiträge) (2019).
[ BibTeX ]
 
@inproceedings{KrTo2019_Informatik_OC-DDC, author = {Krupitzer, Christian and Tomforde, Sven}, booktitle = {Proceedings of the INFORMATIK 2019 (Workshop-Beitr{ä}ge)}, keywords = {Internet_of_Things descartes Self-adaptive-systems}, organization = {Gesellschaft f{ü}r Informatik eV}, title = {The Organic Computing Doctoral Dissertation Colloquium: Status and Overview in 2019}, year = 2019 }

Emerging Self-Integration through Coordination of Autonomous Adaptive Systems. V. Lesch; C. Krupitzer; S. Tomforde; in Proceedings of the 4th IEEE International Workshops on Foundations and Applications of Self* Systems, FAS*W@ICAC/SASO 2019 (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{LeKrTo2019_SISSY, author = {Lesch, Veronika and Krupitzer, Christian and Tomforde, Sven}, booktitle = {Proceedings of the 4th {IEEE} International Workshops on Foundations and Applications of Self* Systems, FAS*W@ICAC/SASO 2019}, keywords = {Internet_of_Things Cyber-Physical_Systems descartes Self-aware-computing Self-adaptive-systems t_workshop}, month = {June}, publisher = {IEEE}, title = {{Emerging Self-Integration through Coordination of Autonomous Adaptive Systems}}, year = 2019 }

Please Obey My Plan: How to Optimise Decentralised Self-Adaptive Systems. V. Lesch; C. Krupitzer; S. Tomforde; (2019, April).
[ BibTeX ] [ Download ]
 
@misc{talk-Lesch-SelPhyS19, author = {Lesch, Veronika and Krupitzer, Christian and Tomforde, Sven}, howpublished = {Talk at Workshop on Self-Awareness in Cyber-Physical Systems 2019}, keywords = {Internet_of_Things Cyber-Physical_Systems se2_talk t_talk descartes Multi-criteria_optimization Talks Self-adaptive-systems Optimization}, month = {April}, title = {{Please Obey My Plan: How to Optimise Decentralised Self-Adaptive Systems}}, year = 2019 }

A Modular Simulation Framework for Analyzing Platooning Coordination. C. Krupitzer; V. Lesch; M. Pfannemüller; C. Becker; M. Segata; in Proceedings of the 1st ACM Workshop on Technologies, mOdels, and Protocols for Cooperative Connected Cars (TOP-Cars), Colocated with ACM MobiHoc 2019 (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{KrLePfBeSe2019_TOPCars, author = {Krupitzer, Christian and Lesch, Veronika and Pfannem{ü}ller, Martin and Becker, Christian and Segata, Michele}, booktitle = {Proceedings of the 1st {ACM} Workshop on Technologies, mOdels, and Protocols for Cooperative Connected Cars (TOP-Cars), Colocated with ACM MobiHoc 2019}, keywords = {Tool Internet_of_Things Cyber-Physical_Systems Analytical_and_simulation-based_analysis Simulation descartes t_workshop Intelligent_Transportation_Systems}, month = {July}, publisher = {ACM}, title = {{A Modular Simulation Framework for Analyzing Platooning Coordination}}, year = 2019 }

WheelShare: Crowd-sensed Surface Classification for Accessible Routing. J. Edinger; V. Raychoudhury; A. Hofmann; A. Wachner; C. Becker; C. Krupitzer; in Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) (2019).
[ Abstract ] [ BibTeX ] [ Download ]
 
Accessible path routing for wheeled mobility is an important problem given the permanent and temporary obstacles in the built environment. Existing research works have focused on identifying several obstacles as well as facilities such as crosswalks with traffic signals using smartphone based sensing or crowd-sourcing and used those knowledge to generate accessible routes. While all those research works have identified the nature of the road or sidewalk surface (even/uneven) as a major accessibility concern, there is no in-depth empirical research regarding how the accessibility varies from surface to surface. In this work, we propose a hybrid system, called WheelShare which can clearly classify (in/)accessible surfaces.We have analyzed vibration (using an aide-propelled manual wheelchair) data from 11 different standard indoor and outdoor surfaces found in the built environment and classified them using WheelShare into five different categories across the accessibility spectrum with an accuracy of up to 95\%.Our objective knowledge of surfaces is then applied to generate an accessible route through the best possible surface depending on user and wheelchair requirements. WheelShare is 1) scalable, as it uses crowd-sensing to collect data, 2) dynamic, as the data gets constantly updated, and 3) objective, as it uses an objective and data-centric approach.
@inproceedings{EdRaHoWaBeKr2019-TSUM-wheelShareConcept, abstract = {Accessible path routing for wheeled mobility is an important problem given the permanent and temporary obstacles in the built environment. Existing research works have focused on identifying several obstacles as well as facilities such as crosswalks with traffic signals using smartphone based sensing or crowd-sourcing and used those knowledge to generate accessible routes. While all those research works have identified the nature of the road or sidewalk surface (even/uneven) as a major accessibility concern, there is no in-depth empirical research regarding how the accessibility varies from surface to surface. In this work, we propose a hybrid system, called WheelShare which can clearly classify (in/)accessible surfaces.We have analyzed vibration (using an aide-propelled manual wheelchair) data from 11 different standard indoor and outdoor surfaces found in the built environment and classified them using WheelShare into five different categories across the accessibility spectrum with an accuracy of up to 95\%.Our objective knowledge of surfaces is then applied to generate an accessible route through the best possible surface depending on user and wheelchair requirements. WheelShare is 1) scalable, as it uses crowd-sensing to collect data, 2) dynamic, as the data gets constantly updated, and 3) objective, as it uses an objective and data-centric approach.}, address = {Kyoto, Japan}, author = {Edinger, Janick and Raychoudhury, Vaskar and Hofmann, Alexandra and Wachner, Anton and Becker, Christian and Krupitzer, Christian}, booktitle = {Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)}, keywords = {Internet_of_Things descartes Self-aware-computing Self-adaptive-systems Optimization}, title = {{WheelShare: Crowd-sensed Surface Classification for Accessible Routing}}, year = 2019 }

Planning as Optimization: Dynamically Discovering Optimal Configurations for Runtime Situations. E. M. Fredericks; I. Gerostathopoulos; C. Krupitzer; T. Vogel; in Proceedings of the 13th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2019 (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{FrGeKrVo2019, author = {Fredericks, Erik M. and Gerostathopoulos, Ilias and Krupitzer, Christian and Vogel, Thomas}, booktitle = {Proceedings of the 13th {IEEE} International Conference on Self-Adaptive and Self-Organizing Systems, {SASO} 2019}, keywords = {Internet_of_Things Cyber-Physical_Systems descartes Self-aware-computing Multi-criteria_optimization Self-adaptive-systems Intelligent_Transportation_Systems Optimization}, month = {June}, publisher = {IEEE}, title = {Planning as Optimization: Dynamically Discovering Optimal Configurations for Runtime Situations}, year = 2019 }

A survey on adaptive authentication. P. Arias-Cabarcos; C. Krupitzer; C. Becker; in ACM Computing Surveys (2019). 52 Art. 80.
[ BibTeX ] [ URL ] [ Download ]
 
@article{ArKrBe2019_CSUR_surveyAdaptiveAuthentication, address = {New York, NY}, author = {Arias-Cabarcos, Patricia and Krupitzer, Christian and Becker, Christian}, journal = {ACM Computing Surveys}, keywords = {Internet_of_Things Security descartes Application-aware Self-adaptive-systems}, pages = {Art. 80}, publisher = {ACM Press}, title = {A survey on adaptive authentication}, volume = 52, year = 2019 }

Beyond position-awareness -- Extending a self-adaptive fall detection system. C. Krupitzer; T. Sztyler; J. Edinger; M. Breitbach; H. Stuckenschmidt; C. Becker; in Pervasive and Mobile Computing (2019). 58
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
Ambient Assisted Living using mobile device sensors is an active area of research in pervasive computing. Multiple approaches have shown that wearable sensors perform very well and distinguish falls reliably from Activities of Daily Living. However, these systems are tested in a controlled environment and are optimized for a given set of sensor types, sensor positions, and subjects. We propose a self-adaptive pervasive fall detection approach that is robust to the heterogeneity of real life situations. Using the data of four publicly available datasets, we show that our system is not only robust regarding the different dimensions of heterogeneity, but also adapts autonomously to spontaneous changes in the sensor’s position at runtime. In this paper, we extend our self-adaptive fall detection system with (i) additional algorithms for fall detection, (ii) an approach for cross-positional sensor fusion, (iii) a fall detection approach that relies on outlier detection, and (iv) a smart fall alert. Additionally, we present implementation and evaluation of these extensions.
@article{KRUPITZER2019101026, abstract = {Ambient Assisted Living using mobile device sensors is an active area of research in pervasive computing. Multiple approaches have shown that wearable sensors perform very well and distinguish falls reliably from Activities of Daily Living. However, these systems are tested in a controlled environment and are optimized for a given set of sensor types, sensor positions, and subjects. We propose a self-adaptive pervasive fall detection approach that is robust to the heterogeneity of real life situations. Using the data of four publicly available datasets, we show that our system is not only robust regarding the different dimensions of heterogeneity, but also adapts autonomously to spontaneous changes in the sensor’s position at runtime. In this paper, we extend our self-adaptive fall detection system with (i) additional algorithms for fall detection, (ii) an approach for cross-positional sensor fusion, (iii) a fall detection approach that relies on outlier detection, and (iv) a smart fall alert. Additionally, we present implementation and evaluation of these extensions.}, author = {Krupitzer, Christian and Sztyler, Timo and Edinger, Janick and Breitbach, Martin and Stuckenschmidt, Heiner and Becker, Christian}, journal = {Pervasive and Mobile Computing}, keywords = {Internet_of_Things Cyber-Physical_Systems Health descartes Self-adaptive-systems}, title = {Beyond position-awareness – Extending a self-adaptive fall detection system}, volume = 58, year = 2019 }

Towards a QoS-aware Cyber Physical Networking Middleware Architecture. M. Brinkschulte; C. Becker; C. Krupitzer; in 1st International Workshop on Middleware for Lightweight, Spontaneous Environments (MISE) @ ACM/IFIP/USENIX International Middleware Conference (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{BrBeKr2019-MISE-CPN_Middleware_Vision, address = {Davis, CA, USA}, author = {Brinkschulte, Melanie and Becker, Christian and Krupitzer, Christian}, booktitle = {1st International Workshop on Middleware for Lightweight, Spontaneous Environments (MISE) @ ACM/IFIP/USENIX International Middleware Conference}, keywords = {Internet_of_Things Cyber-Physical_Systems Networking Design_of_software_and_systems descartes Self-adaptive-systems}, title = {{Towards a QoS-aware Cyber Physical Networking Middleware Architecture}}, year = 2019 }

A Concept for an Adaptive Communication Middleware for Car-2-Cloud Applications. S. Herrnleben; (2019, April).
[ BibTeX ] [ Download ]
 
@misc{He2019-SelPhyS-Car2Cloud, author = {Herrnleben, Stefan}, howpublished = {Talk at Workshop on Self-Awareness in Cyber-Physical Systems 2019}, keywords = {Internet_of_Things descartes Application-aware Talks Self-adaptive-systems t_workshop}, month = {April}, title = {{A Concept for an Adaptive Communication Middleware for Car-2-Cloud Applications}}, year = 2019 }

Artificial Intelligence in Medicine - From Data Collection to Prediction. M. Züfle; R. Leppich; (2019, November).
[ BibTeX ]
 
@misc{talk-ZuLe, author = {Z{ü}fle, Marwin and Leppich, Robert}, howpublished = {Invited Talk at Klinikum N{ü}rnberg}, keywords = {Statistical_estimation_and_machine_learning myown Health t_talk descartes Cloud Prediction Talks IoT Sports}, month = {November}, title = {{Artificial Intelligence in Medicine - From Data Collection to Prediction}}, year = 2019 }

Hands Off my Database: Ransomware Detection in Databases through Dynamic Analysis of Query Sequences L. Iffländer; A. Dmitrienko; C. Hagen; M. Jobst; S. Kounev; (2019).
[ BibTeX ] [ URL ] [ Download ]
 
@techreport{Ifflander_Hands_Off_my_Database, author = {Iffländer, Lukas and Dmitrienko, Alexandra and Hagen, Christoph and Jobst, Michael and Kounev, Samuel}, institution = {Universit{ä}t W{ü}rzburg}, journal = {arXiv}, keywords = {myown Performance Security Design_of_software_and_systems descartes EvIDencE t_techreport}, month = {jul}, title = {Hands Off my Database: Ransomware Detection in Databases through Dynamic Analysis of Query Sequences}, year = 2019 }

Exploring the Limitations of Statistical Response Time Models in Architectural Performance Models. S. Trapp; Thesis; University of Würzburg; Am Hubland, Informatikgebäude, 97074 Würzburg, Germany. (2019, December).
[ BibTeX ]
 
@mastersthesis{Trapp2019, address = {Am Hubland, Informatikgeb{ä}ude, 97074 W{ü}rzburg, Germany}, author = {Trapp, Simon}, keywords = {se2_mastersthesis Thesis_supervised_by_Simon_Eismann descartes}, month = {December}, school = {University of W{ü}rzburg}, title = {Exploring the {L}imitations of {S}tatistical {R}esponse {T}ime {M}odels in {A}rchitectural {P}erformance {M}odels}, type = {{Bachelor Thesis}}, year = 2019 }

Performance-feedback autoscaling with budget constraints for cloud-based workloads of workflows. A. Ilyushkin; A. Bauer; A. V. Papadopoulos; E. Deelman; A. Iosup; in arXiv preprint arXiv:1905.10270 (2019).
[ BibTeX ] [ Download ]
 
@article{IlBaPaDeIo-Tech-BudgetAS, author = {Ilyushkin, Alexey and Bauer, Andr{é} and Papadopoulos, Alessandro V and Deelman, Ewa and Iosup, Alexandru}, journal = {arXiv preprint arXiv:1905.10270}, keywords = {cloud autoscaling descartes metrics_and_benchmarking_methodologies elasticity t_techreport sys:relevantfor:se-group constraints budget}, title = {Performance-feedback autoscaling with budget constraints for cloud-based workloads of workflows}, year = 2019 }

DR.SGX: Automated and Adjustable Side-Channel Protection for SGX using Data Location Randomization. F. Brasser; S. Capkun; A. Dmitrienko; T. Frassetto; K. Kostiainen; A.-R. Sadeghi; in Annual Computer Security Applications Conference (ACSAC) (2019).
[ Abstract ] [ BibTeX ]
 
Recent research has demonstrated that Intel’s SGX is vulnerable to software-based side-channel attacks. In a common attack, the adversary monitors CPU caches to infer secret-dependent data accesses patterns. Known defenses have major limitations, as they require either error-prone developer assistance, incur extremely high runtime overhead, or prevent only specific attacks.In this paper, we propose data location randomization as a novel defense against side-channel attacks that target data access patterns.Our goal is to break the link between the memory observations by the adversary and the actual data accesses by the victim. We design and implement a compiler-based tool called DR.SGX that instruments the enclave code, permuting data locations at fine granularity.To prevent correlation of repeated memory accesses we periodically re-randomize all enclave data. Our solution requires no developer assistance and strikes the balance between side-channel protection and performance based on an adjustable security parameter.
@inproceedings{BrCaDmFrKoSa2019, abstract = {Recent research has demonstrated that Intel’s SGX is vulnerable to software-based side-channel attacks. In a common attack, the adversary monitors CPU caches to infer secret-dependent data accesses patterns. Known defenses have major limitations, as they require either error-prone developer assistance, incur extremely high runtime overhead, or prevent only specific attacks.In this paper, we propose data location randomization as a novel defense against side-channel attacks that target data access patterns.Our goal is to break the link between the memory observations by the adversary and the actual data accesses by the victim. We design and implement a compiler-based tool called DR.SGX that instruments the enclave code, permuting data locations at fine granularity.To prevent correlation of repeated memory accesses we periodically re-randomize all enclave data. Our solution requires no developer assistance and strikes the balance between side-channel protection and performance based on an adjustable security parameter.}, author = {Brasser, Ferdinand and Capkun, Srdjan and Dmitrienko, Alexandra and Frassetto, Tommaso and Kostiainen, Kari and Sadeghi, Ahmad-Reza}, booktitle = {Annual Computer Security Applications Conference (ACSAC)}, keywords = {International-Conference-Workshop-Papers-Book-Chapters sss-group}, month = {December}, publisher = {ACM}, title = {{DR.SGX: Automated and Adjustable Side-Channel Protection for SGX using Data Location Randomization}}, year = 2019 }

Hands Off my Database: Ransomware Detection in Databases through Dynamic Analysis of Query Sequences. L. Iffländer; A. Dmitrienko; C. Hagen; M. Jobst; S. Kounev; in ArXiv | arXiv:1907.06775v1 (2019).
[ BibTeX ] [ URL ]
 
@article{DBLP:journals/corr/abs-1907-06775, author = {Iffl{{ä}}nder, Lukas and Dmitrienko, Alexandra and Hagen, Christoph and Jobst, Michael and Kounev, Samuel}, journal = {ArXiv | arXiv:1907.06775v1}, keywords = {database Technical-Reports sss-group ransomware}, title = {Hands Off my Database: Ransomware Detection in Databases through Dynamic Analysis of Query Sequences}, year = 2019 }

DR.SGX: Automated and Adjustable Side-Channel Protection for SGX using Data Location Randomization F. Brasser; S. Capkun; A. Dmitrienko; T. Frassetto; K. Kostiainen; A.-R. Sadeghi; (2019, December).
[ Abstract ] [ BibTeX ] [ URL ]
 
Recent research has demonstrated that Intel’s SGX is vulnerable to software-based side-channel attacks. In a common attack, the adversary monitors CPU caches to infer secret-dependent data accesses patterns. Known defenses have major limitations, as they require either error-prone developer assistance, incur extremely high runtime overhead, or prevent only specific attacks.In this paper, we propose data location randomization as a novel defense against side-channel attacks that target data access patterns.Our goal is to break the link between the memory observations by the adversary and the actual data accesses by the victim. We design and implement a compiler-based tool called DR.SGX that instruments the enclave code, permuting data locations at fine granularity.To prevent correlation of repeated memory accesses we periodically re-randomize all enclave data. Our solution requires no developer assistance and strikes the balance between side-channel protection and performance based on an adjustable security parameter.
@preprint{brasser2019drsgx, abstract = {Recent research has demonstrated that Intel’s SGX is vulnerable to software-based side-channel attacks. In a common attack, the adversary monitors CPU caches to infer secret-dependent data accesses patterns. Known defenses have major limitations, as they require either error-prone developer assistance, incur extremely high runtime overhead, or prevent only specific attacks.In this paper, we propose data location randomization as a novel defense against side-channel attacks that target data access patterns.Our goal is to break the link between the memory observations by the adversary and the actual data accesses by the victim. We design and implement a compiler-based tool called DR.SGX that instruments the enclave code, permuting data locations at fine granularity.To prevent correlation of repeated memory accesses we periodically re-randomize all enclave data. Our solution requires no developer assistance and strikes the balance between side-channel protection and performance based on an adjustable security parameter.}, author = {Brasser, Ferdinand and Capkun, Srdjan and Dmitrienko, Alexandra and Frassetto, Tommaso and Kostiainen, Kari and Sadeghi, Ahmad-Reza}, booktitle = {Annual Computer Security Applications Conference (ACSAC)}, keywords = {technical-reports international-conference-workshop-papers-book-chapters sss-group}, month = {December}, publisher = {ACM}, title = {{DR.SGX: Automated and Adjustable Side-Channel Protection for SGX using Data Location Randomization}}, year = 2019 }

Multi-objective Optimisation in Hybrid Collaborating Adaptive Systems. V. Lesch; C. Krupitzer; S. Tomforde; in Proceedings of the 7th edition in the Series on Autonomously Learning and Optimising Systems (SAOS), co-located with 32nd GI/ITG ARCS 2019 (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{LeKrTo2019, author = {Lesch, Veronika and Krupitzer, Christian and Tomforde, Sven}, booktitle = {Proceedings of the 7th edition in the Series on Autonomously Learning and Optimising Systems (SAOS), co-located with 32nd GI/ITG ARCS 2019}, keywords = {Internet_of_Things descartes Multi-criteria_optimization Self-adaptive-systems t_workshop Intelligent_Transportation_Systems Optimization}, month = {may}, publisher = {Gesellschaft fuer Informatik (GI)}, title = {{Multi-objective Optimisation in Hybrid Collaborating Adaptive Systems}}, year = 2019 }

Chameleon: A Hybrid, Proactive Auto-Scaling Mechanism on a Level-Playing Field. A. Bauer; N. Herbst; S. Spinner; A. Ali-Eldin; S. Kounev; in IEEE Transactions on Parallel and Distributed Systems (2019). 30(4) 800–813.
[ BibTeX ] [ Download ]
 
@article{BaHeSpAEKo2019-TPDS-ChameleonAutoscaler, author = {Bauer, Andr{é} and Herbst, Nikolas and Spinner, Simon and Ali-Eldin, Ahmed and Kounev, Samuel}, journal = {IEEE Transactions on Parallel and Distributed Systems}, keywords = {Metrics_and_benchmarking_methodologies Resource_management Performance descartes Prediction Elasticity Chameleon LIMBO Tool Online_monitoring_and_forecasting PRISMA Self-aware-computing Cloud BUNGEE Application_quality_of_service_management Application-aware t_journalmagazine SPEC Self-adaptive-systems}, month = {April}, number = 4, pages = {800–813}, publisher = {IEEE}, title = {{Chameleon: A Hybrid, Proactive Auto-Scaling Mechanism on a Level-Playing Field}}, volume = 30, year = 2019 }

Measuring and Rating the Energy-Efficiency of Servers. J. von Kistowski; K.-D. Lange; J. A. Arnold; J. Beckett; H. Block; M. Tricker; S. Sharma; J. Pais; S. Kounev; in Future Generation Computer Systems (2019). 100 579–589.
[ Abstract ] [ BibTeX ] [ URL ]
 
Data centers and servers consume a significant amount of electrical power. As future data centers increase in size, it becomes increasingly important to be able to select servers based on their energy efficiency. Rating the efficiency of servers is challenging, as it depends on the software executed on that server and on its load profile. To account for this, a measurement and rating methodology for servers must make use of both realistic and varying workloads. Existing energy-efficiency benchmarks either run standardized application loads at multiple load levels or multiple micro-benchmarks at full load. This does not enable a full analysis of system behavior as the energy efficiency for different kinds of software at low load levels remains unknown. This article introduces a measurement methodology and metrics for energy-efficiency rating of servers. The methodology defines system setup and instrumentation for reproducible results. It is designed to use multiple, specifically chosen workloads at different load levels for a full system characterization. All partial results are aggregated in a final metric that can be used by regulators to define server-labeling criteria. The methodology and workloads have been implemented in the standardized Server Efficiency Rating Tool. We show the applicability and use of the measurement methodology specifically considering its reproducibility, fairness, and relevance. A reproducibility analysis shows that efficiency scores vary with a maximum coefficient of 1.04% for repeated experiments. In addition, we evaluate the proposed metrics by investigating their energy-efficiency rating on a set of 385 different servers and show the relevance of the selected workloads by analyzing relationships to real-world applications.
@article{KiLaArBeBlTrShPaKo-FGCS2019-ServerEfficiency, abstract = {Data centers and servers consume a significant amount of electrical power. As future data centers increase in size, it becomes increasingly important to be able to select servers based on their energy efficiency. Rating the efficiency of servers is challenging, as it depends on the software executed on that server and on its load profile. To account for this, a measurement and rating methodology for servers must make use of both realistic and varying workloads. Existing energy-efficiency benchmarks either run standardized application loads at multiple load levels or multiple micro-benchmarks at full load. This does not enable a full analysis of system behavior as the energy efficiency for different kinds of software at low load levels remains unknown. This article introduces a measurement methodology and metrics for energy-efficiency rating of servers. The methodology defines system setup and instrumentation for reproducible results. It is designed to use multiple, specifically chosen workloads at different load levels for a full system characterization. All partial results are aggregated in a final metric that can be used by regulators to define server-labeling criteria. The methodology and workloads have been implemented in the standardized Server Efficiency Rating Tool. We show the applicability and use of the measurement methodology specifically considering its reproducibility, fairness, and relevance. A reproducibility analysis shows that efficiency scores vary with a maximum coefficient of 1.04\% for repeated experiments. In addition, we evaluate the proposed metrics by investigating their energy-efficiency rating on a set of 385 different servers and show the relevance of the selected workloads by analyzing relationships to real-world applications.}, author = {von Kistowski, J{ó}akim and Lange, Klaus-Dieter and Arnold, Jeremy A. and Beckett, John and Block, Hansfried and Tricker, Mike and Sharma, Sanjay and Pais, Johann and Kounev, Samuel}, journal = {Future Generation Computer Systems}, keywords = {Tool Metrics_and_benchmarking_methodologies Performance descartes t_journalmagazine SPEC Power-energy_efficient_computing Power}, pages = {579 - 589}, title = {{Measuring and Rating the Energy-Efficiency of Servers}}, volume = 100, year = 2019 }

Challenges and Approaches: Forecasting for Autonomic Computing. A. Bauer; in Organic Computing: Doctoral Dissertation Colloquium 2018, S. Tomforde, B. Sick (eds.) (2019).
[ BibTeX ] [ Download ]
 
@incollection{Ba2019-OCDDC-Forecatsing, author = {Bauer, Andr{é}}, booktitle = {{Organic Computing: Doctoral Dissertation Colloquium 2018}}, editor = {Tomforde, Sven and Sick, Bernhard}, keywords = {Telescope Online_monitoring_and_forecasting descartes Self-aware-computing t_bookchapter Self-adaptive-systems}, month = {April}, publisher = {kassel university press GmbH}, title = {{Challenges and Approaches: Forecasting for Autonomic Computing}}, year = 2019 }

Chameleon: A Hybrid, Proactive Auto-Scaling Mechanism on a Level-Playing Field. A. Bauer; (2019, June).
[ BibTeX ] [ Download ]
 
@misc{talk-Bauer-HotCloudPerf2019, author = {Bauer, Andr{é}}, howpublished = {Talk at HotCloudperf 2019}, keywords = {Metrics_and_benchmarking_methodologies Resource_management Online_monitoring_and_forecasting se2_talk t_talk descartes Cloud Elasticity BUNGEE LibReDE Chameleon}, month = {June}, title = {{Chameleon: A Hybrid, Proactive Auto-Scaling Mechanism on a Level-Playing Field}}, year = 2019 }

On Learning in Collective Self-Adaptive Systems: State of Practice and a 3D Framework. M. D’Angelo; S. Gerasimou; S. Ghahremani; J. Grohmann; I. Nunes; E. Pournaras; S. Tomforde; in Proceedings of the 14th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (2019). 13–24.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Collective self-adaptive systems (CSAS) are distributed and interconnected systems composed of multiple agents that can perform complex tasks such as environmental data collection, search and rescue operations, and discovery of natural resources. By providing individual agents with learning capabilities, CSAS can cope with challenges related to distributed sensing and decision-making and operate in uncertain environments. This unique characteristic of CSAS enables the collective to exhibit robust behaviour while achieving system-wide and agent-specific goals. Although learning has been explored in many CSAS applications, selecting suitable learning models and techniques remains a significant challenge that is heavily influenced by expert knowledge. We address this gap by performing a multifaceted analysis of existing CSAS with learning capabilities reported in the literature. Based on this analysis, we introduce a 3D framework that illustrates the learning aspects of CSAS considering the dimensions of autonomy, knowledge access, and behaviour, and facilitates the selection of learning techniques and models. Finally, using example applications from this analysis, we derive open challenges and highlight the need for research on collaborative, resilient and privacy-aware mechanisms for CSAS.
@inproceedings{SEAMS2019-CollectiveLearningSurvey, abstract = {Collective self-adaptive systems (CSAS) are distributed and interconnected systems composed of multiple agents that can perform complex tasks such as environmental data collection, search and rescue operations, and discovery of natural resources. By providing individual agents with learning capabilities, CSAS can cope with challenges related to distributed sensing and decision-making and operate in uncertain environments. This unique characteristic of CSAS enables the collective to exhibit robust behaviour while achieving system-wide and agent-specific goals. Although learning has been explored in many CSAS applications, selecting suitable learning models and techniques remains a significant challenge that is heavily influenced by expert knowledge. We address this gap by performing a multifaceted analysis of existing CSAS with learning capabilities reported in the literature. Based on this analysis, we introduce a 3D framework that illustrates the learning aspects of CSAS considering the dimensions of autonomy, knowledge access, and behaviour, and facilitates the selection of learning techniques and models. Finally, using example applications from this analysis, we derive open challenges and highlight the need for research on collaborative, resilient and privacy-aware mechanisms for CSAS.}, author = {{D'Angelo}, M. and {Gerasimou}, S. and {Ghahremani}, S. and {Grohmann}, J. and {Nunes}, I. and {Pournaras}, E. and {Tomforde}, S.}, booktitle = {Proceedings of the 14th International Symposium on Software Engineering for Adaptive and Self-Managing Systems}, keywords = {Survey Design_of_software_and_systems t_full descartes Self-aware-computing Automated_model_learning Self-adaptive-systems}, month = {may}, pages = {13–24}, publisher = {IEEE Press}, series = {SEAMS '19}, title = {On Learning in Collective Self-Adaptive Systems: State of Practice and a 3D Framework}, year = 2019 }

Towards Edge Benchmarking: A Methodology for Characterizing Edge Workloads. K. Tocze; N. Schmitt; I. Brandic; A. Aral; S. Nadjm-Tehrani; in Proceedings of Workshop on Hot Topics in Cloud Computing Performance (HotCloudPerf) as part of FAS*(IEEE ICAC/SASO) conferences companion (2019).
[ BibTeX ]
 
@inproceedings{ToScBrArNa2019TowardsEdgeBench, author = {Tocze, Klervie and Schmitt, Norbert and Brandic, Ivona and Aral, Atakan and Nadjm-Tehrani, Simin}, booktitle = {Proceedings of Workshop on Hot Topics in Cloud Computing Performance (HotCloudPerf) as part of FAS*(IEEE ICAC/SASO) conferences companion}, keywords = {myown Metrics_and_benchmarking_methodologies Resource_management Performance t_short descartes Cloud Power-energy_efficient_computing Power}, month = {June}, publisher = {IEEE}, title = {{Towards Edge Benchmarking: A Methodology for Characterizing Edge Workloads}}, year = 2019 }

Die Mehrbelastung der Sicherheit im IoT mit neuen Techniken bewältigen. J. Stoll; L. Iffländer; (2019, April).
[ BibTeX ]
 
@misc{talk-StIf-SDN-buildingIoT, author = {Stoll, Jonathan and Iffländer, Lukas}, howpublished = {building IoT 2019}, keywords = {myown se2_talk t_talk descartes}, month = {04}, title = {Die Mehrbelastung der Sicherheit im IoT mit neuen Techniken bewältigen}, year = 2019 }

Der Weg vom Internet-der-Dinge zum Internet-der-denkenden-Dinge. S. Kounev; (2019, June).
[ BibTeX ]
 
@misc{Talk-Ko2019-RotaryClub-SeAC, address = {W{ü}rzburz, Germany}, author = {Kounev, Samuel}, howpublished = {Rotary Club W{ü}rzburg, 11.06.2019}, keywords = {se2_talk t_talk descartes}, month = {June}, title = {{Der Weg vom Internet-der-Dinge zum Internet-der-denkenden-Dinge}}, year = 2019 }

Monitorless: Predicting Performance Degradation in Cloud Applications with Machine Learning. J. Grohmann; P. K. Nicholson; J. O. Iglesias; S. Kounev; D. Lugones; in Proceedings of the 20th International Middleware Conference (2019). 149–162.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Today, software operation engineers rely on application key performance indicators (KPIs) for sizing and orchestrating cloud resources dynamically. KPIs are monitored to assess the achievable performance and to configure various cloud-specific parameters such as flavors of instances and autoscaling rules, among others. Usually, keeping KPIs within acceptable levels requires application expertise which is expensive and can slow down the continuous delivery of software. Expertise is required because KPIs are normally based on application-specific quality-of-service metrics, like service response time and processing rate, instead of generic platform metrics, like those typical across various environments (e.g., CPU and memory utilization, I/O rate, etc.)In this paper, we investigate the feasibility of outsourcing the management of application performance from developers to cloud operators. In the same way that the serverless paradigm allows the execution environment to be fully managed by a third party, we discuss a monitorless model to streamline application deployment by delegating performance management. We show that training a machine learning model with platform-level data, collected from the execution of representative containerized services, allows inferring application KPI degradation. This is an opportunity to simplify operations as engineers can rely solely on platform metrics -- while still fulfilling application KPIs -- to configure portable and application agnostic rules and other cloud-specific parameters to automatically trigger actions such as autoscaling, instance migration, network slicing, etc.Results show that monitorless infers KPI degradation with an accuracy of 97% and, notably, it performs similarly to typical autoscaling solutions, even when autoscaling rules are optimally tuned with knowledge of the expected workload.
@inproceedings{GrNiIgKoLu-MIDDLEWARE2019-Monitorless, abstract = {Today, software operation engineers rely on application key performance indicators (KPIs) for sizing and orchestrating cloud resources dynamically. KPIs are monitored to assess the achievable performance and to configure various cloud-specific parameters such as flavors of instances and autoscaling rules, among others. Usually, keeping KPIs within acceptable levels requires application expertise which is expensive and can slow down the continuous delivery of software. Expertise is required because KPIs are normally based on application-specific quality-of-service metrics, like service response time and processing rate, instead of generic platform metrics, like those typical across various environments (e.g., CPU and memory utilization, I/O rate, etc.)In this paper, we investigate the feasibility of outsourcing the management of application performance from developers to cloud operators. In the same way that the serverless paradigm allows the execution environment to be fully managed by a third party, we discuss a monitorless model to streamline application deployment by delegating performance management. We show that training a machine learning model with platform-level data, collected from the execution of representative containerized services, allows inferring application KPI degradation. This is an opportunity to simplify operations as engineers can rely solely on platform metrics – while still fulfilling application KPIs – to configure portable and application agnostic rules and other cloud-specific parameters to automatically trigger actions such as autoscaling, instance migration, network slicing, etc.Results show that monitorless infers KPI degradation with an accuracy of 97% and, notably, it performs similarly to typical autoscaling solutions, even when autoscaling rules are optimally tuned with knowledge of the expected workload.}, address = {New York, NY, USA}, author = {Grohmann, Johannes and Nicholson, Patrick K. and Iglesias, Jesus Omana and Kounev, Samuel and Lugones, Diego}, booktitle = {Proceedings of the 20th International Middleware Conference}, keywords = {Statistical_estimation_and_machine_learning Multi-tenancy Performance t_full descartes Cloud Prediction Application_quality_of_service_management Instrumentation_profiling_and_workload_characterization Virtualization}, pages = {149–162}, publisher = {Association for Computing Machinery (ACM)}, series = {Middleware '19}, title = {Monitorless: Predicting Performance Degradation in Cloud Applications with Machine Learning}, year = 2019 }

From the Internet-of-Things to the Internet-of-Thinking-Things. S. Kounev; (2019, July).
[ BibTeX ]
 
@misc{talk-Kounev-InvTUM19, author = {Kounev, Samuel}, howpublished = {Informatik-Sonderkolloquium "Engineering Software for Decentralized Systems", Fakult{ä}t f{ü}r Informatik, Technische Universit{ä}t M{ü}nchen, Munich, Germany}, keywords = {se2_talk t_talk descartes}, month = {Jul}, title = {{From the Internet-of-Things to the Internet-of-Thinking-Things}}, year = 2019 }

Methodological Principles for Reproducible Performance Evaluation in Cloud Computing - A SPEC Research Technical Report. (SPEC-RG-2019-04), A. V. Papadopoulos; L. Versluis; A. Bauer; N. Herbst; J. von Kistowski; A. Ali-Eldin; C. Abad; J. N. Amaral; P. Tuma; A. Iosup; (2019).
[ BibTeX ] [ URL ]
 
@techreport{PaVeBaHeKiEAAbAmTuIo2019-SPEC-CloudPerformance, author = {Papadopoulos, Alessandro Vittorio and Versluis, Laurens and Bauer, Andr{é} and Herbst, Nikolas and von Kistowski, J{ó}akim and Ali-Eldin, Ahmed and Abad, Cristina and Amaral, J. Nelson and Tuma, Petr and Iosup, Alexandru}, institution = {SPEC Research Group — Cloud Working Group, Standard Performance Evaluation Corporation (SPEC)}, keywords = {Metrics_and_benchmarking_methodologies Performance descartes Cloud t_techreport SPEC}, month = {April}, number = {SPEC-RG-2019-04}, title = {{Methodological Principles for Reproducible Performance Evaluation in Cloud Computing - A SPEC Research Technical Report}}, year = 2019 }

Online model learning for self-aware computing infrastructures. S. Spinner; J. Grohmann; S. Eismann; S. Kounev; in Journal of Systems and Software (2019). 147 1–16.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Performance models are valuable and powerful tools for performance prediction. However, the creation of performance models usually requires significant manual effort. Furthermore, as the modeled structures are subject to frequent change in modern infrastructures, such performance models need to be adapted as well. We therefore propose a reference architecture for online model learning in virtualized environments, which enables the automatic extraction of the aforementioned performance models. We follow an agent-based approach, which enables us to incorporate the extraction of information about the application structure as well as the virtualization structures present in modern computing centers. Our evaluation shows that our collaborating agents are able to reduce the manual effort of performance model extraction by 85.4%. The resulting performance model is able to predict the system utilization with an absolute error of less than 4% and the end-to-end response time with a relative error of less than 21%.
@article{SpGrEiKo2019-JSS-ModelLearning, abstract = {Performance models are valuable and powerful tools for performance prediction. However, the creation of performance models usually requires significant manual effort. Furthermore, as the modeled structures are subject to frequent change in modern infrastructures, such performance models need to be adapted as well. We therefore propose a reference architecture for online model learning in virtualized environments, which enables the automatic extraction of the aforementioned performance models. We follow an agent-based approach, which enables us to incorporate the extraction of information about the application structure as well as the virtualization structures present in modern computing centers. Our evaluation shows that our collaborating agents are able to reduce the manual effort of performance model extraction by 85.4%. The resulting performance model is able to predict the system utilization with an absolute error of less than 4% and the end-to-end response time with a relative error of less than 21%.}, author = {Spinner, Simon and Grohmann, Johannes and Eismann, Simon and Kounev, Samuel}, journal = {Journal of Systems and Software}, keywords = {DML Performance Analytical_and_simulation-based_analysis descartes Prediction Automated_model_learning Meta-models LibReDE Simulation Cloud Application-aware t_journalmagazine Virtualization}, pages = {1–16}, title = {Online model learning for self-aware computing infrastructures}, volume = 147, year = 2019 }

Methoden und Messverfahren für Automatisches Skalieren in Elastischen Cloud Umgebungen. N. Herbst; (2019, June).
[ BibTeX ] [ Download ]
 
@misc{talk-Herbst-GIAwardNomination-Dagstuhl, author = {Herbst, Nikolas}, howpublished = {GI Dissertationspreis: Seminar f{ü}r Nominierte Doktoranden, Dagstuhl, Germany, June 28, 2019}, keywords = {Telescope Metrics_and_benchmarking_methodologies Resource_management descartes Prediction Chameleon Instrumentation_profiling_and_workload_characterization LIMBO Online_monitoring_and_forecasting se2_talk Cloud Award BUNGEE Virtualization t_bookchapter}, month = {June}, title = {{Methoden und Messverfahren f{ü}r Automatisches Skalieren in Elastischen Cloud Umgebungen}}, year = 2019 }

Agile Scalability Engineering: The ScrumScale Method. G. Brataas; G. Hanssen; N. Herbst; A. van Hoorn; in IEEE Software (2019). 37(5) 77–85.
to appear
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ]
 
Scalability is a property that must be carefully designed into a system. A case study in the largest Norwegian public portal, Altinn, illustrates how developers and scalability experts improved scalability and spent less time during scalability testing. With minor adjustments to an agile development process, stakeholders spend more up-front time together.
@article{ScrumScale2019IEEESW, abstract = {Scalability is a property that must be carefully designed into a system. A case study in the largest Norwegian public portal, Altinn, illustrates how developers and scalability experts improved scalability and spent less time during scalability testing. With minor adjustments to an agile development process, stakeholders spend more up-front time together.}, author = {Brataas, Gunnar and Hanssen, Geir and Herbst, Nikolas and van Hoorn, Andr{é}}, journal = {IEEE Software}, keywords = {myown descartes t_journalmagazine sys:relevantfor:se-group se2}, month = {June}, note = {to appear}, number = 5, pages = {77-85}, publisher = {IEEE}, title = {Agile Scalability Engineering: The ScrumScale Method}, volume = 37, year = 2019 }

Towards Testing the Software Aging Behavior of Hypervisor Hypercall Interfaces. L. Beierlieb; L. Iffländer; A. Milenkoski; C. F. Goncalves; N. Antunes; S. Kounev; in 2019 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) (2019).
[ Abstract ] [ BibTeX ] [ Download ]
 
With the continuing rise of cloud technology hypervisors play a vital role in the performance and reliability of current services. As long-running applications, they are susceptible to software aging. Hypervisors offer so-called hypercall interfaces for communication with the hosted virtual machines. These interfaces require thorough robustness to assure performance, security, and reliability. Existing research either deals with the aging properties of hypervisors in general without considering the hypercalls or focuses on finding hypercall-related vulnerabilities. In this work, we discuss open challenges regarding hypercall interfaces. To address these challenges, we propose an extensive framework architecture to perform robustness testing on hypercall interfaces. This framework supports extensive test campaigns as well as the modeling of hypercall interfaces.
@inproceedings{Beierlieb_2019_TowardsTestingtheSoftwareAgingBehaviorofHypervisorHypercallInterfaces, abstract = {With the continuing rise of cloud technology hypervisors play a vital role in the performance and reliability of current services. As long-running applications, they are susceptible to software aging. Hypervisors offer so-called hypercall interfaces for communication with the hosted virtual machines. These interfaces require thorough robustness to assure performance, security, and reliability. Existing research either deals with the aging properties of hypervisors in general without considering the hypercalls or focuses on finding hypercall-related vulnerabilities. In this work, we discuss open challenges regarding hypercall interfaces. To address these challenges, we propose an extensive framework architecture to perform robustness testing on hypercall interfaces. This framework supports extensive test campaigns as well as the modeling of hypercall interfaces.}, author = {Beierlieb, Lukas and Iffländer, Lukas and Milenkoski, Aleksandar and Goncalves, Charles F. and Antunes, Nuno and Kounev, Samuel}, booktitle = {2019 {IEEE} International Symposium on Software Reliability Engineering Workshops ({ISSREW})}, keywords = {myown Multi-tenancy Performance descartes Instrumentation_profiling_and_workload_characterization Security Cloud EvIDencE HInjector Isolation Virtualization Reliability t_workshop}, month = 11, organization = {{IEEE}}, title = {Towards Testing the Software Aging Behavior of Hypervisor Hypercall Interfaces}, year = 2019 }

Kaa: Evaluating Elasticity of Cloud-hosted DBMS. D. Seybold; S. Volpert; S. Wesner; A. Bauer; N. Herbst; J. Domaschka; in Proceedings of the 11th IEEE International Conference on Cloud Computing (CloudCom) (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{SeVoWeBaHeDo-CloudCom-Kaa, author = {Seybold, Daniel and Volpert, Simon and Wesner, Stefan and Bauer, Andr{é} and Herbst, Nikolas and Domaschka, J{ö}rg}, booktitle = {Proceedings of the 11th IEEE International Conference on Cloud Computing (CloudCom)}, keywords = {Tool Metrics_and_benchmarking_methodologies Performance t_full descartes Cloud Elasticity}, month = {December}, title = {Kaa: Evaluating Elasticity of Cloud-hosted DBMS}, year = 2019 }

The SPEC-RG Reference Architecture for FaaS: From Microservices and Containers to Serverless Platforms. E. van Eyk; J. Grohmann; S. Eismann; A. Bauer; L. Versluis; L. Toader; N. Schmitt; N. Herbst; C. L. Abad; A. Iosup; in IEEE Internet Computing (2019). 23(6) 7–18.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Microservices, containers, and serverless computing belong to a trend toward applications composed of many small, self-contained, and automatically managed components. Core to serverless computing, Function-as-a-Service (FaaS) platforms employ state-of-the-art container technology and microservices-based architectures to enable users to manage complex applications without the need for systems-level expertise. Victim of its own success, and partially due to proprietary technology, currently the community has a limited overview of these platforms. To address this, we propose a reference architecture and ecosystem for FaaS platforms. Based on a year-long survey of real-world platforms conducted within the SPEC-RG Cloud Group, we highlight specific components and identify common operational patterns.
@article{vEGrEiBaVeToScHeAbIo-IC-FaaS, abstract = {Microservices, containers, and serverless computing belong to a trend toward applications composed of many small, self-contained, and automatically managed components. Core to serverless computing, Function-as-a-Service (FaaS) platforms employ state-of-the-art container technology and microservices-based architectures to enable users to manage complex applications without the need for systems-level expertise. Victim of its own success, and partially due to proprietary technology, currently the community has a limited overview of these platforms. To address this, we propose a reference architecture and ecosystem for FaaS platforms. Based on a year-long survey of real-world platforms conducted within the SPEC-RG Cloud Group, we highlight specific components and identify common operational patterns.}, author = {van Eyk, Erwin and Grohmann, Johannes and Eismann, Simon and Bauer, Andr{é} and Versluis, Laurens and Toader, Lucian and Schmitt, Norbert and Herbst, Nikolas and Abad, Cristina L. and Iosup, Alexandru}, journal = {IEEE Internet Computing}, keywords = {Survey Design_of_software_and_systems descartes Cloud t_journalmagazine SPEC}, month = {nov}, number = 6, pages = {7–18}, publisher = {IEEE}, title = {The SPEC-RG Reference Architecture for FaaS: From Microservices and Containers to Serverless Platforms}, volume = 23, year = 2019 }

TeaStore - A Micro-Service Application for Benchmarking, Modeling and Resource Management Research. S. Eismann; (2019, March).
[ Abstract ] [ BibTeX ] [ Download ]
 
Researchers propose and employ various methods to analyze, model, optimize and manage modern distributed micro-service applications. In order to demonstrate and evaluate these methods in realistic scenarios, researchers rely on reference applications. These applications should offer a range of different behaviors, degrees of freedom allowing for customization and should use a modern and representative technology stack. Unfortunately, existing testing and benchmarking applications are either outdated, designed for specific testing scenarios, or do not offer the necessary degrees of freedom. In this talk, we introduce the TeaStore, a state-of-the-art test and reference application with a micro-service architecture. TeaStore offers services with different performance characteristics and many degrees of freedom regarding deployment and configuration to be used as a benchmarking framework for researchers. Based on three experiments, we demonstrate TeaStore's use in three different research contexts: performance modeling, cloud resource management, and energy efficiency analysis.
@misc{talk-Eismann-SE2019, abstract = {Researchers propose and employ various methods to analyze, model, optimize and manage modern distributed micro-service applications. In order to demonstrate and evaluate these methods in realistic scenarios, researchers rely on reference applications. These applications should offer a range of different behaviors, degrees of freedom allowing for customization and should use a modern and representative technology stack. Unfortunately, existing testing and benchmarking applications are either outdated, designed for specific testing scenarios, or do not offer the necessary degrees of freedom. In this talk, we introduce the TeaStore, a state-of-the-art test and reference application with a micro-service architecture. TeaStore offers services with different performance characteristics and many degrees of freedom regarding deployment and configuration to be used as a benchmarking framework for researchers. Based on three experiments, we demonstrate TeaStore's use in three different research contexts: performance modeling, cloud resource management, and energy efficiency analysis.}, author = {Eismann, Simon}, howpublished = {Multikonferenz Software Engineering & Management 2019}, keywords = {Tool Design_of_software_and_systems se2_talk t_talk SOA descartes Cloud}, month = {February}, title = {{TeaStore - A Micro-Service Application for Benchmarking, Modeling and Resource Management Research}}, year = 2019 }

Measuring the Energy Efficiency of Transactional Loads on GPGPU. J. von Kistowski; J. Pais; T. Wahl; K.-D. Lange; H. Block; J. Beckett; S. Kounev; in Proceedings of the 19th ACM/SPEC International Conference on Performance Engineering (2019).
Best Industry Paper Award
[ Abstract ] [ BibTeX ] [ Download ]
 
General Purpose Graphics Processing Units (GPGPUs) are becoming more and more common in current servers and data centers, which in turn consume a significant amount of electrical power. Measuring and benchmarking this power consumption is important as it helps with optimization and selection of these servers. However, benchmarking and comparing the energy efficiency of GPGPU workloads is challenging as standardized workloads are rare and standardized power and efficiency measurement methods and metrics do not exist. In addition, not all GPGPU systems run at maximum load all the time. Systems that are utilized in transactional, request driven workloads, for example, can run at lower utilization levels. Existing benchmarks for GPGPU systems primarily consider performance and are intended only to run at maximum load. They do not measure performance or energy efficiency at other loads. In turn, server energy-efficiency benchmarks that consider multiple load levels do not address GPGPUs. This paper introduces a measurement methodology for servers with GPGPU accelerators that considers multiple load levels for transactional workloads. The methodology also addresses verifiability of results in order to achieve comparability of different device solutions. We analyze our methodology on three different systems with solutions from two different accelerator vendors. We investigate the efficacy of different methods of load levels scaling and our methodology's reproducibility. We show that the methodology is able to produce consistent and reproducible results with a maximum coefficient of variation of 1.4% regarding power consumption.
@inproceedings{KiPaWaLaBlBeKo2019-ICPE-GPGPUPower, abstract = {{General Purpose Graphics Processing Units (GPGPUs) are becoming more and more common in current servers and data centers, which in turn consume a significant amount of electrical power. Measuring and benchmarking this power consumption is important as it helps with optimization and selection of these servers. However, benchmarking and comparing the energy efficiency of GPGPU workloads is challenging as standardized workloads are rare and standardized power and efficiency measurement methods and metrics do not exist. In addition, not all GPGPU systems run at maximum load all the time. Systems that are utilized in transactional, request driven workloads, for example, can run at lower utilization levels. Existing benchmarks for GPGPU systems primarily consider performance and are intended only to run at maximum load. They do not measure performance or energy efficiency at other loads. In turn, server energy-efficiency benchmarks that consider multiple load levels do not address GPGPUs. This paper introduces a measurement methodology for servers with GPGPU accelerators that considers multiple load levels for transactional workloads. The methodology also addresses verifiability of results in order to achieve comparability of different device solutions. We analyze our methodology on three different systems with solutions from two different accelerator vendors. We investigate the efficacy of different methods of load levels scaling and our methodology's reproducibility. We show that the methodology is able to produce consistent and reproducible results with a maximum coefficient of variation of 1.4\% regarding power consumption.}}, address = {New York, NY, USA}, author = {von Kistowski, J{ó}akim and Pais, Johann and Wahl, Tobias and Lange, Klaus-Dieter and Block, Hansfried and Beckett, John and Kounev, Samuel}, booktitle = {Proceedings of the 19th ACM/SPEC International Conference on Performance Engineering}, keywords = {Metrics_and_benchmarking_methodologies Performance t_full descartes Cloud Award SPEC Power-energy_efficient_computing Power}, note = {{<b>Best Industry Paper Award</b>}}, publisher = {ACM}, series = {ICPE '19}, title = {{Measuring the Energy Efficiency of Transactional Loads on GPGPU}}, year = 2019 }

Predicting Server Power Consumption from Standard Rating Results. J. von Kistowski; J. Grohmann; N. Schmitt; S. Kounev; in Proceedings of the 19th ACM/SPEC International Conference on Performance Engineering (2019). 301–312.
Full Paper Acceptance Rate: 18.6% (13/70)
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Data center providers and server operators try to reduce the power consumption of their servers. Finding an energy efficient server for a specific target application is a first step in this regard. Estimating the power consumption of an application on an unavailable server is difficult, as nameplate power values are generally overestimations. Offline power models are able to predict the consumption accurately, but are usually intended for system design, requiring very specific and detailed knowledge about the system under consideration. In this paper, we introduce an offline power prediction method that uses the results of standard power rating tools. The method predicts the power consumption of a specific application for multiple load levels on a target server that is otherwise unavailable for testing. We evaluate our approach by predicting the power consumption of three applications on different physical servers. Our method is able to achieve an average prediction error of 9.49% for three workloads running on real-world, physical servers.
@inproceedings{KiGrScKo2019-ICPE-PowerPrediction, abstract = {Data center providers and server operators try to reduce the power consumption of their servers. Finding an energy efficient server for a specific target application is a first step in this regard. Estimating the power consumption of an application on an unavailable server is difficult, as nameplate power values are generally overestimations. Offline power models are able to predict the consumption accurately, but are usually intended for system design, requiring very specific and detailed knowledge about the system under consideration. In this paper, we introduce an offline power prediction method that uses the results of standard power rating tools. The method predicts the power consumption of a specific application for multiple load levels on a target server that is otherwise unavailable for testing. We evaluate our approach by predicting the power consumption of three applications on different physical servers. Our method is able to achieve an average prediction error of 9.49% for three workloads running on real-world, physical servers.}, address = {New York, NY, USA}, author = {von Kistowski, J{ó}akim and Grohmann, Johannes and Schmitt, Norbert and Kounev, Samuel}, booktitle = {Proceedings of the 19th ACM/SPEC International Conference on Performance Engineering}, keywords = {Statistical_estimation_and_machine_learning Metrics_and_benchmarking_methodologies t_full descartes Prediction PRISMA SPEC Power}, note = {{Full Paper Acceptance Rate: 18.6\% (13/70)}}, pages = {301&ndash;312}, publisher = {Association for Computing Machinery (ACM)}, series = {ICPE '19}, title = {{Predicting Server Power Consumption from Standard Rating Results}}, year = 2019 }

Performance Influence of Security Function Chain Ordering. L. Iffländer; N. Fella; in Companion of the 2019 ACM/SPEC International Conference on Performance Engineering (2019). 45–46.
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
In modern days security systems often reach their performance peak and limit the protected application. Utilizing the available resources for security more efficiently is becoming more critical. In this paper, we introduce the claim, that no static security function chain is optimal in every situation. First experiments prove our claim.
@inproceedings{Ifflaender2019_PerformanceInfluenceofSecurityFunctionChainOrdering, abstract = {In modern days security systems often reach their performance peak and limit the protected application. Utilizing the available resources for security more efficiently is becoming more critical. In this paper, we introduce the claim, that no static security function chain is optimal in every situation. First experiments prove our claim.}, address = {New York, NY, USA}, author = {Iffländer, Lukas and Fella, Nicolas}, booktitle = {Companion of the 2019 ACM/SPEC International Conference on Performance Engineering}, keywords = {Metrics_and_benchmarking_methodologies Resource_management Networking Performance descartes Optimization Security Online_monitoring_and_forecasting Self-aware-computing EvIDencE Application-aware SDN t_poster Reliability Self-adaptive-systems}, pages = {45&ndash;46}, publisher = {ACM}, series = {ICPE '19}, title = {Performance Influence of Security Function Chain Ordering}, year = 2019 }

On Learning Parametric Dependencies from Monitoring Data. J. Grohmann; S. Eismann; S. Kounev; in Proceedings of the 10th Symposium on Software Performance 2019 (SSP’19) (2019).
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
A common approach to predict system performance are so-called architectural performance models. In these models, parametric dependencies describe the relation between the input parameters of a component and its performance properties and therefore significantly increase the model expressiveness. However, manually modeling parametric dependencies is often infeasible in practice. Existing automated extraction approaches require either application source code or dedicated performance tests, which are not always available. We therefore introduced one approach for identification and one for characterization of parametric dependencies, solely based on run-time monitoring data. In this paper, we propose our idea on combining both techniques in order to create a holistic approach for the identification and characterization of parametric dependencies. Furthermore, we discuss challenges we are currently facing and potential ideas on how to overcome them.
@inproceedings{GrEiKo2019-SSP-LearningDependencies, abstract = {A common approach to predict system performance are so-called architectural performance models. In these models, parametric dependencies describe the relation between the input parameters of a component and its performance properties and therefore significantly increase the model expressiveness. However, manually modeling parametric dependencies is often infeasible in practice. Existing automated extraction approaches require either application source code or dedicated performance tests, which are not always available. We therefore introduced one approach for identification and one for characterization of parametric dependencies, solely based on run-time monitoring data. In this paper, we propose our idea on combining both techniques in order to create a holistic approach for the identification and characterization of parametric dependencies. Furthermore, we discuss challenges we are currently facing and potential ideas on how to overcome them.}, author = {Grohmann, Johannes and Eismann, Simon and Kounev, Samuel}, booktitle = {Proceedings of the 10th Symposium on Software Performance 2019 (SSP'19)}, keywords = {Statistical_estimation_and_machine_learning Performance descartes Self-aware-computing Prediction Automated_model_learning Self-adaptive-systems t_workshop}, month = {November}, title = {{On Learning Parametric Dependencies from Monitoring Data}}, year = 2019 }

Detecting Parametric Dependencies for Performance Models Using Feature Selection Techniques. J. Grohmann; S. Eismann; S. Elflein; M. Mazkatli; J. von Kistowski; S. Kounev; in 2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) (2019). 309–322.
Acceptance Rate: 23.8% (29/122)
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Architectural performance models are a common approach to predict the performance properties of a software system. Parametric dependencies, which describe the relation between the input parameters of a component and its performance properties, significantly increase the prediction accuracy of architectural performance models. However, manually modeling parametric dependencies is time-intensive and requires expert knowledge. Existing automated extraction approaches require dedicated performance tests, which are often infeasible. In this paper, we introduce an approach to automatically identify parametric dependencies from monitoring data using feature selection techniques from the area of machine learning. We evaluate the applicability of three techniques selected from each of the three groups of feature selection methods: a filter method, an embedded method, and a wrapper method. Our evaluation shows that the filter technique outperforms the other approaches. Based on these results, we apply this technique to a distributed micro-service web-shop, where it correctly identifies 11 performance-relevant dependencies, achieving a precision of 91.7% based on a manually labeled gold-standard.
@inproceedings{GrEiElMaKiKo2019-MASCOTS-DependencyIdentification, abstract = {Architectural performance models are a common approach to predict the performance properties of a software system. Parametric dependencies, which describe the relation between the input parameters of a component and its performance properties, significantly increase the prediction accuracy of architectural performance models. However, manually modeling parametric dependencies is time-intensive and requires expert knowledge. Existing automated extraction approaches require dedicated performance tests, which are often infeasible. In this paper, we introduce an approach to automatically identify parametric dependencies from monitoring data using feature selection techniques from the area of machine learning. We evaluate the applicability of three techniques selected from each of the three groups of feature selection methods: a filter method, an embedded method, and a wrapper method. Our evaluation shows that the filter technique outperforms the other approaches. Based on these results, we apply this technique to a distributed micro-service web-shop, where it correctly identifies 11 performance-relevant dependencies, achieving a precision of 91.7% based on a manually labeled gold-standard.}, author = {Grohmann, Johannes and Eismann, Simon and Elflein, Sven and Mazkatli, Manar and von Kistowski, J{ó}akim and Kounev, Samuel}, booktitle = {2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, keywords = {Statistical_estimation_and_machine_learning DML Performance t_full descartes Self-aware-computing Prediction PRISMA Automated_model_learning}, month = {October}, note = {{Acceptance Rate: 23.8% (29/122)}}, pages = {309&ndash;322}, publisher = {IEEE Computer Society}, series = {MASCOTS '19}, title = {{Detecting Parametric Dependencies for Performance Models Using Feature Selection Techniques}}, year = 2019 }

Utilizing Clustering to Optimize Resource Demand Estimation Approaches. J. Grohmann; S. Eismann; A. Bauer; M. Zuefle; N. Herbst; S. Kounev; in 2019 IEEE 4th International Workshops on Foundations and Applications of Self* Systems (FAS*W) (2019). 134–139.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
Resource demands are crucial parameters for modeling and predicting the performance of software systems. Direct measurement of these resource demands is usually infeasible due to instrumentation overheads causing measurement interferences and perturbation in production environments. Thus, a number of statistical estimation approaches (e.g., based on optimization, regression or Kalman filters) have been proposed in the literature. Most of these approaches are parameterized. These parameters influence the estimation quality and the required computation time. Existing work uses historical data as training sets to optimize those parameters and to minimize the estimation error of those approaches. However, if the data traces are fundamentally different, the optimal parameter settings are different as well. In this paper, we propose to use automated clustering in order to group training sets into groups of similar optimization behavior. This way, optimization can be specifically tailored to certain groups of traces in a self-aware manner. During run-time, every trace is first sorted into a cluster, where the respective cluster-wide parameter optimum can be applied. A preliminary case study shows that clustering can provide promising improvements.
@inproceedings{GrEiBaZuHeKo2019-ICAC-RDEClustering, abstract = {Resource demands are crucial parameters for modeling and predicting the performance of software systems. Direct measurement of these resource demands is usually infeasible due to instrumentation overheads causing measurement interferences and perturbation in production environments. Thus, a number of statistical estimation approaches (e.g., based on optimization, regression or Kalman filters) have been proposed in the literature. Most of these approaches are parameterized. These parameters influence the estimation quality and the required computation time. Existing work uses historical data as training sets to optimize those parameters and to minimize the estimation error of those approaches. However, if the data traces are fundamentally different, the optimal parameter settings are different as well. In this paper, we propose to use automated clustering in order to group training sets into groups of similar optimization behavior. This way, optimization can be specifically tailored to certain groups of traces in a self-aware manner. During run-time, every trace is first sorted into a cluster, where the respective cluster-wide parameter optimum can be applied. A preliminary case study shows that clustering can provide promising improvements.}, author = {Grohmann, Johannes and Eismann, Simon and Bauer, Andre and Zuefle, Marwin and Herbst, Nikolas and Kounev, Samuel}, booktitle = {2019 IEEE 4th International Workshops on Foundations and Applications of Self* Systems (FAS*W)}, keywords = {Statistical_estimation_and_machine_learning Performance descartes Self-aware-computing PRISMA GoogleResearchAward LibReDE Instrumentation_profiling_and_workload_characterization Self-adaptive-systems t_workshop Optimization}, month = {June}, pages = {134&ndash;139}, publisher = {IEEE}, title = {{Utilizing Clustering to Optimize Resource Demand Estimation Approaches}}, year = 2019 }

Performance Oriented Dynamic Bypassing for Intrusion Detection Systems. L. Iffländer; J. Stoll; N. Rawtani; V. Lesch; K.-D. Lange; S. Kounev; in Proceedings of the 2019 ACM/SPEC International Conference on Performance Engineering (2019). 159–166.
[ Abstract ] [ BibTeX ] [ URL ] [ Download ]
 
Attacks on software systems are becoming more and more frequent, aggressive and sophisticated. With the changing threat landscape, in 2018, organizations are looking at when they will be attacked, not if. Intrusion Detection Systems (IDSs) can help in defending against these attacks. The systems that host IDSs require extensive computing resources as IDSs tend to detect attacks under overloaded conditions wrongfully. With the end of Moore's law and the growing adoption of Internet of Things, designers of security systems can no longer expect processing power to keep up the pace with them. This limitation requires ways to increase the performance of these systems without adding additional compute power. In this work, we present two dynamic and a static approach to bypass IDS for traffic deemed benign. We provide its prototype implementation and evaluate our solution. Our evaluation shows promising results. Performance is increased up to the level of a system without an IDS. Attack detection is within the margin of error from the 100% rate. However, our findings show that dynamic approaches perform best when using software switches. The use of a hardware switch reduces the detection rate and performance significantly.
@inproceedings{Ifflaender2019_PerformanceOrientedDynamicBypassingforIntrusionDetectionSystems, abstract = {Attacks on software systems are becoming more and more frequent, aggressive and sophisticated. With the changing threat landscape, in 2018, organizations are looking at when they will be attacked, not if. Intrusion Detection Systems (IDSs) can help in defending against these attacks. The systems that host IDSs require extensive computing resources as IDSs tend to detect attacks under overloaded conditions wrongfully. With the end of Moore's law and the growing adoption of Internet of Things, designers of security systems can no longer expect processing power to keep up the pace with them. This limitation requires ways to increase the performance of these systems without adding additional compute power. In this work, we present two dynamic and a static approach to bypass IDS for traffic deemed benign. We provide its prototype implementation and evaluate our solution. Our evaluation shows promising results. Performance is increased up to the level of a system without an IDS. Attack detection is within the margin of error from the 100% rate. However, our findings show that dynamic approaches perform best when using software switches. The use of a hardware switch reduces the detection rate and performance significantly.}, address = {New York, NY, USA}, author = {Iffländer, Lukas and Stoll, Jonathan and Rawtani, Nishant and Lesch, Veronika and Lange, Klaus-Dieter and Kounev, Samuel}, booktitle = {Proceedings of the 2019 ACM/SPEC International Conference on Performance Engineering}, keywords = {Metrics_and_benchmarking_methodologies Resource_management Networking Security Performance t_short descartes Self-aware-computing EvIDencE Self-adaptive-systems Optimization}, pages = {159&ndash;166}, publisher = {ACM}, series = {ICPE '19}, title = {Performance Oriented Dynamic Bypassing for Intrusion Detection Systems}, year = 2019 }

Chamulteon: Coordinated Auto-Scaling of Micro-Services. A. Bauer; V. Lesch; L. Versluis; A. Ilyushkin; N. Herbst; S. Kounev; in Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS) (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{BaLeVeIlHeKo2019-ICDCS-Chamulteon, author = {Bauer, Andr{é} and Lesch, Veronika and Versluis, Laurens and Ilyushkin, Alexey and Herbst, Nikolas and Kounev, Samuel}, booktitle = {Proceedings of the 39th IEEE International Conference on Distributed Computing Systems (ICDCS)}, keywords = {Metrics_and_benchmarking_methodologies Resource_management Online_monitoring_and_forecasting t_full descartes Self-aware-computing Cloud Elasticity Chameleon SPEC}, month = {July}, title = {Chamulteon: Coordinated Auto-Scaling of Micro-Services}, year = 2019 }

Automation in Software Performance Engineering Based on a Declarative Specification of Concerns. J. C. Walter; (2019).
[ BibTeX ] [ URL ]
 
@phdthesis{Walter2018-phd, author = {Walter, J{ü}rgen Christian}, keywords = {DML Supervised_PhD_Thesis t_dissertation descartes PMX}, school = {Universit{ä}t W{ü}rzburg}, title = {Automation in Software Performance Engineering Based on a Declarative Specification of Concerns}, type = {doctoralthesis}, year = 2019 }

SPEC Research Group Newsletter, vol. 2 no. 4. S. Kounev; A. van Hoorn; A. Bauer; N. Herbst; (2019, April).
Published by Standard Performance Evaluation Corporation (SPEC)
[ BibTeX ] [ URL ] [ Download ]
 
@misc{SPEC-RG-NEWSLETTER-8, author = {Kounev, Samuel and van Hoorn, Andre and Bauer, Andr{é} and Herbst, Nikolas}, keywords = {t_other descartes se2}, month = {April}, note = {Published by Standard Performance Evaluation Corporation (SPEC)}, title = {{SPEC Research Group Newsletter, vol. 2 no. 4}}, year = 2019 }

Best Practices for Time Series Forecasting. A. Bauer; M. Züfle; N. Herbst; S. Kounev; in 2019 IEEE 4th International Workshops on Foundations and Applications of Self* Systems (FAS*W) (2019).
[ BibTeX ] [ Download ]
 
@inproceedings{BaZuHeKo2019-ICAC-ForecastingTutorial, author = {Bauer, Andr{é} and Z{ü}fle, Marwin and Herbst, Nikolas and Kounev, Samuel}, booktitle = {{2019 IEEE 4th International Workshops on Foundations and Applications of Self* Systems (FAS*W)}}, keywords = {Telescope Online_monitoring_and_forecasting descartes t_tutorial}, month = {June}, title = {{Best Practices for Time Series Forecasting}}, year = 2019 }

How is Performance Addressed in DevOps?. C.-P. Bezemer; S. Eismann; V. Ferme; J. Grohmann; R. Heinrich; P. Jamshidi; W. Shang; A. van Hoorn; M. Villavicencio; J. Walter; F. Willnecker; in Proceedings of the 2019 ACM/SPEC International Conference on Performance Engineering (2019). 45–50.
[ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
 
DevOps is a modern software engineering paradigm that is gaining widespread adoption in industry. The goal of DevOps is to bring software changes into production with a high frequency and fast feedback cycles. This conflicts with software quality assurance activities, particularly with respect to performance. For instance, performance evaluation activities --- such as load testing --- require a considerable amount of time to get statistically significant results. We conducted an industrial survey to get insights into how performance is addressed in industrial DevOps settings. In particular, we were interested in the frequency of executing performance evaluations, the tools being used, the granularity of the obtained performance data, and the use of model-based techniques. The survey responses, which come from a wide variety of participants from different industry sectors, indicate that the complexity of performance engineering approaches and tools is a barrier for wide-spread adoption of performance analysis in DevOps. The implication of our results is that performance analysis tools need to have a short learning curve, and should be easy to integrate into the DevOps pipeline in order to be adopted by practitioners.
@inproceedings{BeEiFeGrRhJaShHoViWaWi2019-ICPE-DevOpsSurvey, abstract = {DevOps is a modern software engineering paradigm that is gaining widespread adoption in industry. The goal of DevOps is to bring software changes into production with a high frequency and fast feedback cycles. This conflicts with software quality assurance activities, particularly with respect to performance. For instance, performance evaluation activities &mdash; such as load testing &mdash; require a considerable amount of time to get statistically significant results. We conducted an industrial survey to get insights into how performance is addressed in industrial DevOps settings. In particular, we were interested in the frequency of executing performance evaluations, the tools being used, the granularity of the obtained performance data, and the use of model-based techniques. The survey responses, which come from a wide variety of participants from different industry sectors, indicate that the complexity of performance engineering approaches and tools is a barrier for wide-spread adoption of performance analysis in DevOps. The implication of our results is that performance analysis tools need to have a short learning curve, and should be easy to integrate into the DevOps pipeline in order to be adopted by practitioners.}, address = {New York, NY, USA}, author = {Bezemer, Cor{-}Paul and Eismann, Simon and Ferme, Vincenzo and Grohmann, Johannes and Heinrich, Robert and Jamshidi, Pooyan and Shang, Weiyi and van Hoorn, Andr{{é}} and Villavicencio, M{{ó}}nica and Walter, J{{ü}}rgen and Willnecker, Felix}, booktitle = {Proceedings of the 2019 ACM/SPEC International Conference on Performance Engineering}, keywords = {Survey Performance Design_of_software_and_systems t_short descartes Instrumentation_profiling_and_workload_characterization SPEC}, pages = {45&ndash;50}, publisher = {Association for Computing Machinery (ACM)}, series = {ICPE '19}, title = {{How is Performance Addressed in DevOps?}}, year = 2019 }

Towards Adaptive Car-to-Cloud Communication. S. Herrnleben; M. Pfannemüller; C. Krupitzer; S. Kounev; M. Segata; F. Fastnacht; M. Nigmann; in Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) (2019).
[ Abstract ] [ BibTeX ] [ Download ]
 
Recent developments in communication technology have led to cloud resources becoming ubiquitous. These resources enable many new applications by offering computational power for remote embedded devices. In combination with advances in the area of smart driving, this seems to be especially beneficial for applications such as remote maintenance of vehicles or integration with smart city services. As autonomous driving continues to gain traction, Car-to-Cloud communication can support transferring collected data to the cloud, e.g., for dynamic learning of new map information. Additionally, passengers can benefit from novel entertainment services. All these developments require a stable connection between a mobile vehicle and the cloud resources. In this vision paper, we survey Car-to-Cloud communication applications. Based on the analysis of the varying requirements for these applications, we formulate research questions and challenges. Further, we discuss how these challenges can be addressed by means of an adaptive Car-to-Cloud communication middleware. We conclude with an overview on our activities in this area and an outlook on our planned future work on adaptive communication.
@inproceedings{HePfKrKoSeFaNi2019-PerAwareCity-carToCloudCommunication, abstract = {Recent developments in communication technology have led to cloud resources becoming ubiquitous. These resources enable many new applications by offering computational power for remote embedded devices. In combination with advances in the area of smart driving, this seems to be especially beneficial for applications such as remote maintenance of vehicles or integration with smart city services. As autonomous driving continues to gain traction, Car-to-Cloud communication can support transferring collected data to the cloud, e.g., for dynamic learning of new map information. Additionally, passengers can benefit from novel entertainment services. All these developments require a stable connection between a mobile vehicle and the cloud resources. In this vision paper, we survey Car-to-Cloud communication applications. Based on the analysis of the varying requirements for these applications, we formulate research questions and challenges. Further, we discuss how these challenges can be addressed by means of an adaptive Car-to-Cloud communication middleware. We conclude with an overview on our activities in this area and an outlook on our planned future work on adaptive communication.}, address = {Kyoto, Japan}, author = {Herrnleben, Stefan and Pfannem{ü}ller, Martin and Krupitzer, Christian and Kounev, Samuel and Segata, Michele and Fastnacht, Felix and Nigmann, Magnus}, booktitle = {Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)}, keywords = {Internet_of_Things Cyber-Physical_Systems Networking descartes Self-aware-computing Cloud MODELS Self-adaptive-systems t_workshop Intelligent_Transportation_Systems}, title = {Towards Adaptive {Car-to-Cloud} Communication}, year = 2019 }

Integrating Statistical Response Time Models in Architectural Performance Models. S. Eismann; J. Grohmann; J. Walter; J. von Kistowski; S. Kounev; in Proceedings of the 2019 IEEE International Conference on Software Architecture (ICSA) (2019). 71–80.
Acceptance Rate: 21,9% (21/96)