Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly

Ting-Yi Wu; Yunghsiang S. Han; Zhengrui Li; Bo Bai; Gong Zhang; Liang Chen; Xiang Wu

Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly

Information Theory 2021-02-05 v1 math.IT

Authors: Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu

Abstract

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is discussed. For the DRF MDS array code with 2 redundant nodes and the sub-packetization level of 2, the lower bound of its access bandwidth is derived.

Keywords

distributed storage codes maximum distance separable code

Cite

@article{arxiv.2102.02436,
  title  = {Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly},
  author = {Ting-Yi Wu and Yunghsiang S. Han and Zhengrui Li and Bo Bai and Gong Zhang and Liang Chen and Xiang Wu},
  journal= {arXiv preprint arXiv:2102.02436},
  year   = {2021}
}

Comments

22 pages, 1 figure

Lower Bound on the Optimal Access Bandwidth of ($K+2,K,2$)-MDS Array Code with Degraded Read Friendly

Abstract

Keywords

Cite

Comments

Related papers