Message and time efficient consensus protocols for synchronous distributed systems

DOI10.1016/J.JPDC.2007.08.008MaRDI QIDQ436769zbMATHOpenAlexWikidataFDO

Authors Xianbing Wang, Yong Meng Teo, Jiannong Cao

Publication date 26 July 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2007.08.008

zbMATH Keywords

consensusearly stoppingmessage efficientorderly crash failuresynchronous distributed systems

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Recommendations

• A bivalency proof of the lower bound for uniform consensus
• Structured Derivation of Semi-Synchronous Algorithms
• Message complexity of hierarchical quorum consensus algorithm
• Atomic broadcast in a Byzantine model
• Using conditions to expedite consensus in synchronous distributed systems

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1235916 (Why is no real title available?)
• scientific article; zbMATH DE number 1759635 (Why is no real title available?)
• A bivalency proof of the lower bound for uniform consensus
• A layered analysis of consensus
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A simple proof of the uniform consensus synchronous lower bound.
• Early stopping in Byzantine agreement
• Fast fault-tolerant agreement algorithms
• Impossibility of distributed consensus with one faulty process
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Uniform consensus is harder than consensus
• Unreliable failure detectors for reliable distributed systems
• Using conditions to expedite consensus in synchronous distributed systems

Cited in

(4)

• Timeliness, failure-detectors, and consensus performance
• Message Lower Bounds via Efficient Network Synchronization
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Interval approximations of message causality in distributed executions

This page was built for publication: Message and time efficient consensus protocols for synchronous distributed systems

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