Tolerating Random Byzantine Failures in an Unbounded Network

DOI10.1142/S0129626416500031MaRDI QIDQ4598913zbMATH OpenOpenAlexFDO

Authors Alexandre Maurer, Sébastien Tixeuil

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626416500031

zbMATH Keywords

Byzantine failuresdistributed computinggridrandom failuresreliable communicationscalability

Mathematics Subject Classification ID

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

Recommendations

• On Byzantine broadcast in loosely connected networks
• Reliable broadcast in dynamic networks with locally bounded Byzantine failures
• Reliable communication in networks with Byzantine link failures
• Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
• On the impact of link faults on Byzantine agreement
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
• Broadcasting in hypercubes with randomly distributed Byzantine faults

Cited in

(4)

• Scalable eventually consistent counters over unreliable networks
• The Do-All problem with Byzantine processor failures
• Reliable communication in networks with Byzantine link failures
• On Byzantine broadcast in loosely connected networks

This page was built for publication: Tolerating Random Byzantine Failures in an Unbounded Network

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