License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.19
URN: urn:nbn:de:0030-drops-61761
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6176/
Go to the corresponding LIPIcs Volume Portal

Rickmann, Christina ; Wagner, Christoph ; Nestmann, Uwe ; Schmid, Stefan

Topological Self-Stabilization with Name-Passing Process Calculi

pdf-format:
LIPIcs-CONCUR-2016-19.pdf (0.6 MB)

Abstract

Topological self-stabilization is the ability of a distributed system to have its nodes themselves establish a meaningful overlay network. Independent from the initial network topology, it converges to the desired topology via forwarding, inserting, and deleting links to neighboring nodes.

We adapt a linearization algorithm, originally designed for a shared memory model, to asynchronous message-passing. We use an extended localized pi-calculus to model the algorithm and to formally prove its essential self-stabilization properties: closure and weak convergence for every arbitrary initial configuration, and strong convergence for restricted cases.

BibTeX - Entry

@InProceedings{rickmann_et_al:LIPIcs:2016:6176,
  author =	{Christina Rickmann and Christoph Wagner and Uwe Nestmann and Stefan Schmid},
  title =	{{Topological Self-Stabilization with Name-Passing Process Calculi}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{19:1--19:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Jos{\'e}e Desharnais and Radha Jagadeesan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6176},
  URN =		{urn:nbn:de:0030-drops-61761},
  doi =		{10.4230/LIPIcs.CONCUR.2016.19},
  annote =	{Keywords: Distributed Algorithms, Fault Tolerance, Topological Self-Stabilization, Linearization, Process Calculi}
}

Keywords: Distributed Algorithms, Fault Tolerance, Topological Self-Stabilization, Linearization, Process Calculi
Collection: 27th International Conference on Concurrency Theory (CONCUR 2016)
Issue Date: 2016
Date of publication: 24.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI