Campus Units

Electrical and Computer Engineering, Mathematics

Document Type

Conference Proceeding

Conference

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Link to Published Version

https://doi.org/10.1109/Allerton.2012.6483351

Publication Date

2012

Journal or Book Title

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

DOI

10.1109/Allerton.2012.6483351

Conference Title

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Conference Date

October 1-5, 2012

City

Allerton, IL

Abstract

We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and consist of an outer MDS code followed by an inner fractional repetition (FR) code where copies of the coded symbols are placed on the storage nodes. The main challenge in this domain is the design of the inner FR code. In our work, we consider generalizations of FR codes, by establishing their connection with a family of combinatorial structures known as resolvable designs. Our constructions based on affine geometries, Hadamard designs and mutually orthogonal Latin squares allow the design of systems where a new node can be exactly regenerated by downloading β ≥ 1 packets from a subset of the surviving nodes (prior work only considered the case of β = 1). Our techniques allow the design of systems over a large range of parameters. Specifically, the repetition degree of a symbol, which dictates the resilience of the system can be varied over a large range in a simple manner. Moreover, the actual table needed for the repair can also be implemented in a rather straightforward way. Furthermore, we answer an open question posed in prior work by demonstrating the existence of codes with parameters that are not covered by Steiner systems.

Comments

This is a manuscript of a proceeding from the 50th Annual Allerton Conference on Communication, Control, and Computing (2012): 1174, doi:10.1109/Allerton.2012.6483351. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS