Sciweavers

46 search results - page 3 / 10
» Dynamic Byzantine Quorum Systems
Sort
View
ICDCS
2006
IEEE
14 years 1 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
PODC
2003
ACM
14 years 1 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
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...
PODC
1998
ACM
14 years 40 min ago
Probabilistic Byzantine Quorum Systems
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Re...