No article text was recorded for this version.
repair bandwidth overhead
Version 2 of 2272 papers457 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
- Blog: Repair of Multiple Descriptions on Distributed Storage
- Blog: Network Coding for Distributed Storage Systems
- Blog: A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes
- Blog: Increasing Availability in Distributed Storage Systems via Clustering
- Blog: Repair of Multiple Descriptions on Distributed Storage
- Blog: Repairing with Zero Skip Cost
- Blog: Explicit codes minimizing repair bandwidth for distributed storage
- Blog: A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
- Blog: Repair of Multiple Descriptions on Distributed Storage
- Blog: Repair Rates for Multiple Descriptions on Distributed Storage
- Blog: A Repair Framework for Scalar MDS Codes
- Blog: A repair framework for scalar MDS codes.
- Blog: Network Coding for Distributed Storage Systems
- Blog: Network coding for distributed storage systems.
- Blog: Repair Optimal Erasure Codes Through Hadamard Designs
- Blog: A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes
- Blog: Repair optimal erasure codes through hadamard designs
- Blog: Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes
- Blog: Simple Regenerating Codes: Network Coding for Cloud Storage
- Blog: Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation
- Blog: A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
- Blog: Locality and Availability in Distributed Storage
- Blog: Repair optimal erasure codes through hadamard designs
- Blog: Clustered Network Coding for Maintenance in Practical Storage Systems
- Blog: Repair Pipelining for Erasure-coded Storage: Algorithms and Evaluation
- Blog: Distributed Storage Codes through Hadamard Designs
- Blog: A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
- Blog: Enabling Node Repair in Any Erasure Code for Distributed Storage
- Blog: Simple Regenerating Codes: Network Coding for Cloud Storage
- Blog: Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains
- Blog: Network Coding for Distributed Storage Systems.
- Blog: A Survey on Network Codes for Distributed Storage
- Blog: Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth
- Blog: Recovery and Repair Schemes for Shift-XOR Regenerating Codes
- Blog: Distributed Storage Codes through Hadamard Designs
- Blog: Fractional repetition codes for repair in distributed storage systems
- Blog: Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Blog: Locally Repairable Codes
- Blog: Boosting the Performance of Degraded Reads in RS-coded Distributed Storage Systems
- Blog: Optimizing RAID 6 performance and reliability using Reed-Solomon codes: Implementation, analysis, and exploration of alternative methods
- Blog: Network coding for distributed storage systems
- Blog: Simple regenerating codes: Network coding for cloud storage.
- Blog: CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems
- Blog: Capacity of Clustered Distributed Storage
- Blog: The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment
- Blog: Enabling All-Node-Repair in Minimum Storage Regenerating Codes
- Blog: Repairing Reed-Solomon Codes with Side Information
- Blog: Exact Regenerating Codes for Distributed Storage
- Blog: Rebuilding for Array Codes in Distributed Storage Systems
- Blog: PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access
- Blog: Explicit MBR All-Symbol Locality Codes
- Blog: Rack-Aware Regenerating Codes for Data Centers
- Blog: Special focus on distributed storage coding
- Blog: Repairing Reed-Solomon Codes via Subspace Polynomials
- Blog: A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
- Blog: Repairing Algebraic Geometry Codes
- Blog: Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
- Blog: TSUE: A Two-Stage Data Update Method for an Erasure Coded Cluster File System
- Blog: A Class of MSR Codes for Clustered Distributed Storage
Showing 60 of 272 papers.
History & citation
Current · Permanent link
- All-Node Repair for Distributed Storage Systems merged into this direction (70% overlap)
- Bandwidth Efficient Repair for Maximum Distance Separable Codes merged into this direction (100% overlap)
- The Sub-packetization Bottleneck in Distributed Storage merged into this direction (67% overlap)
- Regenerating Codes for Distributed Storage merged into this direction (76% overlap)
- Bandwidth Adaptive Repair for Distributed Storage merged into this direction (74% overlap)
- Modular Transformations for Repair-Efficient Erasure Codes merged into this direction (89% overlap)
- Cooperative and Centralized Multi-Node Repair merged into this direction (73% overlap)
- Secure Distributed Storage via Exact Repair merged into this direction (60% overlap)
- Bandwidth Efficient Recovery for Concurrent Node Failures merged into this direction (60% overlap)
- Interference Alignment for Distributed Storage Repair merged into this direction (79% overlap)
- The Storage and Repair Bandwidth Tradeoff merged into this direction (77% overlap)
- Uncoded Repair by Transfer for Distributed Storage merged into this direction (90% overlap)
- generalized local repair algorithm split from this direction (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_repair_bandwidth_overhead_1ac885c0,
title = {repair bandwidth overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/repair-bandwidth-overhead/rdr_1ac885c0ccb944c59b11a524a187a071},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_repair_bandwidth_overhead_1ac885c0_v2,
title = {repair bandwidth overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/repair-bandwidth-overhead/rdr_1ac885c0ccb944c59b11a524a187a071/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}