Rack-Aware Minimum-Storage Regenerating Codes with Optimal Access for Consecutive Node Failures

We study the access complexity of repairing MDS array codes in a rack-aware storage model, that allows collective information processing among nodes within the same rack. We construct a family of MDS array codes that only requires accessing the minimum number of symbols to repair consecutive failed nodes in a single rack.

Authors

Institutions

Publication Details

Published
2024-11-24
DOI
https://doi.org/10.1109/itw61385.2024.10806950
Citations
2
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rack-Aware Minimum-Storage Regenerating Codes with Optimal Access for Consecutive Node Failures

Xun Guan, Jiaojiao Wang
2 citations
Advanced Data Storage Technologies
0.70
article

Rack-Aware Minimum-Storage Regenerating Codes with Optimal Access for Consecutive Node Failures

Xun Guan, Jiaojiao Wang
article en
2 citations

Abstract

We study the access complexity of repairing MDS array codes in a rack-aware storage model, that allows collective information processing among nodes within the same rack. We construct a family of MDS array codes that only requires accessing the minimum number of symbols to repair consecutive failed nodes in a single rack.

Tsinghua–Berkeley Shenzhen Institute (CN), Tsinghua University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 26%
Advanced Data Storage Technologies
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.