27 search results - page 1 / 6 » Optimal Resilience for Erasure-Coded Byzantine Distributed S... |
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
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...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off stor...
ICPP
2009
IEEE
13 years 2 months ago
2009
IEEE
Peer-to-peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopte...