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.2018.42
URN: urn:nbn:de:0030-drops-98318
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9831/
Go to the corresponding LIPIcs Volume Portal


Bamberger, Philipp ; Kuhn, Fabian ; Maus, Yannic

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks

pdf-format:
LIPIcs-DISC-2018-42.pdf (0.2 MB)


Abstract

We define a generalization of local distributed graph problems to (synchronous round-based) dynamic networks and present a framework for developing algorithms for these problems. We require two properties from our algorithms: (1) They should satisfy non-trivial guarantees in every round. The guarantees should be stronger the more stable the graph has been during the last few rounds and they coincide with the definition of the static graph problem if no topological change appeared recently. (2) If a constant neighborhood around some part of the graph is stable during an interval, the algorithms quickly converge to a solution for this part of the graph that remains unchanged throughout the interval.

We demonstrate our generic framework with two classic distributed graph, namely (degree+1)-vertex coloring and maximal independent set (MIS).

BibTeX - Entry

@InProceedings{bamberger_et_al:LIPIcs:2018:9831,
  author =	{Philipp Bamberger and Fabian Kuhn and Yannic Maus},
  title =	{{Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks}},
  booktitle =	{32nd International Symposium on Distributed Computing  (DISC 2018)},
  pages =	{42:1--42:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Ulrich Schmid and Josef Widder},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9831},
  URN =		{urn:nbn:de:0030-drops-98318},
  doi =		{10.4230/LIPIcs.DISC.2018.42},
  annote =	{Keywords: dynamic networks, distributed graph algorithms, MIS, vertex coloring}
}

Keywords: dynamic networks, distributed graph algorithms, MIS, vertex coloring
Collection: 32nd International Symposium on Distributed Computing (DISC 2018)
Issue Date: 2018
Date of publication: 04.10.2018


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