Office Hours

For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.

Benjamin Erb

Benjamin Erb has been studying Computer Science in Media at Ulm University and graduated in 2012 with a Diploma degree. He then joined the Institute of Distributed Systems and is currently employed as a research assistant.

Research Outline: Chronograph

As part of my thesis, I am currently working on Chronograph – a novel graph computing platform that combines concepts of traditional graph computing with features from event-driven architectures. The platform combines a vertex-based programming model, an asynchronous concurrency model using message passing, and an alternative persistence approach that is based on event sourcing.

Research Interests 

  • Distributed Computing
    • Graph-based computing
    • Event processing
    • Distribution and parallelization aspects
    • Time & programming models
  • Distributed systems & architectures
    • Event-driven architectures
    • Event sourcing & CQRS
    • Scalability of architectures
    • Concurrency and parallelism
  • Other Topics
    • Psychology & Privacy
    • Web technologies & web architectures
    • Programming languages and concepts
    • Open data

Projects

  • SIDGRAPH (started 2014/08 – 2017/07; completed): Development of scalability and distribution mechanisms for graph-based and event-driven computations and simulations
  • PRIPARE (2013/10 – 2015/09; completed): Design and implementation of a collaborative web portal for patterns and best practices for privacy
  • diretto / diretto.resc (2009/10 – 2011/08; completed): The main target of this student project has been the design and prototypical implementation of a platform for distributed reporting. Use cases include collaborations in disaster scenarios and the live coverage of large-scale public events. The second stage of the project has been funded by MFG Stiftung Baden-Württemberg as part of a Karl-Steinbuch scholarship.

Publications


2018

Lukaseder, Thomas; Maile, Lisa; Erb, Benjamin; Kargl, Frank
SDN-Assisted Network-Based Mitigation of Slow DDoS Attacks
SecureComm'18,
August 2018
akzeptiert

Zusammenfassung: Slow-running attacks against network applications are often not easy to detect, as the attackers behave according to the specification. The servers of many network applications are not prepared for such attacks, either due to missing countermeasures or because their default configurations ignores such attacks. The pressure to secure network services against such attacks is shifting more and more from the service operators to the network operators of the servers under attack. Recent technologies such as software-defined networking offer the flexibility and extensibility to analyze and influence network flows without the assistance of the target operator. Based on our previous work on a network-based mitigation, we have extended a framework to detect and mitigate slow-running DDoS attacks within the network infrastructure, but without requiring access to servers under attack. We developed and evaluated several identification schemes to identify attackers in the network solely based on network traffic information. We showed that by measuring the packet rate and the uniformity of the packet distances, a reliable identificator can be built, given a training period of the deployment network.

Erb, Benjamin; Meißner, Dominik; Steer, Benjamin A.; Margan, Domagoj; Kargl, Frank; Cuadrado, Felix; Pietzuch, Peter
GraphTides: A Framework for Evaluating Stream-based Graph Processing Platforms
Proceedings of the 1st Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
Juni 2018
akzeptiert

Zusammenfassung: Stream-based graph systems continuously ingest graph-changing events via an established input stream, performing the required computation on the corresponding graph. While there are various benchmarking and evaluation approaches for traditional, batch-oriented graph processing systems, there are no common procedures for evaluating stream-based graph systems. We, therefore, present GraphTides, a generic framework which includes the definition of an appropriate system model, an exploration of the parameter space, suitable workloads, and computations required for evaluating such systems. Furthermore, we propose a methodology and provide an architecture for running experimental evaluations. With our framework, we hope to systematically support system development, performance measurements, engineering, and comparisons of stream-based graph systems.

Meißner, Dominik; Erb, Benjamin; Kargl, Frank; Tichy, Matthias
retro-λ: An Event-sourced Platform for Serverless Applications with Retroactive Computing Support
Proceedings of the 12th ACM International Conference on Distributed Event-Based Systems
Juni 2018
akzeptiert

Zusammenfassung: State changes over time are inherent characteristics of stateful applications. So far, there are almost no attempts to make the past application history programmatically accessible or even modifiable. This is primarily due to the complexity of temporal changes and a difficult alignment with prevalent programming primitives and persistence strategies. Retroactive computing enables powerful capabilities though, including computations and predictions of alternate application timelines, post-hoc bug fixes, or retroactive state explorations. We propose an event-driven programming model that is oriented towards serverless computing and applies retroaction to the event sourcing paradigm. Our model is deliberately restrictive, but therefore keeps the complexity of retroactive operations in check. We then introduce retro-λ, a runtime platform that implements the model and provides retroactive capabilites to its applications. While retro-λ only shows negligible performance overheads compared to similar solutions for running regular applications, it enables its users to execute retroactive computations on the application histories as part of its programming model.

Meißner, Dominik; Erb, Benjamin; Kargl, Frank
Poster: Performance Engineering in Distributed Event-sourced Systems
Proceedings of the 12th ACM International Conference on Distributed Event-Based Systems
Juni 2018
akzeptiert

Zusammenfassung: Distributed event-sourced systems adopt a fairly new architectural style for data-intensive applications that maintains the full history of the application state. However, the performance implications of such systems are not yet well explored, let alone how the performance of these systems can be improved. A central issue is the lack of systematic performance engineering approaches that take into account the specific characteristics of these systems. To address this problem, we suggest a methodology for performance engineering and performance analysis of distributed event-sourced systems based on specific measurements and subsequent, targeted optimizations. The methodology blends in well into existing software engineering processes and helps developers to identify bottlenecks and to resolve performance issues. Using our structured approach, we improved an existing event-sourced system prototype and increased its performance considerably.

Erb, Benjamin; Meißner, Dominik; Ogger, Ferdinand; Kargl, Frank
Poster: Log Pruning in Distributed Event-sourced Systems
Proceedings of the 12th ACM International Conference on Distributed Event-Based Systems
Juni 2018
akzeptiert

Zusammenfassung: Event sourcing is increasingly used and implemented in event-based systems for maintaining the evolution of application state. However, unbounded event logs are impracticable for many systems, as it is difficult to align scalability requirements and long-term runtime behavior with the corresponding storage requirements. To this end, we explore the design space of log pruning approaches suitable for event-sourced systems. Furthermore, we survey specific log pruning mechanisms for event-sourced logs. In a brief evaluation, we point out the trade-offs when applying pruning to event logs and highlight the applicability of log pruning to event-sourced systems.

2017

Erb, Benjamin; Meißner, Dominik; Pietron, Jakob; Kargl, Frank
Chronograph – A Distributed Processing Platform for Online and Batch Computations on Event-sourced Graphs
Proceedings of the 11th ACM International Conference on Distributed Event-Based Systems
Juni 2017

Zusammenfassung: Several data-intensive applications take streams of events as a continuous input and internally map events onto a dynamic, graph-based data model which is then used for processing. The differences between event processing, graph computing, as well as batch processing and near-realtime processing yield a number of specific requirements for computing platforms that try to unify theses approaches. By combining an altered actor model, an event-sourced persistence layer, and a vertex-based, asynchronous programming model, we propose a distributed computing platform that supports event-driven, graph-based applications in a single platform. Our Chronograph platform concept enables online and offline computations on event-driven, history-aware graphs and supports different processing models on the evolving graph.

Erb, Benjamin; Meißner, Dominik; Habiger, Gerhard; Pietron, Jakob; Kargl, Frank
Consistent Retrospective Snapshots in Distributed Event-sourced Systems
Proceedings of the International Conference on Networked Systems 2017
März 2017

Zusammenfassung: 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.

2016

Erb, Benjamin; Kargl, Frank
Chronograph–A Distributed Platform for Event-Sourced Graph Computing
Proceedings of the Posters and Demos Session of the 17th International Middleware Conference
Dezember 2016

Zusammenfassung: Many data-driven applications require mechanisms for processing interconnected or graph-based data sets. Several platforms exist for offline processing of such data and fewer solutions address online computations on dynamic graphs. We combined a modified actor model, an event-sourced persistence layer, and a vertex-based, asynchronous programming model in order to unify event-driven and graph-based computations. Our distributed chronograph platform supports both near-realtime and batch computations on dynamic, event-driven graph topologies, and enables full history tracking of the evolving graphs over time.

Seybold, Daniel; Wagner, Nicolas; Erb, Benjamin; Domascka, Jörg
Is Elasticity of Scalable Databases a Myth?
4th Workshop on Scalable Cloud Data Management
Dezember 2016
Lukaseder, Thomas; Bradatsch, Leonard; Erb, Benjamin; van der Heijden, Rens W.; Kargl, Frank
A Comparison of TCP Congestion Control Algorithms in 10G Networks
Proceedings of the 41st IEEE Conference on Local Computer Networks (LCN) , Seite 706-714.
November 2016

Zusammenfassung: The increasing availability of 10G Ethernet network capabilities challenges existing transport layer protocols. As 10G connections gain momentum outside of backbone networks, the choice of appropriate TCP congestion control algorithms becomes even more relevant for networked applications running in environments such as data centers. Therefore, we provide an extensive overview of relevant TCP congestion control algorithms for high-speed environments leveraging 10G. We analyzed and evaluated six TCP variants using a physical network testbed, with a focus on the effects of propagation delay and significant drop rates. The results indicate that of the algorithms compared, BIC is most suitable when no legacy variant is present; CUBIC is suggested otherwise.

Lukaseder, Thomas; Bradatsch, Leonard; Erb, Benjamin; Kargl, Frank
Setting Up a High-Speed TCP Benchmarking Environment — Lessons Learned
Proceedings of the 41st IEEE Conference on Local Computer Networks (LCN) , Seite 160-163.
November 2016

Zusammenfassung: There are many high-speed TCP variants with different congestion control algorithms, which are designed for specific settings or use cases. Distinct features of these algorithms are meant to optimize different aspects of network performance, and the choice of TCP variant strongly influences application performance. However, setting up tests to help with the decision of which variant to use can be problematic, as many systems are not designed to deal with high bandwidths, such as 10 Gbps or more. This paper provides an overview of pitfalls and challenges of realistic network analysis to help in the decision making process.

Meißner, Dominik; Erb, Benjamin; van der Heijden, Rens W.; Lange, Kristin; Kargl, Frank
Mobile Triage Management in Disaster Area Networks Using Decentralized Replication
Proceedings of the Tenth ACM MobiCom Workshop on Challenged Networks , Seite 7-12.
Herausgeber: ACM,
Oktober 2016
ISBN: 978-1-4503-4256-8

Zusammenfassung: In large-scale disaster scenarios, efficient triage management is a major challenge for emergency services. Rescue forces traditionally respond to such incidents with a paper-based triage system, but technical solutions can potentially achieve improved usability and data availability. We develop a triage management system based on commodity hardware and software components to verify this claim. We use a single-hop, ad-hoc network architecture with multi-master replication, a tablet-based device setup and a mobile application for emergency services. We study our system in cooperation with regional emergency services and describe experiences from a field exercise. We show that state-of-the-art commodity technology provides the means necessary to implement a triage management system compatible with existing emergency service procedures, while introducing additional benefits. This work highlights that powerful real-world ad-hoc networking applications do not require unreasonable development effort, as existing tools from distributed systems, like replicating No-SQL databases, can be used successfully.

Erb, Benjamin; Habiger, Gerhard; Hauck, Franz J.
On the Potential of Event Sourcing for Retroactive Actor-based Programming
Proceedings of the 1st Workshop on Programming Models and Languages for Distributed Computing
Juli 2016

Zusammenfassung: 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.

Kraft, Robin; Erb, Benjamin; Mödinger, David; Kargl, Frank
Using Conflict-Free Replicated Data Types for Serverless Mobile Social Applications
Proceedings of the 8th ACM International Workshop on Hot Topics in Planet-scale mObile computing and online Social neTworking , Seite 49-54.
Herausgeber: ACM,
Juli 2016
ISBN: 978-1-4503-4344-2

Zusammenfassung: A basic reason for backend systems in mobile application architectures is the centralized management of state. Mobile clients synchronize local states with the backend in order to maintain an up-to-date view of the application state. As not all mobile social applications require strong consistency guarantees, we survey an alternative approach using special data structures for mobile applications. These data structures only provide eventual consistency, but allow for conflict-free replication between peers. Our analysis collects the requirements of social mobile applications for being suitable for this approach. Based on exemplary mobile social applications, we also point out the benefits of serverless architecture or architectures with a thin backend layer.

Bösch, Christoph; Erb, Benjamin; Kargl, Frank; Kopp, Henning; Pfattheicher, Stefan
Tales from the Dark Side: Privacy Dark Strategies and Privacy Dark Patterns
Proceedings on Privacy Enhancing Technologies, 2016(4):237-254
Juli 2016

Zusammenfassung: Privacy strategies and privacy patterns are fundamental concepts of the privacy-by-design engineering approach. While they support a privacy-aware development process for IT systems, the concepts used by malicious, privacy-threatening parties are generally less understood and known. We argue that understanding the ``dark side'', namely how personal data is abused, is of equal importance. In this paper, we introduce the concept of privacy dark strategies and privacy dark patterns and present a framework that collects, documents, and analyzes such malicious concepts. In addition, we investigate from a psychological perspective why privacy dark strategies are effective. The resulting framework allows for a better understanding of these dark concepts, fosters awareness, and supports the development of countermeasures. We aim to contribute to an easier detection and successive removal of such approaches from the Internet to the benefit of its users.

Erb, Benjamin
Computing on Event-sourced Graphs
4th Graph-TA Workshop, Universitat Politècnica de Catalunya, Barcelona, Spain
März 2016

Zusammenfassung: While traditional graph computing usually employs batch processing, near-realtime computations on streaming data are often accomplished using event processing technologies. However, an increasing number of applications requires both computing capabilities for scenarios with highly dynamic and highly interconnected data fed by a stream of events. We suggest a novel platform architecture for graph computing that enables event-driven graph dynamicity while also supporting complex, long-running graph computations within the same system. To this end, we combine a vertex-based programming model, an asynchronous concurrency model using message passing, and an alternative persistence approach that is based on event sourcing. As a result, our approach allows for computations on dynamic live graphs as well as decoupled batch computations on graph snapshots. We also support the reconstruction of arbitrary previous graph states as well as temporal graph computations. Furthermore, our approach enables retroactive modifications of snapshot branches, so that alternate histories can be explored or future states of the graph can be simulated and predicted.

2015

Erb, Benjamin; Kargl, Frank
A Conceptual Model for Event-sourced Graph Computing
Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems aus DEBS '15 , Seite 352-355.
Herausgeber: ACM, New York, NY, USA
Juni 2015
ISBN: 978-1-4503-3286-6
Erb, Benjamin
Towards Distributed Processing on Event-sourced Graphs (Extended Abstract)
Doctoral Symposium, 9th ACM International Conference on Distributed Event-Based Systems
Juni 2015

2014

Domaschka, Jörg; Hauser, Christopher B.; Erb, Benjamin
Reliability and Availability Properties of Distributed Database Systems
Enterprise Distributed Object Computing Conference (EDOC), 2014 18th IEEE International
September 2014
akzeptiert
Erb, Benjamin; Kargl, Frank
Combining Discrete Event Simulations and Event Sourcing
7th International ICST Conference on Simulation Tools and Techniques, SIMUTools '14 , Seite 51-55.
August 2014
ISBN: 978-1-63190-007-5
Engelmann, Felix; Lukaseder, Thomas; Erb, Benjamin; van der Heijden, Rens W.; Kargl, Frank
Dynamic Packet-filtering in High-speed Networks Using NetFPGAs
Proceedings of the 3rd International Conference on Future Generation Communication Technology (Best Paper Award) , Seite 55-59.
Herausgeber: IEEE,
August 2014
Erb, Benjamin; Kargl, Frank; Domaschka, Jörg
Concurrent programming in web applications
it-Information Technology, 56(3):119--126
Mai 2014

2012

Erb, Benjamin
Concurrent Programming for Scalable Web Architectures
Diplomarbeit VS-D01-2012
Institut für Verteilte Systeme, Universität Ulm,
April 2012

Zusammenfassung: Web architectures are an important asset for various large-scale web applications, such as social networks or e-commerce sites. Being able to handle huge numbers of users concurrently is essential, thus scalability is one of the most important features of these architectures. Multi-core processors, highly distributed backend architectures and new web technologies force us to reconsider approaches for concurrent programming in order to implement web applications and fulfil scalability demands. While focusing on different stages of scalable web architectures, we provide a survey of competing concurrency approaches and point to their adequate usages.

2011

Erb, Benjamin; Kaufmann, Stefan; Schlecht, Tobias; Schaub, Florian; Weber, Michael
diretto: A Toolkit for Distributed Reporting and Collaboration
Mensch & Computer 2011 (MC 2011)
Chemnitz
September 2011

2009

Erb, Benjamin; Elsholz, Jan-Patrick; Hauck, Franz J.
Semantic Mashup: Mashing up Information in the Todays World Wide Web - An Overview
Technischer Bericht
Dokument Nummer: VS-R08-2009
Institut für Verteilte Systeme, Universität Ulm,
2009
Export als: BibTeX, XML

Teaching

Lab Courses

Seminars and Student Projects

Student Theses

Bachelor/Master/Diploma Theses

The section lists open and finished topics for theses. More topics for Bachelor/Master/Diploma theses are available on the thesis website of the institute.

Please note that I am currently not able to advise any additional student theses. Please get in touch with Dominik Meißner instead.

Office Hours

For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.

Open Topics for Theses


7.
default
Erb, Benjamin; Meißner, Dominik
Blockchain Analysis with Chronograph
Bachelor's thesis, Master's thesis or individual lab project
Institute of Distributed Systems,
2018
in Vorbereitung

Marker: PROJEKT, AA, BA, MA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Blockchain technology allows for decentralized, distributed, and secure ledgers that store records (e.g., transactions). Popular blockchain-based systems such as Bitcoin and Etherum have emerged as so-called crypto-currencies. As the ledger maintains the full history of transactions, interactions within the system are always persisted. In this work, the student is asked to design and implement online and offline transaction analyses based on Chronograph, a data processing platform for evolving graphs developed at our Institute. Therefore, different blockchain-based systems should be surveyed and appropriate analysis mechanisms should be conducted.

6.
default
Erb, Benjamin; Meißner, Dominik
Pause/Shift/Resume in Chronograph
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Pause/Shift/Resume is a mechanism for doing iterative graph processing on an evolving graph using snapshots. Our Chronograph graph processing platform provides very similar functionalities based on an event-sourced graph model. In this work, the student is asked to incorporate the Pause/Shift/Resume mechanism into our platform. Therefore, the mechanism has to be adapted and adjusted to event-sourced graphs. Furthermore, an evaluation should highlight the runtime behavior of the approach in different workloads.

5.
default
Erb, Benjamin; Meißner, Dominik
Evaluation of Key/Value Stores for Event Sourcing
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Event sourcing is an alternative persistence approach that maintains a log of state-changing events instead of altering states directly. Event-sourced architectures require an event store for efficiently appending and retrieving log entries. In this project, an evaluation of different key/value stores and alternative (No)SQL stores is to be conducted in order to identify stores appropriate for event sourcing.

4.
default
Erb, Benjamin; Meißner, Dominik
Design and Implementation of a REPL Interface for a Distributed Graph Processing Platform
Bachelor thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

3.
default
Erb, Benjamin; Meißner, Dominik
Secondary Index Structures on Event-sourced Graphs
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: As part of an ongoing research project at our institute, we are currently developing a novel distributed computing platform prototype. The systems provides a graph-based, asynchronous programming model and takes advantage of event sourcing for history-aware computations. The aim of this student work is the identification and evaluation of appropriate secondary index structures, in order to provide fast access onto specific notes of the graph topology. Also, a prototypical implementation is part of this work.

2.
default
Erb, Benjamin; Meißner, Dominik
Interactive exploration of event-sourced graphs
Master's thesis, Diploma thesis, or Project (8 or 16 ECTS)
Institute of Distributed Systems,
2016
in Vorbereitung

Marker: AA, MA, DA, PROJEKT, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: The chronograph platform is a system for computing on evolving graphs. One module of the platform should provide an interactive user interface for exploring the history, evolution, and topology of the graph. The goal of this project is the design and implementation of a scalable, web-based user interface for the exploration of chronograph data.

1.
default
Erb, Benjamin
Data mining on distributed, asynchronous graph platforms
Bachelor's thesis
Institute of Distributed Systems,
2016
in Vorbereitung

Marker: AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed

Zusammenfassung: As part of an ongoing research project at our institute, we are currently developing a novel distributed computing platform prototype. The systems provides a graph-based, asynchronous programming model and takes advantage of event sourcing for history-aware computations. The aim of this student work is to compile a survey of data mining mechanisms that can be executed on graphs. Specifically, asynchronicity has to be considered here. As a result, our current prototype should be evaluated on how it suits existing graph mining approaches.

Finished Theses


2013

1.
default
Irlinger, Laura
Design & Durchführung einer Benutzerstudie zur Nutzung von Netzwerksimulatoren
Bachelorarbeit VS-B06-2013
Institut für Verteilte Systeme, Universität Ulm,
Oktober 2013

Zusammenfassung: Im Rahmen dieser Arbeit wurde eine Benutzerstudie durchgeführt, die sich mit Fragen der Benutzerbarkeit und Komplexität von Netzwerksimulatoren befasst und offene Problemstellungen für Anwender von Netzwerksimulatoren identifizierte.

Individual Student Projects

Master Projects

I provide a number of  individual master projects that are related to my field of research. Several student thesis topics can also be worked on as part of a master project.

Most projects can be conducted as 8 LP or 16 LP projects, depending on the focus and extent of the topic.

For more details, please get in touch with me.

Office Hours

For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.

Open Topics for Projects


Erb, Benjamin; Meißner, Dominik
Blockchain Analysis with Chronograph
Bachelor's thesis, Master's thesis or individual lab project
Institute of Distributed Systems,
2018
in Vorbereitung

Marker: PROJEKT, AA, BA, MA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Blockchain technology allows for decentralized, distributed, and secure ledgers that store records (e.g., transactions). Popular blockchain-based systems such as Bitcoin and Etherum have emerged as so-called crypto-currencies. As the ledger maintains the full history of transactions, interactions within the system are always persisted. In this work, the student is asked to design and implement online and offline transaction analyses based on Chronograph, a data processing platform for evolving graphs developed at our Institute. Therefore, different blockchain-based systems should be surveyed and appropriate analysis mechanisms should be conducted.

Erb, Benjamin; Meißner, Dominik
Pause/Shift/Resume in Chronograph
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Pause/Shift/Resume is a mechanism for doing iterative graph processing on an evolving graph using snapshots. Our Chronograph graph processing platform provides very similar functionalities based on an event-sourced graph model. In this work, the student is asked to incorporate the Pause/Shift/Resume mechanism into our platform. Therefore, the mechanism has to be adapted and adjusted to event-sourced graphs. Furthermore, an evaluation should highlight the runtime behavior of the approach in different workloads.

Erb, Benjamin; Meißner, Dominik
Evaluation of Key/Value Stores for Event Sourcing
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: Event sourcing is an alternative persistence approach that maintains a log of state-changing events instead of altering states directly. Event-sourced architectures require an event store for efficiently appending and retrieving log entries. In this project, an evaluation of different key/value stores and alternative (No)SQL stores is to be conducted in order to identify stores appropriate for event sourcing.

Erb, Benjamin; Meißner, Dominik
Design and Implementation of a REPL Interface for a Distributed Graph Processing Platform
Bachelor thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Erb, Benjamin; Meißner, Dominik
Secondary Index Structures on Event-sourced Graphs
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in Vorbereitung

Marker: PROJEKT, AA, BA, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: As part of an ongoing research project at our institute, we are currently developing a novel distributed computing platform prototype. The systems provides a graph-based, asynchronous programming model and takes advantage of event sourcing for history-aware computations. The aim of this student work is the identification and evaluation of appropriate secondary index structures, in order to provide fast access onto specific notes of the graph topology. Also, a prototypical implementation is part of this work.

Erb, Benjamin; Meißner, Dominik
Interactive exploration of event-sourced graphs
Master's thesis, Diploma thesis, or Project (8 or 16 ECTS)
Institute of Distributed Systems,
2016
in Vorbereitung

Marker: AA, MA, DA, PROJEKT, BenjaminErb, FrankKargl, sidgraph, distributed, DominikMeissner

Zusammenfassung: The chronograph platform is a system for computing on evolving graphs. One module of the platform should provide an interactive user interface for exploring the history, evolution, and topology of the graph. The goal of this project is the design and implementation of a scalable, web-based user interface for the exploration of chronograph data.

Seminars

Seminar Courses

  • Privacy in the Internet (PRIV)
  • Selected Topics in Distributed Systems (ATVS)
  • Research Trends in Distributed Systems (RTDS)

Office Hours

For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.

Previous Topics

  1. Architectures for Data-intensive Applications  (Seminar RTDS; Winter Term 2017)
  2. Spatio-temporal Networks (Seminar ATVS; Winter Term 2016/2017)
  3. The Psychology of Social Engineering (Seminar ATVS; Summer Term 2016)
  4. Apache Kafka  (Seminar RTDS; Summer Term 2016)
  5. Platforms for Temporal Graph Analysis  (Seminar RTDS; Winter Term 2015/2016)
  6. Social Graph Mining & Social Network Analysis (Seminar ATVS; Winter Term 2015/2016)
  7. Psychologische Aspekte von Privacy (Proseminar PRIV; Winter Term 2015/2016)
  8. Auswirkungen von Big Data & Data Mining auf Privacy (Proseminar PRIV; Winter Term 2015/2016)
  9. Big Data on Graphs  (Seminar RTDS; Summer  Term 2015)
  10. Lambda Architectures for Neartime & Batch Processing (Seminar RTDS; Summer  Term 2015)
  11. Time Models in Distributed Systems & Applications (Seminar ATVS; Summer  Term 2015)
  12. Java Serialization (Seminar KTT; Summer  Term 2015)
  13. Distributed Systems Archaeology (Seminar RTDS; Winter Term 2014/2015)
  14. Verteilte Graph-Algorithmen (Seminar ATVS; Winter Term 2014/2015)
  15. Psychologische Aspekte von Privacy (Proseminar PRIV; Winter Term 2014/2015)
  16. Graphenbasierte Computing-Frameworks (Seminar RTDS; Summer Term 2014)
  17. Commutative Replicated Data Types (Seminar ATVS; Summer Term 2014)
  18. Reactive Programming (Seminar ATVS; Summer Term 2014)
  19. Erlang's OTP Library (Seminar RTDS; Winter Term 2013/2014)
  20. Flow-based Programming (Seminar RTDS; Winter Term 2013/2014)
  21. Event Sourcing & Command-Query Responsibility Segregation (Seminar ATVS; Winter Term 2013/2014)
  22. Privacy in Sozialen Netzwerken (Proseminar PRIV; Winter Term 2013/2014)
  23. Auswirkungen von Big Data & Data Mining auf Privacy (Proseminar PRIV; Winter Term 2013/2014)
  24. Psychologische Aspekte von Privacy (Proseminar PRIV; Winter Term 2013/2014)
  25. Das Disruptor Pattern (Seminar RTDS; Summer Term 2013)
  26. Software Defined Networking (Seminar RTDS; Summer Term 2013)
  27. Time-Warp Algorithmus für nebenläufige Simulationen (Seminar ATVS; Summer Term 2013)
  28. Der Lebenszyklus von Objekten in Java (Proseminar KTT; Summer Term 2013)
  29. Konzepte für HTTP/2.0 (Seminar RTDS; Winter Term 2012/2013)
  30. Persistent Data Structures (Seminar ATVS; Winter Term 2012/2013)
  31. Verteiltes Entwickeln und Testen – Am Beispiel von Vagrant & Puppet (Seminar ATVS; Winter Term 2012/2013)
  32. Off-the-Record Messaging (Proseminar PRIV; Winter Term 2012/2013)
  33. Privacy Issues in Micro-Blogging-Diensten (Proseminar PRIV; Winter Term 2012/2013)
  34. Foto-Tagging in Sozialen Netzen (Proseminar PRIV; Winter Term 2012/2013)
  35. Facebook und Privacy Settings (Proseminar PRIV; Winter Term 2012/2013)