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.DISC.2017.43
URN: urn:nbn:de:0030-drops-79829
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7982/
Go to the corresponding LIPIcs Volume Portal

Blin, Lélia ; Tixeuil, Sébastien

Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs

pdf-format:
LIPIcs-DISC-2017-43.pdf (0.3 MB)

Abstract

We present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log Delta, log log n}) bits per node, where n is the network size and Delta its degree. This complexity is sub-logarithmic in n when Delta = n^o(1).

BibTeX - Entry

@InProceedings{blin_et_al:LIPIcs:2017:7982,
  author =	{L{\'e}lia Blin and S{\'e}bastien Tixeuil},
  title =	{{Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{43:1--43:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Andr{\'e}a W. Richa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7982},
  URN =		{urn:nbn:de:0030-drops-79829},
  doi =		{10.4230/LIPIcs.DISC.2017.43},
  annote =	{Keywords: Leader Election, Self-stabilization, Memory Complexity, Arbitrary Graphs}
}

Keywords: Leader Election, Self-stabilization, Memory Complexity, Arbitrary Graphs
Collection: 31st International Symposium on Distributed Computing (DISC 2017)
Issue Date: 2017
Date of publication: 12.10.2017

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