Rashmi, KV and Shah B, Nihar and Kumar P, Vijay and Ramchandran, Kannan (2010) Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage. In: 2010 IEEE International Symposium on Information Theory, JUL 13, 2010, Austin, TX, pp. 1938-1942.
Explicit.pdf - Published Version
Restricted to Registered users only
Download (162Kb) | Request a copy
In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||06 Apr 2011 10:26|
|Last Modified:||06 Apr 2011 10:26|
Actions (login required)