Storage

A Flexible Class of Regenerating Codes for Distributed Storage

Free registration required

Executive Summary

In the distributed storage setting introduced by the researcher, B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most B units of data from each node. In this paper, the authors introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B.

  • Format: PDF
  • Size: 204.83 KB