On the Design of Storage Orbit Codes

Liu, Shiqiu; Oggier, Frédérique

doi:10.1007/978-3-319-17296-5_28

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To this end, a partially cooperative repair model, in which a new node communicates only with a fraction of all new nodes, is proposed in [35]. A code construction based on subspace codes is given in [36].…”

Section: Discussionmentioning

confidence: 99%

Cooperative repair of multiple node failures in distributed storage systems

Shum

Chen

2016

IJICOT

View full text Add to dashboard Cite

Cooperative regenerating codes are designed for repairing multiple node failures in distributed storage systems.In contrast to the original repair model of regenerating codes, which are for the repair of single node failure, data exchange among the new nodes is enabled. It is known that further reduction in repair bandwidth is possible with cooperative repair. Currently in the literature, we have an explicit construction of exact-repair cooperative code achieving all parameters corresponding to the minimum-bandwidth point. We give a slightly generalized and more flexible version of this cooperative regenerating code in this paper. For minimum-storage regeneration with cooperation, we present an explicit code construction which can jointly repair any number of systematic storage nodes.

show abstract

Section: Discussionmentioning

confidence: 99%

Cooperative repair of multiple node failures in distributed storage systems

Shum

Chen

2016

IJICOT

View full text Add to dashboard Cite

show abstract

On applications of orbit codes to storage

Liu¹,

Oggier²

2016

AMC

Self Cite

View full text Add to dashboard Cite

We consider orbit codes, namely subspace codes obtained from orbits of the action of subgroups of GLn(Fq) on m-dimensional subspaces of F n q. We discuss their applicability to design storage codes, in particular in the context of collaborative repair: we identify known storage codes that can be interpreted as orbit codes, motivate why orbit codes provide good candidates for storage codes, and translate the storage code parameters into those of the algebraic objects involved. Two simple families of storage orbit codes are given.

show abstract

On the Design of Storage Orbit Codes

Cited by 2 publications

References 5 publications

Cooperative repair of multiple node failures in distributed storage systems

Cooperative repair of multiple node failures in distributed storage systems

On applications of orbit codes to storage

Contact Info

Product

Resources

About