Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

11/21/2022
by   Antoine El-Hayek, et al.
0

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(nloglog 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2022

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

Data dissemination is a fundamental task in distributed computing. This ...
research
01/19/2023

Efficient Computation in Congested Anonymous Dynamic Networks

An "anonymous dynamic network" is a network of indistinguishable process...
research
03/10/2022

Deterministic Rendezvous in Infinite Trees

The rendezvous task calls for two mobile agents, starting from different...
research
06/17/2019

Throttling adversaries on trees

For the cop versus robber game, the throttling number th_c(G) of a graph...
research
04/05/2022

Computing in Anonymous Dynamic Networks Is Linear

We give the first linear-time counting algorithm for processes in anonym...
research
12/06/2022

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees

In this paper we continue to rigorously establish the predictions in gro...
research
09/07/2022

Four Algorithms on the Swapped Dragonfly

The Swapped Dragonfly with M routers per group and K global ports per ro...

Please sign up or login with your details

Forgot password? Click here to reset