A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization

Dominik Gall, Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization-i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and best-case parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.

Original languageEnglish (US)
Pages (from-to)110-135
Number of pages26
JournalTheory of Computing Systems
Volume55
Issue number1
DOIs
StatePublished - Jul 2014

Keywords

  • Distributed algorithms
  • Distributed systems
  • Overlay networks
  • Peer-to-peer systems
  • Performance
  • Self-stabilization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization'. Together they form a unique fingerprint.

  • Cite this