7 research outputs found
On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks
International audienceA 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(log log n), where n is the number of nodes. This is an exponential improvement on the previously best known upper bound of O(log n). 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
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
We study the broadcast problem on dynamic networks with 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 lower bound and an
upper bound. We show the first linear upper bound for this
problem, namely . Our result
follows from a detailed analysis of the evolution of the adjacency matrix of
the network over time.Comment: 5 pages, 1 figure, published in PODC'22, further work:
arXiv:2211.1015
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks
The Time Complexity of Consensus Under Oblivious Message Adversaries
We study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message adversary that picks the communication graph to be used in a round from a fixed set of graphs ? arbitrarily. In this fundamental model, determining consensus solvability and designing efficient consensus algorithms is surprisingly difficult. Enabled by a decision procedure that is derived from a well-established previous consensus solvability characterization for a given set ?, we study, for the first time, the time complexity of solving consensus in this model: We provide both upper and lower bounds for this time complexity, and also relate it to the number of iterations required by the decision procedure. Among other results, we find that reaching consensus under an oblivious message adversary can take exponentially longer than both deciding consensus solvability and broadcasting the input value of some unknown process to all other processes
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks
International audienceA 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(log log n), where n is the number of nodes. This is an exponential improvement on the previously best known upper bound of O(log n). 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