Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

DOI10.1145/3519270.3538460arXiv2211.11352MaRDI QIDQ6202000FDOQ6202000

Author name not available (Why is that?), Stefan Schmid, Monika R. Henzinger

Publication date: 26 March 2024

Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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 $lceilfrac3n-12ceil-2$ lower bound and an $O(nloglogn)$ upper bound. We show the first linear upper bound for this problem, namely $lceil(1+sqrt2)n-1ceilapprox2.4n$. Our result follows from a detailed analysis of the evolution of the adjacency matrix of the network over time.

Full work available at URL: https://arxiv.org/abs/2211.11352

zbMATH Keywords

broadcasttime complexitydynamic graphsdynamic radiusoblivious message adversary

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (1)

• The time complexity of consensus under oblivious message adversaries

This page was built for publication: Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202000)