On the public citation graph

Performance characterization of quorum-consensus algorithms for replicated data

0 signed · 100 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1016/0010-4485(78)90118-5openalex-snapshot
Operating systems — an advanced course
inferredcites →https://doi.org/10.1109/tc.1987.1676860openalex-snapshot
The Reliability of Voting Mechanisms
inferredcites →https://doi.org/10.1109/tse.1987.232855openalex-snapshot
On the Reliability of the IBM MVS/XA Operating System
inferredcites →https://doi.org/10.1145/22952.22953openalex-snapshot
Dynamic quorum adjustment for partitioned data
inferredcites →https://doi.org/10.1145/319989.319992openalex-snapshot
Achieving robustness in distributed database systems
inferredcites →https://doi.org/10.1145/38713.38740openalex-snapshot
Dynamic voting
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/6306.6308openalex-snapshot
A quorum-consensus replication method for abstract data types
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1201/9781351132510-2openalex-snapshot
Fundamentals of Applied Probability

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1995.1059openalex-snapshot
A Tight Upper Bound on the Benefits of Replica Control Protocols
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_85openalex-snapshot
Efficient voting protocols with witnesses
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_18openalex-snapshot
Weighted voting for operation dependent management of replicated data
inferred← citeshttps://doi.org/10.1007/978-3-7091-9198-9_3openalex-snapshot
Evaluating the Impact of Network Partitions on Replicated Data Availability
inferred← citeshttps://doi.org/10.1007/bf02973437openalex-snapshot
Fault tolerant algorithm based on dynamic and active load balancing for redundant services
inferred← citeshttps://doi.org/10.1007/bfb0030830openalex-snapshot
Analysis of quorum-based protocols for distributed (k+1)-exclusion
inferred← citeshttps://doi.org/10.1007/s00453-022-01060-5openalex-snapshot
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00012-3openalex-snapshot
Message complexity of hierarchical quorum consensus algorithm
inferred← citeshttps://doi.org/10.1016/0026-2714(95)00194-8openalex-snapshot
The effect of workload on the performance and availability of voting algorithms
inferred← citeshttps://doi.org/10.1016/0166-5316(92)90017-bopenalex-snapshot
Measuring the effects of distributed database models on transaction availability measures
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90011-wopenalex-snapshot
Performance evaluation of catalog management schemes in distributed database systems
inferred← citeshttps://doi.org/10.1016/s0020-0255(99)00024-9openalex-snapshot
Minimal cost replicated file system with an availability constraint
inferred← citeshttps://doi.org/10.1016/s0164-1212(00)00056-xopenalex-snapshot
Optimal binary vote assignment for replicated data
inferred← citeshttps://doi.org/10.1016/s1389-1286(03)00322-0openalex-snapshot
An efficient QoS routing algorithm for quorumcast communication
inferred← citeshttps://doi.org/10.1080/00207729808929572openalex-snapshot
Optimal cost design of replicated data in distributed database systems
inferred← citeshttps://doi.org/10.1088/1742-6596/1015/4/042059openalex-snapshot
Application of majority voting and consensus voting algorithms in N-version software
inferred← citeshttps://doi.org/10.1088/1742-6596/1015/4/042060openalex-snapshot
Classification of voting algorithms for N-version software
inferred← citeshttps://doi.org/10.1088/1742-6596/1333/3/032087openalex-snapshot
Fuzzy voting algorithms for N-version software
inferred← citeshttps://doi.org/10.1109/12.135555openalex-snapshot
Effect of fault tolerance on response time-analysis of the primary site approach
inferred← citeshttps://doi.org/10.1109/12.83661openalex-snapshot
Hierarchical quorum consensus: a new algorithm for managing replicated data
inferred← citeshttps://doi.org/10.1109/12.88491openalex-snapshot
Vote assignments in weighted voting mechanisms
inferred← citeshttps://doi.org/10.1109/24.295014openalex-snapshot
Order-P: an algorithm to order network partitionings
inferred← citeshttps://doi.org/10.1109/26.380059openalex-snapshot
On the performance of protocols for collecting responses over a multiple-access channel
inferred← citeshttps://doi.org/10.1109/32.238570openalex-snapshot
Capacity of voting systems
inferred← citeshttps://doi.org/10.1109/69.180609openalex-snapshot
The grid protocol: a high performance scheme for maintaining replicated data
inferred← citeshttps://doi.org/10.1109/69.43421openalex-snapshot
A hybrid replica control algorithm combining static and dynamic voting
inferred← citeshttps://doi.org/10.1109/69.542030openalex-snapshot
Using reconfiguration for efficient management of replicated data
inferred← citeshttps://doi.org/10.1109/69.60797openalex-snapshot
Storage efficient replicated databases
inferred← citeshttps://doi.org/10.1109/69.87983openalex-snapshot
Optimizing vote and quorum assignments for reading and writing replicated data
inferred← citeshttps://doi.org/10.1109/71.262589openalex-snapshot
Voting as the optimal static pessimistic scheme for managing replicated data
inferred← citeshttps://doi.org/10.1109/71.372774openalex-snapshot
Coding-based replication schemes for distributed systems
inferred← citeshttps://doi.org/10.1109/71.476168openalex-snapshot
A fault-tolerant algorithm for replicated data management
inferred← citeshttps://doi.org/10.1109/71.598279openalex-snapshot
Analysis of quorum-based protocols for distributed (k+1)-exclusion
inferred← citeshttps://doi.org/10.1109/71.80192openalex-snapshot
Specifying graceful degradation
inferred← citeshttps://doi.org/10.1109/access.2022.3191686openalex-snapshot
GeoRep—Resilient Storage for Wide Area Networks
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363945openalex-snapshot
Comparison of eager and quorum-based replication in a cloud environment
inferred← citeshttps://doi.org/10.1109/cmpcmm.1993.659081openalex-snapshot
Probabilistic Multicast: Generalizing the Multicast Paradigm to Improve Scalability
inferred← citeshttps://doi.org/10.1109/dcs.1988.12548openalex-snapshot
Voting with ghosts
inferred← citeshttps://doi.org/10.1109/ftdcs.1990.138355openalex-snapshot
Performance of quorum consensus protocols for mutual exclusion from the user's point of view
inferred← citeshttps://doi.org/10.1109/hicss.1994.323249openalex-snapshot
On the power of reconfiguration in fault-tolerant distributed databases
inferred← citeshttps://doi.org/10.1109/hicss.1994.323253openalex-snapshot
Using extended hierarchical quorum consensus to control replicated data: from traditional voting to logical structures
inferred← citeshttps://doi.org/10.1109/icc.1992.268093openalex-snapshot
Order-P: an algorithm to order network partitionings
inferred← citeshttps://doi.org/10.1109/icdcs.1990.89304openalex-snapshot
Multidimensional voting: a general method for implementing synchronization in distributed systems
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235109openalex-snapshot
Optimal coteries for rings and related networks
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302398openalex-snapshot
An efficient method for mutual exclusion in truly distributed systems
inferred← citeshttps://doi.org/10.1109/icde.1988.105456openalex-snapshot
Integrating static and dynamic voting protocols to enhance file availability
inferred← citeshttps://doi.org/10.1109/icde.1989.47226openalex-snapshot
Optimizing vote and quorum assignments for reading and writing replicated data
inferred← citeshttps://doi.org/10.1109/icde.1990.113497openalex-snapshot
The grid protocol: a high performance scheme for maintaining replicated data
inferred← citeshttps://doi.org/10.1109/icde.1991.131458openalex-snapshot
Voting with regenerable volatile witnesses
inferred← citeshttps://doi.org/10.1109/icde.1992.213188openalex-snapshot
A fault-tolerant algorithm for replicated data management
inferred← citeshttps://doi.org/10.1109/icde.1992.213192openalex-snapshot
Using coding to support data resiliency in distributed systems
inferred← citeshttps://doi.org/10.1109/icnp.2001.992890openalex-snapshot
An efficient QoS routing algorithm for quorumcast communication
inferred← citeshttps://doi.org/10.1109/icsmc.2003.1244350openalex-snapshot
Non-stop Internet model based on Circle Quorum System
inferred← citeshttps://doi.org/10.1109/infcom.1991.147682openalex-snapshot
On the performance of protocols for collecting responses over a multiple-access channel
inferred← citeshttps://doi.org/10.1109/infcom.1992.263559openalex-snapshot
Improving the throughput of point-to-multipoint ARQ protocols through destination set splitting
inferred← citeshttps://doi.org/10.1109/infcom.1994.337530openalex-snapshot
Multi-destination communication over single-hop lightwave WDM networks
inferred← citeshttps://doi.org/10.1109/infcom.1994.337653openalex-snapshot
Probabilistic multicast: generalizing the multicast paradigm to improve scalability
inferred← citeshttps://doi.org/10.1109/infcom.1997.631176openalex-snapshot
Application-layer anycasting
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302996openalex-snapshot
Transaction based dynamic partial replication in mobile environments
inferred← citeshttps://doi.org/10.1109/ipds.1996.540224openalex-snapshot
Analysis of data replication with two levels of consistency
inferred← citeshttps://doi.org/10.1109/issre.2003.1251043openalex-snapshot
Automating the analysis of voting systems
inferred← citeshttps://doi.org/10.1109/mascot.1995.378684openalex-snapshot
The effect of workload on the performance and availability of voting algorithms
inferred← citeshttps://doi.org/10.1109/mrd.1990.138254openalex-snapshot
Optimizing the performance of quorum consensus replica control protocols
inferred← citeshttps://doi.org/10.1109/mrd.1990.138256openalex-snapshot
Some (naive?) questions about replica control
inferred← citeshttps://doi.org/10.1109/mrd.1992.242624openalex-snapshot
Dynamic logical structures: a position statement for managing replicated data
inferred← citeshttps://doi.org/10.1109/pccc.1992.200517openalex-snapshot
Availability analysis of composite coteries
inferred← citeshttps://doi.org/10.1109/pccc.1993.344470openalex-snapshot
Optimal 0/1 vote assignment for replicated data
inferred← citeshttps://doi.org/10.1109/pccc.1994.504096openalex-snapshot
An Available Copy Protocol Tolerating Network Partitions
inferred← citeshttps://doi.org/10.1109/qest.2007.25openalex-snapshot
Performance Modeling of a Quorum Pattern in Layered Service Systems
inferred← citeshttps://doi.org/10.1109/qest.2007.31openalex-snapshot
Model checking the probabilistic pi-calculus
inferred← citeshttps://doi.org/10.1109/reldis.1988.25789openalex-snapshot
Vote assignments in weighted voting mechanisms
inferred← citeshttps://doi.org/10.1109/reldis.1989.72757openalex-snapshot
Availability analysis of the primary site approach for fault tolerance
inferred← citeshttps://doi.org/10.1109/reldis.1990.93958openalex-snapshot
Voting as the optimal static pessimistic scheme for managing replicated data
inferred← citeshttps://doi.org/10.1109/reldis.1992.235142openalex-snapshot
Optimal replica control protocols for ring networks
inferred← citeshttps://doi.org/10.1109/reldis.1992.235146openalex-snapshot
Dynamic management of highly replicated data
inferred← citeshttps://doi.org/10.1109/reldis.2001.969732openalex-snapshot
How to select a replication protocol according to scalability, availability and communication overhead
inferred← citeshttps://doi.org/10.1109/tr.2004.832819openalex-snapshot
A Taxonomy for Software Voting Algorithms Used in Safety-Critical Systems
inferred← citeshttps://doi.org/10.1145/118544.118552openalex-snapshot
Multidimensional voting
inferred← citeshttps://doi.org/10.1145/146931.146935openalex-snapshot
The generalized tree quorum protocol
inferred← citeshttps://doi.org/10.1145/312624.312662openalex-snapshot
Partial replica selection based on relevance for information retrieval
inferred← citeshttps://doi.org/10.1145/345508.345591openalex-snapshot
Partial collection replication versus caching for information retrieval systems
inferred← citeshttps://doi.org/10.1145/78922.78926openalex-snapshot
Dynamic voting algorithms for maintaining the consistency of a replicated database
inferred← citeshttps://doi.org/10.1145/937598.937601openalex-snapshot
Are quorums an alternative for data replication?
inferred← citeshttps://doi.org/10.1145/98457.98507openalex-snapshot
Probabilistic language analysis of weighted voting algorithms
inferred← citeshttps://doi.org/10.1145/98460.98507openalex-snapshot
Probabilistic language analysis of weighted voting algorithms
inferred← citeshttps://doi.org/10.1631/jzus.2004.0550openalex-snapshot
Circle quorum system-based non-stop network service model
inferred← citeshttps://doi.org/10.22215/etd/2007-06184openalex-snapshot
Performance modeling of replication techniques in parallel and distributed layered service architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03129openalex-snapshot
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems
inferred← citeshttps://doi.org/10.5220/0009835403280338openalex-snapshot
Superlinear and Bandwidth Friendly Geo-replication for Store-and-forward Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.