Document Open Access Logo

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks

Authors Philipp Bamberger, Fabian Kuhn, Yannic Maus

PDF
Thumbnail PDF

File

LIPIcs.DISC.2018.42.pdf
  • Filesize: 223 kB
  • 4 pages

Document Identifiers

Author Details

Philipp Bamberger
  • University of Freiburg, Georges-Köhler-Allee 106, 79110 Freiburg, Germany
Fabian Kuhn
  • University of Freiburg, Georges-Köhler-Allee 106, 79110 Freiburg, Germany
Yannic Maus
  • University of Freiburg, Georges-Köhler-Allee 106, 79110 Freiburg, Germany

Funding

Second and third author were supported by ERC Grant No. 336495 (ACDC).

Cite AsGet BibTex

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)
https://doi.org/10.4230/LIPIcs.DISC.2018.42

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

Subject Classification

ACM Subject Classification
  • Networks → Network algorithms
Keywords
  • dynamic networks
  • distributed graph algorithms
  • MIS
  • vertex coloring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7(4):567-583, 1986. Google Scholar
  2. S. Assadi, K. Onak, B. Schieber, and S. Solomon. Fully dynamic maximal independent set with sublinear update time. In Proc. 50th ACM Symp. on Theory of Comp. (STOC), 2018. Google Scholar
  3. K. Censor-Hillel, E. Haramaty, and Z.S. Karnin. Optimal dynamic distributed MIS. In Proc. 35th ACM Symp. on Principles of Distr. Computing (PODC), pages 217-226, 2016. Google Scholar
  4. P. Fraigniaud, A. Korman, and D. Peleg. Local distributed decision. In Proc. 52nd Symp. on Foundations of Computer Sc. (FOCS), pages 708-717. IEEE Computer Society, 2011. Google Scholar
  5. M. Ghaffari. An improved distributed algorithm for maximal independent set. In Proc. 27th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 270-277, 2016. Google Scholar
  6. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comp., 15:1036-1053, 1986. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact