Message and time efficient consensus protocols for synchronous distributed systems

DOI10.1016/j.jpdc.2007.08.008zbMath1243.68046OpenAlexW1980693538WikidataQ60249762 ScholiaQ60249762MaRDI QIDQ436769

Yong Meng Teo, Jiannong Cao, Xianbing Wang

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bivalency proof of the lower bound for uniform consensus
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A simple proof of the uniform consensus synchronous lower bound.
• A Layered Analysis of Consensus
• Early stopping in Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Uniform consensus is harder than consensus
• Fast fault-tolerant agreement algorithms
• Distributed Computing

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