minimum-bandwidth-regenerating-code · limited · also MBR code

Minimum-bandwidth regenerating code

A minimum-bandwidth regenerating code minimizes single-node repair download at the bandwidth endpoint of the storage-repair tradeoff.

Let B be the source size in symbols, n the node count, k the recovery threshold and d the number of helpers, with 2<=k<=d<n. At the symmetric MBR point, beta=2B/(k(2d-k+1)) symbols come from each helper, and per-node storage alpha equals total repair download d*beta. Unlike MSR, this point permits alpha>B/k. Symbol counts must fit a realizable code or a suitable stripe scaling. [1]

For B=20, n=4, k=2 and d=3, MBR uses alpha=12 symbols per node and downloads 12 to repair it. MSR stores 10 per node and downloads 15 under its optimal repair formula. Total storage is therefore 48 versus 40 symbols. These are endpoint calculations for the same source and helper count, not a claim of equal storage overhead. [1]

MBR alone does not imply that helpers merely copy stored symbols. Exact repair reproduces the lost contents, while functional repair need only preserve the required recoverability. The complete-graph construction realizes exact repair-by-transfer when d=n-1. [2]

Relations

related
Minimum-storage regenerating code, Repair-by-transfer, Erasure coding, Repair-read amplification

Advantages

  • Repair download can fall below the amount needed to reconstruct the entire source before rebuilding a node. [1]

Limitations

  • A smaller download budget does not guarantee minimum helper reads for every helper selection, even at the MBR endpoint. [3]

Citations

  1. Dimakis et al. Network Coding for Distributed Storage Systems. IEEE TIT 56(9), 4539-4551 (2010), section III. (accessed 2026-11-22)
  2. Shah et al. Distributed Storage Codes With Repair-by-Transfer. IEEE TIT 58(3), 1837-1852 (2012), section III; DOI 10.1109/TIT.2011.2173792. (accessed 2026-11-22)
  3. Shah. On Minimizing Data-Read and Download for Storage-Node Recovery. IEEE Communications Letters 17(5), 964-967 (2013), sections III-IV. (accessed 2026-11-22)
Sources & caveats
  • Formulas describe symmetric single-node repair in the regenerating-code model, not network protocol bytes or elapsed time.
  • Reviewed Dimakis section III, Shah 2012 section III and Shah 2013 sections I-IV.
  • B=20 comparison is exact arithmetic; no empirical population, uncertainty interval or speedup is claimed.

JSON: /data/terms/minimum-bandwidth-regenerating-code.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Minimum-bandwidth regenerating code. Hesela. 2026-11-22. https://hesela.dev/terms/minimum-bandwidth-regenerating-code/