Brief announcement: Broadcasting time in dynamic rooted trees is linear
El-Hayek A, Henzinger M, Schmid S. 2022. Brief announcement: Broadcasting time in dynamic rooted trees is linear. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distrubuted Computing, 54–56.
Download (ext.)
Conference Paper
| Published
| English
Scopus indexed
Author
Abstract
We study the broadcast problem on dynamic networks with n processes. The processes communicate in synchronous rounds along an arbitrary rooted tree. The sequence of trees is given by an adversary whose goal is to maximize the number of rounds until at least one process reaches all other processes. Previous research has shown a ⌈(3n-1)/(2)⌉-2 lower bound and an O(n log log n) upper bound. We show the first linear upper bound for this problem, namely ⌈(1 + √2) n-1⌉ ~2.4n. Our result follows from a detailed analysis of the evolution of the adjacency matrix of the network over time.
Publishing Year
Date Published
2022-07-21
Proceedings Title
Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher
Association for Computing Machinery
Acknowledgement
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, and by the Federal Ministry of Education and Research (BMBF, Germany), 6G-RIC under
Grant 16KISK020K. We would like to thank Kyrill Winkler for his
inputs and feedback on this paper.
Page
54-56
Conference
PODC: Symposium on Principles of Distrubuted Computing
Conference Location
Salerno, Italy
Conference Date
2022-07-25 – 2022-07-29
ISBN
IST-REx-ID
Cite this
El-Hayek A, Henzinger M, Schmid S. Brief announcement: Broadcasting time in dynamic rooted trees is linear. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:54-56. doi:10.1145/3519270.3538460
El-Hayek, A., Henzinger, M., & Schmid, S. (2022). Brief announcement: Broadcasting time in dynamic rooted trees is linear. In Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 54–56). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3519270.3538460
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538460.
A. El-Hayek, M. Henzinger, and S. Schmid, “Brief announcement: Broadcasting time in dynamic rooted trees is linear,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 54–56.
El-Hayek A, Henzinger M, Schmid S. 2022. Brief announcement: Broadcasting time in dynamic rooted trees is linear. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distrubuted Computing, 54–56.
El-Hayek, Antoine, et al. “Brief Announcement: Broadcasting Time in Dynamic Rooted Trees Is Linear.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 54–56, doi:10.1145/3519270.3538460.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Material in ISTA:
Dissertation containing ISTA record
arXiv 
Google Scholar
ISBN Search