Repairing with Zero Skip Cost

2024/05/06 by Wenqin Zhang, Zhang, Wenqin, Yeow Meng Chee +9 · 2 citations
Engineering · #BIM and Construction Integration #Manufacturing Process and Optimization

paper · pdf · doi:10.48550/arxiv.2405.03614

Abstract

To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur zero skip cost

Cited by

• Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
• Completely (Quasi-)Uniform Nested Boolean Steiner Quadruple Systems

Related

• An Alternate Construction of an Access-Optimal Regenerating Code with\n Optimal Sub-Packetization Level
• Node repair on connected graphs
• When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis
• Explicit Codes Minimizing Repair Bandwidth for Distributed Storage
• New Codes and Inner Bounds for Exact Repair in Distributed Storage\n Systems