Sciweavers

33 search results - page 3 / 7
» Probabilistic Byzantine Quorum Systems
Sort
View
ICDCS
2006
IEEE
14 years 2 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
SRDS
2007
IEEE
14 years 2 months ago
Evaluating Byzantine Quorum Systems
Replication is a mechanism extensively used to guarantee the availability and good performance of data storage services. Byzantine Quorum Systems (BQS) have been proposed as a sol...
Wagner Saback Dantas, Alysson Neves Bessani, Joni ...
NCA
2007
IEEE
14 years 2 months ago
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
Alysson Neves Bessani, Miguel Correia, Joni da Sil...
STOC
1997
ACM
131views Algorithms» more  STOC 1997»
14 years 22 days ago
Byzantine Quorum Systems
Dahlia Malkhi, Michael K. Reiter
ICPADS
2008
IEEE
14 years 3 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao