Stopping times of distributed consensus protocols: a probabilistic analysis

DOI10.1016/0020-0190(87)90127-XzbMATH Open0619.68015OpenAlexW2151815767WikidataQ59491574 ScholiaQ59491574MaRDI QIDQ1089784FDOQ1089784

Authors: Ozalp Babaoglu 

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90127-x

Recommendations

• Simple constant-time consensus protocols in realistic failure models
• Randomized protocols for asynchronous consensus
• Fast and simple distributed consensus
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus

zbMATH Keywords

resiliencyByzantine agreementdistributed computing systemprocessorsreliable computingprobabilistic failuresystem executions

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Authenticated Algorithms for Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Title not available (Why is that?)

Cited In (5)

• Computing reliability intervals for k-resilient protocols
• Simple constant-time consensus protocols in realistic failure models
• A crash-tolerant consensus algorithm in presence of probabilistic message omission
• Distributed Stopping for Average Consensus in Digraphs
• Closed schedulers: a novel technique for analyzing asynchronous protocols

This page was built for publication: Stopping times of distributed consensus protocols: a probabilistic analysis

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