Fabíola Greve
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.
- D. Cavin, Y. Sasson, and A. Schiper. Consensus with unknown participants or fundamental self-organization. In Proc. 3rd Int. Conf. AD-NOC Networks & Wireless (ADHOC-NOW), pages 135--148, Vancouver, July 2004. Springer-Verlag.Google Scholar
Cross Ref
- D. Cavin, Y. Sasson, and A. Schiper. Reaching agreement with unknown participants in mobile self-organized networks in spite of process crashes. Research Report IC/2005/026, EPFL, 2005.Google Scholar
- T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, Mar. 1996. Google ScholarDigital Library
- T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685--722, July 1996. Google ScholarDigital Library
- M. J. Fischer, N. A. Lynch, and M. D. Paterson. Impossibility of distributed consensus with one faulty process. Journal of ACM, 32(2):374--382, Apr. 1985. Google ScholarDigital Library
- F. Greve and S. Tixeuil. Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks. In DSN '07: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, pages 82--91, Washington, DC, USA, 2007. IEEE Computer Society. Google ScholarDigital Library
- F. Greve and S. Tixeuil. Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. Technical report, INRIA, Paris, France, 2010.Google Scholar
Index Terms
- Conditions for the solvability of fault-tolerant consensus in asynchronous unknown networks: invited paper
Recommendations
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for which it is possible to solve consensus despite the ...
Fault-Tolerant Consensus in Directed Graphs
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed ComputingConsider a point-to-point network in which nodes are connected by directed links. This paper proves tight necessary and sufficient conditions on the underlying communication graphs for solving the following fault-tolerant consensus problems: Exact crash-...
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computingThis paper introduces and explores a new condition based approach to solve the consensus problem in asynchronous systems. The approach consists of identifying sets of input vectors, called conditions, for which it is possible to design a protocol ...
Comments