Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries

02/24/2022
by   Ami Paz, et al.
0

Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which computation and communication is lock-step synchronous but controlled by an oblivious message adversary. In this basic model, determining consensus solvability and designing consensus algorithms in the case where it is possible, has been shown to be surprisingly difficult. We present an explicit decision procedure to determine if consensus is possible under a given adversary. This in turn enables us, for the first time, to study the time complexity of consensus in this model. In particular, we derive time complexity upper bounds for consensus solvability both for a centralized decision procedure as well as for solving distributed consensus. We complement these results with time complexity lower bounds. Intriguingly, we find that reaching consensus under an oblivious message adversary can take exponentially longer than broadcasting the input value of some process to all other processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2023

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries

Broadcast and consensus are most fundamental tasks in distributed comput...
research
05/16/2019

On the complexity of fault-tolerant consensus

The paper studies the problem of reaching agreement in a distributed mes...
research
04/05/2023

Topological Characterization of Consensus Solvability in Directed Dynamic Networks

Consensus is one of the most fundamental problems in distributed computi...
research
03/24/2022

Improved Communication Complexity of Fault-Tolerant Consensus

Consensus is one of the most thoroughly studied problems in distributed ...
research
05/18/2023

Fault-Tolerant Consensus in Quantum Networks

Fault-tolerant consensus is about reaching agreement on some of the inpu...
research
04/13/2020

A Hierarchical Model for Fast Distributed Consensus in Dynamic Networks

We present two new consensus algorithms for dynamic networks. The first,...
research
07/17/2022

Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks

We give a simple and complete characterization of which functions can be...

Please sign up or login with your details

Forgot password? Click here to reset