Crash-tolerant causal broadcast in O(n) messages

DOI10.1016/J.IPL.2019.105837MaRDI QIDQ2274523zbMATH OpenOpenAlexFDO

Authors Matthieu Perrin, Michel Raynal, Jiannong Cao, Achour Mostefaoui

Publication date 20 September 2019

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

Full work available at URL https://doi.org/10.1016/j.ipl.2019.105837

zbMATH Keywords

algorithmsdistributed computingfault-tolerancereliable communication

Mathematics Subject Classification ID

Distributed algorithms (68W15) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Byzantine-tolerant causal broadcast
• scientific article; zbMATH DE number 1848309
• Reliable and total order broadcast in the crash-recovery model
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Necessary and sufficient conditions on information for causal message ordering and their optimal implementation

Cites work

• Detecting causal relationships in distributed computations: In search of the holy grail
• Distributed Algorithms for Message-Passing Systems
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• Introduction to Reliable and Secure Distributed Programming
• Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
• The causal ordering abstraction and a simple way to implement it
• Time, clocks, and the ordering of events in a distributed system

Cited in

(13)

• An optimal algorithm for distributed snapshots with causal message ordering
• Low-latency atomic broadcast in the presence of contention
• Byzantine-tolerant causal broadcast
• Reliable and total order broadcast in the crash-recovery model
• Low-latency Atomic Broadcast in the presence of contention
• HPP: A Reliable Causal Broadcast Protocol for Large-Scale Replication in Wide Area Networks
• scientific article; zbMATH DE number 1292975 (Why is no real title available?)
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• A positive acknowledgment protocol for causal broadcasting
• Causal broadcast: how to forget?
• Interval approximations of message causality in distributed executions
• Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
• On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks

This page was built for publication: Crash-tolerant causal broadcast in \(O(n)\) messages

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