Sciweavers

219 search results - page 4 / 44
» Byzantine Quorum Systems
Sort
View
WMCSA
2008
IEEE
14 years 4 months ago
The obscure nature of epidemic quorum systems
Epidemic quorum systems enable highly available agreement even when a quorum is not simultaneously connected, and are therefore very interesting for mobile networks. Although rece...
João Barreto, Paulo Ferreira
ICALP
2004
Springer
14 years 3 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler
SOSP
2005
ACM
14 years 6 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
OPODIS
2008
13 years 11 months ago
Write Markers for Probabilistic Quorum Systems
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
Michael G. Merideth, Michael K. Reiter
EUROSYS
2011
ACM
13 years 1 months ago
DepSky: dependable and secure storage in a cloud-of-clouds
The increasing popularity of cloud storage services has lead companies that handle critical data to think about using these services for their storage needs. Medical record databa...
Alysson Neves Bessani, Miguel P. Correia, Bruno Qu...