Fehlertolerante Middleware-Idiome basierend auf selbststabilisierenden Techniken


Project Acronym
Tolerance-Zone
 
Project Title
A Fault Tolerant Middleware Idioms based on Self-Stabilizing Techniques
 
Funding Code
TU 221/6-3
 
Institute
 
Principal Investigator
 
 
Status
Abgeschlossen
 
Duration
01-06-2011
-
31-08-2019
 
GEPRIS-ID
 
 
Project Abstract
Self-Stabilizing Algorithms (SSAs) have the inherent property to return into a stable state even when non-anticipated errors occur. This implicit robustness is certainly beneficial for error prone wireless networks. However, it comes at a price: convergence time is not predictable and possibly unbounded. Furthermore, neighboring nodes need to exchange state information periodically, which may lead to intolerable energy consumption.The ToleranceZone project investigates ways to implement self-stabilizing communication and middleware platforms for wireless ad hoc networks. Understanding the relationship between the rate of state exchange among neighbors and the convergence time is particularly important. Specifically we would like to know, whether self-stabilizing algorithms (SSAs) can cope with typical network topology changes in a reasonable time with a reasonable energy consumption.We started our research by implementing common communication patterns in a self-stabilizing way and evaluated our approach in experiments with real networks. We were able to show, that SSAs work in principle but we detected phenomenons that were both hard to explain and hard to reproduce. The bad reproducibility turned out to be our major challenge. Therefore we developed a methodology that allows us to feed topology data collected in real experiments into reproducible, deterministic simulations. This allows us to study the impact of topology changes on our SSAs as well as the impact of the exchange frequency to convergence time in detail.We could already show that SSAs are much more sensitive to topology changes than anticipated. Changes in the neighborhood are not implicitly repaired as expected, but may lead to significant instability on higher software layers resulting in either poor convergence time or no convergence at all. In fact, multiple SSAs on different layers tend to work against each other like contradicting control loops. These cross layer effects have a significant impact, but so far this phenomenon has not been studied. Therefore we will focus in the final phase of our project on understanding these interdependencies. Based on those insights we will derive cross layer feedback mechanisms that allow us to adapt the neighbor exchange rate to the perceived stability in the neighborhood. We will evaluate our approach with the aforementioned methodology as well as experiment with real networks. Finally we will compare the results against state of the art approaches to robustness in wireless networks.
 

Publications
(All)

Results 1-15 of 15

Issue DateTitleTypeAuthor(s)
1Dec-2020A distributed algorithm for finding Hamiltonian cycles in random graphs in O(log⁡n) timeArticleTurau, Volker 
21-Dec-2019Fulltext availableOpen AccessConcurrent distributed serving with mobile serversChapter/Article (Proceedings)Ghodselahi, Abdolhamid ; Kuhn, Fabian ; Turau, Volker 
3Jul-2019Making randomized algorithms self-stabilizingChapter/Article (Proceedings)Turau, Volker 
4Jun-2018A self-stabilizing publish/subscribe Middleware for IoT applicationsArticleSiegemund, Gerry ; Turau, Volker 
53-May-2018Fulltext availableOpen AccessComputing Fault-Containment Times of Self-Stabilizing Algorithms Using Lumped Markov ChainsArticleTurau, Volker 
62018A distributed algorithm for finding hamiltonian cycles in random graphs in O(Log n) timeChapter/Article (Proceedings)Turau, Volker 
77-Oct-2017Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumpingChapter/Article (Proceedings)Turau, Volker 
813-Jul-2017Scalable routing for topic-based publish/subscribe systems under fluctuationsChapter/Article (Proceedings)Turau, Volker ; Siegemund, Gerry 
921-Jun-2017A O(m) self-stabilizing algorithm for maximal triangle partition of general fraphsArticleNeggazi, Brahim ; Turau, Volker ; Haddad, Mohammed ; Kheddouci, Hamamache 
102017Fulltext availableOpen AccessSelf-stabilizing algorithms in wireless sensor networksThesisSiegemund, Gerry 
1120-Sep-2016A self-stabilizing algorithm for edge monitoring in wireless sensor networksArticleNeggazi, Brahim ; Haddad, Mohammed ; Turau, Volker ; Kheddouci, Hamamache 
1214-Apr-2016Fulltext availableOpen AccessA self-stabilizing algorithm for virtual ring constructionChapter/Article (Proceedings)Paulsen, Hans-Peter ; Siegemund, Gerry 
132-Aug-2015Self-stabilizing local k-placement of replicas with local minimum varianceArticleKöhler, Sven ; Turau, Volker 
142014Fulltext availableOpen AccessScalable fault-containing self-stabilization in dynamic networksThesisKöhler, Sven 
152013Fulltext availableOpen AccessGlueAPI joining REFLEX and CometOSTechnical ReportSiegemund, Gerry ; Lohs, Stefan