Reaching approximate Byzantine consensus with multi-hop communication

DOI10.1007/978-3-319-21741-3_2MaRDI QIDQ5207895zbMATH OpenOpenAlexFDO

Authors 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

approximate Byzantine consensusbounded-length communication pathsincomplete networkiterative algorithmsynchronous system

Mathematics Subject Classification ID

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

Recommendations

• Reaching approximate Byzantine consensus with multi-hop communication
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Iterative approximate Byzantine consensus under a generalized fault model
• An improved approximate consensus algorithm in the presence of mobile faults
• Reaching approximate agreement in the presence of faults

Cites work

• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Easy impossibility proofs for distributed consensus problems
• Fault-tolerant consensus in directed graphs
• Impossibility of distributed consensus with one faulty process
• Introduction to algorithms
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Reaching Agreement in the Presence of Faults
• Reaching approximate agreement in the presence of faults
• Reaching approximate Byzantine consensus with multi-hop communication

Cited in

(9)

• Approximate agreement under mobile Byzantine faults
• Reaching approximate Byzantine consensus with multi-hop communication
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• An improved approximate consensus algorithm in the presence of mobile faults
• Effects of topology knowledge and relay depth on asynchronous appoximate consensus
• Reaching approximate Byzantine consensus with multi-hop communication
• Iterative approximate Byzantine consensus under a generalized fault model
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions

This page was built for publication: Reaching approximate Byzantine consensus with multi-hop communication

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