DROPS

Document

Brief Announcement

DOI: 10.4230/LIPIcs.DISC.2018.42

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks

Authors: Philipp Bamberger, Fabian Kuhn, and Yannic Maus

Published in: LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018)

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).

Cite as

Philipp Bamberger, Fabian Kuhn, and Yannic Maus. Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 42:1-42:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{bamberger_et_al:LIPIcs.DISC.2018.42,
  author =	{Bamberger, Philipp and Kuhn, Fabian and Maus, Yannic},
  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 =	{Schmid, Ulrich and Widder, Josef},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.42},
  URN =		{urn:nbn:de:0030-drops-98318},
  doi =		{10.4230/LIPIcs.DISC.2018.42},
  annote =	{Keywords: dynamic networks, distributed graph algorithms, MIS, vertex coloring}
}

Search Results

Documents authored by Bamberger, Philipp

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks

Abstract

Cite as

Thanks for your feedback!

Could not send message