Fundamental Limits of Erasure-Coded Key-Value Stores with Side Information
Ramy E. Ali, Viveck Cadambe, Jaime Llorca, Antonia Tulino

TL;DR
This paper investigates the fundamental limits of erasure-coded key-value stores with side information about data versions, showing how network topology and side information can reduce storage costs in distributed systems.
Contribution
It introduces a new model where servers have side information about data versions based on network topology, analyzing its impact on storage costs and latency.
Findings
Side information can reduce storage costs in certain regimes.
In some scenarios, side information does not improve worst-case storage costs.
Case study on AWS demonstrates potential cost savings.
Abstract
In applications of distributed storage systems to modern key-value stores, the stored data is highly dynamic due to frequent updates. The multi-version coding problem was formulated to study the cost of storing dynamic data in distributed storage systems. Previous work on multi-version coding considered a completely decentralized and asynchronous system assuming that the servers are not aware of which versions of the data are received by the other servers. In this paper, we relax this assumption and study a system where a server may acquire side information of the data versions propagated to some other servers based on the network topology. Specifically, we study a storage system with servers over a directed graph that store totally ordered versions of a message. Each server receives a subset of these versions. A server is aware of which versions have been received by…
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.
