Reaching Approximate Byzantine Consensus with Multi-hop Communication

DOI10.1007/978-3-319-21741-3_2zbMath1428.68082OpenAlexW1946818232MaRDI QIDQ5207895

Lili Su, Nitin H. Vaidya

Publication date: 14 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_2

zbMATH Keywords

iterative algorithmsynchronous systemincomplete networkbounded-length communication pathsapproximate Byzantine consensus

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Approximate agreement under mobile Byzantine faults ⋮ Reaching approximate Byzantine consensus with multi-hop communication ⋮ Unnamed Item ⋮ Reaching Approximate Byzantine Consensus with Multi-hop Communication

Cites Work

• Unnamed Item
• Easy impossibility proofs for distributed consensus problems
• Fault-Tolerant Consensus in Directed Graphs
• Iterative approximate byzantine consensus in arbitrary directed graphs
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Reaching Approximate Byzantine Consensus with Multi-hop Communication
• Coordination of groups of mobile autonomous agents using nearest neighbor rules

This page was built for publication: Reaching Approximate Byzantine Consensus with Multi-hop Communication