Muteness Failure Detectors: Specification & Implementation
This paper extends the failures detector approach from crashstop 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 specification of a muteness failure detector, denoted by <>MA, and an implementation of <>MA 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 modification, a consensus algorithm that has been designed in a crash-stop model with <>S, can be reused in the presence of muteness failures simply by replacing <>MA with <>S.
[Dou99] Doudou A., Garbinato B., Guerraoui R. and Schiper A.. Muteness Failure Detectors: Specification & Implementation. In Proceedings of the Third European Dependable Computing Conference (EDCC-3), Springer Verlag, September 1999.
Get publication ( 254K, Adobe Acrobat PDF ).