This paper extends the failures detector approach from crash-stop failures to muteness failures. Muteness failures are malicious failures in which a process stops sending algorithm messages, but might continue to send other messages, e.g., "I-am-alive" messages. The paper presents both the speci cation of a muteness failure detector, denoted by 3M A , and an implementation of 3M A in a partial synchrony model (there are bounds on message latency and clock skew, but these bounds are unknown and hold only after some point that is itself unknown). We show that, modulo a simple modi cation, a consensus algorithm that has been designed in a crash-stop model with 3S, can be reused in the presence of muteness failures simply by replacing 3M A with 3S.
such failure detectors can be found in REF .
Muteness Failure Detectors: Specification and Implementation
EDCC
Computer Science