Encapsulating failure detection: From crash to Byzantine failures

DOI10.1007/3-540-48046-3_3MaRDI QIDQ3045849zbMATH OpenFDO

Authors Assia Doudou, Benoît Garbinato, Rachid Guerraoui

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2361/23610024.htm

Mathematics Subject Classification ID

Theory of software (68N99) Computing methodologies and applications (68U99)

Recommendations

• Failure detectors encapsulate fairness
• The failure discovery problem
• Are Byzantine failures really different from crash failures?
• Byzantine Fault Detectors for Solving Consensus
• The failure detector abstraction

Cited in

(5)

• On the round complexity of Byzantine agreement without initial set-up
• Are Byzantine failures really different from crash failures?
• Low complexity Byzantine-resilient consensus
• Consensus in the presence of mortal Byzantine faulty processes
• On Byzantine generals with alternative plans

This page was built for publication: Encapsulating failure detection: From crash to Byzantine failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3045849)