%
% This file was created by the TYPO3 extension
% publications
% --- Timezone: CEST
% Creation date: 2025-05-02
% Creation time: 01:34:10
% --- Number of references
% 16
%


@Article { Koestler21a,
    author = {K\\dq\{o\}stler, Johannes and Reiser, Hans P. and Habiger, Gerhard and Hauck, Franz J.},
    title = {SmartStream: Towards Efficient Byzantine Resilient Data Streaming through Speculation and Sharding},
    abstract = {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 elaborate communication primitives usually result in a higher overall
complexity and a non-negligible performance degradation. As data streaming operates
on highly-partitionable append-only state, some of these performance losses can be
counteracted by applying speculative execution and sharding. We show the effectiveness
of these concepts in a prototype implementation, which only results in a reasonable
drop in system throughput and latency during average system utilization, when compared
to state-of-the-art data streaming platforms like Apache Kafka, while providing stronger
resilience guarantees.},
    year = {2021},
    month = {10},
    DOI = {10.1145/3493499.3493501},
    journal = {SIGAPP Appl. Comput. Rev.},
    volume = {21},
    publisher = {ACM},
    address = {New York, NY, USA},
    pages = {19–32},
    number = {3},
    keywords = {replication, sharding, speculation, byzantine fault tolerance, state machine, message broker, streaming platform}
}

@Article { Koestler21a,
    author = {K\"{o}stler, Johannes and Reiser, Hans P. and Habiger, Gerhard and Hauck, Franz J.},
    title = {SmartStream: Towards Efficient Byzantine Resilient Data Streaming through Speculation and Sharding},
    abstract = {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 elaborate communication primitives usually result in a higher overall
complexity and a non-negligible performance degradation. As data streaming operates
on highly-partitionable append-only state, some of these performance losses can be
counteracted by applying speculative execution and sharding. We show the effectiveness
of these concepts in a prototype implementation, which only results in a reasonable
drop in system throughput and latency during average system utilization, when compared
to state-of-the-art data streaming platforms like Apache Kafka, while providing stronger
resilience guarantees.},
    year = {2021},
    month = {10},
    DOI = {10.1145/3493499.3493501},
    journal = {SIGAPP Appl. Comput. Rev.},
    volume = {21},
    publisher = {ACM},
    address = {New York, NY, USA},
    pages = {19-32},
    number = {3},
    keywords = {replication, sharding, speculation, byzantine fault tolerance, state machine, message broker, streaming platform}
}

@Article { Berger21CSUR,
    author = {Berger, Christian and Eichhammer, Philipp and Reiser, Hans P. and Domaschka, J\"{o}rg and Hauck, Franz J. and Habiger, Gerhard},
    title = {A survey on resilience in IoT: Taxonomy, classification and discussion of resilience mechanisms},
    year = {2021},
    month = {6},
    reviewed = {1},
    DOI = {10.1145/3462513},
    journal = {ACM Comp. Surv.},
    volume = {54},
    number = {7},
    tags = {SORRIR,ARTeam}
}

@Inproceedings { Koestler21smartstream,
    author = {K\"{o}stler, Johannes and Reiser, Hans P. and Habiger, Gerhard and Hauck, Franz J.},
    title = {SmartStream: Towards Byzantine Resilient Data Streaming},
    abstract = {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.},
    year = {2021},
    month = {3},
    DOI = {10.1145/3412841.3441904},
    booktitle = {36th Ann. ACM Symp. on Appl. Comp. (SAC)},
    publisher = {ACM},
    address = {New York, NY, USA},
    pages = {213–222},
    keywords = {publish-subscribe, streaming platform, message broker, byzantine fault tolerance, state machine, replication}
}

@Inproceedings { RDB0817,
    author = {Habiger, Gerhard and Hauck, Franz J. and Reiser, Hans P. and K\"{o}stler, Johannes},
    title = {Self-optimising application-agnostic multithreading for replicated state machines},
    year = {2020},
    reviewed = {1},
    DOI = {10.1109/SRDS51746.2020.00024},
    booktitle = {Proc. of the 39th Int. Symp. on Rel. Distr. Sys. (SRDS)},
    tags = {ARTEAM, OptSCORE}
}

@Inproceedings { DomaschkaM4IoT2019,
    author = {Domaschka, J\"{o}rg and Berger, Christian and Reiser, Hans P. and Eichhammer, Philipp and Griesinger, Frank and Pietron, Jakob and Tichy, Matthias and Hauck, Franz J. and Habiger, Gerhard},
    title = {SORRIR: a resilient self-organizing middleware for IoT applications},
    year = {2019},
    month = {12},
    reviewed = {1},
    DOI = {10.1145/3366610.3368098},
    booktitle = {Proc. of 6th Int. Worksh. on Middlew. and App. for the Internet of Things (M4IoT)},
    pages = {13-16},
    event_place = {Davis, CA},
    tags = {ARTeam, SORRIR}
}

@Inproceedings { HabigerFBSYS2019,
    author = {Habiger, Gerhard and Hauck, Franz J.},
    title = {Systems support for efficient state-machine replication},
    year = {2019},
    DOI = {10.18420/fbsys2019-04},
    booktitle = {Tagungsband des FB-SYS Herbsttreffens 2019},
    publisher = {GI},
    event_place = {Osnabr\"{u}ck},
    tags = {ARTeam, OptSCORE}
}

@Inproceedings { EichhFBSYS2019,
    author = {Eichhammer, Philipp and Berger, Christian and Reiser, Hans P. and Domaschka, J\"{o}rg and Hauck, Franz J. and Habiger, Gerhard and Griesinger, Frank and Pietron, Jakob},
    title = {Towards a robust, self-organizing IoT platform for secure and dependable service execution},
    year = {2019},
    DOI = {10.18420/fbsys2019-03},
    booktitle = {Tagungsband des FB-SYS Herbsttreffens 2019},
    publisher = {GI},
    event_place = {Osnabr\"{u}ck},
    tags = {ARTeam, SORRIR}
}

@Conference { HabigerHKR2018,
    author = {Habiger, Gerhard and Hauck, Franz J. and K\"{o}stler, Johannes and Reiser, Hans P.},
    title = {Resource-Efficient State-Machine Replication with Multithreading and Vertical Scaling},
    abstract = {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.},
    year = {2018},
    month = {9},
    reviewed = {1},
    DOI = {10.1109/EDCC.2018.00024},
    booktitle = {Proc. of the 14th Eur. Dep. Comp. Conf. (EDCC)},
    publisher = {IEEE},
    event_place = {Ia\c{s}i, Romania},
    tags = {OptSCORE, ARTeam}
}

@Conference { ErbMHPK2017,
    author = {Erb, Benjamin and Mei\"{s}ner, Dominik and Habiger, Gerhard and Pietron, Jakob and Kargl, Frank},
    title = {Consistent Retrospective Snapshots in Distributed Event-sourced Systems},
    abstract = {An increasing number of distributed, event-based systems adopt an architectural style called event sourcing, in which entities keep their entire history in an event log. Event sourcing enables data lineage and allows entities to rebuild any previous state. Restoring previous application states is a straightforward task in event-sourced systems with a global and totally ordered event log. However, the extraction of causally consistent snapshots from distributed, individual event logs is rendered non-trivial due to causal relationships between communicating entities. High dynamicity of entities increases the complexity of such reconstructions even more. We present approaches for retrospective and global state extraction of event-sourced applications based on distributed event logs. We provide an overview on historical approaches towards distributed debugging and breakpointing, which are closely related to event log-based state reconstruction. We then introduce and evaluate our approach for non-local state extraction from distributed event logs, which is specifically adapted for dynamic and asynchronous event-sourced systems.},
    year = {2017},
    month = {3},
    DOI = {10.1109/NetSys.2017.7903947},
    booktitle = {Proc. of the Int. Conf. on Netw. Sys. (NetSys)},
    event_place = {G\"{o}ttingen},
    tags = {SIDGRAPH, ARTeam}
}

@Conference { HauckHD2016,
    author = {Hauck, Franz J. and Habiger, Gerhard and Domaschka, J\"{o}rg},
    title = {UDS: a novel and flexible scheduling algorithm for deterministic multithreading},
    year = {2016},
    month = {9},
    reviewed = {1},
    DOI = {10.1109/SRDS.2016.030},
    booktitle = {Proc. of the 35th Int. Symp. on Reliable Distrib. Sys. (SRDS)},
    event_place = {Budapest, Hungry},
    tags = {OptSCORE, ARTeam}
}

@Conference { ErbHH2016,
    author = {Erb, Benjamin and Habiger, Gerhard and Hauck, Franz J.},
    title = {On the Potential of Event Sourcing for Retroactive Actor-based Programming},
    abstract = {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.},
    year = {2016},
    month = {7},
    day = {17},
    reviewed = {1},
    DOI = {10.1145/2957319.2957378},
    booktitle = {Proc. of the 1st Workshop on Progr. Models and Lang. for Distrib. Comp.},
    event_place = {Rome, Italy},
    tags = {SIDGRAPH, ARTeam}
}

@Mastersthesis { Habiger2016,
    author = {Habiger, Gerhard},
    title = {Implementation of asynchronous request handling in BFT SMaRt},
    abstract = {Current research efforts of our institute include a project on deterministic scheduling of multithreaded applications for State Machine Replication (SMR) systems with Byzantine Fault Tolerance (BFT).
One part of this project aims to integrate our own work on deterministic scheduling with the BFT SMaRt library. Currently, BFT SMaRt only supports synchronous request-response patterns, whereas our planned SMR platform needs these patterns to be asynchronous. The goals of this project are (i) to analyze the existing BFT SMaRt codebase, (ii) to implement the necessary interfaces for asynchronous request handling and (iii) to integrate these changes into the existing BFT SMaRt libraries.},
    status = {4},
    year = {2016},
    school = {Institute of Distributed Systems},
    tags = {PROJEKT, GerhardHabiger}
}

@Report { HabigerHKR2016,
    author = {Habiger, Gerhard and Hauck, Franz J. and K\"{o}stler, Johannes and Reiser, Hans P.},
    title = {Vertikale Skalierung f\"{u}r aktiv replizierte Dienste in Cloud-Infrastrukturen},
    type = { Kurzfassung f\"{u}r das Herbsttreffen der GI/VDE/ITG Fachgruppe Betriebssysteme 2016},
    year = {2016},
    tags = {OptSCORE, ARTeam},
    file_url = {/fileadmin/website\_uni\_ulm/iui.inst.200/files/publikationen/Habiger16.pdf}
}

@Mastersthesis { Habiger2015,
    author = {Habiger, Gerhard},
    title = {Distributed Versioning and Snapshot Mechanisms on Event-Sourced Graphs},
    abstract = {Two interesting approaches to tackle many of today's problems in large scale data processing and live query resolution on big graph datasets have emerged in recent years. Firstly, after Google's presentation of its graph computing platform Pregel in 2010, an influx of more or less similar platforms could be observed. These platforms all share the goal of providing highly performant data mining and analysis capabilities to users, enabling a wide variety of today's technologies like ranking web pages in the the web graph of the WWW or analysing user interactions in social networks. Secondly, the old concept of message logging for failure recovery was rediscovered and combined with event based computing in the early 2000s and is now known as event sourcing. This approach to system design keeps persistent logs of every single change of all entities in a computation, providing highly interesting options like state restoration by replaying old events, retroactive event modifications, phenomenal debugging capabilities and many more.

A recently published paper suggests the merging of those two approaches to create a hybrid event-sourced graph computing platform. This platform would show unique characteristics compared to other known solutions. For example, computations on temporal data can yield information about the evolution of a graph and not only its current state. Furthermore, for backups or to enable offline analysis on large compute clusters, snapshot extraction – i.e. reproducing any consistent global state the graph has ever been in – from the event logs produced by event-sourced graph computations is possible.
This thesis provides one of the first major works related to this proposed hybrid platform and provides background knowledge related to these aforementioned topics. It presents a thorough overview over the current state-of-the-art in graph computing platforms and causality tracking in distributed systems and finally develops an efficient mechanism for extracting arbitrary, consistent global snapshots from a distributed event log produced by an event-sourced graph computation.
},
    type = {Masterarbeit VS-M13-2015},
    year = {2015},
    month = {10},
    school = {Institut f\"{u}r Verteilte Systeme, Universit\"{a}t Ulm},
    tags = {BA, AA, MA, DA, BenjaminErb, FrankKargl, sidgraph, distributed}
}

@Mastersthesis { Habiger2013,
    author = {Habiger, Gerhard},
    title = {Security and Privacy of Implantable Medical Devices},
    abstract = {The high demand and growing market for Implantable Medical Devices shows a widespread need for invisible and unobtrusive medical treatment of medical conditions like e.g. diabetes or cardiac arrythmia. The advancements of technology in this field make devices increasingly inter-connected, allowing them to communicate wirelessly with sensors, medical telemetry systems or device programmers. However, the increased complexity and the fact that many medical devices nowadays can be programmed and controlled via wireless links, brings with it a plethora of vulnerabilities. Adversaries capable of imitating authorized device programmers could gain control over IMDs, leading to serious injury or even death of their users. Other attacks could target a patient’s private medical data. This thesis strives to give an overview over the current state of research and recent developments in the field of IMD-security and privacy. It will discuss known vulnerabilities and possible defensive measures and evaluate the current risks involved with using a modern IMD. Based on these discussions, design concerns for IMD manufacturers are then summarized.},
    type = {Bachelorarbeit},
    year = {2012},
    month = {5},
    day = {25},
    school = {Institut f\"{u}r Medieninformatik, Universit\"{a}t Ulm},
    extern = {1},
    tags = {BA, AA, StephanKleber, MichaelWeber}
}