{
  "slug": "maximum-repair-load",
  "term": "Maximum repair load",
  "aliases": [
    "max repair load"
  ],
  "definition": "Maximum repair load is the largest per-node send or receive volume during a repair operation.",
  "note": "For each participating node, count incoming and outgoing payload separately and take the largest value across both directions and all nodes; do not add a node's send and receive volumes. The unit is bytes per repair, not bytes per second. [pararc]\n\nThis distinguishes a bottleneck's traffic from aggregate repair traffic. A lower total does not guarantee a smaller maximum node load or a shorter repair. Input reuse also matters: one sub-block sent to a destination can serve multiple calculations there. [pararc]\n\nHesela enumerates all 65,536 placements of eight computation vertices in one four-node repair graph. Source locations and the replacement collector are fixed. The downloadable calculation checks transfer conservation and deduplicates by source sub-block and destination. It measures neither decoding correctness nor elapsed time. [hesela-load]",
  "related": [
    "minimum-storage-regenerating-code",
    "subpacketization",
    "repair-read-amplification",
    "repair-locality"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-21",
  "citations": [
    {
      "id": "pararc",
      "title": "Li et al. ParaRC. FAST 2023, pp. 17-32; sections 2-3, figures 2-5.",
      "url": "https://www.usenix.org/system/files/fast23-li.pdf",
      "accessed": "2026-10-21"
    },
    {
      "id": "hesela-load",
      "title": "Hesela: repair-load graph accounting and downloadable evidence",
      "url": "https://hesela.com/analyses/lrc-repair-costs-locality/#repair-load",
      "accessed": "2026-10-21"
    }
  ]
}