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

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). [accepted for publication]
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. 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., 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., 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. 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.
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.
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
Kopp, H., Mödinger, D., Hauck, F.J. and Kargl, F. 2021. Cryptographic Design of PriCloud, a Privacy-Preserving Decentralized Storage with Remuneration. IEEE Trans. on Dep. & Sec. Comput. 18, 4 (2021), 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.
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.

2016

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.

 

Leider sind noch nicht alle Publikationen im neuen Format verfügbar. Daher folgt eine Publikationsliste im alten Format.

2021

118.
D. Mödinger, J. Lorenz and F. J. Hauck, "Statistical privacy-preserving message broadcast for peer-to-peer networks", PLOS ONE, vol. 16, no. 5, pp. 1-24, Mai 2021.
DOI:10.1371/journal.pone.0251458
117.
D. Mödinger, J. Dispan and F. J. Hauck, " Shared-dining: broadcasting secret shares using dining-cryptographers groups" in Proc. Int. IFIP Conf. on Distrib. Appl. and Interop. Sys. (DAIS), 2021.
116.
J. Köstler, H. P. Reiser, G. Habiger and F. J. Hauck, "SmartStream: Towards Efficient Byzantine Resilient Data Streaming through Speculation and Sharding", SIGAPP Appl. Comput. Rev., vol. 21, no. 3, pp. 19-32, Okt. 2021. ACM.
DOI:10.1145/3493499.3493501
115.
A. Dode, M. Mehdi, R. Pryss, W. Schlee, T. Probst, M. Reichert, F. J. Hauck and M. Winter, "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", Amsterdam: Elsevier, 2021, pp. 171--190.
114.
C. Berger, P. Eichhammer, H. P. Reiser, J. Domaschka, F. J. Hauck and G. Habiger, "A survey on resilience in IoT: Taxonomy, classification and discussion of resilience mechanisms", ACM Comp. Surv., vol. 54, no. 7, Jun. 2021.
DOI:10.1145/3462513
113.
J. Köstler, H. P. Reiser, G. Habiger and F. J. Hauck, "SmartStream: Towards Byzantine Resilient Data Streaming" in 36th Ann. ACM Symp. on Appl. Comp. (SAC), New York, NY, USA: ACM, Mä. 2021, pp. 213–222.
DOI:10.1145/3412841.3441904
112.
E. Genitsaridi, A. Dode, B. Qirjazi, M. Mehdi, R. Pryss, T. Probst, M. Reichert, F. J. Hauck and D. A. Hall, "An Albanian translation of a questionnaire for self-reported tinnitus assessment", Int. J. of Audiology, pp. 1-6, 2021. Taylor & Francis.
DOI:10.1080/14992027.2021.1933221
111.
D. Mödinger, A. Hess and F. J. Hauck, "Arbitrary Length k-Anonymous Dining-Cryptographers Communication", CoRR, vol. abs/2103.17091, 2021.
Datei:https://arxiv.org/abs/2103.17091

2020

110.
D. Mödinger, J. Lorenz and F. J. Hauck, "Unobtrusive monitoring: statistical dissemination latency estimation in Bitcoin's peer-to-peer network", PlosONE, vol. 15, no. 12, Dez. 2020.
DOI:10.1371/journal.pone.0243475
109.
D. Mödinger, N. Fröhlich and F. J. Hauck, "Pixy: a privacy-increasing group creation scheme" in Proc. of the 5th Int. Conf. on Netw. Sec. (ICNS), Dez. 2020.
108.
M. Mehdi, F. Diemer, L. Hennig, A. Dode, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "TinnituSense: a mobile electroencephalography (EEG) smartphone app for tinnitus research" in Proc. of 17th EAI Int. Conf. on Wireless Mobile and Ubiq. Sys.: Comp., Netw. and Services (MobiQuitous), Dez. 2020.
107.
D. Mödinger and F. J. Hauck, "3P3: strong flexible privacy for broadcasts" in Proc. of 4th Int. Worksh. on Cybersp. Sec. (IWCCS), Dez. 2020.
DOI:10.1109/TrustCom50675.2020.00225
106.
M. Mehdi, A. Dode, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "Contemporary review of smartphone apps for tinnitus management and treatment", MDPI Brain Sciences, vol. 10, no. 11, Nov. 2020.
DOI:10.3390/brainsci10110867
105.
M. Mehdi, L. Hennig, F. Diemer, A. Dode, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "Towards mobile-based preprocessing pipeline for electroencephalography (EEG) analyses: the case of tinnitus" in Proc. of 9th EAI Int. Conf. on Wireless Mobile Comm. and Healthcare (MobiHealth), Nov. 2020.
104.
M. Tichy, J. Pietron, D. Mödinger, K. Juhnke and F. J. Hauck, "Experiences with an internal DSL in the IoT domain" in Proc. of 4th Int. Worksh. on Model-Driv. Eng. for IoT (MDE4IoT), CEUR-WS, Jul. 2020, pp. 22-34.
Datei:pdfhttp://ceur-ws.org/Vol-2707/mde4iotpaper1.pdf
103.
G. Habiger, F. J. Hauck, H. P. Reiser and J. Köstler, "Self-optimising application-agnostic multithreading for replicated state machines" in Proc. of the 39th Int. Symp. on Rel. Distr. Sys. (SRDS), 2020.
DOI:10.1109/SRDS51746.2020.00024
102.
M. Mehdi, M. Stack, C. Riha, P. Neff, A. Dode, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "Smartphone and mobile health apps for tinnitus: systematic identification, analysis, and assessment", JMIR Mhealth Uhealth, vol. 8, no. 8, 2020.
DOI:10.2196/21767
101.
M. Mehdi, C. Riha, P. Neff, A. Dode, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "Smartphone apps in the context of tinnitus: systematic review", MDPI Sensors, vol. 20, no. 6, 2020.
DOI:10.3390/s20061725

2019

100.
J. Domaschka, C. Berger, H. P. Reiser, P. Eichhammer, F. Griesinger, J. Pietron, M. Tichy, F. J. Hauck and G. Habiger, "SORRIR: a resilient self-organizing middleware for IoT applications" in Proc. of 6th Int. Worksh. on Middlew. and App. for the Internet of Things (M4IoT), Davis, CA, Dez. 2019, pp. 13-16.
DOI:10.1145/3366610.3368098
99.
M. Mehdi, D. Schwager, R. Pryss, W. Schlee, M. Reichert and F. J. Hauck, "Towards automated smart mobile crowdsensing for tinnitus research" in Proc. of the 32nd Int. Symp. on Comp.-Based Medical Sys. (CBMS), Jun. 2019.
DOI:10.1109/CBMS.2019.00026
98.
P. Eichhammer, C. Berger, H. P. Reiser, J. Domaschka, F. J. Hauck, G. Habiger, F. Griesinger and J. Pietron, "Towards a robust, self-organizing IoT platform for secure and dependable service execution" in Tagungsband des FB-SYS Herbsttreffens 2019, Osnabrück, GI, 2019.
DOI:10.18420/fbsys2019-03
97.
G. Habiger and F. J. Hauck, "Systems support for efficient state-machine replication" in Tagungsband des FB-SYS Herbsttreffens 2019, Osnabrück, GI, 2019.
DOI:10.18420/fbsys2019-04
96.
H. Kopp, D. Mödinger, F. J. Hauck and F. Kargl, "Cryptographic design of PriCloud, a privacy-preserving decentralized storage with remuneration", IEEE T. on Dep. and Sec. Comp., 2019.
DOI:10.1109/TDSC.2019.2942300

2018

95.
G. Habiger, F. J. Hauck, J. Köstler and H. P. Reiser, "Resource-Efficient State-Machine Replication with Multithreading and Vertical Scaling" in Proc. of the 14th Eur. Dep. Comp. Conf. (EDCC), Iaşi, Romania, IEEE, Sep. 2018.
DOI:10.1109/EDCC.2018.00024
94.
D. Mödinger, H. Kopp, F. Kargl and F. J. Hauck, "A Flexible Network Approach to Privacy of Blockchain Transactions" in Proc. of the 38th IEEE Int. Conf. on Distrib. Comp. Sys. (ICDCS), 38th IEEE International Conference on Distributed Computing Systems, Vienna, 2 July 2018, IEEE, Jul. 2018, pp. 1486-1491.
DOI:10.1109/ICDCS.2018.00153
Datei:https://ieeexplore.ieee.org/document/8416416/
93.
D. Mödinger, H. Kopp, F. Kargl and F. J. Hauck, "Towards Enhanced Network Privacy for Blockchains" in Short research statement for the DSN Workshop on Byzantine Consensus and Resilient Blockchains (BCRB), DSN Workshop on Byzantine Consensus and Resilient Blockchains, Luxemburg, 25 June 2018, Jun. 2018.
Datei:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.200/files/publikationen/Moedinger18.pdf
92.
W. Schlee, D. A. Hall, B. Canlon, R. F. F. Cima, E. de Kleine, F. J. Hauck, A. Huber, S. Gallus, T. Kleinjung, T. Kypraios, B. Langguth, J. A. Lopez-Escamez, A. Lugo, M. Meyer, M. Mielczarek, A. Norena, F. Pfiffner, R. C. Pryss, M. Reichert, T. Requena, M. Schecklmann, P. van Dijk, P. van de Heyning, N. Weisz and C. R. Cederroth, "Innovations in doctoral training and research on Tinnitus: the European School on Interdisciplinary Tinnitus Research (ESIT) perspective", Frontiers in Aging Neuroscience, vol. 9, pp. 447, Jan. 2018.
DOI:10.3389/fnagi.2017.00447
91.
M. Mehdi, G. Mühlmeier, K. Agrawal, R. Pryss, W. Schlee and F. J. Hauck, "Referenceable mobile crowdsensing architecture " in Proc. of the 1st Int. Worksh. on Serv. for Mobile Data Coll. (MoDaC), Gran Canaria, 13.-15.8.2018, 2018.
DOI:10.1016/j.procs.2018.07.185
90.
K. Agrawal, M. Mehdi, M. Reichert, F. J. Hauck, W. Schlee, T. Probst and R. Pryss, "Towards incentive management mechanisms in the context of crowdsensing technologies based on TrackYour Tinnitus insights" in Proc. of the 15th Int. Conf. on Mobile Sys. and Perv. Comp. (MobiSPC), Gran Canaria, 13.-15.8.2018, 2018.
DOI:10.1016/j.procs.2018.07.155

2017

89.
V. Nikolov, S. Bonfert, E. Frasch and F. J. Hauck, "Scheduling interactive HPC applications" in Proc. of the 8th Int. Real-Time Scheduling Open Problems Seminar (RTSOPS), Jun. 2017, pp. 15-16.
Datei:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.200/files/publikationen/Nikolov17c.pdf
88.
V. Nikolov, S. Wesner, E. Frasch and F. J. Hauck, "A hierarchical scheduling model for dynamic soft-realtime systems" in Proc. of the 29th Euromicro Conference on Real-Time Systems (ECRTS), Dubrovnik, Croatia, 27.-30.6.2017, Jun. 2017.
87.
H. Kopp, D. Mödinger, F. J. Hauck, F. Kargl and C. Bösch, "Design of a Privacy-Preserving Decentralized File Storage with Financial Incentives" in Proc. of IEEE Security & Privacy on the Blockchain (IEEE S&B) (affiliated with EUROCRYPT 2017), IEEE Security & Privacy on the Blockchain (IEEE S&B) (affiliated with EUROCRYPT 2017), Paris, 29 April 2017, IEEE, 2017.
DOI:10.1109/EuroSPW.2017.45
ISBN:978-1-5386-2244-5
Datei:https://doi.org/10.1109/EuroSPW.2017.45

2016

86.
F. J. Hauck, G. Habiger and J. Domaschka, "UDS: a novel and flexible scheduling algorithm for deterministic multithreading" in Proc. of the 35th Int. Symp. on Reliable Distrib. Sys. (SRDS), Budapest, Hungry, 2016-09-26, Sep. 2016.
DOI:10.1109/SRDS.2016.030
85.
B. Erb, G. Habiger and F. J. Hauck, "On the Potential of Event Sourcing for Retroactive Actor-based Programming" in Proc. of the 1st Workshop on Progr. Models and Lang. for Distrib. Comp., Rome, Italy, 2016-07-17, Jul. 2016.
DOI:10.1145/2957319.2957378
84.
F. J. Hauck and J. Domaschka, "UDS: a unified approach to determinisitic multithreading" in 36th Int. Conf. on Distrib. Comp. Sys. (ICDCS), Nara, Japan, 2016-06-27, Jun. 2016.
DOI:10.1109/ICDCS.2016.73
83.
G. Habiger, F. J. Hauck, J. Köstler and H. P. Reiser, "Vertikale Skalierung für aktiv replizierte Dienste in Cloud-Infrastrukturen" , 2016.
Datei:pdfhttps://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.200/files/publikationen/Habiger16.pdf

2015

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

2014

78.
V. Nikolov, S. Kächele and F. J. Hauck, "CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management" in In Proceedings of the IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC), 6th Cloud Control Workshop, London, Dec 8, 2014, IEEE, Dez. 2014.
DOI:10.1109/UCC.2014.84

2013

77.
S. Kächele and F. J. Hauck, "COSCAnet: virtualized sockets for scalable and flexible PaaS applications" in Proceedings of the 6th IEEE/ACM International Conference Utility and Cloud Computing UCC '13, Utility and Cloud Computing, USA: IEEE, Dez. 2013.
DOI:10.1109/UCC.2013.55
76.
S. Kächele, C. Spann, F. J. Hauck and J. Domaschka, "Beyond IaaS and PaaS: An Extended Cloud Taxonomy for Computation, Storage and Networking" in Proceedings of the 6th IEEE/ACM International Conference Utility and Cloud Computing UCC '13, 2013, USA: IEEE, Dez. 2013.
DOI:10.1109/UCC.2013.28
75.
S. Schober, S. Brenner, R. Kapitza and F. J. Hauck, "Bandwidth prediction in the face of asymmetry" in Proc. 13th Int. IFIP Conf. on Distrib. Appl. and Interop. Sys., DAIS, Florence, Italy, June 2013, Springer, Jun. 2013.
74.
S. Kächele and F. J. Hauck,COSCA: a component-based and scalable PaaS platform, Apr. 2013.
73.
S. Kächele and F. J. Hauck, "Component-based scalability for cloud applications" in Proc of the 3rd Int. Workshop on Cloud Data and Platforms, CloudDP, Prague, ACM Digital Library, Apr. 2013.
DOI:10.1145/2460756.2460760
72.
S. Kächele and F. J. Hauck, "COSCA: a PaaS platform for component-based applications" in Poster Compendium of EuroSys 2013 Conference, 2013.

2012

71.
V. Nikolov, M. Matousek, D. Rautenbach, L. Draque Penso and F. J. Hauck, "ARTOS: System Model and Optimization Algorithm" , Dez. 2012.
70.
F. J. Hauck, S. Kächele, J. Domaschka and C. Spann, "The COSCA PaaS platform: on the way to flexible and dependable cloud computing" in Proc. of the 1st European Workshop on Dependable Cloud Computing, New York, NY, USA: ACM, 2012, pp. 1:1--1:2.
DOI:10.1145/2365316.2365317
ISBN:978-1-4503-1149-6

2011

69.
J. Elsholz, A. Fromm, S. Schober and F. J. Hauck, "A unified API for negotiation in multimedia middleware" , 2011.
68.
S. Kächele, J. Domaschka, H. Schmidt and F. J. Hauck, "<prt>nOSGi</prt>: a posix-compliant native <prt>OSGi</prt> framework" in Proceedings of the 5th International Conference on Communication System Software and Middleware, New York, NY, USA: ACM, 2011, pp. 4:1--4:2.
DOI:10.1145/2016551.2016555
ISBN:978-1-4503-0560-0
Datei:http://doi.acm.org/10.1145/2016551.2016555
67.
S. Kächele, J. Domaschka and F. J. Hauck, "<prt>COSCA</prt>: an easy-to-use component-based <prt>PaaS</prt> cloud system for common applications" in Proceedings of the 1st International Workshop on Cloud Computing Platforms, New York, NY, USA: ACM, 2011, pp. 4:1--4:6.
DOI:10.1145/1967422.1967426
ISBN:978-1-4503-0727-7
Datei:http://doi.acm.org/10.1145/1967422.1967426

2010

66.
J. Elsholz, E. Seibel and F. J. Hauck, "RAPIX: a plug-in based RIA for multimedia communication" , 2010.

2009

65.
J. Elsholz, H. Schmidt, S. Schober, F. J. Hauck and A. J. Kassler, "<prt>Instant-X:</prt> Towards a Generic <prt>API</prt> for Multimedia Middleware" in IEEE International Conference on Internet Multimedia Systems Architecture and Application, Bangalore, India, Dez. 2009.
64.
J. Domaschka, H. Schmidt, F. J. Hauck, R. Kapitza and H. P. Reiser, "DOSGi: An architecture for instant replication" in Proc. of the 39th Annual IEEE/IFIP Int. Conf. on Dependable Sys. and Netw., Supplemental Volume, 2009.
63.
J. Elsholz, H. Schmidt, S. Schober and F. J. Hauck, "Instant-X: SOA for Multimedia Communication in NGNs" , 2009.
62.
H. Schmidt, J. Elsholz, V. Nikolov, F. J. Hauck and R. Kapitza, "OSGi4C: enabling OSGi for the cloud" in Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE, New York, NY, USA: ACM, 2009, pp. 15:1--15:12.
DOI:10.1145/1621890.1621910
ISBN:978-1-60558-353-2
Datei:http://doi.acm.org/10.1145/1621890.1621910
61.
V. Nikolov, R. Kapitza and F. J. Hauck, "Recoverable Class Loaders for a Fast Restart of Java Applications", Mobile Networks and Applications, vol. 14, pp. 53-64, 2009. Springer Netherlands.
DOI:10.1007/s11036-008-0115-8
Datei:http://dx.doi.org/10.1007/s11036-008-0115-8
60.
B. Erb, J. Elsholz and F. J. Hauck, "Semantic Mashup: Mashing up Information in the Todays World Wide Web - An Overview" , 2009.
DOI:10.13140/RG.2.1.1459.6967

2008

59.
J. Elsholz, F. J. Hauck and H. Schmidt, "Multimediale Datenübertragung" , 2008.
58.
J. Domaschka, T. Bestfleisch, F. J. Hauck, H. P. Reiser and R. Kapitza, "Multithreading strategies for replicated objects" in Proc. of the ACM/IFIP/USENIX 9th Int. Middleware Conf., Berlin, Heidelberg: Springer-Verlag, 2008, pp. 104--123.
DOI:10.1007/978-3-540-89856-6_6
ISBN:978-3-540-89855-9
Datei:http://dx.doi.org/10.1007/978-3-540-89856-6_6
57.
J. Domaschka, C. Spann and F. J. Hauck, "<prt>Virtual Nodes: a re-configurable replication framework for highly-available grid services</prt>" in Proceedings of the ACM/IFIP/USENIX Middleware'08 Conference Companion, ACM New York, NY, USA, 2008, pp. 107--109.
DOI:10.1145/1462735.1462766
Datei:http://portal.acm.org/citation.cfm?id=1462766
56.
H. Schmidt, J. Elsholz and F. J. Hauck, "Instant-X: a component-based middleware architecture for a generic multimedia API" in Companion '08: Proceedings of the ACM/IFIP/USENIX Middleware '08 Conference Companion, New York, NY, USA: ACM, 2008, pp. 90--92.
DOI:http://doi.acm.org/10.1145/1462735.1462759
ISBN:978-1-60558-369-3
55.
H. Schmidt, B. Aksoy, F. J. Hauck and A. Kassler, "How well does JXTA fit peer-to-peer SIP?" in IEEE International Conference on Communications--ICC , 19.-23. May 2008, 2008.
DOI:10.1109/ICC.2008.344

2007

54.
H. Schmidt, C. Dang and F. J. Hauck, "Proxy-based security for the Session Initiation Protocol (SIP)" in 2nd International Conference on Systems and Networks Communications, Cap Esterel, France, 25.-31. Aug. 2007, Aug. 2007.
53.
T. Guenkova-Luy, H. Schmidt, A. Schorr, F. J. Hauck and A. Kassler, "A Session-initiation-protocol-based middleware for multi-application management" in IEEE International Conference on Communications, Glasgow, Jun. 2007.
52.
J. Domaschka, H. Schmidt and F. J. Hauck, "Forschungstrends im Bereich Verteilter Systeme" , 2007.
51.
J. Domaschka, A. I. Schmied, H. P. Reiser and F. J. Hauck, "Revisiting deterministic multithreading strategies" in Pro. of the 9th Int. Workshop on Java and Components for Parallelism, Distribution and Concurrency, 2007.
DOI:10.1109/IPDPS.2007.370415
50.
J. Domaschka, H. P. Reiser and F. J. Hauck, "Towards generic and middleware-independent support for replicated, distributed objects" in Proc of the 1st Workshop on Middleware-Application Interaction, New York, NY, USA: ACM, 2007, pp. 43--48.
DOI:10.1145/1238828.1238839
ISBN:978-1-59593-696-7
Datei:http://doi.acm.org/10.1145/1238828.1238839

2006

49.
R. Kapitza, J. Domaschka, F. J. Hauck and H. P. Reiser, "FORMI: Integrating Adaptive Fragmented Objects into Java RMI", IEEE Distributed Systems Online, vol. 7, no. 10, Okt. 2006.
DOI:10.1109/MDSO.2006.61
48.
H. P. Reiser, J. Domaschka, F. J. Hauck, R. Kapitza and W. Schröder-Preikschat, "Consistent replication of multithreaded distributed objects" in Proc. of the 25th IEEE Symp. on Reliable Distributed Systems, Washington, DC, USA: IEEE Computer Society, 2006, pp. 257--266.
DOI:10.1109/SRDS.2006.14
ISBN:0-7695-2677-2
Datei:http://dx.doi.org/10.1109/SRDS.2006.14
47.
J. Domaschka, F. J. Hauck, H. P. Reiser and R. Kapitza, "Deterministic Multithreading for Java-based Replicated Objects" in Proc. of the 18th IASTED Int. Conf. on Parallel and Distributed Computing and Systems, 2006, pp. 516--521.
46.
H. P. Reiser, R. Kapitza, J. Domaschka and F. J. Hauck, "Fault-tolerant replication based on fragmented objects" in Proc. of the 6th IFIP WG 6.1 Int. Conf. on Distrib. Applications and Interoperable Sys., Berlin, Heidelberg: Springer-Verlag, 2006, pp. 256--271.
DOI:10.1007/11773887_20
ISBN:3-540-35126-4, 978-3-540-35126-9
Datei:http://dx.doi.org/10.1007/11773887_20
45.
H. P. Reiser, R. Kapitza, J. Domaschka and F. J. Hauck, "Flexible und adaptive Replikation in verteilter objektbasierter Middleware" , 2006.
44.
H. P. Reiser, F. J. Hauck, R. Kapitza and W. Schröder-Preikschat, "Hypervisor-based redundant execution on a single physical host" in Proc. Suppl. Vol. of the 6th European Dependable Comp. Conf. (EDCC), 2006, pp. 67-68.
Datei:pdfhttp://homepages.lasige.di.fc.ul.pt/~hans/pub/doc/reiser06hypervisor.pdf

2005

43.
R. Kapitza, M. Kirstein, H. Schmidt and F. J. Hauck, "FORMI: An RMI extension for adaptive applications" in Proc. of the 4th Workshop on Adaptive and Reflective Middleware, ARM, Grenoble, France, 28.11.2005, ACM Digital Library, 2005.
DOI:10.1145/1101516.1101518

2003

42.
R. Kapitza and F. J. Hauck, "DLS: a CORBA service for dynamic loading of code" in Proc. of the Int. Symp. on Distrib. Obj. and Appl. - DOA, Dez. 2003.
41.
T. Bindhammer, A. I. Schmied and F. J. Hauck, "Betriebssystem Linux, Proseminar im Sommersemester 2003" , Okt. 2003.
40.
A. I. Schmied and F. J. Hauck, "Sicherheit in Verteilten Systemen, Hauptseminare im Sommersemester 2003" , Sep. 2003.
39.
H. P. Reiser, F. J. Hauck, R. Kapitza and A. I. Schmied, "Integrating fragmented objects into a CORBA environment" in Proc. of the Net.ObjectDAYS, Erfurt, Sep. 2003.

2002

38.
R. Kapitza and F. J. Hauck, "DLS: a CORBA service for dynamic loading of code" , Dez. 2002.

2001

37.
H. P. Reiser, M. Steckermeier and F. J. Hauck, "IDLflex: a flexible and generic compiler for CORBA IDL" in Proc. of the Net.ObjectDAYS, Erfurt, 10-13.9.2001, Sep. 2001.
36.
H. P. Reiser, M. Steckermeier and F. J. Hauck, "IDLflex: a flexible and generic compiler for CORBA IDL" , Sep. 2001.
35.
F. J. Hauck, U. Becker, M. Geier, E. Meier, U. Rastofer and M. Steckermeier, "AspectIX: a quality-aware, object-based middleware architecture" in Proc. of the 3rd IFIP Int. Conf. on Distrib. Appl. and Interop. Sys. - DAIS, Krakow, Sep. 2001.

1999

34.
F. J. Hauck, U. Becker, M. Geier, E. Meier, U. Rastofer and M. Steckermeier, "The AspectIX approach to quality-of-service integration into CORBA" , 1999.
Datei:ftp://ftp.informatik.uni-erlangen.de/pub/papers/byyear/99/TR-I4-99-09.ps.gz

1998

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

1997

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

1996

27.
F. J. Hauck, M. van Steen and A. S. Tanenbaum, "Algorithmic design of the Globe location service" , 1996.

1995

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

1994

23.
F. J. Hauck, "Typisierte Vererbung modelliert durch Aggregation" in Verteilte Systeme, Hartmut Wedekind, Eds. Zürich: Bibliographisches Institut, 1994, pp. 291--302.

1993

22.
F. J. Hauck, "Inheritance modelled by aggregation: an approach to typed inheritance relations: submission to the OOPSLA `93 conference -- research paper" , 1993.
21.
F. J. Hauck, "Typisierte Vererbung modelliert durch Aggregation" , 1993.
20.
F. J. Hauck, "Towards the implementation of a uniform object model" in SFB Colloquium SFB 182 and SFB 342, Berlin, Heidelberg, New York, Tokyo: Springer-Verlag, 1993, pp. 180--189.
19.
F. J. Hauck, "PM: a distributed object-oriented operating system" , 1993.
18.
F. J. Hauck, "Supporting class evolution by typing inheritance" , 1993.
17.
F. J. Hauck, "Inheritance modeled with explicit bindings: an approach to typed inheritance" in Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Andreas Paepcke, Eds. New York, NY: ACM Press, 1993, pp. 231--239.
ISBN:0-89791-587-9
16.
F. J. Hauck, "Inheritance modeled with explicit bindings: an approach to typed inheritance" , 1993.
15.
R. Monge and F. J. Hauck, "Ein Ereignis-basiertes Modell zur Formalisierung von Request-Reply Objektinteraktionen" , 1993.
14.
F. J. Hauck, "Class-based inheritance is not a basic concept" in Understanding object-model concepts: Position papers for OOPSLA '93 Workshop #19, Clyde, Stephen W. and Conrad, Bruce A. and Embley, David W. and Kurtz, Barry D., Eds. 1993.
13.
F. J. Hauck, "Class-based inheritance is not a basic concept" , 1993.
12.
F. J. Hauck and P. R. Steyaert, "3rd Workshop for Doctoral Students in Object-Oriented Systems" , 1993.

1992

11.
F. J. Hauck, "Typisierte Vererbung modelliert durch Aggregation" , 1992.
10.
F. J. Hauck, "Towards the implementation of a uniform object model" , 1992.
9.
F. J. Hauck, "Multiple inheritance and multiple subtyping" in Position Papers of the ECOOP '92 Workshop W1, Markku Sakkinen, Eds. Department of Computer Science and Information Systems, University of Jyväskylä, 1992, pp. 14--16.
8.
R. Monge and F. J. Hauck, "Ein Ereignis-basiertes Modell für Beauftragung und mögliche Protokolle" , 1992.

1991

7.
F. J. Hauck, T. Eirich, M. Fäustle, J. Kleinöder, R. Pruy and P. Schlenk, "Das PM Projekt" , 1991.
6.
T. Eirich and F. J. Hauck, "Inheritance by aggregation" , 1991.

1990

5.
F. J. Hauck, "Verteilte Objekte unter UNIX - Eine PM-Implementierung", interner Bericht, 1990. IMMD 4, Universität Erlangen-Nürnberg.

1989

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

1988

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

1986

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

1985

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