bft - A definition The Byzantine Generals Problem Leslie...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
The Byzantine Generals Problem Leslie Lamport, Robert Shostak, and Marshall Pease ACM TOPLAS 1982 Practical Byzantine Fault Tolerance Miguel Castro and Barbara Liskov OSDI 1999 A definition • Byzantine ( 1: of, relating to , or characteristic of the ancient city of Byzantium 4b: intricately involved : labyrinthine <rules of Byzantine complexity> • Lamport’s reason: “I have long felt that, because it was posed as a cute problem about philosophers seated around a table, Dijkstra's dining philosopher's problem received much more attention than it deserves.” ( Byzantine Generals Problem • Concerned with (binary) atomic broadcast – All correct nodes receive same value – If broadcaster correct, correct nodes receive broadcasted value • Can use broadcast to build consensus protocols (aka, agreement) – Consensus: think Byzantine fault-tolerant (BFT) Paxos Synchronous Asynchronous Fail-stop Byzantine Synchronous, Byzantine world
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Cool note Example Byzantine fault-tolerant system: ! Seawolf submarine ’s control system Sims, J. T. 1997. Redundancy Management Software Services for Seawolf Ship Control System . In Proceedings of the 27th international Symposium on Fault-Tolerant Computing (FTCS '97) (June 25 - 27, 1997). FTCS. IEEE Computer Society, Washington, DC, 390. But it remains to be seen if commodity distributed systems are willing to pay to have so many replicas in a system Practical Byzantine Fault Tolerance: Asynchronous, Byzantine Synchronous Asynchronous Fail-stop Byzantine Practical Byzantine Fault Tolerance •Why async BFT? BFT: – Malicious attacks, software errors – Need N-version programming? – Faulty client can write garbage data, but can’t make system inconsistent (violate operational semantics) •Why async? – Faulty network can violate timing assumptions – But can also prevent liveness [For different liveness properties, see, e.g., Cachin, C., Kursawe, K., and Shoup, V. 2000. Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract). In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 9

bft - A definition The Byzantine Generals Problem Leslie...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online