Sign Up to like & get
recommendations!
0
Published in 2017 at "IEEE Access"
DOI: 10.1109/access.2017.2699232
Abstract: Regenerating codes (RGCs) have recently been proposed to reduce the repair traffic of ( $n,k$ ) erasure-coded distributed storage systems. Moreover, RGCs can also be used in a scalable distributed storage scenario where $n$ is…
read more here.
Keywords:
storage;
distributed storage;
scalable distributed;
tex math ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2017 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2017.2695610
Abstract: This letter studies the performance of ensemble of Regenerating codes and Replication (RR). It theoretically analyzes the storage-bandwidth tradeoff curve of RR, and attains two extremal cases, corresponding to minimum storage cost RR (MSRR) and…
read more here.
Keywords:
regenerating codes;
ensemble regenerating;
repair bandwidth;
codes replication ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2025 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2025.3582724
Abstract: In data centers, storage nodes are typically organized in racks and rack-aware regenerating codes (RRCs) can achieve the optimal trade-off between storage capacity and cross-rack repair bandwidth. In this paper, we present explicit constructions for…
read more here.
Keywords:
multi node;
regenerating codes;
explicit constructions;
rack aware ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2018.2840995
Abstract: For general exact repair regenerating codes, the optimal trade-offs between the storage size and repair bandwidth remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument, we identify…
read more here.
Keywords:
exact repair;
regenerating codes;
outer;
shortened regenerating ... See more keywords