Sciweavers

219 search results - page 6 / 44
» Byzantine Quorum Systems
Sort
View
CNIS
2006
13 years 11 months ago
Self-organising quorum systems for ad hoc networks
There are many essential applications for quorum systems in ad-hoc networks, such as that of location servers in large-scale networks. Existing research proposes many approaches t...
Gareth Owen, Mo Adda
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
PODC
2003
ACM
14 years 3 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
DSN
2007
IEEE
14 years 4 months ago
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
A quorum system is a collection of sets (quorums) of servers, where any two quorums intersect. Quorumbased protocols underly modern edge-computing architectures and throughput-sca...
Florian Oprea, Michael K. Reiter
OPODIS
1997
13 years 11 months ago
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
Kim Potter Kihlstrom, Louise E. Moser, P. M. Melli...