Akademischer Mitarbeiter
For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.
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.
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.
2018 |
|
SDN-Assisted Network-Based Mitigation of Slow DDoS Attacks
SecureComm'18,
August
2018
accepted
|
2017 |
|
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
June
2017
|
|
Consistent Retrospective Snapshots in Distributed Event-sourced Systems
Proceedings of the International Conference on Networked Systems 2017
March
2017
|
2016 |
|
Chronograph–A Distributed Platform for Event-Sourced Graph Computing
Proceedings of the Posters and Demos Session of the 17th International Middleware Conference
December
2016
|
|
Is Elasticity of Scalable Databases a Myth?
4th Workshop on Scalable Cloud Data Management
December
2016
|
|
A Comparison of TCP Congestion Control Algorithms in 10G Networks
Proceedings of the 41st IEEE Conference on Local Computer Networks (LCN)
, page 706-714.
November
2016
DOI: 10.1109/LCN.2016.121
|
|
Setting Up a High-Speed TCP Benchmarking Environment — Lessons Learned
Proceedings of the 41st IEEE Conference on Local Computer Networks (LCN)
, page 160-163.
November
2016
DOI: 10.1109/LCN.2016.32
|
|
Mobile Triage Management in Disaster Area Networks Using Decentralized Replication
Proceedings of the Tenth ACM MobiCom Workshop on Challenged Networks
, page 7-12.
Publisher: ACM,
October
2016
ISBN: 978-1-4503-4256-8
|
|
On the Potential of Event Sourcing for Retroactive Actor-based Programming
Proceedings of the 1st Workshop on Programming Models and Languages for Distributed Computing
July
2016
|
|
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
, page 49-54.
Publisher: ACM,
July
2016
ISBN: 978-1-4503-4344-2
|
|
Tales from the Dark Side: Privacy Dark Strategies and Privacy Dark Patterns
Proceedings on Privacy Enhancing Technologies,
2016(4):237-254
July
2016
|
|
Computing on Event-sourced Graphs
4th Graph-TA Workshop, Universitat Politècnica de Catalunya, Barcelona, Spain
March
2016
|
2015 |
|
A Conceptual Model for Event-sourced Graph Computing
Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems
of DEBS '15
, page 352-355.
Publisher: ACM, New York, NY, USA
June
2015
ISBN: 978-1-4503-3286-6
|
|
Towards Distributed Processing on Event-sourced Graphs (Extended Abstract)
Doctoral Symposium, 9th ACM International Conference on Distributed Event-Based Systems
June
2015
|
2014 |
|
Reliability and Availability Properties of Distributed Database Systems
Enterprise Distributed Object Computing Conference (EDOC), 2014 18th IEEE International
September
2014
DOI: 10.1109/EDOC.2014.38
accepted
|
|
Combining Discrete Event Simulations and Event Sourcing
7th International ICST Conference on Simulation Tools and Techniques, SIMUTools '14
, page 51-55.
August
2014
ISBN: 978-1-63190-007-5
|
|
Dynamic Packet-filtering in High-speed Networks Using NetFPGAs
Proceedings of the 3rd International Conference on Future Generation Communication Technology (Best Paper Award)
, page 55-59.
Publisher: IEEE,
August
2014
|
|
Concurrent programming in web applications
it-Information Technology,
56(3):119--126
May
2014
|
2012 |
|
Concurrent Programming for Scalable Web Architectures
Diplomarbeit VS-D01-2012
Institut für Verteilte Systeme, Universität Ulm,
April
2012
DOI: 10.18725/OPARU-2423
|
2011 |
|
diretto: A Toolkit for Distributed Reporting and Collaboration
Mensch & Computer 2011 (MC 2011)
Chemnitz
September
2011
|
2009 |
|
Semantic Mashup: Mashing up Information in the Todays World Wide Web - An Overview
Technischer Bericht
Document number: VS-R08-2009
Institut für Verteilte Systeme, Universität Ulm,
2009
|
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.
For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.
7. 
|
Blockchain Analysis with Chronograph
Bachelor's thesis, Master's thesis or individual lab project
Institute of Distributed Systems,
2018
in preparation
Abstract: 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.
|
Pause/Shift/Resume in Chronograph
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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.
|
Evaluation of Key/Value Stores for Event Sourcing
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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.
|
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 preparation
|
|
3.
|
Secondary Index Structures on Event-sourced Graphs
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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.
|
Interactive exploration of event-sourced graphs
Master's thesis, Diploma thesis, or Project (8 or 16 ECTS)
Institute of Distributed Systems,
2016
in preparation
Abstract: 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.
|
Data mining on distributed, asynchronous graph platforms
Bachelor's thesis
Institute of Distributed Systems,
2016
in preparation
Abstract: 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. |
2017 | |
|
26.
|
A Methodology for Performance Analysis and Performance Engineering of Distributed Event-sourced Systems
Masterarbeit VS-M22-2017
Institut für Verteilte Systeme, Universität Ulm,
October
2017
Abstract: Distributed event-sourced systems adopt a fairly new architectural style for data-intensive applications that maintain the complete history of the application state. However, the performance implications of such systems is 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 incorporate the specific properties of distributed event-sourced systems, such as messaging and event persistence. To address this problem, we developed a methodology for performance engineering and performance analysis of distributed event-sourced systems as part of a software engineering process. This approach helps developers to identify bottlenecks and resolve performance issues based on specific micro benchmarks and subsequent targeted optimizations. To show the practicality of our methology, we applied it to the \cg platform to improve the overall performance of its current research prototype. Using our structured approach, we improved the performance of the prototype system and made it more than twice as fast for certain workloads. |
|
25.
|
Design and Implementation of an Web-based API and Interactive Dashboard
Bachelorarbeit VS-B07-2017
Institut für Verteilte Systeme, Universität Ulm,
May
2017
|
|
24.
|
Asynchrones latentes Snapshotting von dynamischen event-sourced Systemen
Bachelorarbeit VS-B05-2017
Institut für Verteilte Systeme, Universität Ulm,
March
2017
|
2016 | |
|
23.
|
A Persistence Layer for Distributed Event-Sourced Architectures
Masterarbeit VS-M09-2016
Institut für Verteilte Systeme, Universität Ulm,
August
2016
Abstract: Due to the increasingly large amount of data which is collected and processed each day, enabling fast, reliable, and scalable distributed computing on very large datasets has become more important than ever. Unfortunately, distributed computation on large inhomogeneous datasets is still time-consuming and it is very difficult to make evaluations and predictions. To address these issues, event sourcing and graph computing are relevant topics. While event sourcing provides techniques to save data in a particular way, which enables evaluations and makes predictions possible, graph computing provides a way to distribute the computation on large datasets. Although there is a conceptual idea which addresses these issues, no practical experience how such a concept can be implemented in case of persistence and communication is available. As a result, a prototype system to measure and evaluate different persistence and communication implementations for distributed event-sourced architectures using event sourcing and graph computing needs to be created. Such a system can be used to find a way how to persist and work on large distributed inhomogeneous datasets efficiently. |
|
22.
|
Performance Engineering in verteilten, polyglotten Berechnungsplattformen
Masterarbeit VS-M08-2016
Institut für Verteilte Systeme, Universität Ulm,
June
2016
|
|
21.
|
Vergleich und Evaluierung von Time Series Databases
Bachelorarbeit VS-B07-2016
Institut für Verteilte Systeme, Universität Ulm,
May
2016
|
|
20.
|
Enabling Retroactive Computing Through Event Sourcing
Masterarbeit VS-M01-2016
Institut für Verteilte Systeme, Universität Ulm,
April
2016
Abstract: Event sourcing is a style of software architecture wherein state altering operations to an application are captured as immutable events. Each event is appended to an event log, with the current state of a system derived from this series of events. This thesis addresses the utilization of retroactive capabilities in event-sourced systems: computing alternate application states, post hoc bug fixes, or the support of algorithms which have access to their own history, for example. The possibility of retroactively accessing and modifying this event log is a potential capability of an event-sourced system, but a detailed exploration how these operations can be facilitated and supported has not yet been conducted. We examine how retroaction can be applied to event-sourced systems and discuss conceptual considerations. Furthermore, we demonstrate how different architectures can be used to provide retroaction and describe the prototypical implementation of an appropriate programming model. These findings are applied in the Chronograph research project, in order to utilize potential temporal aspects of this platform. |
2015 | |
|
19.
|
Distributed Versioning and Snapshot Mechanisms on Event-Sourced Graphs
Masterarbeit VS-M13-2015
Institut für Verteilte Systeme, Universität Ulm,
October
2015
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. |
|
18.
|
Designing a Disaster Area Network for First Responders in Disastrous and Emergency Scenarios
Bachelorarbeit VS-B18-2015
Institut für Verteilte Systeme, Universität Ulm,
October
2015
Abstract: Man-made disasters, earthquakes, floods, and other natural disasters come with a great number of casualties, which have to be treated as quickly as possible by emergency services to minimize fatalities. Due to the large number of casualties and aid workers, it is difficult to maintain an accurate overview of the situation. To improve the clarity of the situation, a comprehensive support system can be used for the forces on-site, which supports them in information gathering and distribution to all involved parties. Previous work has failed to implement independency of public infrastructure (e.g. power grid, cellular network) or suffer data loss due to single node failures. To solve this problem, we propose a fault-tolerant design that fully distributes information to all devices in a mobile ad hoc network, while allowing offline work outside of it. We present a proof-of-concept prototype for the proposed design and show that its data distribution component behaves as designed using a series of trials. To the best of our knowledge, there is currently no DAN system that uses multi master replication to fully distribute data, where every node has an individual copy of every piece of information. |
|
17.
|
An Evaluation of Distributed Approaches to Large-Scale Graph Computing
Bachelorarbeit VS-B09-2015
Institut für Verteilte Systeme, Universität Ulm,
October
2015
Abstract: This thesis takes a look at several considerations for developers and users of distributed graph computing platforms. Two popular computing platforms, Apache Giraph on Hadoop and the GraphX library in Apache Spark, are analyzed and tested through a benchmarking process. We examine a basic PageRank and ConnectedComponents algorithm for a variety of input graphs and cluster sizes. We hereby discover how immensely different parameters of distributed graph computations, such as graph sizes and topology properties, impact the execution time. Concluding, we carve out the application fields, for which both platforms are practical and where trade-offs have to be made. |
|
16.
|
Verhalten von TCP-Varianten in Hochgeschwindigkeitsnetzwerken
Bachelorarbeit VS-B08-2015
Institut für Verteilte Systeme, Universität Ulm,
September
2015
|
|
15.
|
Verwendung von CRDTs in mobilen verteilten Anwendungen
Bachelorarbeit VS-B07-2015
Institut für Verteilte Systeme, Universität Ulm,
July
2015
Abstract: Einen Ansatz für asynchrone Datenhaltung in verteilten Systemen bieten Conflict-free Replicated Data Types (CRDT). Sie stellen Verfügbarkeit über strikte Konsistenz, trotzdem konvergieren die Zustände der Datentypen zu einem späteren Zeitpunkt mit Hilfe einfacher mathematischer Annahmen wie Kommutativität oder den Eigenschaften eines Halbverbandes. Diese Arbeit erklärt die Grundsätze, Unterscheidungsmöglichkeiten, Funktionsweisen, Anwendungsfälle und Probleme dieser CRDTs und überträgt deren Konzepte anschließend in den mobilen Kontext. Dabei werden auf theoretischer Basis zunächst geeignete Anwendungsszenarien unter verschiedenen Kriterien untersucht und anschließend ein Framework entwickelt, mit dem Entwickler mobiler Anwendungen CRDT-Instanzen verschiedener Datentypen verwenden können, die automatisiert über mehrere Geräte repliziert werden. |
|
14.
|
Communication Patterns for Concurrent and Distributed Computations
Bachelorarbeit VS-B04-2015
Institut für Verteilte Systeme, Universität Ulm,
May
2015
Abstract: This bachelor thesis presents a catalog of communication patterns for concurrent and distributed computations. We compose this catalog by reviewing the inter-process communication in common concurrency models and surveying existing pattern resources, such as professional books and weblogs. In addition to the selection and composition of patterns, we determine our own pattern template structure and an appropriate visualization, specifically matching the requirements of communication patterns. The catalog itself consists of a variety of patterns, intended for the reader to get a grasp of proven solutions for recurring problems in the field of concurrent programming. We provide simplified examples for every solution by the means of message-passing. |
|
13.
|
Ereignisorientierte, diskrete Netzwerksimulation mit Pregel
Bachelorarbeit VS-B05-2015
Institut für Verteilte Systeme, Universität Ulm,
May
2015
Abstract: Diese Arbeit verfolgt das Ziel festzustellen, ob sich die Architektur von Pregel - ein Framework für verteilte Berechnungen auf großen Graphen - eignet, um eine ereignisorientiert-diskrete Netzwerksimulation zu implementieren. Dazu wurde ein Simulator entworfen, der das Verhalten eines Transportprotokolls innerhalb eines Computernetzwerks darstellt. In der Entwurfsphase hat es sich ergeben, dass die Konzepte, die eine ereignisorientiert-diskrete Simulation ausmachen, in Pregel umgesetzt werden können. Dieser Entwurf wurde praktisch umgesetzt, um innerhalb einer Evaluierung zu ermitteln, wie sich die Simulation verhält, je größer die Eingabe-Netzwerkgraphen werden. |
2014 | |
|
12.
|
Sicherheitsanalyse von NoSQL-Datenbanken
Bachelorarbeit VS-B15-2014
Institut für Verteilte Systeme, Universität Ulm,
October
2014
Abstract: NoSQL-Datenbanken werden immer häufiger produktiv eingesetzt, um die steigenden Datenmengen bewältigen zu können. Derzeit ist allerdings noch nicht klar, ob diese die notwendigen Sicherheitsanforderungen erfüllen. Zu diesem Zweck stellt die vorliegende Arbeit eine Methodik zur Sicherheitsanalyse von NoSQL-Datenbanken vor. Hierzu werden die wichtigsten Sicherheitsrisiken identifiziert und es wird aufgezeigt, wie eine NoSQL-Datenbank auf diese überprüft werden kann. Die Methodik wird auf die NoSQL-Vertreter Neo4j und CouchDB angewendet. Es zeigt sich hierbei, dass beide Datenbanken schwerwiegende Sicherheitsdefizite aufweisen. Deshalb werden Empfehlungen zur Steigerung der Informationssicherheit gegeben, die bei Beachtung die ermittelten Schwachstellen beheben. |
|
11.
|
A Collection of Privacy Patterns
Bachelorarbeit VS-B06-2014
Institut für Verteilte Systeme, Universität Ulm,
September
2014
Abstract: In dieser Arbeit wurde die Dokumentation von Patterns im Kontext von Privacy untersucht. Es wurden Anforderungen an die Struktur von Privacy Patterns diskutiert sowie die Kategorisierung von Privacy Patterns in einem Katalog betrachtet. Auf Basis einer eigenen Pattern-Struktur wurde dann anhand von exemplarischen Privacy Patterns ein kleiner, beispielhafter Katalog von Privacy Patterns vorgestellt. |
|
10.
|
Entwurf & Implementierung einer kollaborativen Web-Plattform zur Dokumentation von Design Patterns
Bachelorarbeit VS-B07-2014
Institut für Verteilte Systeme, Universität Ulm,
September
2014
Abstract: In dieser Arbeit wurde eine Plattform zur kollaborativen Dokumentation von Patterns entworfen und prototypisch implementiert. Hierfür wurden die Anforderungen für eine generische Plattform gesammelt und Konzepte für die kollaborative Nutzung erörtert. Die Implementierung verwendet verschiedene Konzepte des Web 2.0 zur Kollaboration und zeigt prototypisch den Funktionsumfang einer Plattform für Patterns verschiedener Anwendungsgebiete. |
|
9.
|
Intrusion Detection in Software Defined Networks
Bachelorarbeit VS-B02-2014
Institut für Verteilte Systeme, Universität Ulm,
July
2014
Abstract: Intrusion detection systems are valuable tools to improve security in a network. Due to growing network bandwidths not all packets can be investigated because of resource limitations. Special traffic filters can be used to forward only traffic that is suspected of containing intrusions. Software defined network is an architecture which allows to interact with a network in a programmable way. With OpenFlow a switch can be programmed reactive, were flows are created dynamically and proactive, were flows are created statically. This work evaluates the impact of filtering traffic proactive and reactive. Evaluated was the number of alerts the SNORT IDS generated. An emulated SDN testbed was used for the evaluation. Compared to forwarding without filtering, the traffic can be reduced by more than a half.The results show that supporting an IDS is possible with OpenFlow, either in a reactive or a proactive way. |
|
8.
|
Distributed Architecture using Event Sourcing & Command Query Responsibility Segregation
Bachelorarbeit VS-B04-2014
Institut für Verteilte Systeme, Universität Ulm,
July
2014
Abstract: In a common software system we occasionally want to know how we got to the current application state without making the system more complicated. Mostly, this question can not be answered because the software just saves the newest application state. Even if the software architects implement their own history support later, it can not tell anything about the previous changes. This is where Event Sourcing and Command Query Responsibility Segregation come into play. Event Sourcing saves every change as an event and Command Query Responsibility Segregation helps to handle the increased complexity. Therefore, we can build a system which provides a history support and which is still maintainable. If we use Event Sourcing and Command Query Responsibility Segregation, we just have to make small changes to a traditional architecture in order to fix that problem. By saving all changes as events we can evaluate everything we want. |
|
7.
|
Evaluation von Distributed Event Processing Frameworks für Zeitreihenanalysen
Bachelorarbeit VS-B03-2014
Institut für Verteilte Systeme, Universität Ulm,
July
2014
|
|
6.
|
Design und Implementierung eines skalierenden Database-as-a-Service Systems
Masterarbeit VS-M05-2014
Institut für Verteilte Systeme, Universität Ulm,
June
2014
Abstract: Datenbanksysteme stellen in Anwendungen die zentrale Komponente zur Persistierung von Daten dar. Die Speicherung der Daten kann über verschieden Datenmodelle, welche die Literatur in die Kategorien relational und NoSQL einteilt, realisiert werden. Die Datenmodelle bieten unterschiedliche Funktionalitäten in Bereichen wie Konsistenz, Verteilung und Skalierbarkeit. Skalierbarkeit stellt besonders für Datenbanken innerhalb Webanwendungen eine wichtige Anforderungen dar, da zum einen die Nutzeranzahl von Webanwendungen immer weiter steigt und zum anderen die Webanwendungen starke Lastschwankungen bewältigen müssen. Um diese Lastschwankungen verarbeiten zu können, werden flexible Ressourcen benötigt, die das Cloud-Computing verspricht. Diese Arbeit betrachtet die Cloud-Computing-Architektur des DBaaS, welche Datenbanken als abstrakte Ressource bereitstellt. Der Schwerpunkt liegt hierbei auf skalierenden DBaaS-Systemen. Das Ziel dieser Arbeit besteht aus dem Design und der Implementierung eines DBaaS-Dienstes, der eine automatisierte Skalierung bietet und auf frei verfügbarer Software basiert. Hierfür werden die Anforderungen eines solchen DBaaS-Dienstes anhand eines Anwendungsfalls herausgearbeitet und die Skalierbarkeit existierender Datenbanken auf Basis von Benchmarks untersucht. Aus diesen Ergebnissen wird ein prototypisches DBaaS-System umgesetzt. |
|
5.
|
Design und Implementierung eines zuverlässigen und verfügbaren (NoSQL) Datenbanksystems
Masterarbeit OMI-2014-M-02
Institut für Organisation und Management von Informationssystemen & Institut für Verteilte Systeme, Universität Ulm,
February
2014
Abstract: Datenbanken bilden das Rückgrat vieler Anwendungen. Wegen dieser zentralen Rolle sind Zuverlässigkeit und Ausfallsicherheit für sie essentiell. In dieser Arbeit sollen existierende Ansätze zur Fehlertoleranz bestehender relationaler und nicht-relationer Datenbanken zunächst untersucht und verglichen werden. Aufbauend darauf soll ein System mit Hilfe des Virtual Nodes Frameworks nachimplementiert werden. |
2013 | |
|
4.
|
Evaluation von existierenden Lösungen zur Simulation von Netzwerken
Bachelorarbeit VS-B05-2013
Institut für Verteilte Systeme, Universität Ulm,
October
2013
Abstract: Gegenstand dieser Arbeit ist die Erstellung eines aktuellen Surveys von bestehenden Netzwerksimulatoren, insbesondere für VANET-Simulationen. |
|
3.
|
Comparison of Concurrency Frameworks for the JVM
Bachelorarbeit VS-B13-2013
Institut für Verteilte Systeme, Universität Ulm,
October
2013
Abstract: Aufgrund von Multi-Core-CPUs wird Nebenläufigkeit ein zunehmend wichtigerer Teil bei der Programmierung von performanten und skalierbaren Anwendungen. Für Java existieren diverse Frameworks, die höhere Abstraktionen für Nebenläufigkeit anbieten und somit nebenläufige Programmierung vereinfachen. Im Rahmen dieser Bachelor-Arbeit wurden wichtigte Frameworks vorgestellt und miteinander verglichen. Ebenso wurde aufgezeigt, welche Frameworks sich für welche Einsatzzwecke besonders eignen. |
|
2.
|
Content-Inspection in Hochgeschwindigkeitsnetzen
Bachelorarbeit VS-B17-2013
Institut für Verteilte Systeme, Universität Ulm,
October
2013
Abstract: Computational power for content filtering in high-speed networks reaches a limit, but many applications as intrusion detection systems rely on such processes. Especially signature based methods need extraction of header fields. Hence we created an parallel protocol-stack parser module on the NetFPGA 10G architecture with a framework for simple adaption to custom protocols. Our measurements prove that the appliance operates at 9.5 Gb/s with a delay in order of any active hop. The work provides the foundation to use for application specific projects in the NetFPGA context. |
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.
For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.
|
Blockchain Analysis with Chronograph
Bachelor's thesis, Master's thesis or individual lab project
Institute of Distributed Systems,
2018
in preparation
Abstract: 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. |
|
Pause/Shift/Resume in Chronograph
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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. |
|
Evaluation of Key/Value Stores for Event Sourcing
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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. |
|
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 preparation
|
|
Secondary Index Structures on Event-sourced Graphs
Bachelor's thesis or individual lab project
Institute of Distributed Systems,
2017
in preparation
Abstract: 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. |
|
Interactive exploration of event-sourced graphs
Master's thesis, Diploma thesis, or Project (8 or 16 ECTS)
Institute of Distributed Systems,
2016
in preparation
Abstract: 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. |
For reliable meetings, please arrange an appointment via mail.
Otherwise, you can try to drop by at my office.
