Prof. Dr.-Ing. Franz Hauck

Franz Hauck
Prof. Dr.-Ing. Franz Hauck
Stellv. Institutsdirektor
Institut für Verteilte Systeme
Institut für Verteilte Systeme
Universität Ulm
Albert-Einstein-Allee 11
89081 Ulm
Baden-Württemberg
Deutschland
Raum: O27 348
Telefon: +4973150-24143

Publikationen

2024

Heß, A., Hauck, F.J. and Meißner, E. 2024. Consensus-agnostic state-machine replication. 25th ACM/IFIP Int. Middleware Conf. (Dec. 2024). [accepted for publication]
Hauck, F.J. and Heß, A. 2024. Linearizability and state-machine replication: Is it a match? ArXiv.org.
Mehdi, M., Hauck, F.J., Pryss, R. and Schlee, W. 2024. Mobile health solutions for Tinnitus. Textbook on Tinnitus (Mar. 2024), 723–738.
Modern mobile devices are mainstream and ubiquitous devices. The widespread adoption of mobile devices has resulted in surge of mobile applications (apps) hosted on marketplaces (app stores) of several mobile platforms. Besides other benefits, these apps are also applied in healthcare-related and medical use, for instance, in case of tinnitus, where tinnitus disorder is associated with the perception of ringing sound without external sound source. In particular, for tinnitus, these apps allow provision of tinnitus-related relief, self-help, and general management. The collective aim of this chapter is to foster and report on Mobile Health (mHealth) solutions, in particular mobile apps within the tinnitus context. First, this chapter provides an up-to-date overview of existing mHealth apps available for major mobile platforms. Second, this chapter provides deep insights into quality and effectiveness of said mobile apps for tinnitus treatment and management. Finally, this chapter provides discussions in relation to the tinnitus-related mHealth apps.
Hauck, F.J. and Heß, A. 2024. Linearizability and state-machine replication. Workshop on Resilient Oper. - Byz. Fault Tol. and State-Machine Repl. – ROBUST (Mar. 2024).
Heß, A. and Hauck, F.J. 2024. A framework for consensus-agnostic state-machine replication based on threshold signatures. Workshop on Resilient Oper. - Byz. Fault Tol. and State-Machine Repl. – ROBUST (Mar. 2024).

2023

Köstler, J., Reiser, H.P., Hauck, F.J. and Habiger, G. 2023. Fluidity: location-awareness in replicated state machines. 38th ACM/SIGAPP Symp. on Appl. Comp. – SAC (Mar. 2023).
In planetary-scale replication systems, the overall response delay is greatly influenced by the geographical distances between client and server nodes. Current systems define the replica locations statically during startup time. However, the selected locations might be suboptimal for the clients, and the client request origin distribution may change over time, so a different replica placement may provide lower overall request latencies. In this work, we propose a locationaware replicated state machine that is able to adapt the geographic location of its replicas dynamically during runtime to locations geographically closer to client request origins. Our prototype is able to observe emerging optimization potentials and to reduce the overall request latency for the majority of clients by adapting its replica locations to the time-dependent optimum placement during real-world use case evaluations, whereby the absolute performance gain is dependent on the respective usage scenario.
Heß, A. and Hauck, F.J. 2023. Towards a Cloud Service for State-Machine Replication. Tagungsband des FG-BS Frühjahrstreffens 2023 (Bonn - Germany, 2023).
State-machine replication (SMR) is a well-known technique to achieve fault tolerance for services that require high availability and fast recovery times. While the concept of SMR has been extensively investigated, there are still missing building blocks to provide a generic offer, which automatically serves applications with SMR technology in the cloud. In this work, we introduce a cloud service architecture that enables automatic deployment of service applications based on customer-friendly service parameters, which are mapped onto an internal configuration that comprises the number of replicas, tolerable failures, and the consensus algorithm, amongst other aspects. The deployed service configuration is masked to large extent with the use of threshold signatures. As a consequence, a reconfiguration in the cloud deployment does not affect the client-side code. We conclude the paper by discussing open engineering questions that need to be addressed in order to provide a productive cloud offer.
Pampel, B., Standl, B., Hildebrand, C., Hauck, F.J., Ulbrich, M. and Paech, B. 2023. Neue Einblicke in den Berufswahlprozess von Informatiklehrkräften. Informatikunterricht zwischen Aktualität und Zeitlosigkeit – INFOS (2023).
Mit der Einführung bzw. dem Ausbau des seit Jahren geforderten Pflichtfaches Informatik entsteht noch mehr Bedarf an qualifizierten Lehrkräften. Auch wenn Maßnahmen zur Nachqualifizierung von bestehenden Lehrkräften einen wichtigen Beitrag zur Deckung des Bedarfs leisten, muss gleichzeitig die Anzahl der Absolvent:innen aus lehramtsbezogenen Informatik-Studiengängen gesteigert werden. Allerdings zeigen die Zahlen, dass es noch immer zu wenig Studienanfänger:innen und noch weniger Absolvent:innen im Lehramt Informatik gibt. Um Maßnahmen zur Stärkung der Lehramtsausbildung im Fach Informatik gezielt auszurichten, muss der Berufswahlprozess erneut in den Blick genommen werden. Die wenigen bisher dazu durchgeführten Untersuchungen haben hier verschiedene Fragen offengelassen bzw. aufgrund der noch nicht ausreichenden Datenlage teils nur mit Vermutungen beantworten können. Der vorliegende Artikel widmet sich der Auswertung einer landesweit in Baden-Württemberg durchgeführten Umfrage unter aktiven Lehramtsstudierenden der Informatik mit erfreulich hoher Rücklaufquote. Es werden neue Erkenntnisse zur Reihenfolge von Teilentscheidungen für das Lehramtsstudium bzw. für die Fächer vorgestellt und der Anteil an Fachwechsler:innen betrachtet. Es wird unterschieden zwischen Studierenden, die während der Schulzeit keinen, einen als nicht gut bewerteten oder als gut bewerteten Informatikunterricht hatten. Darüber hinaus werden Motive der Berufs- bzw. Studiengangswahl in den Blick genommen und der Frage nach Unterschieden zwischen männlichen und weiblichen Studierenden nachgegangen.

2022

Berger, C., Reiser, H.P., Hauck, F.J., Held, F. and Domaschka, J. 2022. Automatic integration of BFT state-machine replication into IoT systems. CoRR. abs/2207.00500, (2022).
Byzantine fault tolerance (BFT) can preserve the availability and integrity of IoT systems where single components may suffer from random data corruption or attacks that can expose them to malicious behavior. While state-of-the-art BFT state-machine replication (SMR) libraries are often tailored to fit a standard request-response interaction model with dedicated client-server roles, in our design, we employ an IoT-fit interaction model that assumes a loosly-coupled, event-driven interaction between arbitrarily wired IoT components. In this paper, we explore the possibility of automating and streamlining the complete process of integrating BFT SMR into a component-based IoT execution environment. Our main goal is providing simplicity for the developer: We strive to decouple the specification of a logical application architecture from the difficulty of incorporating BFT replication mechanisms into it. Thus, our contributions address the automated configuration, re-wiring and deployment of IoT components, and their replicas, within a component-based, event-driven IoT platform.
Berger, C., Reiser, H.P., Hauck, F.J., Held, F. and Domaschka, J. 2022. Automatic integration of BFT state-machine replication into IoT systems. 18th Eur. Dep. Comp. Conf. – EDCC (2022), 1–8.
Byzantine fault tolerance (BFT) can preserve the availability and integrity of IoT systems where single components may suffer from random data corruption or attacks that can expose them to malicious behavior. While state-of-the-art BFT state-machine replication (SMR) libraries are often tailored to fit a standard request-response interaction model with dedicated client-server roles, in our design, we employ an IoT-fit interaction model that assumes a loosly-coupled, event-driven interaction between arbitrarily wired IoT components.In this paper, we explore the possibility of automating and streamlining the complete process of integrating BFT SMR into a component-based IoT execution environment. Our main goal is providing simplicity for the developer: We strive to decouple the specification of a logical application architecture from the difficulty of incorporating BFT replication mechanisms into it. Thus, our contributions address the automated configuration, rewiring and deployment of IoT components, and their replicas, within a component-based, event-driven IoT platform.
Berger, C., Eichhammer, P., Reiser, H.P., Domaschka, J., Hauck, F.J. and Habiger, G. 2022. A survey on resilience in the IoT: taxonomy, classification, and discussion of resilience mechanisms. ACM Comp. Surv. 54, 7 (2022), 147:1-147:39.
Internet-of-Things (IoT) ecosystems tend to grow both in scale and complexity, as they consist of a variety of heterogeneous devices that span over multiple architectural IoT layers (e.g., cloud, edge, sensors). Further, IoT systems increasingly demand the resilient operability of services, as they become part of critical infrastructures. This leads to a broad variety of research works that aim to increase the resilience of these systems. In this article, we create a systematization of knowledge about existing scientific efforts of making IoT systems resilient. In particular, we first discuss the taxonomy and classification of resilience and resilience mechanisms and subsequently survey state-of-the-art resilience mechanisms that have been proposed by research work and are applicable to IoT. As part of the survey, we also discuss questions that focus on the practical aspects of resilience, e.g., which constraints resilience mechanisms impose on developers when designing resilient systems by incorporating a specific mechanism into IoT systems.

2021

Genitsaridi, E., Dode, A., Qirjazi, B., Mehdi, M., Pryss, R., Probst, T., Reichert, M., Hauck, F.J. and Hall, D.A. 2021. An Albanian translation of a questionnaire for self-reported tinnitus assessment. Int. J. of Audiology. (Jun. 2021), 1–6.
To our knowledge, there is no published study investigating the characteristics of people experiencing tinnitus in Albania. Such a study would be important, providing the basis for further research in this region and contributing to a wider understanding of tinnitus heterogeneity across different geographic locations. The main objective of this study was to develop an Albanian translation of a standardised questionnaire for tinnitus research, namely the European School for Interdisciplinary Tinnitus Research-Screening Questionnaire (ESIT-SQ). A secondary objective was to assess its applicability and usefulness by conducting an exploratory survey on a small sample of the Albanian tinnitus population.Design and study sample Three translators were recruited to create the Albanian ESIT-SQ translation following good practice guidelines. Using this questionnaire, data from 107 patients attending otolaryngology clinics in Albania were collected.Results Participants reporting various degrees of tinnitus symptom severity had distinct phenotypic characteristics. Application of a random forest approach on this preliminary dataset showed that self-reported hearing difficulty, and tinnitus duration, pitch and temporal manifestation were important variables for predicting tinnitus symptom severity.Conclusions Our study provided an Albanian translation of the ESIT-SQ and demonstrated that it is a useful tool for tinnitus profiling and subgrouping.
Mödinger, D., Lorenz, J.-H. and Hauck, F.J. 2021. Statistical privacy-preserving message broadcast for peer-to-peer networks. PLOS ONE. 16, 5 (May 2021), 1–24.
Privacy concerns are widely discussed in research and society in general. For the public infrastructure of financial blockchains, this discussion encompasses the privacy of the originator of a transaction broadcasted on the underlying peer-to-peer network. Adaptive diffusion is an approach to expose an alternative source of a message to attackers. However, this approach assumes an unsuitable attacker model and a non-realistic network model for current peer-to-peer networks on the Internet. We transform adaptive diffusion into a new statistical privacy-preserving broadcast protocol for realistic current networks. We model a class of unstructured peer-to-peer networks as organically growing graphs and provide models for other classes of such networks. We show that the distribution of shortest paths can be modelled using a normal distribution N ( μ , σ 2 ). We determine statistical estimators for μ, σ via multivariate models. The model behaves logarithmic over the number of nodes n and proportional to an inverse exponential over the number of added edges per node k. These results facilitate the computation of optimal forwarding probabilities during the dissemination phase for maximum privacy, with participants having only limited information about network topology.
Köstler, J., Reiser, H.P., Habiger, G. and Hauck, F.J. 2021. SmartStream: towards Byzantine resilient data streaming. 36th Ann. ACM Symp. on Appl. Comp. – SAC (Virtual Event, Republic of Korea, Mar. 2021), 213–222.
Data streaming platforms connect heterogeneous services through the publish-subscribe paradigm. Currently available platforms provide protection against crash faults, but are not resistant against Byzantine faults like arbitrary hardware faults and intrusions. State machine replication can provide this protection, but the higher resource requirements and the more elaborated communication primitives usually result in a higher overall complexity and a non-negligible performance degradation. This is especially true for data streaming if the default textbook approach of integrating the service into a replicated state machine is followed without further adaptions. The standard state management with state logs and snapshots and without any partitioning scheme limits both performance and scalability in a way those systems become unusable in practice. That is why we propose SmartStream, a topic-based Byzantine fault-tolerant data streaming platform that harmonizes the competing concepts of both systems and leverages the specific characteristics of data streaming, namely the append-only semantics of the application state and its partitionable structure. We show its effectiveness in a prototype implementation and evaluate its performance. The evaluation results show a moderate drop in system throughput when compared to state-of-the-art data streaming platforms like Apache Kafka, but reasonable overall performance considering the stronger resilience guarantees.
Mödinger, D., Heß, A. and Hauck, F.J. 2021. Arbitrary Length k-Anonymous Dining-Cryptographers Communication. CoRR. abs/2103.17091, (Mar. 2021).
Dining-cryptographers networks (DCN) can achieve information-theoretical privacy. Unfortunately, they are not well suited for peer-to-peer networks as they are used in blockchain applications to disseminate transactions and blocks among par- ticipants. In previous but preliminary work, we proposed a three- phase approach with an initial phase based on a DCN with a group size of k while later phases take care of the actual broadcast within a peer-to-peer network. This paper describes our DCN protocol in detail and adds a performance evaluation powered by our proof-of-concept implementation. Our contributions are (i) an extension of the DCN protocol by von Ahn for fair delivery of arbitrarily long messages sent by potentially multiple senders, (ii) a privacy and security analysis of this extension, (iii) various performance optimisation especially for best-case operation, and (iv) a performance evaluation. The latter uses a latency of 100 ms and a bandwidth limit of 50 Mbit s−1 between participants. The interquartile range of the largest test of the highly secured version took 35s ± 1.25s for a full run. All tests of the optimized common-case mode show the dissemination of a message within 0.5s ± 0.1s. These results compare favourably to previously established protocols for k-anonymous transmission of fixed size messages, outperforming the original protocol for messages as small as 2 KiB.
Mödinger, D., Lorenz, J.-H. and Hauck, F.J. 2021. Statistical privacy-preserving message dissemination for peer-to-peer networks. CoRR. abs/2102.01615, (2021).
Concerns for the privacy of communication is widely discussed in research and overall society. For the public financial infrastructure of blockchains, this discussion encompasses the privacy of transaction data and its broadcasting throughout the network. To tackle this problem, we transform a discrete-time protocol for contact networks over infinite trees into a computer network protocol for peer-to-peer networks. Peer-to-peer networks are modeled as organically growing graphs. We show that the distribution of shortest paths in such a network can be modeled using a normal distribution (μ,σ2). We determine statistical estimators for μ,σ via multivariate models. The model behaves logarithmic over the number of nodes n and proportional to an inverse exponential over the number of added edges k. These results facilitate the computation of optimal forwarding probabilities during the dissemination phase for optimal privacy in a limited information environment.
Mödinger, D., Dispan, J. and Hauck, F.J. 2021. Shared-Dining: Broadcasting Secret Shares using Dining-Cryptographers Groups. CoRR. abs/2104.03032, (2021).
A k-anonymous broadcast can be implemented using a small group of dining cryptographers to first share the message, followed by a flooding phase started by group members. Members have little incentive to forward the message in a timely manner, as forwarding incurs costs, or they may even profit from keeping the message. In worst case, this leaves the true originator as the only sender, rendering the dining-cryptographers phase useless and compromising their privacy. We present a novel approach using a modified dining-cryptographers protocol to distributed shares of an (n,k)-Shamir's secret sharing scheme. Finally, all group members broadcast their received share through the network, allowing any recipient of k shares to reconstruct the message, enforcing anonymity. If less than k group members broadcast their shares, the message cannot be decoded thus preventing privacy breaches for the originator. Our system provides (n-|attackers|)-anonymity for up to k-1 attackers and has little performance impact on dissemination. We show these results in a security analysis and performance evaluation based on a proof-of-concept prototype. Throughput rates between 10 and 100 kB/s are enough for many real applications with high privacy requirements, e.g., financial blockchain system.
Mödinger, D., Dispan, J. and Hauck, F.J. 2021. Shared-Dining: Broadcasting Secret Shares Using Dining-Cryptographers Groups. Distributed Applications and Interoperable Systems – DAIS (2021), 83–98.
We introduce a combination of Shamir's secret sharing and dining-cryptographers networks, which provides (n-|attackers|))-anonymity for up to k-1 attackers and has manageable performance impact on dissemination. A k-anonymous broadcast can be implemented using a small group of dining cryptographers to first share the message, followed by a flooding phase started by group members. Members have little incentive to forward the message in a timely manner, as forwarding incurs costs, or they may even profit from keeping the message. In worst case, this leaves the true originator as the only sender, rendering the dining-cryptographers phase useless and compromising their privacy. We present a novel approach using a modified dining-cryptographers protocol to distributed shares of an (n, k)-Shamir's secret sharing scheme. All group members broadcast their received share through the network, allowing any recipient of k shares to reconstruct the message, enforcing anonymity. If less than k group members broadcast their shares, the message cannot be decoded thus preventing privacy breaches for the originator. We demonstrate the privacy and performance results in a security analysis and performance evaluation based on a proof-of-concept prototype. Throughput rates between 10 and 100 kB/s are enough for many real applications with high privacy requirements, e.g., financial blockchain system.
Heß, A., Hauck, F.J., Mödinger, D., Pietron, J., Tichy, M. and Domaschka, J. 2021. Morpheus: A Degradation Framework for Resilient IoT Systems. STAF Workshops (Virtual Event, Bergen - Norway, 2021), 105–114.
Graceful degradation is an established concept to improve the resilience of systems, especially when other resilience mechanisms have failed. Its implementation is often heavily tied to the application code and, thus, cumbersome and error prone. As IoT systems get not only ubiquitous but also critical, reliable graceful degradation would be ideal. In this paper, we present the Morpheus framework that provides a TypeScript-internal DSL to enable a systematic development of degradable IoT systems. The design of the framework is based on the concept of separation of concerns by providing distinct yet linked languages to specify hierarchical components and their connections; the components’ operating modes and transfer functions between them; as well as state machines for the specification of the components’ behaviour in each operating mode. The operating modes for each component serve as degradation levels. Automatic degradation of a component is triggered in case of failures of connected components. With recovery from underlying failures, the component is automatically upgraded back to a higher level. We illustrate our framework using a simplified prototype of an entrance barrier of a parking garage
Dode, A., Mehdi, M., Pryss, R., Schlee, W., Probst, T., Reichert, M., Hauck, F.J. and Winter, M. 2021. Chapter 9: Using a visual analog scale (VAS) to measure tinnitus-related distress and loudness: investigating correlations using the Mini-TQ results of participants from the TrackYourTinnitus platform. Tinnitus: an interdisciplinary approach towards individualized treatment; Results from the European Graduate School for Interdisciplinary Tinnitus Research. Elsevier. 171–190.
ntroduction: Tinnitus, a perception of ringing and buzzing sound in the ear, has not been completely understood yet. It is well known that tinnitus-related distress and loudness can change over time. However, proper comparability for the data collection approaches requires further focused studies. In this context, technology such as the use of mobile devices may be a promising approach. Repeated assessments of tinnitus-related distress and loudness in Ecological Momentary Assessment (EMA) studies require a short assessment, and a Visual Analogic Scale (VAS) is often used in this context. Yet, their comparability with psychometric questionnaires remains unclear and thus was the focus of this study. Research goals: The evaluation of the appropriateness of VAS in measuring tinnitus-related distress and loudness is pursued in this paper. Methods: The Mini Tinnitus Questionnaire (Mini-TQ) measured tinnitus-related distress once. Tinnitus-related distress and tinnitus loudness were measured repeatedly using VAS on a daily basis during 7 days in the TrackYourTinnitus (TYT) smartphone app and were summarized per day using mean and median results. Then, correlations between summarized VAS tinnitus-related distress and summarized VAS tinnitus loudness, on the one side, and Mini-TQ, on the other side, were calculated. Results: Correlations between Mini-TQ and VAS tinnitus-related distress ranged between r = 0.36 and r = 0.52, while correlations between Mini-TQ and VAS tinnitus loudness ranged between r = 0.25 and r = 0.36. The more time difference between the Mini-TQ and the VAS assessments is, the lower the correlations between them. Mean and median VAS values per day resulted in similar correlations. Conclusions: Mobile-based VAS seems to be an appropriate approach to utilize daily measurements of tinnitus-related distress.
Berger, C., Eichhammer, P., Reiser, H.P., Domaschka, J., Hauck, F.J. and Habiger, G. 2021. A Survey on Resilience in the IoT: Taxonomy, Classification and Discussion of Resilience Mechanisms. CoRR. abs/2109.02328, (2021).
Internet-of-Things (IoT) ecosystems tend to grow both in scale and complexity as they consist of a variety of heterogeneous devices, which span over multiple architectural IoT layers (e.g., cloud, edge, sensors). Further, IoT systems increasingly demand the resilient operability of services as they become part of critical infrastructures. This leads to a broad variety of research works that aim to increase the resilience of these systems. In this paper, we create a systematization of knowledge about existing scientific efforts of making IoT systems resilient. In particular, we first discuss the taxonomy and classification of resilience and resilience mechanisms and subsequently survey state-of-the-art resilience mechanisms that have been proposed by research work and are applicable to IoT. As part of the survey, we also discuss questions that focus on the practical aspects of resilience, e.g., which constraints resilience mechanisms impose on developers when designing resilient systems by incorporating a specific mechanism into IoT systems.

2020

Mödinger, D., Lorenz, J.-H., van der Heijden, R.W. and Hauck, F.J. 2020. Unobtrusive monitoring: Statistical dissemination latency estimation in Bitcoin’s peer-to-peer network. PLOS ONE. 15, 12 (Dec. 2020), 1–21.
The cryptocurrency system Bitcoin uses a peer-to-peer network to distribute new transactions to all participants. For risk estimation and usability aspects of Bitcoin applications, it is necessary to know the time required to disseminate a transaction within the network. Unfortunately, this time is not immediately obvious and hard to acquire. Measuring the dissemination latency requires many connections into the Bitcoin network, wasting network resources. Some third parties operate that way and publish large scale measurements. Relying on these measurements introduces a dependency and requires additional trust. This work describes how to unobtrusively acquire reliable estimates of the dissemination latencies for transactions without involving a third party. The dissemination latency is modelled with a lognormal distribution, and we estimate their parameters using a Bayesian model that can be updated dynamically. Our approach provides reliable estimates even when using only eight connections, the minimum connection number used by the default Bitcoin client. We provide an implementation of our approach as well as datasets for modelling and evaluation. Our approach, while slightly underestimating the latency distribution, is largely congruent with observed dissemination latencies.
Mehdi, M., Stach, M., Riha, C., Neff, P., Dode, A., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2020. Smartphone and Mobile Health Apps for Tinnitus: Systematic Identification, Analysis, and Assessment. JMIR Mhealth Uhealth. 8, 8 (Aug. 2020).
Background: Modern smartphones contain sophisticated high-end hardware features, offering high computational capabilities at extremely manageable costs and have undoubtedly become an integral part in users' daily life. Additionally, smartphones offer a well-established ecosystem that is easily discoverable and accessible via the marketplaces of differing mobile platforms, thus encouraging the development of many smartphone apps. Such apps are not exclusively used for entertainment purposes but are also commonplace in health care and medical use. A variety of those health and medical apps exist within the context of tinnitus, a phantom sound perception in the absence of any physical external source. Objective: In this paper, we shed light on existing smartphone apps addressing tinnitus by providing an up-to-date overview. Methods: Based on PRISMA guidelines, we systematically searched and identified existing smartphone apps on the most prominent app markets, namely Google Play Store and Apple App Store. In addition, we applied the Mobile App Rating Scale (MARS) to evaluate and assess the apps in terms of their general quality and in-depth user experience. Results: Our systematic search and screening of smartphone apps yielded a total of 34 apps (34 Android apps, 26 iOS apps). The mean MARS scores (out of 5) ranged between 2.65-4.60. The Tinnitus Peace smartphone app had the lowest score (mean 2.65, SD 0.20), and Sanvello—Stress and Anxiety Help had the highest MARS score (mean 4.60, SD 0.10). The interrater agreement was substantial (Fleiss κ=0.74), the internal consistency was excellent (Cronbach α=.95), and the interrater reliability was found to be both high and excellent—Guttman λ6=0.94 and intraclass correlation, ICC(2,k) 0.94 (95% CI 0.91-0.97), respectively. Conclusions: This work demonstrated that there exists a plethora of smartphone apps for tinnitus. All of the apps received MARS scores higher than 2, suggesting that they all have some technical functional value. However, nearly all identified apps were lacking in terms of scientific evidence, suggesting the need for stringent clinical validation of smartphone apps in future. To the best of our knowledge, this work is the first to systematically identify and evaluate smartphone apps within the context of tinnitus.
Mehdi, M., Hennig, L., Diemer, F., Dode, A., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2020. Towards Mobile-Based Preprocessing Pipeline for Electroencephalography (EEG) Analyses: The Case of Tinnitus. 9th EAI Int. Conf. on Wireless Mobile Comm. & Healthcare - MobiHealth (2020), 67–86.
Recent developments in Brain-Computer Interfaces (BCI)—technologies to collect brain imaging data—allow recording of Electroencephalography (EEG) data outside of a laboratory setting by means of mobile EEG systems. Brain imaging has been pivotal in understanding the neurobiological correlates of human behavior in many complex disorders. This is also the case for tinnitus, a disorder that causes phantom noise sensations in the ears in absence of any sound source. As studies have shown that tinnitus is also influenced by complexities in non-auditory brain areas, mobile EEG can be a viable solution in better understanding the influencing factors causing tinnitus. Mobile EEG will become even more useful, if real-time EEG analysis in mobile experimental environments is enabled, e.g., as an immediate feedback to physicians and patients or in undeveloped areas where a laboratory setup is unfeasible. The volume and complexity of brain imaging data have made preprocessing a pertinent step in the process of analysis, e.g., for data cleaning and artifact removal. We introduce the first smartphone-based preprocessing pipeline for real-time EEG analysis. More specifically, we present a mobile app with a rudimentary EEG preprocessing pipeline and evaluate the app and its resource consumption underpinning the feasibility of smartphones for EEG preprocessing. Our proposed approach will allow researchers to collect brain imaging data of tinnitus and other patients in real-world environments and everyday situations, thereby collecting evidence for previously unknown facts about tinnitus and other conditions.
Mehdi, M., Diemer, F., Hennig, L., Dode, A., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2020. TinnituSense: a Mobile Electroencephalography (EEG) Smartphone App for Tinnitus Research. 17th EAI Int. Conf. on Wireless Mobile & Ubiq. Comp. - MobiQuitous (2020), 252–261.
Tinnitus is a disorder or symptom that causes phantom noise sensation in the ears without presence of any external sound source. Tinnitus is understood as a problem caused by underlying damage in the inner-ear. However, recent studies have shown that tinnitus is also influenced by complexities in non-auditory brain areas. Among different brain-imaging techniques, mobile Electroencephalography (EEG) can be a viable solution in better understanding the influencing factors in the brain causing tinnitus, but real-time analysis of EEG in real-world environments is faced by unique challenges and limitations. We present the first pure smartphone-based solution to acquire and analyze EEG data in real time and in everyday settings, as well as in any other scenario which does not allow large setups. More specifically, we propose TinnituSense a smartphone app for EEG recordings and visualization, and evaluate this app to claim the feasibility of our approach. On one hand, the proposed approach will open the opportunities to perform brain-imaging in real-world environment. On the other hand, the developed app will allow tinnitus researchers to collect evidence for new facts regarding tinnitus with the help of ambulatory brain-imaging data.
Mehdi, M., Riha, C., Neff, P., Dode, A., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2020. Smartphone Apps in the Context of Tinnitus: Systematic Review. Sensors. 20, 6 (2020), 1725.
martphones containing sophisticated high-end hardware and offering high computational capabilities at extremely manageable costs have become mainstream and an integral part of users’ lives. Widespread adoption of smartphone devices has encouraged the development of many smartphone applications, resulting in a well-established ecosystem, which is easily discoverable and accessible via respective marketplaces of differing mobile platforms. These smartphone applications are no longer exclusively limited to entertainment purposes but are increasingly established in the scientific and medical field. In the context of tinnitus, the ringing in the ear, these smartphone apps range from relief, management, self-help, all the way to interfacing external sensors to better understand the phenomenon. In this paper, we aim to bring forth the smartphone applications in and around tinnitus. Based on the PRISMA guidelines, we systematically analyze and investigate the current state of smartphone apps, that are directly applied in the context of tinnitus. In particular, we explore Google Scholar, CiteSeerX, Microsoft Academics, Semantic Scholar for the identification of scientific contributions. Additionally, we search and explore Google’s Play and Apple’s App Stores to identify relevant smartphone apps and their respective properties. This review work gives (1) an up-to-date overview of existing apps, and (2) lists and discusses scientific literature pertaining to the smartphone apps used within the context of tinnitus.
Habiger, G., Hauck, F.J., Reiser, H.P. and Köstler, J. 2020. Self-optimising Application-agnostic Multithreading for Replicated State Machines. Int. Symp. on Rel. Distr. Sys. – SRDS (2020), 165–174.
State-machine replication (SMR) is a well-known approach for fault-tolerant services demanding fast recovery. It is not easy, however, to parallelise SMR in order to exploit modern multicore architectures. Two main approaches have been extensively studied; one focusing on request-level concurrency using prior knowledge, the other utilising application-agnostic and lock-level deterministic scheduling. We show that significant performance improvements for the latter approach require deterministic scheduler configurations to be dynamically adapted to the current application load during runtime. First, we summarise current research on parallel SMR execution. Second, an analysis of obstacles in lock-level deterministic multithreading approaches shows how static scheduler configurations can lead to poor performance when load on the system varies over time. Third, we present a simple yet effective automatic adaptation solution, which provides significantly better overall system behaviour compared to static configurations. This is demonstrated by evaluations using a full system setup.
Mödinger, D., Fröhlich, N. and Hauck, F.J. 2020. Pixy: A Privacy-Increasing Group Creation Scheme. 9th Int. Conf. on Netw., Comm. & Comp. – ICNCC (Tokyo, Japan, 2020), 118–124.
Modern peer-to-peer networks provide a lot of value. However, as the networks handle more and more sensitive data, e.g. in cryptocurrencies, privacy becomes an issue. Several approaches to provide efficient privacy to network participants rely on group formation with little or no regard to the privacy impact of how groups are created. Group creation is often based on random selection, which can easily be highjacked by attackers. We propose Pixy, an extensible, component-based scheme to increase privacy during group formation stages beyond current approaches. Our scheme provides a two-stage setup for group formation. First, a selection based on personal and network-wide collaboration lists reduces the attack surface for group initiators. Second, a testing phase based on cryptographic puzzles and, for suitable contexts, CAPTCHAs sort out Sybil attackers. We show that this scheme improves the current state of privacy in group-creation processes.
Tichy, M., Pietron, J., Mödinger, D., Juhnke, K. and Hauck, F.J. 2020. Experiences with an Internal DSL in the IoT Domain. 4th Int. Worshp. on Model-Driv. Eng. for IoT – MDE4IoT (2020), 22–34.
Modeling the architecture and behavior of embedded systems has long been a success story in the engineering of embedded systems due to the positive effects on quality and productivity, e.g., by declara- tive specifications, by enabling formal analyses, and by the generation of optimized code. These benefits, however, can only be reaped with extensive investments in specialized languages and tools which typically come with a closed and highly restrictive ecosystem. In this paper, we report our experiences while building an internal domain-specific language for IoT systems. We present our modeling language realized in Type- Script and integrated into the TypeScript/JavaScript ecosystem. The modeling language supports the declarative specification and execution of components, connectors, and state machines. We also provide a simple state space exploration to enable quality assurance techniques like test case generation and model checking. The language is illustrated by a running example with IoT devices. We believe that our solution lies at a sweet spot of providing a declarative modeling experience while reaping benefits from modern programming languages and their ecosystem to boost productivity
Mehdi, M., Dode, A., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2020. Contemporary Review of Smartphone Apps for Tinnitus Management and Treatment. Brain Sciences. 10, 11 (2020).
Tinnitus is a complex and heterogeneous psycho-physiological disorder responsible for causing a phantom ringing or buzzing sound albeit the absence of an external sound source. It has a direct influence on affecting the quality of life of its sufferers. Despite being around for a while, there has not been a cure for tinnitus, and the usual course of action for its treatment involves use of tinnitus retaining and sound therapy, or Cognitive Behavioral Therapy (CBT). One positive aspect about these therapies is that they can be administered face-to-face as well as delivered via internet or smartphone. Smartphones are especially helpful as they are highly personalized devices, and offer a well-established ecosystem of apps, accessible via respective marketplaces of differing mobile platforms. Note that current therapeutic treatments such as CBT have shown to be effective in suppressing the tinnitus symptoms when administered face-to-face, their effectiveness when being delivered using smartphones is not known so far. A quick search on the prominent market places of popular mobile platforms (Android and iOS) yielded roughly 250 smartphone apps offering tinnitus-related therapies and tinnitus management. As this number is expected to steadily increase due to high interest in smartphone app development, a contemporary review of such apps is crucial. In this paper, we aim to review scientific studies validating the smartphone apps, particularly to test their effectiveness in tinnitus management and treatment. We use the PRISMA guidelines for identification of studies on major scientific literature sources and delineate the outcomes of identified studies.
Mödinger, D. and Hauck, F.J. 2020. 3P3: Strong Flexible Privacy for Broadcasts. 19th IEEE Int. Conf. on Trust, Sec. & Priv. in Comp. & Comm. – TrustCom (2020), 1630–1637.
Privacy concerns have reached the mainstream discourse in society and already had a significant impact on research and technology. Cryptocurrencies have adopted many transaction-level privacy mechanisms to provide privacy in the persisted blockchain. Unfortunately, these are insufficient as network-level attacks can also provide privacy-breaking insights into transactions and their origins. We proposed k-Dining Cryptographers and topological methods as a basis for a privacy-preserving broadcast protocol. In this work, we present 3P3, a three-phase privacy-preserving broadcast protocol. We transformed our approach to a stronger attacker model so that it provides strong base privacy against global attackers and malicious nodes and additional privacy against common attackers, e.g., botnets. Further, we provide mechanisms to transmit almost arbitrarily long messages, reduce overhead for zero-message rounds, a more extensive analysis, and simulation results of our enhanced protocol. Our simulations show the dissemination of a message to all nodes within 1000ms in 99.9% of instances. These results hold for all network sizes, including networks of up to 10,000 participants. Bandwidth estimates also show practical applicability with usual group sizes of 10 to 30 participants.

2019

Domaschka, J., Berger, C., Reiser, H.P., Eichhammer, P., Griesinger, F., Pietron, J., Tichy, M., Hauck, F.J. and Habiger, G. 2019. SORRIR: a resilient self-organizing middleware for IoT applications. Proc. of 6th Int. Worksh. on Middlew. and App. for the Internet of Things (M4IoT) (Davis, CA, Dec. 2019), 13–16.
Mehdi, M., Schwager, D., Pryss, R., Schlee, W., Reichert, M. and Hauck, F.J. 2019. Towards automated smart mobile crowdsensing for tinnitus research. Proc. of the 32nd Int. Symp. on Comp.-Based Medical Sys. (CBMS). IEEE.
Tinnitus is a disorder that is not entirely understood, and many of its correlations are still unknown. On the other hand, smartphones became ubiquitous. Their modern versions provide high computational capabilities, reasonable battery size, and a bunch of embedded high-quality sensors, combined with an accepted user interface and an application ecosystem. For tinnitus, as for many other health problems, there are a number of apps trying to help patients, therapists, and researchers to get insights into personal characteristics but also into scientific correlations as such. In this paper, we present the first approach to an app in this context, called TinnituSense that does automatic sensing of related characteristics and enables correlations to the current condition of the patient by a combined participatory sensing, e.g., a questionnaire. For tinnitus, there is a strong hypothesis that weather conditions have some influence. Our proof-of-concept implementation records weather-related sensor data and correlates them to the standard Tinnitus Handicap Inventory (THI) questionnaire. Thus, TinnituSense enables therapists and researchers to collect evidence for unknown facts, as this is the first opportunity to correlate weather to patient conditions on a larger scale. Our concept as such is limited neither to tinnitus nor to built-in sensors, e.g., in the tinnitus domain, we are experimenting with mobile EEG sensors. TinnituSense is faced with several challenges of which we already solved principle architecture, sensor management, and energy consumption.
Eichhammer, P., Berger, C., Reiser, H.P., Domaschka, J., Hauck, F.J., Habiger, G., Griesinger, F. and Pietron, J. 2019. Towards a robust, self-organizing IoT platform for secure and dependable service execution. Tagungsband des FB-SYS Herbsttreffens 2019 (Osnabrück, 2019).
Habiger, G. and Hauck, F.J. 2019. Systems support for efficient state-machine replication. Tagungsband des FB-SYS Herbsttreffens 2019 (Osnabrück, 2019).
Kopp, H., Mödinger, D., Hauck, F.J. and Kargl, F. 2019. Cryptographic design of PriCloud, a privacy-preserving decentralized storage with remuneration. IEEE Trans. on Dep. and Sec. Comp. 18, 4 (2019), 1908–1919.
Over the last years, demand for file hosting has sky-rocketed due to cost reductions and availability of services. However, centralized providers have a negative impact on the privacy of their users, since they are able to read and collect various data about their users and even link it to their identity via their payments. On the other hand, decentralized storage solutions like GNUnet suffer from a lack of participation by providers, since there is no feasible business model. We propose PriCloud, a decentralized storage system which allows users to pay their storage providers without sacrificing their privacy by employing anonymous storage smart contracts and private payments on a blockchain. We are able to provide privacy to the users and storage providers, and unlinkability between users and files. Our system offers decentralized file storage including strong privacy guarantees and built-in remuneration for storage providers.

2018

Habiger, G., Hauck, F.J., Köstler, J. and Reiser, H.P. 2018. Resource-Efficient State-Machine Replication with Multithreading and Vertical Scaling. Proc. of the 14th Eur. Dep. Comp. Conf. (EDCC) (Iaşi, Romania, Sep. 2018).
State-machine replication (SMR) enables transparent and delayless masking of node faults. It can tolerate crash faults and malicious misbehavior, but usually comes with high resource costs, not only by requiring multiple active replicas, but also by providing the replicas with enough resources for the expected peak load. This paper presents a vertical resource-scaling solution for SMR systems in virtualized environments, which can dynamically adapt the number of available cores to current load. In similar approaches, benefits of CPU core scaling are usually small due to the inherent sequential execution of SMR systems in order to achieve determinism. In our approach, we utilize sophisticated deterministic multithreading to avoid this bottleneck and experimentally demonstrate that core scaling then allows SMR systems to effectively tailor resources to service load, dramatically reducing service provider costs.
Mödinger, D., Kopp, H., Kargl, F. and Hauck, F.J. 2018. A Flexible Network Approach to Privacy of Blockchain Transactions. 38th IEEE Int. Conf. on Distrib. Comp. Sys. (Vienna, Jul. 2018), 1486–1491.
For preserving privacy, blockchains can be equipped with dedicated mechanisms to anonymize participants. How- ever, these mechanism often take only the abstraction layer of blockchains into account whereas observations of the underlying network traffic can reveal the originator of a transaction request. Previous solutions either provide topological privacy that can be broken by attackers controlling a large number of nodes, or offer strong and cryptographic privacy but are inefficient up to practical unusability. Further, there is no flexible way to trade privacy against efficiency to adjust to practical needs. We propose a novel approach that combines existing mechanisms to have quantifiable and adjustable cryptographic privacy which is further improved by augmented statistical measures that prevent frequent attacks with lower resources. This approach achieves flexibility for privacy and efficency requirements of different blockchain use cases.
Mödinger, D., Kopp, H., Kargl, F. and Hauck, F.J. 2018. Towards Enhanced Network Privacy for Blockchains. Short research statement for the DSN Workshop on Byzantine Consensus and Resilient Blockchains (BCRB) (Luxemburg, Jun. 2018).
Privacy aspects of blockchains have gained attention as the log of transactions can be view by any interested party. Privacy mechanisms applied to the ledger can be undermined by attackers on the network level, resulting in deanonymization of the transaction senders. We discuss current approaches to this problem, e.g. Dandelion, sketch our own approach to provide even stronger privacy mechanisms and discuss the challenges and open questions for further research in this area.
Schlee, W. et al. 2018. Innovations in doctoral training and research on Tinnitus: the European School on Interdisciplinary Tinnitus Research (ESIT) perspective. Frontiers in Aging Neuroscience. 9, (Jan. 2018), 447.
Tinnitus is a common medical condition which interfaces many different disciplines, yet it is not a priority for any individual discipline. A change in its scientific understanding and clinical management requires a shift toward multidisciplinary cooperation, not only in research but also in training. The European School for Interdisciplinary Tinnitus research (ESIT) brings together a unique multidisciplinary consortium of clinical practitioners, academic researchers, commercial partners, patient organizations, and public health experts to conduct innovative research and train the next generation of tinnitus researchers. ESIT supports fundamental science and clinical research projects in order to: (1) advancing new treatment solutions for tinnitus, (2) improving existing treatment paradigms, (3) developing innovative research methods, (4) performing genetic studies on, (5) collecting epidemiological data to create new knowledge about prevalence and risk factors, (6) establishing a pan-European data resource. All research projects involve inter-sectoral partnerships through practical training, quite unlike anything that can be offered by any single university alone. Likewise, the postgraduate training curriculum fosters a deep knowledge about tinnitus whilst nurturing transferable competencies in personal qualities and approaches needed to be an effective researcher, knowledge of the standards, requirements and professionalism to do research, and skills to work with others and to ensure the wider impact of research. ESIT is the seed for future generations of creative, entrepreneurial, and innovative researchers, trained to master the upcoming challenges in the tinnitus field, to implement sustained changes in prevention and clinical management of tinnitus, and to shape doctoral education in tinnitus for the future.
Agrawal, K., Mehdi, M., Reichert, M., Hauck, F.J., Schlee, W., Probst, T. and Pryss, R. 2018. Towards incentive management mechanisms in the context of crowdsensing technologies based on TrackYour Tinnitus insights. Proc. of the 15th Int. Conf. on Mobile Sys. and Perv. Comp. (MobiSPC) (Gran Canaria, 2018).
The increased use of mobile devices has led to an improvement in the public health care through participatory interventions. For example, patients were empowered to contribute in treatment processes with the help of mobile crowdsourcing and crowdsensing technologies. However, when using the latter technologies, one prominent challenge constitutes a continuous user engagement. Incentive management techniques can help to tackle this challenge by motivating users through rewards and recognition in exchange of task completion. For this purpose, we aim at developing a conceptual framework that can be integrated with existing mHealth mobile crowdsourcing and crowdsensing platforms. The development of this framework is based on insights we obtained from the TrackYourTinnitus (TYT) mobile crowdsensing platform. TYT, in turn, pursues the goal to reveal insights to the moment-to-moment variability of patients suffering from tinnitus. The work at hands presents evaluated data of TYT and illustrates how the results drive the idea of a conceptual framework for an incentive management in this context. Our results indicate that a proper incentive management should play an important role in the context of any mHealth platform that incorporates the idea of the crowd.
Mehdi, M., Mühlmeier, G., Agrawal, K., Pryss, R., Schlee, W. and Hauck, F.J. 2018. Referenceable mobile crowdsensing architecture . Proc. of the 1st Int. Worksh. on Serv. for Mobile Data Coll. (MoDaC) (Gran Canaria, 2018).
Smartphones have become an integral part in life of users, mainly because over the course of recent years, they have become extremely mainstream, cheap, flexible, and they pack high-end hardware that offers high computational capabilities. Many, if not all of today’s smartphones are equipped with sophisticated sensors which enable smart mobile sensing. The programmable nature of these sensors in the smartphones enable a wide array of possibilities to achieve user-centric or environmental sensing. Even though there have been different approaches proposed to develop a smartphone app, platform, design frameworks, APIs, and even application-specific architectures, there is a lack of generalised referenceable architecture in the literature. In this paper, we propose a generic reference architecture, which can be derived to create more concrete mobile sensing or mobile app architectures. Furthermore, we realise the proposed reference architecture in a healthcare use case, specifically in the context of applying smart mobile sensing to support tinnitus research.

2017

Nikolov, V., Bonfert, S., Frasch, E. and Hauck, F.J. 2017. Scheduling interactive HPC applications. Proc. of the 8th Int. Real-Time Scheduling Open Problems Seminar (RTSOPS). 15–16.
Nikolov, V., Wesner, S., Frasch, E. and Hauck, F.J. 2017. A hierarchical scheduling model for dynamic soft-realtime systems. Proc. of the 29th Euromicro Conference on Real-Time Systems (ECRTS) (Dubrovnik, Croatia, Jun. 2017).
Kopp, H., Mödinger, D., Hauck, F.J., Kargl, F. and Bösch, C. 2017. Design of a Privacy-Preserving Decentralized File Storage with Financial Incentives. IEEE Sec. & Priv. on the Blockch. (aff. w/ EUROCRYPT) (Paris, 2017).
Surveys indicate that users are often afraid to entrust data to cloud storage providers, because these do not offer sufficient privacy. On the other hand, peer-2-peer–based privacy-preserving storage systems like Freenet suffer from a lack of contribution and storage capacity, since there is basically no incentive to contribute own storage capacity to other participants in the network. We address these contradicting requirements by a design which combines a distributed storage with a privacy-preserving blockchain-based payment system to create incentives for participation while maintaining user privacy. By following a Privacy-by-Design strategy integrating privacy throughout the whole system life cycle, we show that it is possible to achieve levels of privacy comparable to state-of-the-art distributed storage technologies, despite integrating a payment mechanism. Our results show that it is possible to combine storage contracts and payments in a privacy-preserving way. Further, our system design may serve as an inspiration for future similar architectures.

2016

Hauck, F.J., Habiger, G. and Domaschka, J. 2016. UDS: a novel and flexible scheduling algorithm for deterministic multithreading. Proc. of the 35th Int. Symp. on Reliable Distrib. Sys. (SRDS) (Budapest, Hungry, Sep. 2016).
Hauck, F.J. and Domaschka, J. 2016. UDS: a unified approach to determinisitic multithreading. 36th Int. Conf. on Distrib. Comp. Sys. (ICDCS) (Nara, Japan, Jun. 2016).
Habiger, G., Hauck, F.J., Köstler, J. and Reiser, H.P. 2016. Vertikale Skalierung für aktiv replizierte Dienste in Cloud-Infrastrukturen.
Erb, B., Habiger, G. and Hauck, F.J. 2016. On the Potential of Event Sourcing for Retroactive Actor-based Programming. First Workshop on Programming Models and Languages for Distributed Computing (Rome, Italy, 2016), 1–5.
The actor model is an established programming model for distributed applications. Combining event sourcing with the actor model allows the reconstruction of previous states of an actor. When this event sourcing approach for actors is enhanced with additional causality information, novel types of actor-based, retroactive computations are possible. A globally consistent state of all actors can be reconstructed retrospectively. Even retroactive changes of actor behavior, state, or messaging are possible, with partial recomputations and projections of changes in the past. We believe that this approach may provide beneficial features to actor-based systems, including retroactive bugfixing of applications, decoupled asynchronous global state reconstruction for recovery, simulations, and exploration of distributed applications and algorithms.

2015

Nikolov, V., Hauck, F.J. and Schubert, L. 2015. Ein hierarchisches Scheduling-Modell für unbekannte Anwendungen mit schwankenden Ressourcenanforderungen. Echtzeit und Betriebssysteme (Boppard, Nov. 2015).
Nikolov, V., Hauck, F.J. and Wesner, S. 2015. Assembling a framework for unkown real-time applications with RTSJ. Proc. of the 13th Int. Workshop on Java Techn. for Real-time and Embedded Sys. (Paris, Oct. 2015).
Kächele, S. and Hauck, F.J. 2015. COSCAnet-FT: transparent network support for highly available cloud services. Proceedings of the International Conference of Networked Systems (NetSys) 2015 (Mar. 2015).
Nikolov, V., Kempf, K., Hauck, F.J. and Rautenbach, D. 2015. Distributing the Complexity of Schedulability Tests. Proc. of the 21th IEEE Real-Time and Embedded Technology and Applications Symposium (2015).

2014

Nikolov, V., Kächele, S. and Hauck, F.J. 2014. CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management. In Proceedings of the IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC) (London, Dec. 2014).

2013

Kächele, S. and Hauck, F.J. 2013. COSCAnet: virtualized sockets for scalable and flexible PaaS applications. Proceedings of the 6th IEEE/ACM International Conference Utility and Cloud Computing UCC ’13 (USA, Dec. 2013).
Kächele, S., Spann, C., Hauck, F.J. and Domaschka, J. 2013. Beyond IaaS and PaaS: An Extended Cloud Taxonomy for Computation, Storage and Networking. Proceedings of the 6th IEEE/ACM International Conference Utility and Cloud Computing UCC ’13 (USA, Dec. 2013).
Schober, S., Brenner, S., Kapitza, R. and Hauck, F.J. 2013. Bandwidth prediction in the face of asymmetry. Proc. 13th Int. IFIP Conf. on Distrib. Appl. and Interop. Sys. (Florence, Italy, Jun. 2013).
Kächele, S. and Hauck, F.J. 2013. COSCA: a component-based and scalable PaaS platform. Frühjahrstreffen 2013 der Fachgruppe Betriebssysteme, Abstract.
Kächele, S. and Hauck, F.J. 2013. Component-based scalability for cloud applications. Proc of the 3rd Int. Workshop on Cloud Data and Platforms (Prague, Apr. 2013).
Kächele, S. and Hauck, F.J. 2013. COSCA: a PaaS platform for component-based applications. Poster Compendium of EuroSys 2013 Conference (2013).

2012

Nikolov, V., Matousek, M., Rautenbach, D., Draque Penso, L. and Hauck, F.J. 2012. ARTOS: System Model and Optimization Algorithm. Technical Report #VS-R08-2012. Institute of Distributed Systems, University of Ulm.
Hauck, F.J., Kächele, S., Domaschka, J. and Spann, C. 2012. The COSCA PaaS platform: on the way to flexible and dependable cloud computing. Proc. of the 1st European Workshop on Dependable Cloud Computing (New York, NY, USA, 2012), 1:1-1:2.

2011

Kächele, S., Domaschka, J., Schmidt, H. and Hauck, F.J. 2011. nOSGi: a POSIX-compliant native OSGi framework. 5th Int. Conf. on Communication System Software and Middleware (New York, NY, USA, 2011), 4:1-4:2.
Elsholz, J.-P., Fromm, A., Schober, S. and Hauck, F.J. 2011. A unified API for negotiation in multimedia middleware. Technical Report #VS-R19-2011. Institute of Distributed Systems, University of Ulm.
Kächele, S., Domaschka, J. and Hauck, F.J. 2011. <prt>COSCA</prt>: an easy-to-use component-based <prt>PaaS</prt> cloud system for common applications. 1st International Workshop on Cloud Computing Platforms (New York, NY, USA, 2011), 4:1-4:6.

2010

Elsholz, J.-P., Seibel, E. and Hauck, F.J. 2010. RAPIX: a plug-in based RIA for multimedia communication. Technical Report #VS-R08-2010. Institute of Distributed Systems, University of Ulm.

2009

Elsholz, J.-P., Schmidt, H., Schober, S., Hauck, F.J. and Kassler, A.J. 2009. <prt>Instant-X:</prt> Towards a Generic <prt>API</prt> for Multimedia Middleware. IEEE International Conference on Internet Multimedia Systems Architecture and Application (Bangalore, India, Dec. 2009).
The globalisation of our society leads to an increasing need for spontaneous communication. However, the development of such applications is a tedious and error-prone process. This results from the fact that in general only basic functionality is available in terms of protocol implementations and encoders/decoders. This leads to inflexible proprietary software systems implementing unavailable functionality on their own. In this work we introduce Instant-X, a novel component-based middleware platform for multimedia applications. Unlike related work, Instant-X provides a generic programming model with an API for essential tasks of multimedia applications with respect to signalling and data transmission. This API abstracts from concrete component implementations and thus allows replacing specific protocol implementations without changing the application code. Furthermore, Instant-X supports dynamic deployment, i.e., unavailable components can be automatically loaded at runtime. To show the feasibility of our approach we evaluated our Instant-X prototype regarding code complexity and performance.
Erb, B., Elsholz, J.-P. and Hauck, F.J. 2009. Semantic Mashup: Mashing up Information in the Todays World Wide Web - An Overview. Technical Report #VS-R08-2009. Institut für Verteilte Systeme, Universität Ulm.
Nikolov, V., Kapitza, R. and Hauck, F.J. 2009. Recoverable Class Loaders for a Fast Restart of Java Applications. Mobile Networks and Applications. 14, (2009), 53–64.
Schmidt, H., Elsholz, J.-P., Nikolov, V., Hauck, F.J. and Kapitza, R. 2009. OSGi4C: enabling OSGi for the cloud. Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (New York, NY, USA, 2009), 15:1-15:12.
Elsholz, J.-P., Schmidt, H., Schober, S. and Hauck, F.J. 2009. Instant-X: SOA for Multimedia Communication in NGNs. Technical Report #VS-R11-2009. Institut für Verteilte Systeme, Universität Ulm.
Domaschka, J., Schmidt, H., Hauck, F.J., Kapitza, R. and Reiser, H.P. 2009. dOSGi: An architecture for instant replication. Proc. of the 39th Annual IEEE/IFIP Int. Conf. on Dependable Sys. and Netw., Supplemental Volume (2009).

2008

Domaschka, J., Spann, C. and Hauck, F.J. 2008. Virtual Nodes: a re-configurable replication framework for highly-available grid services. Proceedings of the ACM/IFIP/USENIX Middleware’08 Conference Companion (2008), 107–109.
We present Virtual Nodes, a framework to provide fault-tolerance for grid applications by replicating them over multiple nodes. For the performance of replicated systems it is crucial that the application characteristics and load pattern are taken into account when the replication protocol is selected. For that reason Virtual Nodes offer a wide variety of configuration parameters that allow to fine-tune framework properties to optimise the overall system performance.
Domaschka, J., Bestfleisch, T., Hauck, F.J., Reiser, H.P. and Kapitza, R. 2008. Multithreading strategies for replicated objects. Proc. of the ACM/IFIP/USENIX 9th Int. Middleware Conf. (Berlin, Heidelberg, 2008), 104–123.
Elsholz, J.-P., Hauck, F.J. and Schmidt, H. 2008. Multimediale Datenübertragung. Technical Report #VS-R06-2008. Institut für Verteilte Systeme, Universität Ulm.
Schmidt, H., Elsholz, J.-P. and Hauck, F.J. 2008. Instant-X: a component-based middleware architecture for a generic multimedia API. Companion ’08: Proceedings of the ACM/IFIP/USENIX Middleware ’08 Conference Companion (New York, NY, USA, 2008), 90–92.
Schmidt, H., Aksoy, B., Hauck, F.J. and Kassler, A. 2008. How well does JXTA fit peer-to-peer SIP? IEEE International Conference on Communications–ICC (2008).

2007

Schmidt, H., Dang, C.-T. and Hauck, F.J. 2007. Proxy-based security for the Session Initiation Protocol (SIP). 2nd International Conference on Systems and Networks Communications (Cap Esterel, France, Aug. 2007).
Guenkova-Luy, T., Schmidt, H., Schorr, A., Hauck, F.J. and Kassler, A. 2007. A Session-initiation-protocol-based middleware for multi-application management. IEEE International Conference on Communications (Glasgow, Jun. 2007).
Domaschka, J., Reiser, H.P. and Hauck, F.J. 2007. Towards generic and middleware-independent support for replicated, distributed objects. Proc of the 1st Workshop on Middleware-Application Interaction (New York, NY, USA, 2007), 43–48.
Domaschka, J., Schmied, A.I., Reiser, H.P. and Hauck, F.J. 2007. Revisiting deterministic multithreading strategies. Pro. of the 9th Int. Workshop on Java and Components for Parallelism, Distribution and Concurrency (2007).
Domaschka, J., Schmidt, H. and Hauck, F.J. 2007. Forschungstrends im Bereich Verteilter Systeme. Technical Report #VS-R07-2007. Institut für Verteilte Systeme, Universität Ulm.

2006

Kapitza, R., Domaschka, J., Hauck, F.J. and Reiser, H.P. 2006. FORMI: Integrating Adaptive Fragmented Objects into Java RMI. IEEE Distributed Systems Online. 7, 10 (Oct. 2006).
Reiser, H.P., Hauck, F.J., Kapitza, R. and Schröder-Preikschat, W. 2006. Hypervisor-based redundant execution on a single physical host. Proc. Suppl. Vol. of the 6th European Dependable Comp. Conf. (EDCC). 67–68.
Reiser, H.P., Kapitza, R., Domaschka, J. and Hauck, F.J. 2006. Flexible und adaptive Replikation in verteilter objektbasierter Middleware. Technical Report #VS-R06-2006. Institut für Verteilte Systeme, Universität Ulm.
Reiser, H.P., Kapitza, R., Domaschka, J. and Hauck, F.J. 2006. Fault-tolerant replication based on fragmented objects. Proc. of the 6th IFIP WG 6.1 Int. Conf. on Distrib. Applications and Interoperable Sys. (Berlin, Heidelberg, 2006), 256–271.
Domaschka, J., Hauck, F.J., Reiser, H.P. and Kapitza, R. 2006. Deterministic Multithreading for Java-based Replicated Objects. Proc. of the 18th IASTED Int. Conf. on Parallel and Distributed Computing and Systems (2006), 516–521.
Reiser, H.P., Domaschka, J., Hauck, F.J., Kapitza, R. and Schröder-Preikschat, W. 2006. Consistent replication of multithreaded distributed objects. Proc. of the 25th IEEE Symp. on Reliable Distributed Systems (Washington, DC, USA, 2006), 257–266.

2005

Kapitza, R., Kirstein, M., Schmidt, H. and Hauck, F.J. 2005. FORMI: An RMI extension for adaptive applications. Proc. of the 4th Workshop on Adaptive and Reflective Middleware (Grenoble, France, 2005).

2003

Kapitza, R. and Hauck, F.J. 2003. DLS: a CORBA service for dynamic loading of code. Proc. of the Int. Symp. on Distrib. Obj. and Appl. - DOA (Dec. 2003).
Bindhammer, T., Schmied, A.I. and Hauck, F.J. 2003. Betriebssystem Linux, Proseminar im Sommersemester 2003. Technical Report #VS-R02-2003. Institut für Verteilte Systeme, Universität Ulm.
Schmied, A.I. and Hauck, F.J. 2003. Sicherheit in Verteilten Systemen, Hauptseminare im Sommersemester 2003. Technical Report #VS-R01-2003. Institut für Verteilte Systeme, Universität Ulm.
Reiser, H.P., Hauck, F.J., Kapitza, R. and Schmied, A.I. 2003. Integrating fragmented objects into a CORBA environment. Proc. of the Net.ObjectDAYS (Erfurt, Sep. 2003).

2002

Kapitza, R. and Hauck, F.J. 2002. DLS: a CORBA service for dynamic loading of code. Technical Report #TR-I4-02-06. Informatik 4, Univ. Erlangen-Nürnberg.

2001

Reiser, H.P., Steckermeier, M. and Hauck, F.J. 2001. IDLflex: a flexible and generic compiler for CORBA IDL. Technical Report #TR-I4-01-08. Informatik 4, University of Erlangen-Nürnberg.
Reiser, H.P., Steckermeier, M. and Hauck, F.J. 2001. IDLflex: a flexible and generic compiler for CORBA IDL. Proc. of the Net.ObjectDAYS (Erfurt, Sep. 2001).
Hauck, F.J., Becker, U., Geier, M., Meier, E., Rastofer, U. and Steckermeier, M. 2001. AspectIX: a quality-aware, object-based middleware architecture. Proc. of the 3rd IFIP Int. Conf. on Distrib. Appl. and Interop. Sys. - DAIS (Krakow, Sep. 2001).

1999

Hauck, F.J., Becker, U., Geier, M., Meier, E., Rastofer, U. and Steckermeier, M. 1999. The AspectIX approach to quality-of-service integration into CORBA. Technical Report #TR-I4-99-09. IMMD 4, Univ. of Erlangen-Nürnberg.

1998

Riechmann, T., Hauck, F.J. and Kleinöder, J. 1998. Transitiver Schutz in Java durch Sicherheitsmetaobjekte. Java Informationstage (JIT) (Berlin, Heidelberg, New York, Tokyo, 1998), 204–214.
Riechmann, T. and Hauck, F.J. 1998. Meta objects for access control: extending capability-based security. Proceedings of the ACM New Security Paradigms Workshop (New York, NY, 1998), 17–22.
van Steen, M., Hauck, F.J., Homburg, P. and S. Tanenbaum, A. 1998. Locating objects in wide-area systems. IEEE Communications Magazine. 36, 1 (1998), 104–109.
van Steen, M., Hauck, F.J., Ballintijn, G. and S. Tanenbaum, A. 1998. Algorithmic design of the Globe wide-area location service. The Computer Journal. 41, 5 (1998), 297–310.

1997

Gall, U. and Hauck, F.J. 1997. Promondia: a Java-based framework for real-time group communication in the Web. Proceedings of the 6th International WWW Conference (1997).
Hauck, F.J., van Steen, M. and S. Tanenbaum, A. 1997. A location service for worldwide distributed objects. Special issues in object-oriented programming. M. Mühlhäuser, ed. dpunkt.verlag. 384–388.

1996

Hauck, F.J., van Steen, M. and Tanenbaum, A.S. 1996. Algorithmic design of the Globe location service. Technical Report #Internal Report IR-413. Faculty of Math.

1995

Hauck, F.J. 1995. Typen, Klassen und Vererbung in verteilten objektorientierten Systemen. VDI.
Hauck, F.J. 1995. Location tracking in large object-based systems: framework. -.
Hauck, F.J. 1995. Location tracking in large object-based systems: assumptions. -.

1994

Hauck, F.J. 1994. Typisierte Vererbung modelliert durch Aggregation. Verteilte Systeme (Zürich, 1994), 291–302.

1993

Hauck, F.J. 1993. Typisierte Vererbung modelliert durch Aggregation. Technical Report #TR-I4-9-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. Towards the implementation of a uniform object model: SFB Colloquium SFB 182 and SFB 342. Parallel computer architectures: Theory, hardware, software, applications. A. Bode and M.D. Cin, eds. Springer. 180–189.
Hauck, F.J. 1993. Supporting class evolution by typing inheritance. Technical Report #TR-14-5-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. PM: a distributed object-oriented operating system. Technical Report #TR-I4-2-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. Inheritance modeled with explicit bindings: an approach to typed inheritance. Technical Report #TR-I4-3-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. Inheritance modeled with explicit bindings: an approach to typed inheritance. Conf. on Obj.-Oriented Progr. Sys., Lang., and Appl. – OOPSLA (1993), 231–239.
Hauck, F.J. 1993. Inheritance modelled by aggregation: an approach to typed inheritance relations: submission to the OOPSLA `93 conference – research paper. Technical Report #TR-I4-1-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Monge, R. and Hauck, F.J. 1993. Ein Ereignis-basiertes Modell zur Formalisierung von Request-Reply Objektinteraktionen. Technical Report #TR-I4-10-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. Class-based inheritance is not a basic concept. Technical Report #TR-14-6-93. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1993. Class-based inheritance is not a basic concept. Understanding object-model concepts: Position papers for OOPSLA ’93 Workshop #19. S.W. Clyde, B.A. Conrad, D.W. Embley, and B.D. Kurtz, eds. Brigham Young University.
Hauck, F.J. and R. Steyaert, P. 1993. 3rd Workshop for Doctoral Students in Object-Oriented Systems. Technical Report #TR-I4-7-92. IMMD 4, Univ. of Erlangen-Nürnberg.

1992

Hauck, F.J. 1992. Typisierte Vererbung modelliert durch Aggregation. Technical Report #TR-I4-15-92. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1992. Towards the implementation of a uniform object model. Technical Report #TR-I4-5-92. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J. 1992. Multiple inheritance and multiple subtyping. Position Papers of the ECOOP ’92 Workshop W1 (1992), 14–16.
Monge, R. and Hauck, F.J. 1992. Ein Ereignis-basiertes Modell für Beauftragung und mögliche Protokolle. Technical Report #TR-I4-92-19. IMMD 4, Univ. of Erlangen-Nürnberg.

1991

Eirich, T. and Hauck, F.J. 1991. Inheritance by aggregation. Technical Report #TR-I4-4-91. IMMD 4, Univ. of Erlangen-Nürnberg.
Hauck, F.J., Eirich, T., Fäustle, M., Kleinöder, J., Pruy, R. and Schlenk, P. 1991. Das PM Projekt. Technical Report #TR-I4-6-91. IMMD 4, Univ. of Erlangen-Nürnberg.

1990

Hauck, F.J. 1990. Verteilte Objekte unter UNIX - Eine PM-Implementierung. interner Bericht. (1990).

1989

Hauck, F.J. 1989. Implementierung eines Stubgenerators als Phase des PM/PL Compilers. IMMD 4, Univ. Erlangen-Nürnberg. Diplomarbeit.

1988

Hauck, F.J. 1988. Implementierung und Dokumentation des MEMOS-Betriebssystems. IMMD 4, Univ. Erlangen-Nürnberg. Studienarbeit.

1986

Hauck, F.J. and Eirich, T. 1986. Der Data Becker Profi C-Compiler C64/C128. Data Becker.

1985

Hauck, F.J. and Eirich, T. 1985. Der Data Becker C-Compiler C64. Data Becker.