Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper

Authors:
Fabíola Greve;Sébastien Tixeuil
Affiliations:
Federal University of Bahia (UFBA), Brasil;UPMC Sorbonne Universités
Venue:
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Year:
2010

Citing 4
Cited 0

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The consensus problem is at the heart of solutions related to the development of modern reliable distributed systems. This paper studies necessary and sufficient conditions under which fault-tolerant consensus become solvable in dynamic systems and self-organizing networks. Those conditions are related to the synchrony requirements of the environment, to the connectivity of the knowledge graph constructed by the nodes in order to communicate with their peers, as well as to the knowledge about global parameters in the system, such as, the total number of participants and the maximum number of node crashes.