Sciweavers

1124 search results - page 9 / 225
» Refined quorum systems
Sort
View
JDM
1998
101views more  JDM 1998»
14 years 11 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
93
Voted
DSN
2008
IEEE
15 years 6 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
WDAG
2005
Springer
74views Algorithms» more  WDAG 2005»
15 years 5 months ago
On the Availability of Non-strict Quorum Systems
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
NCA
2007
IEEE
15 years 6 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...
ICDCS
2006
IEEE
15 years 5 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