11 search results - page 2 / 3 » Probabilistic Opaque Quorum Systems |
PODC
2004
ACM
13 years 11 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...
MOBIHOC
2003
ACM
13 years 11 months ago
2003
ACM
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
DSN
2008
IEEE
14 years 3 days ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
PODC
1998
ACM
13 years 10 months ago
1998
ACM
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
ICDCN
2010
Springer
14 years 14 days ago
2010
Springer
