Sciweavers

37 search results - page 1 / 8
» Tolerating Byzantine Faulty Clients in a Quorum System
Sort
View
ICDCS
2006
IEEE
13 years 10 months ago
Tolerating Byzantine Faulty Clients in a Quorum System
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
Barbara Liskov, Rodrigo Rodrigues
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
13 years 11 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
SRDS
2003
IEEE
13 years 10 months ago
Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers
This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers ...
Hagit Attiya, Amir Bar-Or
SRDS
2005
IEEE
13 years 10 months ago
Agile Store: Experience with Quorum-Based Data Replication Techniques for Adaptive Byzantine Fault Tolerance
Quorum protocols offer several benefits when used to maintain replicated data but techniques for reducing overheads associated with them have not been explored in detail. It is d...
Lei Kong, Deepak J. Manohar, Mustaque Ahamad, Arun...
OTM
2009
Springer
13 years 11 months ago
Proactive Byzantine Quorum Systems
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzan...
Eduardo Adílio Pelinson Alchieri, Alysson N...