Message and time efficient consensus protocols for synchronous distributed systems

DOI10.1016/J.JPDC.2007.08.008zbMATH Open1243.68046OpenAlexW1980693538WikidataQ60249762 ScholiaQ60249762MaRDI QIDQ436769FDOQ436769

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

• Title not available (Why is that?)
• Unreliable failure detectors for reliable distributed systems
• Early stopping in Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Title not available (Why is that?)
• A layered analysis of consensus
• Uniform consensus is harder than consensus
• Fast fault-tolerant agreement algorithms
• 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.
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Title not available (Why is that?)
• Distributed Computing

Cited In (4)

• Timeliness, failure-detectors, and consensus performance
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Message Lower Bounds via Efficient Network Synchronization
• 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)