Probabilistic quorum systems

No abstract is available for this paper.

• Publication year

  1997

• Venue

  ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

• Publication date

  1997-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/259380.259458
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ad Hoc mobility management with uniform quorum systems

  1999cited by this paper
• Non-blocking Asynchronous Byzantine Quorum Systems

  1999cited by this paper
• On Propagating Updates in a Byzantine Environment

  1999cited by this paper
• Secure Multicast in a WAN

  1999cited by this paper
• On diffusing updates in a Byzantine environment

  1999cited by this paper
• Retrospective: a study of branch prediction strategies

  1998cited by this paper
• Secure and scalable replication in Phalanx

  1998cited by this paper
• Synchronous Byzantine quorum systems

  1997cited by this paper
• Crumbling walls: a class of practical and efficient quorum systems

  1997cited by this paper
• Epidemic algorithms in replicated databases (extended abstract)

  1997cited by this paper
• Secure reliable multicast protocols in a WAN

  1997cited by this paper
• Byzantine quorum systems

  1997cited by this paper
• The load and availability of Byzantine quorum systems

  1997cited by this paper
• Fast and scalable handoffs for wireless internetworks

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Proceedings of the 10th International Workshop on Distributed Algorithms

  1996cited by this paper
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)

  1996cited by this paper
• The Availability of Quorum Systems

  1995cited by this paper
• Randomized algorithms

  1995cited by this paper
• Achieving Critical Reliability With Unreliable Components andUnreliable Glue

  1995cited by this paper
• Chernoff-Hoeffding bounds for applications with limited independence

  1995cited by this paper
• The load, capacity and availability of quorum systems

  1994cited by this paper
• Crumbling Walls: A Class of High Availability Quorum Systems

  1994cited by this paper
• Bounded ignorance

  1994cited by this paper
• Optimal multi-writer multi-reader atomic register

  1992cited by this paper
• Tolerating bounded inconsistency for increasing concurrency in database systems

  1992cited by this paper
• Efficient program transformations for resilient parallel computation via randomization (preliminary version)

  1992cited by this paper
• Clock construction in fully asynchronous parallel systems and PRAM simulation

  1992cited by this paper
• Replica control in distributed systems: as asynchronous approach

  1991cited by this paper
• An efficient and fault-tolerant solution for distributed mutual exclusion

  1991cited by this paper
• Replica Control in Distributed Systems: An Asynchronous Approach

  1991cited by this paper
• The grid protocol: a high performance scheme for maintaining replicated data

  1990cited by this paper
• Implementing fault-tolerant services using the state machine approach: a tutorial

  1990cited by this paper
• Epidemic algorithms for replicated database maintenance

  1988cited by this paper
• Epidemic algorithms for replicated database maintenance

  1987cited by this paper
• The Reliability of Voting Mechanisms

  1987cited by this paper
• Maintaining availability in partitioned replicated databases

  1987cited by this paper
• Concurrency Control and Recovery in Database Systems

  1987cited by this paper
• The Vulnerabilty of Vote Assignments

  1986cited by this paper
• A quorum-consensus replication method for abstract data types

  1986cited by this paper
• How to assign votes in a distributed system

  1985cited by this paper
• A √N algorithm for mutual exclusion in decentralized systems

  1985cited by this paper
• Hints for Computer System Design

  1983cited by this paper
• 7th symposium on operating systems principles

  1980cited by this paper
• A Majority consensus approach to concurrency control for multiple copy databases

  1979cited by this paper
• Weighted voting for replicated data

  1979cited by this paper
• The tail of the hypergeometric distribution

  1979cited by this paper
• The ARPA Network Design Decisions

  1977cited by this paper
• An open operating system for a single-user machine

  1974cited by this paper
• An Introduction to Probability Theory and Its Applications

  1967cited by this paper
• Probability inequalities for sum of bounded random variables

  1963cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper

• Scalable Accountable Byzantine Agreement and Beyond

  2025influential citation
• Real Life Is Uncertain. Consensus Should Be Too!

  2025cites this paper
• Byzantine Consensus in the Random Asynchronous Model

  2025cites this paper
• Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer

  2025cites this paper
• Probabilistic Byzantine Fault Tolerance

  2024cites this paper
• The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations

  2024cites this paper
• Fractional Payment Transactions: Executing Payment Transactions in Parallel with Less than f+1 Validations

  2024cites this paper
• Optimal Multilevel Slashing for Blockchains

  2024influential citation
• Chop Chop: Byzantine Atomic Broadcast to the Network Limit

  2023cites this paper
• Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations

  2023cites this paper
• Blockchain Data Replication

  2023cites this paper
• Dynamic Probabilistic Reliable Broadcast

  2023cites this paper
• Reference Architecture for Blockchain-Native Distributed Information System

  2023cites this paper
• Deterministic or probabilistic? - A survey on Byzantine fault tolerant state machine replication

  2023cites this paper
• High-availability clusters: A taxonomy, survey, and future directions

  2021cites this paper
• How to Trust Strangers: Composition of Byzantine Quorum Systems

  2021cites this paper
• Read-Write Quorum Systems Made Practical

  2021cites this paper
• Singularly Optimal Randomized Leader Election

  2020cites this paper
• Probabilistic Consistency Guarantee in Partial Quorum-Based Data Store

  2020cites this paper
• Consistency Analysis of Replication-Based Probabilistic Key-Value Stores

  2020cites this paper
• Online Payments by Merely Broadcasting Messages

  2020cites this paper
• Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system

  2019cites this paper
• Scalable Byzantine Reliable Broadcast (Extended Version)

  2019cites this paper
• Emulating a Shared Register in a System That Never Stops Changing

  2019cites this paper
• Inspection of Fault Tolerance in Cloud Environment

  2018cites this paper
• Minimizing content staleness in dynamo-style replicated storage systems

  2018cites this paper
• Analysis of Distributed Mutual Exclusion Algorithms

  2018cites this paper
• Crumbling Walls Log Quorum System-based Name Resolution Routing for CCN based IoT

  2018cites this paper
• Asynchronous neighbor discovery with unreliable link in wireless mobile networks

  2018cites this paper
• Leader Election in Well-Connected Graphs

  2018cites this paper
• D C ] 1 0 A ug 2 01 7 Simulating a Shared Register in a System that Never Stops Changing ∗

  2018cites this paper
• Tuning and Predicting Consistency in Distributed Storage Systems

  2017cites this paper
• Self-tuning Eventually-Consistent Data Stores

  2017cites this paper
• Probabilistic Models of Partial Order Enforcement in Distributed Systems. (Modèles probabilistes d'ordonnancement partiel pour les systèmes distribués)

  2017cites this paper
• Simulating a Shared Register in a System that Never Stops Changing

  2017cites this paper
• Sistema Publicador/Subscritor com Persistência de Dados para Redes de Dispositivos Móveis

  2017cites this paper
• Quadtrees and Morton Indexing

  2016cites this paper
• Scalable Atomic Visibility with RAMP Transactions

  2016cites this paper
• Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed Study

  2016cites this paper
• A Non-Consensus Based Decentralized Financial Transaction Processing Model with Support for Efficient Auditing

  2016cites this paper
• A Combinational Advance via Matrix Based Pairwise Key Establishment and Post Deployment Approach in WSN

  2016cites this paper
• Reliable causal delivery with probabilistic design

  2016cites this paper
• Exploiting cost-performance tradeoffs for modern cloud systems

  2016cites this paper
• How many cooks spoil the soup?

  2016cites this paper
• Adaptive Consistency Protocols for Replicated Data in Modern Storage Systems with a High Degree of Elasticity. (Cohérence de données répliquées partagées adaptative pour architectures de stockage à fort degré d'élasticité)

  2016cites this paper
• Fine-tuning the consistency-latency trade-off in quorum-replicated distributed storage systems

  2015cites this paper
• Soft Quorums: A High Availability Solution for Service Oriented Stream Systems

  2015cites this paper
• ELASTICITY, AVAILABILITY AND CONSISTENCY IN CLOUD-BASED AGGREGATE DATA STORES

  2015cites this paper
• A Modified Pair Wise Key Distribution Schemes and There Effect On Network Performances

  2015cites this paper
• Relaxing data consistency along different dimensions for increasing operation availabilities

  2015cites this paper
• Overlay Topology as Random-Walk Cache

  2015cites this paper
• Coordination Avoidance in Distributed Databases

  2015cites this paper
• BubbleStorm: rendezvous theory in unstructured peer-to-peer search = BubbleStorm: Rendezvous-Theorie in unstrukturierten Peer-to-peer-Netzwerken

  2015cites this paper
• Continuous Partial Quorums for Consistency-Latency Tuning in Distributed NoSQL Storage Systems

  2015influential citation
• Probabilistic Biquorums

  2015cites this paper
• Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract)

  2015cites this paper
• Mutual inclusion in asynchronous message-passing distributed systems

  2015cites this paper
• CaLibRe: A Better Consistency-Latency Tradeoff for Quorum Based Replication Systems

  2015cites this paper
• On the tradeoff of availability and consistency for quorum systems in data center networks

  2015cites this paper
• Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-Value Stores

  2015cites this paper
• Survey on Phoenix: Storage Using an Autonomous Mobile Infrastructure

  2014cites this paper
• Quantifying eventual consistency with PBS

  2014influential citation
• PAC'nPost : a peer-to-peer micro-blogging social network

  2014cites this paper
• Survey on Phoenix : Storage Using an Autonomous Mobile Infrastructure

  2014cites this paper
• Survey on Distributed Storage Using a Mobile Infrastructure

  2014cites this paper
• Survey on Distributed Storage Using a Mobile Infrastructure

  2014cites this paper
• Notes on Theory of Distributed Systems

  2014cites this paper
• A quantitative analysis of quorum system availability in data centers

  2014influential citation
• KEY PRE-DISTRIBUTION USING UNITAL DESIGN FOR WIRELESS SENSOR NETWORK 1

  2014cites this paper
• Phoenix: Storage Using an Autonomous Mobile Infrastructure

  2013cites this paper
• Retrieval of highly dynamic information in an unstructured peer-to-peer network

  2013cites this paper
• SECURED CONSISTENT NETWORK FOR COPING UP WITH FABRICATION ATTACK IN MANET

  2013cites this paper
• α-Register

  2013cites this paper
• International Conference on Information Systems and Computing ( ICISC-2013 ) , INDIA

  2013cites this paper
• Consistency or latency? A quantitative analysis of replication systems based on replicated state machines

  2013cites this paper
• A Distributed Pool Architecture for Highly Constrained Optimization Problems in Complex Systems Design

  2013cites this paper
• Quorum Systems: With Applications to Storage and Consensus

  2012cites this paper
• Evaluating Intrusion‐Tolerant Certification Authority Systems

  2012cites this paper
• Harmonic quorum systems: Data management in 2D/3D wireless sensor networks with holes

  2012cites this paper
• Adaptive Hybrid Quorums in Practical Settings

  2012cites this paper
• Probabilistically Bounded Staleness for Practical Partial Quorums

  2012influential citation
• GRADE: Graceful Degradation in Byzantine Quorum Systems

  2012cites this paper
• Sublinear bounds for randomized leader election

  2012cites this paper
• Guide to Reliable Distributed Systems

  2012influential citation
• Specification and Analytical Evaluation of Heterogeneous Dynamic Quorum-Based Data Replication Schemes

  2012cites this paper
• EENMDRA: Efficient Energy and Node Mobility based Data Replication Algorithm for MANET

  2012cites this paper
• On the Feasibility of Unstructured Peer-to-Peer Information Retrieval

  2011cites this paper
• Trade-offs in implementing consistent distributed storage

  2011cites this paper
• Multiwriter Consistency Conditions for Shared Memory Registers

  2011cites this paper
• Toward Robust High Performance Distributed Services

  2011cites this paper
• GeoQuorum: Load balancing and energy efficient data access in wireless sensor networks

  2011cites this paper
• A Scalable Quorum Based Approach for Improving Global Consistency in MANET

  2011cites this paper
• Redundant data management in unstructured peer-to-peer networks

  2011cites this paper
• Émulation de mémoire partagée en environnements distribués dynamiques

  2011cites this paper
• Implications of misbehaving attacks on probabilistic quorum system for MANETs

  2010cites this paper
• The Origin of Quorum Systems

  2010influential citation
• The Impact of Partial Orders among Strict and Probabilistic Quorums on the Data Consistency vs. Operation Availabilities Trade-Off

  2010cites this paper
• Robust Simulation of Shared Memory: 20 Years After

  2010cites this paper
• Distributed agreement with optimal communication complexity

  2010cites this paper
• Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes

  2010cites this paper