9 search results - page 2 / 2 » Efficient Byzantine-Tolerant Erasure-Coded Storage |
MOBIHOC
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
SIGMETRICS
2010
ACM
13 years 5 months ago
2010
ACM
Space efficiency and data reliability are two primary concerns for modern storage systems. Chunk-based deduplication, which breaks up data objects into single-instance chunks that...
CCGRID
2004
IEEE
14 years 2 months ago
2004
IEEE
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, whic...
NSDI
2004
14 years 7 days ago
2004
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...