Multi-Version Coding—An Information-Theoretic Perspective of Consistent Distributed Storage
From MaRDI portal
Publication:5375595
DOI10.1109/TIT.2017.2725273zbMATH Open1395.94243arXiv1506.00684OpenAlexW2963568514MaRDI QIDQ5375595FDOQ5375595
Authors: Zhiying Wang, Viveck R. Cadambe 
Publication date: 14 September 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information theoretic formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {
u} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {
u} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.
Full work available at URL: https://arxiv.org/abs/1506.00684
This page was built for publication: Multi-Version Coding—An Information-Theoretic Perspective of Consistent Distributed Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375595)
