In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing,
and analyzing distributed algorithms. She directs her book at a wide audience, including …

Fault-Tolerant Message-Passing Distributed Systems Page 1 Michel Raynal Fault-Tolerant
Message-Passing Distributed Systems An Algorithmic Approach Page 2 Fault-Tolerant …

We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …

Understanding distributed computing is not an easy task. This is due to the many facets of
uncertainty one has to cope with and master in order to produce correct distributed software …

We provide a suite of impossibility results and lower bounds for the required number of
processes and rounds for synchronous consensus under transient link failures. Our results …

Simulating reliable links with unreliable links in the presence of process crashes Page 1
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes* Anindya …

We study failure detectors in an asynchronous environment that admits message omission
failures. In such environments, processes may fail by crashing, but may also {\em …

The correct operation of communication and co-operation protocols, including signalling
systems in various networks, is essential for the reliability of the many distributed systems …

We introduce a comprehensive hybrid failure model for synchronous distributed systems,
which extends a conventional hybrid process failure model by adding communication …

An important function of communication networks is to implement reliable data transfer over
an unreliable underlying network. Formal specifications are given for reliable and unreliable …