27 search results - page 2 / 6 » Optimal Resilience for Erasure-Coded Byzantine Distributed S... |
MOBIHOC
2010
ACM
13 years 3 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...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
PODC
2011
ACM
12 years 8 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...
MM
2005
ACM
13 years 10 months ago
2005
ACM
The inherent instability and unreliability of peer-to-peer networks introduce several fundamental engineering challenges to multimedia streaming over peer-to-peer networks. First,...