This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-07-04 Creation time: 14-17-33 --- Number of references 3 inproceedings 2023_pennekamp_benchmarking_comparison 2023 6 15 13901 489-505 Benchmarking is an essential tool for industrial organizations to identify potentials that allows them to improve their competitive position through operational and strategic means. However, the handling of sensitive information, in terms of (i) internal company data and (ii) the underlying algorithm to compute the benchmark, demands strict (technical) confidentiality guarantees—an aspect that existing approaches fail to address adequately. Still, advances in private computing provide us with building blocks to reliably secure even complex computations and their inputs, as present in industry benchmarks. In this paper, we thus compare two promising and fundamentally different concepts (hardware- and software-based) to realize privacy-preserving benchmarks. Thereby, we provide detailed insights into the concept-specific benefits. Our evaluation of two real-world use cases from different industries underlines that realizing and deploying secure information systems for industry benchmarking is possible with today's building blocks from private computing. Lecture Notes in Computer Science (LNCS), Volume 13901 real-world computing; trusted execution environments; homomorphic encryption; key performance indicators; benchmarking internet-of-production https://www.comsys.rwth-aachen.de/fileadmin/papers/2023/2023-pennekamp-industry-benchmarking.pdf Springer Proceedings of the 35th International Conference on Advanced Information Systems Engineering (CAiSE '23), June 12-16, 2023, Zaragoza, Spain Zaragoza, Spain 35th International Conference on Advanced Information Systems Engineering (CAiSE '23) June 12-16, 2023 978-3-031-34559-3 0302-9743 10.1007/978-3-031-34560-9_29 1 JanPennekamp JohannesLohmöller EduardVlad JoschaLoos NiklasRodemann PatrickSapel Ina BereniceFink SethSchmitz ChristianHopmann MatthiasJarke GüntherSchuh KlausWehrle MartinHenze inproceedings 2011-globecom-bitsch-geodtn 2011 12 5 1 -- 5 In this paper we present a disruption tolerant routing algorithm based on geographic location information, which improves upon the hop count compared to the current state of the art by up to a factor of three in large scale human networks. Leveraging only the history of geographic movement patterns in the two-hop neighborhood, our algorithm is able to perform well in the absence of knowledge of social interaction between nodes and without detailed future schedule information. Representing previously visited locations as probability distributions encoded in an efficient vector, we formalize a heuristic for efficiently forwarding messages in disruption tolerant networks, implement a framework for comparing our approach with the state of the art, and evaluate key metrics, such as hop count and delivery rate, as well as energy consumption and battery depletion fairness on real world data. We are able to outperform the state of the art in human mobility based networks considerably in terms of energy usage per node, thereby extending data network availability further into areas devoid of otherwise necessary communication infrastructure. fileadmin/papers/2011/2011-GlobeCom-bitsch-geoDTN.pdf Online

Piscataway, NJ, USA

IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN), Houston, Texas, USA IEEE Houston, Texas, USA IEEE GLOBECOM 2011 - Next Generation Networking Symposium (GC'11 - NGN) 5-9 December 2011 en 978-1-4244-9268-8 1930-529X 1 Jó AgilaBitsch Link DanielSchmitz KlausWehrle inproceedings 200707SchmidtFGSN07composition 2007

Aachen, Germany

Proceedings of 6th GI/ITG KuVS Fachgespräch "Wireless Sensor Networks", Aachen StefanSchmitz OlafLandsiedel KlausWehrle