Seite drucken

Gerry Siegemund

Foto von Gerry Siegemund
Gerry Siegemund
Raum 4.077, Gebäude E
Am Schwarzenberg-Campus 3
21073 Hamburg
Telefon040 42878 - 3448
Fax040 42878 - 2581
E-Mail

Im Juni 2011 habe ich mein Diplom-Studium Informatik-Ingenieurwesen an der TU Hamburg-Harburg abgeschlossen. Seit Februar 2012 bin ich als wissenschaftlicher Mitarbeiter am Institut für Telematik tätig.

Projekte

Publikationen

Volker Turau und Gerry Siegemund. Scalable Routing for Topic-based Publish/Subscribe Systems under Fluctuations. In Proceedings of International Conference on Distributed Computing Systems - ICDCS 2017, Juni 2017, pp. 1608–1617. Atlanta, USA.
@InProceedings{Telematik_ICDS_2017, author = {Volker Turau and Gerry Siegemund}, title = {Scalable Routing for Topic-based Publish/Subscribe Systems under Fluctuations}, booktitle = {Proceedings of International Conference on Distributed Computing Systems - ICDCS 2017}, pages = {1608-1617}, day = {5-8}, month = jun, year = 2017, location = {Atlanta, USA}, }
Abstract: The loose coupling and the inherent scalability make publish/subscribe systems an ideal candidate for event-driven services for wireless networks using low power protocols such as IEEE 802.15.4. This work introduces a distributed algorithm to build and maintain a routing structure for such networks.The algorithm dynamically maintains a multicast tree for each node. While previous work focused on minimizing these trees we aim to keep the effort to maintain them in case of fluctuations of subscribers low. The multicast trees are implicitly defined by a novel structure called augmented virtual ring. The main contribution is a distributed algorithm to build and maintain this augmented virtual ring. Maintenance operations after sub-and unsubscriptions require message exchange in a limited region only. We compare the average lengths of the constructed forwarding paths with an almost ideal approach. As a result of independent interest we present a distributed algorithm using messages of size O(logn) for constructing virtual rings of graphs that are on average shorter than rings based on depth first search.
Gerry Siegemund und Volker Turau. PSVR - Self-Stabilizing Publish/Subscribe Communication for Ad-Hoc Networks (Short Paper). In Proceedings of Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium, November 2016, pp. 346–351. Lyon, France.
@InProceedings{Telematik_SSS_2016, author = {Gerry Siegemund and Volker Turau}, title = {PSVR - Self-Stabilizing Publish/Subscribe Communication for Ad-Hoc Networks (Short Paper)}, booktitle = {Proceedings of Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium}, pages = {346-351}, day = {7-10}, month = nov, year = 2016, location = {Lyon, France}, }
Abstract: PSVR is a novel routing algorithm for pub/sub systems in ad-hoc networks focusing on scenarios where communications links are unstable and nodes frequently change subscriptions. It is a compromise of size and maintenance effort for routing tables due to sub- and unsubscriptions and the length of routing paths. Designed in a self-stabilizing manner it scales well with network size. The evaluation with real world deployment reveals that PSVR only needs slightly more messages than a close to optimal routing structure for publication delivery, and creates shorter routing paths than an existing self-stabilizing algorithm.
Stefan Lohs, Gerry Siegemund, Jörg Nolte und Volker Turau. Self-Stabilization - A Mechanism to Make Networked Embedded Systems More Reliable?. In Proceedings of 35th Symposium on Reliable Distributed Systems (SRDS), September 2016, pp. 317–326. Budapest, Hungary.
@InProceedings{Telematik_SRDS_2016, author = {Stefan Lohs and Gerry Siegemund and Jörg Nolte and Volker Turau}, title = {Self-Stabilization - A Mechanism to Make Networked Embedded Systems More Reliable?}, booktitle = {Proceedings of 35th Symposium on Reliable Distributed Systems (SRDS)}, pages = {317-326}, day = {26-29}, month = sep, year = 2016, location = {Budapest, Hungary}, }
Abstract: The erratic behavior of wireless channels is still a major hurdle in the implementation of robust applications in wireless networks. In the past it has been argued that self-stabilization is a remedy to provide the needed robustness. This assumption has not been verified to the extent necessary to convince engineers implementing such applications. A major reason is that the time in which a self-stabilizing system returns to a valid state is unpredictable and potentially unbound. Failure rates typically depend on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of its neighbors' states. When the frequency of state changes is too high, the system may never reach a state sufficiently stable for a specific task. In this paper we substantiate the conditions under which self-stabilization leads to fault tolerance in wireless networks and look at the myths about the power of self-stabilization as a particular instance of self-organization. We investigate the influences of the error rate and the neighbor state exchange rate on the stability and the convergence time on topology information acquired in real network experiments.

Die vollständige Publikationsliste ist separat verfügbar.

Betreute Arbeiten

Abgeschlossene Arbeiten