dorsal/arxiv
View SchemaRegenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth
| Authors | Minhan Gao, Kenneth Shum |
|---|---|
| Categories | |
| ArXiv ID | 2601.09300vv1 |
| URL | https://arxiv.org/abs/2601.09300 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
There are multiple performance metrics in the design of coding schemes for distributed storage systems. The first metric is called repair bandwidth, which measures the network resources required during the repair process. Another critical metric for repair efficiency is disk I/O cost, defined as the amount of data packets accessed at helper nodes to repair the failed node. In an encoding scheme with optimal I/O cost, the number of packets sent to the newcomer is exactly the same as the number of packets read from memory. This mode of repair is referred to as uncoded repair, as no coding operations are performed at the helper node. In addition to minimizing disk I/O cost, an uncoded repair mechanism has the advantage of incurring minimal computational overhead at the helper node. In this paper, we demonstrate that for single node failures, if all surviving nodes participate in the repair of the failed node, we can achieve all points on the fundamental tradeoff curve between storage and repair bandwidth. The design of the proposed encoding scheme is based on the theory of gammoids, a specialized class of graph-based matroids. We prove that this scheme can tolerate an unlimited number of node repair iterations over a field of fixed size.
{
"annotation_id": "733bed1e-b998-4658-8434-5a83c7419185",
"date_created": "2026-02-17T05:53:20.537000Z",
"date_modified": "2026-02-17T05:53:20.537000Z",
"file_hash": "49312a778fb71a6444b702c5773aaef4467ab7290f71132dd9c9e3147d460f45",
"private": false,
"record": {
"abstract": "There are multiple performance metrics in the design of coding schemes for distributed storage systems. The first metric is called repair bandwidth, which measures the network resources required during the repair process. Another critical metric for repair efficiency is disk I/O cost, defined as the amount of data packets accessed at helper nodes to repair the failed node. In an encoding scheme with optimal I/O cost, the number of packets sent to the newcomer is exactly the same as the number of packets read from memory. This mode of repair is referred to as uncoded repair, as no coding operations are performed at the helper node. In addition to minimizing disk I/O cost, an uncoded repair mechanism has the advantage of incurring minimal computational overhead at the helper node. In this paper, we demonstrate that for single node failures, if all surviving nodes participate in the repair of the failed node, we can achieve all points on the fundamental tradeoff curve between storage and repair bandwidth. The design of the proposed encoding scheme is based on the theory of gammoids, a specialized class of graph-based matroids. We prove that this scheme can tolerate an unlimited number of node repair iterations over a field of fixed size.",
"arxiv_id": "2601.09300",
"authors": [
"Minhan Gao",
"Kenneth Shum"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth",
"url": "https://arxiv.org/abs/2601.09300",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "dc65b4b4-43bf-4e33-a822-0b19135ba9bd",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}