{
  "slug": "repair-by-transfer",
  "term": "Repair-by-transfer",
  "aliases": [
    "Uncoded repair",
    "Help-by-transfer"
  ],
  "definition": "Repair-by-transfer restores a failed storage node using stored symbols sent by helpers without helper-side coding operations.",
  "note": "A complete-graph construction assigns one encoded symbol to each edge and stores it at both endpoints. With d=n-1, every surviving node sends the symbol shared with the failed node. This particular MBR construction also needs no decoding arithmetic at the replacement node. Encoding and whole-object reconstruction remain separate operations. [shah2012]\n\nThe helper requirement matters: for 2<=k<=d<n at the MBR optimum, simultaneous minimum read and download for every failed node from every set of d helpers is impossible when d<n-1. Relaxations allow minimum read for systematic nodes only, or for selected helper sets. This result is about MBR, not a prohibition on optimal-access MSR codes. [shah2013]\n\nFor four nodes, five data bits plus one XOR parity bit occupy six edges and twelve stored bits. Any two nodes expose five distinct code bits; repairing one node transfers three bits. This is a finite symbolic example, not a measured disk workload. [example]",
  "related": [
    "minimum-bandwidth-regenerating-code",
    "minimum-storage-regenerating-code",
    "repair-read-amplification",
    "repair-locality",
    "clay-code"
  ],
  "citations": [
    {
      "id": "shah2012",
      "title": "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.",
      "url": "https://www.cs.cmu.edu/~nihars/publications/repair_by_transfer.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "shah2013",
      "title": "Shah. On Minimizing Data-Read and Download for Storage-Node Recovery. IEEE Communications Letters 17(5), 964-967 (2013), sections III-IV.",
      "url": "https://www.cs.cmu.edu/~nihars/publications/mbr_no_rbt.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "clay",
      "title": "Vajha et al. Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018, sections 2 and 5.2.",
      "url": "https://www.usenix.org/system/files/conference/fast18/fast18-vajha.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "example",
      "title": "Hesela: finite repair-by-transfer construction and tests, synthetic binary example.",
      "url": "https://hesela.dev/research/repair-transfer.test.mjs",
      "accessed": "2026-11-22"
    }
  ],
  "status": "limited",
  "advantages": [
    {
      "text": "Avoiding helper-side coding permits forwarding selected stored symbols without computing new linear combinations.",
      "citationIds": [
        "shah2012"
      ]
    }
  ],
  "limitations": [
    {
      "text": "Symbol-level reads are not physical device I/O: alignment, request size and layout can force additional bytes to be fetched.",
      "citationIds": [
        "clay"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22",
  "provenance": [
    "Shah 2012 section III and Shah 2013 sections I-IV reviewed; no hardware reproduction.",
    "Help-by-transfer describes helper behavior; arithmetic at the replacement node depends on the construction.",
    "The binary example exhaustively checks 32 messages and all two-node recovery sets; it is not a general erasure-code implementation."
  ]
}
