PODC
2004
ACM
14 years 5 months ago
2004
ACM
PODC
2004
ACM
14 years 5 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
PODC
2004
ACM
14 years 5 months ago
2004
ACM
PODC
2004
ACM
14 years 5 months ago
2004
ACM
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
PODC
2004
ACM
14 years 5 months ago
2004
ACM
PODC
2004
ACM
14 years 5 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
PODC
2004
ACM
14 years 5 months ago
2004
ACM
PODC
2004
ACM
14 years 5 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
PODC
2004
ACM
14 years 5 months ago
2004
ACM
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
PODC
2004
ACM
14 years 5 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...