Sciweavers

175 search results - page 4 / 35
» Decentralized Erasure Codes for Distributed Networked Storag...
Sort
View
WDAG
2005
Springer
88views Algorithms» more  WDAG 2005»
13 years 11 months ago
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
Christian Cachin, Stefano Tessaro
MSS
2003
IEEE
77views Hardware» more  MSS 2003»
13 years 11 months ago
Software-Based Erasure Codes for Scalable Distributed Storage
Joseph A. Cooley, Jeremy L. Mineweaser, Leslie D. ...
DSN
2008
IEEE
13 years 7 months ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie
GLOBE
2011
Springer
12 years 5 months ago
Hybrid Approaches for Distributed Storage Systems
Abstract. Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redund...
Júlio Araújo, Frédéric...
INFOCOM
2010
IEEE
13 years 4 months ago
Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes
Abstract—Distributed storage systems provide large-scale reliable data storage by storing a certain degree of redundancy in a decentralized fashion on a group of storage nodes. T...
Jun Li, Shuang Yang, Xin Wang, Baochun Li