Förderung: DFG-Projekt, 2008–2011

Hier beschäftigen wir uns mit selbststabilisierenden Overlay-Netzwerken, d.h. anwendungsorientierten Netzwerken, die sich aus jeder Situation, in dem schwacher Zusammenhang gewährleistet ist, wieder in einen legalen Zustand zurückversetzen können. Dieses soll ohne zentrale Kontrolle, d.h. rein durch lokale Interaktionen seiner Teilnehmer geschehen.

Aktuelle Forschungsberichte:

• A. Richa, C. Scheideler and P. Stevens. Self-stabilizing De Bruijn Networks. In 13th Intl. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011.
• R. Nor, M. Nesterenko and C. Scheideler. Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proc. of the 13th Intl. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011.
• S. Kniesburges, A. Koutsopoulos and C. Scheideler.
  Re-Chord: a self-stabilizing chord overlay network. 
  In 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011.
• D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid and H. Täubig.
  Time complexity of distributed topological self-stabilization: The case of graph linearization.
  In 9th Latin American Symposium on Theoretical Informatics (LATIN), 2010.
• R. Jacob, S. Ritscher, C. Scheideler and S. Schmid.
  A self-stabilizing local Delaunay graph construction.
  In 20th Intl. Symp. on Algorithms and Computation (ISAAC), 2009.
• R. Jacob, A. Richa, C. Scheideler, S. Schmid and Hanjo Täubig.
  A distributed polylograithmic time algorithm for self-stabilizin skip graphs.
  In 28th ACM Symp. on Principles of Distributed Computing (PODC), 2009.
• T. Clouser, M. Nesterenko and C. Scheideler.
  Tiara: A self-stabilizing skip list.
  In 10th Intl. Symp. on Stabilization, Safety and Security of Distributed Systems (SSS), 2008.
• M. Onus, A. Richa and C. Scheideler.
  Linearization: Locally self-stabilizing sorting in graphs.
  In Workshop on Algorithm Engineering and Experiments (ALENEX), 2007.