Document Open Access Logo

Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks

Authors Antoine El-Hayek , Monika Henzinger , Stefan Schmid

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2023.47.pdf
  • Filesize: 1.02 MB
  • 21 pages

Document Identifiers

Author Details

Antoine El-Hayek
  • Faculty of Computer Science, Universität Wien, Austria
Monika Henzinger
  • Faculty of Computer Science, Universität Wien, Austria
Stefan Schmid
  • TU Berlin, Germany
  • Fraunhofer SIT, Darmstadt, Germany

Funding

This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 101019564). This work was further supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N, as well as the FWF project I 4800-N (ADVISE)

Cite AsGet BibTex

Antoine El-Hayek, Monika Henzinger, and Stefan Schmid. Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 47:1-47:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ITCS.2023.47

Abstract

Data dissemination is a fundamental task in distributed computing. This paper studies broadcast problems in various innovative models where the communication network connecting n processes is dynamic (e.g., due to mobility or failures) and controlled by an adversary. In the first model, the processes transitively communicate their ids in synchronous rounds along a rooted tree given in each round by the adversary whose goal is to maximize the number of rounds until at least one id is known by all processes. Previous research has shown a ⌈(3n-1)/2⌉-2 lower bound and an O(nlog log n) upper bound. We show the first linear upper bound for this problem, namely ⌈(1+√2) n-1⌉ ≈ 2.4n. We extend these results to the setting where the adversary gives in each round k-disjoint forests and their goal is to maximize the number of rounds until there is a set of k ids such that each process knows of at least one of them. We give a ⌈3(n-k)/2⌉-1 lower bound and a (π²+6)/6 n+1 ≈ 2.6n upper bound for this problem. Finally, we study the setting where the adversary gives in each round a directed graph with k roots and their goal is to maximize the number of rounds until there exist k ids that are known by all processes. We give a ⌈3(n-3k)/2⌉+2 lower bound and a ⌈(1+√2)n⌉+k-1 ≈ 2.4n+k upper bound for this problem. For the two latter problems no upper or lower bounds were previously known.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Networks → Network algorithms
Keywords
  • broadcast
  • cover
  • k-broadcast
  • dynamic radius
  • dynamic graphs
  • oblivious message adversary
  • time complexity

Metrics

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

Related Versions

References

  1. Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. The k-simultaneous consensus problem. Distributed Comput., 22(3):185-195, 2010. URL: https://doi.org/10.1007/s00446-009-0090-8.
  2. Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, and Gopal Pandurangan. The communication cost of information spreading in dynamic networks. In 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019, Dallas, TX, USA, July 7-10, 2019, pages 368-378. IEEE, 2019. URL: https://doi.org/10.1109/ICDCS.2019.00044.
  3. Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. Approximate consensus in highly dynamic networks: The role of averaging algorithms. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 528-539. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-47666-6_42.
  4. Bernadette Charron-Bost and André Schiper. The heard-of model: computing in distributed systems with benign faults. Distributed Comput., 22(1):49-71, 2009. URL: https://doi.org/10.1007/s00446-009-0084-6.
  5. Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, and Riccardo Silvestri. Rumor spreading in random evolving graphs. Random Struct. Algorithms, 48(2):290-312, 2016. URL: https://doi.org/10.1002/rsa.20586.
  6. Étienne Coulouma, Emmanuel Godard, and Joseph G. Peters. A characterization of oblivious message adversaries for which consensus is solvable. Theor. Comput. Sci., 584:80-90, 2015. URL: https://doi.org/10.1016/j.tcs.2015.01.024.
  7. Stefan Dobrev and Imrich Vrto. Optimal broadcasting in hypercubes with dynamic faults. Inf. Process. Lett., 71(2):81-85, 1999. URL: https://doi.org/10.1016/S0020-0190(99)00093-9.
  8. Stefan Dobrev and Imrich Vrto. Optimal broadcasting in tori with dynamic faults. Parallel Process. Lett., 12(1):17-22, 2002. URL: https://doi.org/10.1142/S0129626402000781.
  9. Antoine El-Hayek, Monika Henzinger, and Stefan Schmid. Brief announcement: Broadcasting time in dynamic rooted trees is linear. In Alessia Milani and Philipp Woelfel, editors, PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 54-56. ACM, 2022. URL: https://doi.org/10.1145/3519270.3538460.
  10. Faith Ellen, Barun Gorain, Avery Miller, and Andrzej Pelc. Constant-length labeling schemes for deterministic radio broadcast. ACM Trans. Parallel Comput., 8(3):14:1-14:17, 2021. URL: https://doi.org/10.1145/3470633.
  11. Pierre Fraigniaud and Emmanuel Lazard. Methods and problems of communication in usual networks. Discret. Appl. Math., 53(1-3):79-133, 1994. URL: https://doi.org/10.1016/0166-218X(94)90180-5.
  12. Matthias Függer, Thomas Nowak, and Kyrill Winkler. On the radius of nonsplit graphs and information dissemination in dynamic networks. Discret. Appl. Math., 282:257-264, 2020. URL: https://doi.org/10.1016/j.dam.2020.02.013.
  13. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, and Arthur L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319-349, 1988. URL: https://doi.org/10.1002/net.3230180406.
  14. Juraj Hromkovič, Ralf Klasing, Burkhard Monien, and Regine Peine. Dissemination of information in interconnection networks (broadcasting & gossiping). In Combinatorial network theory, pages 125-212. Springer, 1996. Google Scholar
  15. Fabian Kuhn, Nancy A. Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 513-522. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806760.
  16. Nicola Santoro and Peter Widmayer. Time is not a healer. In Burkhard Monien and Robert Cori, editors, STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, volume 349 of Lecture Notes in Computer Science, pages 304-313. Springer, 1989. URL: https://doi.org/10.1007/BFb0028994.
  17. Kyrill Winkler, Hugo Rincon Galeana, Ami Paz, Stefan Schmid, and Ulrich Schmid. The time complexity of consensus under oblivious message adversaries. In 14th Innovations in Theoretical Computer Science (ITCS), 2023. Google Scholar
  18. Martin Zeiner, Manfred Schwarz, and Ulrich Schmid. On linear-time data dissemination in dynamic rooted trees. Discret. Appl. Math., 255:307-319, 2019. URL: https://doi.org/10.1016/j.dam.2018.08.015.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact