Sciweavers

219 search results - page 15 / 44
» Byzantine Quorum Systems
Sort
View
WDAG
2000
Springer
97views Algorithms» more  WDAG 2000»
14 years 1 months ago
Objects Shared by Byzantine Processes
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only...
Dahlia Malkhi, Michael Merritt, Michael K. Reiter,...
JDM
1998
101views more  JDM 1998»
13 years 9 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
DSN
2008
IEEE
14 years 4 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»
14 years 3 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
ICDCS
2008
IEEE
14 years 4 months ago
Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System
Quorum-based Power Saving (QPS) protocols have been proposed for ad hoc networks (e.g., IEEE 802.11 ad hoc mode) to increase energy efficiency and prolong the operational time of...
Shan-Hung Wu, Ming-Syan Chen, Chung-Min Chen