On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks

01/21/2019
by   Matthias Függer, et al.
0

A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in O( n), where n is the number of nodes. We then generalize the result to products of nonsplit graphs. The analysis of nonsplit graph products has direct implications in the context of distributed systems, where processes operate in rounds and communicate via message passing in each round: communication graphs in several distributed systems naturally relate to nonsplit graphs and the graph product concisely represents relaying messages in such networks. Applying our results, we obtain improved bounds on the dynamic radius of such networks, i.e., the maximum number of rounds until all processes have received a message from a common process, if all processes relay messages in each round. We finally connect the dynamic radius to lower bounds for achieving consensus in dynamic networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2023

Optimal Message-Passing with Noisy Beeps

Beeping models are models for networks of weak devices, such as sensor n...
research
01/16/2018

Round- and Message-Optimal Distributed Graph Algorithms

Distributed graph algorithms that separately optimize for either the num...
research
03/02/2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation

Massive graphs, such as online social networks and communication network...
research
02/18/2020

Synthesis in Presence of Dynamic Links

The problem of distributed synthesis is to automatically generate a dist...
research
03/05/2020

K set-agreement bounds in round-based models through combinatorial topology

Round-based models are the main message-passing models; combinatorial to...
research
08/01/2019

Distributed Data Summarization in Well-Connected Networks

We study distributed algorithms for some fundamental problems in data su...
research
01/19/2023

Efficient Computation in Congested Anonymous Dynamic Networks

An "anonymous dynamic network" is a network of indistinguishable process...

Please sign up or login with your details

Forgot password? Click here to reset