Implementing the Omega failure detector in the crash-recovery failure model

Cristian Martín; Mikel Larrea; Ernesto Jiménez

doi:10.1016/j.jcss.2008.10.002

Implementing the Omega failure detector in the crash-recovery failure model

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2008.10.002 ◽

2009 ◽

Vol 75 (3) ◽

pp. 178-189 ◽

Cited By ~ 14

Author(s):

Cristian Martín ◽

Mikel Larrea ◽

Ernesto Jiménez

Keyword(s):

Failure Model ◽

Failure Detector ◽

Crash Recovery

Download Full-text

On the implementation of the Omega failure detector in the crash-recovery failure model

The Second International Conference on Availability, Reliability and Security (ARES'07) ◽

10.1109/ares.2007.111 ◽

2007 ◽

Cited By ~ 2

Author(s):

Cristian Martin ◽

Mikel Larrea ◽

Ernesto Jimenez

Keyword(s):

Failure Model ◽

Failure Detector ◽

Crash Recovery

Download Full-text

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

Computing ◽

10.1007/s00607-021-01023-8 ◽

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.

Download Full-text