Rafture: Erasure-coded Raft with Post-Dissemination Pruning
Rithwik Kerur, Divyakant Agrawal, Michael K. Reiter, Dahlia Malkhi

TL;DR
Rafture introduces a novel erasure-coded consensus protocol with post-dissemination pruning, enabling adaptive storage costs and simplified recovery in dynamic distributed systems.
Contribution
It is the first to incorporate post-dissemination pruning in erasure-coded consensus, allowing autonomous storage adaptation without complex metadata or centralized control.
Findings
Significantly reduces long-term storage consumption.
Simplifies recovery process in dynamic network conditions.
Improves efficiency over existing dissemination-focused approaches.
Abstract
Spreading and storing erasure-coded data in distributed systems effectively is challenging in real settings. Practical deployments must contend with unpredictable network latencies, particularly when information dispersal is integrated into consensus protocols, a prominent and latency-sensitive use case. Existing approaches address this challenge through timeout-based dissemination and adaptive communication or storage decisions driven by acknowledgments during dissemination. However, these designs focus almost exclusively on dissemination-time efficiency, complicate recovery with reconstruction procedures that require metadata that can differ per consensus value, and rely on a centralized leader to make storage decisions for all nodes. This paper introduces \textbf{Rafture}, a novel information dispersal algorithm, and its integration in a consensus protocol, that overcomes these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Distributed and Parallel Computing Systems · Advanced Data Storage Technologies
