scientific article; zbMATH DE number 7650856

DOI10.4230/LIPICS.OPODIS.2019.6MaRDI QIDQ5874232zbMATH OpenFDO

Authors Alex Auvolat, Michel Raynal, François Taïani

Publication date 7 February 2023

zbMATH Keywords

algorithmdistributed computingmodularityfault-toleranceasynchronous systemreliable broadcastcommunication abstractionmessage-passingByzantine processdistributed software engineeringRead/write snapshot objectset-constrained message delivery

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Recommendations

• Byzantine-tolerant causal broadcast
• Scalable Byzantine reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Broadcast using certified propagation algorithm in presence of Byzantine faults
• Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
• Asynchronous Byzantine reliable broadcast with a message adversary
• On Byzantine broadcast in loosely connected networks
• Reliable broadcast in dynamic networks with locally bounded Byzantine failures

Cited in

(4)

• Scalable Byzantine reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Byzantine-tolerant causal broadcast

This page was built for publication:

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