Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors

2019 ◽  
Vol 75 (12) ◽  
pp. 8262-8292
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Javier Martín-Rueda
Keyword(s):  
Asynchronous Systems ◽  
Failure Detectors ◽  
Binary Consensus

scholarly journals Anonymous asynchronous systems: the case of failure detectors

2012 ◽  
Vol 26 (3) ◽  
pp. 141-158 ◽  
Author(s):  
François Bonnet ◽  
Michel Raynal
Keyword(s):  
Asynchronous Systems ◽  
Failure Detectors

scholarly journals Consensus in anonymous asynchronous systems with crash-recovery and omission failures

Computing ◽  
2021 ◽  
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Marta Patiño-Martínez
Keyword(s):  
Distributed Systems ◽  
Fundamental Problem ◽  
Asynchronous Systems ◽  
Failure Model ◽  
Failure Detectors ◽  
Fair Exchange ◽  
Failure Detector ◽  
Distributed Object ◽  
Failure Models ◽  
Crash Recovery

AbstractIn anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction. $$\varOmega $$ Ω is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and $$A\varOmega '$$ A Ω ′ is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using $$A\varOmega '$$ A Ω ′ in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of $$A\varOmega '$$ A Ω ′ for these new failure models.

scholarly journals Mutual exclusion in asynchronous systems with failure detectors

2005 ◽  
Vol 65 (4) ◽  
pp. 492-505 ◽  
Author(s):  
Carole Delporte-Gallet ◽  
Hugues Fauconnier ◽  
Rachid Guerraoui ◽  
Petr Kouznetsov
Keyword(s):  
Mutual Exclusion ◽  
Asynchronous Systems ◽  
Failure Detectors

Binary Consensus Over Fading Channels

2010 ◽  
Vol 58 (12) ◽  
pp. 6340-6354 ◽  
Author(s):  
Yasamin Mostofi ◽  
Mehrzad Malmirchegini
Keyword(s):  
Fading Channels ◽  
Binary Consensus
Sign in / Sign up

Export Citation Format

Share Document