Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems

Huang, Cheng; Chen, Minghua; Li, Jin

doi:10.1109/nca.2007.37

Cited by 311 publications

(380 citation statements)

References 10 publications

Supporting

Mentioning

370

Contrasting

Unclassified

Order By: Relevance

“…In [9], Gopalan et al establish an upper bound on the minimum distance of scalar LRCs, which is analogous to the Singleton bound. The paper also showes that pyramid codes, presented in [17], achieve this bound with information symbols locality. Subsequently, the work by Prakash et al extends the bound to a more general definition of scalar LRCs [11].…”

Section: Introductionmentioning

confidence: 71%

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Rawat

Silberstein

Koyluoglu

et al. 2013

2013 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.

show abstract

Section: Introductionmentioning

confidence: 71%

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Rawat

Silberstein

Koyluoglu

et al. 2013

2013 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

show abstract

“…To achieve these goals, data are often considered as (nearly) immutable: updates are done by writing new data -the old blocks being cleaned using a background garbage collector process. Moreover, the data consistency is either not discussed [10] or the protocols used are not strict: for example, a "reasonably strong consistency" may be used [3]where a read concurrent to write operations returns a non deterministic value. To our best knowledge, the only implementation of a strong consistency protocol seals the writes on failures to guarantee the consistency [5].…”

Section: A Data Distributionmentioning

confidence: 99%

Majority Quorum Protocol Dedicated to General Threshold Schemes

Relaza

Jorda

M'zoughi

2015

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

show abstract

“…Recently, there are many efforts in practical network coding for storage systems [22], [23], [24]. However, there has been no work addressing the update problem defined in Sec.…”

Section: Related Workmentioning

confidence: 99%

An update model for network coding in cloud storage systems

Zakerinasab¹,

Wang²

2012

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-The fast emerging cloud services have received a tremendous amount of attention in both industry and academia. Storage services such as Dropbox and iCloud enabled us to share files among multiple users or devices. Providing the benefits of network coding in distributed systems such as Peerto-Peer file sharing and multimedia streaming, researchers have also been trying to apply network coding in storage systems. Existing works have been focusing on mechanisms for preserving the level of redundancy when one or more nodes fail or leave the system. However, file updates, the most frequent operations performed on files, pose challenges in maintaining coded information in the system up to date. In other words, any change in the file will impact all coded blocks in the system, so all traces of the file must be completely replaced. This becomes costly since recomputing coded blocks is very CPU intensive and replacing all the coded blocks consumes an excessive amount of bandwidth. To the best of our knowledge, there has been no work addressing this update problem. To this end, we propose a Differential Update Model (DUM) that will update coded blocks by delivering only the changes in the file. We also present our objective view of the model through a complete analysis on computational complexity and bandwidth saving and simulated experiments.

show abstract

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems

Cited by 311 publications

References 10 publications

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Majority Quorum Protocol Dedicated to General Threshold Schemes

An update model for network coding in cloud storage systems

Contact Info

Product

Resources

About