This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

This paper presents a simple framework unifying a family of consensus algorithms that can
tolerate process crash failures and asynchronous periods of the network, also called …

We study the feasibility and cost of implementing Ω—a fundamental failure detector at the
core of many algorithms—in systems with weak reliability and synchrony assumptions …

Many reliable distributed services rely on an eventual leader election to coordinate actions.
The eventual leader detector has been proposed as a way to implement such an …

The election of an eventual leader in an asynchronous system prone to process crashes is
an important problem of fault-tolerant distributed computing. This problem is known as the …

The failure detector approach for solving distributed computing problems has been
celebrated for its modularity. This approach allows the construction of algorithms using …

The distributed computing scenario is rapidly evolving for integrating self-organizing and
dynamic wireless networks. Unreliable failure detectors (FDs) are classical mechanisms that …

While protocols that elect an eventual common leader in asynchonous message-passing
systems have been proposed, to our knowledge, no such protocol has been proposed for …

The distributed computing scenario is rapidly evolving for integrating self-organizing and
dynamic wireless networks. Unreliable failure detectors are classical mechanisms which …

Failure detectors are classical mechanisms which provide information about process failures
and can help systems to cope with the high dynamics of self-organizing, unstructured and …