TY - GEN
T1 - Fast Deterministic Algorithms for Highly-Dynamic Networks
AU - Censor-Hillel, Keren
AU - Dafni, Neta
AU - Kolobov, Victor I.
AU - Paz, Ami
AU - Schwartzman, Gregory
N1 - Publisher Copyright: © Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman; licensed under Creative Commons License CC-BY 24th International Conference on Principles of Distributed Systems (OPODIS 2020).
PY - 2021/1
Y1 - 2021/1
N2 - This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highlydynamic setting, in which arbitrarily many edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2) using only O(log n)-bit messages, (3) not posing any restrictions on the dynamic behavior of the environment, (4) being deterministic, (5) having strong guarantees for intermediate solutions, and (6) being applicable for a wide family of tasks. The tasks for which we deduce such an algorithm are maximal matching, (degree + 1)-coloring, 2-approximation for minimum weight vertex cover, and maximal independent set (which is the most subtle case). For some of these tasks, node insertions can also be among the allowed topology changes, and for some of them also abrupt node deletions.
AB - This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highlydynamic setting, in which arbitrarily many edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2) using only O(log n)-bit messages, (3) not posing any restrictions on the dynamic behavior of the environment, (4) being deterministic, (5) having strong guarantees for intermediate solutions, and (6) being applicable for a wide family of tasks. The tasks for which we deduce such an algorithm are maximal matching, (degree + 1)-coloring, 2-approximation for minimum weight vertex cover, and maximal independent set (which is the most subtle case). For some of these tasks, node insertions can also be among the allowed topology changes, and for some of them also abrupt node deletions.
KW - Dynamic distributed algorithms
UR - http://www.scopus.com/inward/record.url?scp=85101698252&partnerID=8YFLogxK
U2 - https://doi.org/10.4230/LIPIcs.OPODIS.2020.28
DO - https://doi.org/10.4230/LIPIcs.OPODIS.2020.28
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 24th International Conference on Principles of Distributed Systems, OPODIS 2020
A2 - Bramas, Quentin
A2 - Oshman, Rotem
A2 - Romano, Paolo
T2 - 24th International Conference on Principles of Distributed Systems, OPODIS 2020
Y2 - 14 December 2020 through 16 December 2020
ER -