Reliable broadcasts and communication models: tradeoffs and lower bounds

DOI10.1007/BF01872844zbMath0659.68043OpenAlexW1967084447WikidataQ59491571 ScholiaQ59491571MaRDI QIDQ1112599

Rogério Drummond, Pat Stephenson, Ozalp Babaoglu

Publication date: 1988

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01872844

zbMATH Keywords

distributed systemstime complexityfault-tolerant systemsByzantine agreementprotocolsreliable broadcastcommunication modellower bound resultsbroadcast networkshardware/software tradeoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items

Hundreds of impossibility results for distributed computing, Clock synchronization and the power of broadcasting, Necessary and sufficient conditions for broadcast consensus protocols.

Cites Work

• Efficient fault-tolerant routings in networks
• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• The Byzantine Generals Problem
• Unnamed Item
• Unnamed Item