50
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Cooperative Regenerating Codes for Distributed Storage Systems

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-bandwidth minimization is concerned. If data exchange among the newcomers is enabled, we can get a better tradeoff between repair bandwidth and the storage per node. An explicit and optimal construction of cooperative regenerating code is illustrated.

          Related collections

          Author and article information

          Journal
          2011-01-27
          2011-02-07
          Article
          1101.5257
          3dba29e7-bf25-4ba4-a19a-136e8a394e43

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          5 pages, 7 figures, to appear in Proc. IEEE ICC, 2011
          cs.IT cs.DC math.IT

          Numerical methods,Information systems & theory,Networking & Internet architecture

          Comments

          Comment on this article