Sciweavers

33 search results - page 4 / 7
» Probabilistic Byzantine Quorum Systems
Sort
View
PERCOM
2006
ACM
14 years 10 months ago
Communication-Efficient Probabilistic Quorum Systems for Sensor Networks
Gregory Chockler, Seth Gilbert, Boaz Patt-Shamir
OSDI
2006
ACM
14 years 11 months ago
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
DSN
2004
IEEE
14 years 2 months ago
A Framework for Dynamic Byzantine Storage
We present a framework for transforming several quorum-based protocols so that they can dynamically adapt their failure threshold and server count, allowing them to be reconfigure...
Jean-Philippe Martin, Lorenzo Alvisi
PODC
2004
ACM
14 years 4 months ago
Signed quorum systems
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...
Haifeng Yu
MOBIHOC
2003
ACM
14 years 4 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
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...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster