License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2020.66
URN: urn:nbn:de:0030-drops-117510
URL: https://drops.dagstuhl.de/opus/volltexte/2020/11751/
Go to the corresponding LIPIcs Volume Portal


Maturana, Francisco ; Rashmi, K. V.

Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage

pdf-format:
LIPIcs-ITCS-2020-66.pdf (0.7 MB)


Abstract

Erasure codes are typically used in large-scale distributed storage systems to provide durability of data in the face of failures. In this setting, a set of k blocks to be stored is encoded using an [n, k] code to generate n blocks that are then stored on different storage nodes. A recent work by Kadekodi et al. [Kadekodi et al., 2019] shows that the failure rate of storage devices vary significantly over time, and that changing the rate of the code (via a change in the parameters n and k) in response to such variations provides significant reduction in storage space requirement. However, the resource overhead of realizing such a change in the code rate on already encoded data in traditional codes is prohibitively high. Motivated by this application, in this work we first present a new framework to formalize the notion of code conversion - the process of converting data encoded with an [n^I, k^I] code into data encoded with an [n^F, k^F] code while maintaining desired decodability properties, such as the maximum-distance-separable (MDS) property. We then introduce convertible codes, a new class of code pairs that allow for code conversions in a resource-efficient manner. For an important parameter regime (which we call the merge regime) along with the widely used linearity and MDS decodability constraint, we prove tight bounds on the number of nodes accessed during code conversion. In particular, our achievability result is an explicit construction of MDS convertible codes that are optimal for all parameter values in the merge regime albeit with a high field size. We then present explicit low-field-size constructions of optimal MDS convertible codes for a broad range of parameters in the merge regime. Our results thus show that it is indeed possible to achieve code conversions with significantly lesser resources as compared to the default approach of re-encoding.

BibTeX - Entry

@InProceedings{maturana_et_al:LIPIcs:2020:11751,
  author =	{Francisco Maturana and K. V. Rashmi},
  title =	{{Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage}},
  booktitle =	{11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  pages =	{66:1--66:26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-134-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{151},
  editor =	{Thomas Vidick},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11751},
  URN =		{urn:nbn:de:0030-drops-117510},
  doi =		{10.4230/LIPIcs.ITCS.2020.66},
  annote =	{Keywords: Coding theory, Reed-Solomon codes, Erasure codes, Code conversion, Distributed storage}
}

Keywords: Coding theory, Reed-Solomon codes, Erasure codes, Code conversion, Distributed storage
Seminar: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Issue Date: 2020
Date of publication: 10.01.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI