Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems

05/11/2018
by   Brice Nédelec, et al.
0

Many distributed protocols and applications rely on causal broadcast to ensure consistency criteria. However, none of causality tracking state-of-the-art approaches scale in large and dynamic systems. This paper presents a new non-blocking causal broadcast protocol suited for dynamic systems. The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity. Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems. Consequently, large and dynamic systems can finally afford causal broadcast.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2022

Verified Causal Broadcast with Liquid Haskell

Protocols to ensure that messages are delivered in causal order are a ub...
research
11/04/2020

Context-based Broadcast Acknowledgement for Enhanced Reliability of Cooperative V2X Messages

Most V2X applications/services are supported by the continuous exchange ...
research
09/04/2023

Communication Lower Bounds for Cryptographic Broadcast Protocols

Broadcast protocols enable a set of n parties to agree on the input of a...
research
11/05/2018

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Ensuring reliable communication despite possibly malicious participants ...
research
04/14/2023

Chop Chop: Byzantine Atomic Broadcast to the Network Limit

At the heart of state machine replication, the celebrated technique enab...
research
06/07/2022

Topos: A Secure, Trustless, and Decentralized Interoperability Protocol

Topos is an open interoperability protocol designed to reduce as much as...
research
11/09/2022

Dynamic Slicing by On-demand Re-execution

In this paper, we propose a novel approach that aims to offer an alterna...

Please sign up or login with your details

Forgot password? Click here to reset