On the public citation graph
An analysis of the average message overhead in replica control protocols
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/12.83661openalex-snapshot
Hierarchical quorum consensus: a new algorithm for managing replicated data
inferredcites →https://doi.org/10.1109/32.368122openalex-snapshot
On a unified framework for the evaluation of distributed quorum attainment protocols
inferredcites →https://doi.org/10.1109/71.476168openalex-snapshot
A fault-tolerant algorithm for replicated data management
inferredcites →https://doi.org/10.1109/icde.1988.105469openalex-snapshot
Efficient dynamic voting algorithms
inferredcites →https://doi.org/10.1109/icde.1990.113497openalex-snapshot
The grid protocol: a high performance scheme for maintaining replicated data
inferredcites →https://doi.org/10.1145/103727.103728openalex-snapshot
An efficient and fault-tolerant solution for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/325405.325443openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_25openalex-snapshot
A Replication Protocol with Composite Topology for High Adaptability
inferred← citeshttps://doi.org/10.1007/3-540-44863-2_47openalex-snapshot
Symmetric Tree Replication Protocol for Efficient Distributed Storage System
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_49openalex-snapshot
Delay Optimizations in Quorum Consensus
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_10openalex-snapshot
Increasing the Expressiveness of Analytical Performance Models for Replicated Databases
inferred← citeshttps://doi.org/10.1007/s00453-003-1066-xopenalex-snapshot
Delay Optimization in Quorum Consensus
inferred← citeshttps://doi.org/10.1007/s11227-010-0536-6openalex-snapshot
Dynamic hybrid replication effectively combining tree and grid topology
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00111-3openalex-snapshot
Response time behavior of distributed voting algorithms for managing replicated data
inferred← citeshttps://doi.org/10.1023/a:1008785706349openalex-snapshot
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
inferred← citeshttps://doi.org/10.1023/a:1025540831715openalex-snapshot
Analyzing User-Perceived Dependability and Performance Characteristics of Voting Algorithms for Managing Replicated Data
inferred← citeshttps://doi.org/10.1093/comjnl/42.7.613openalex-snapshot
Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks
inferred← citeshttps://doi.org/10.1109/69.868912openalex-snapshot
Performance modeling of distributed and replicated databases
inferred← citeshttps://doi.org/10.1109/71.762814openalex-snapshot
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1109/asset.1999.756758openalex-snapshot
User-perceived availability and response-time in voting-based replicated systems: a case study
inferred← citeshttps://doi.org/10.1109/cmpsac.1999.812691openalex-snapshot
Response time behavior of voting schemes for managing replicated data
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776512openalex-snapshot
Using hysteresis to reduce adaptation cost of a dynamic quorum assignment
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.1145/937598.937601openalex-snapshot
Are quorums an alternative for data replication?
inferred← citeshttps://doi.org/10.1515/jmc.2007.019openalex-snapshot
The average transmission overhead for broadcast encryption
inferred← citeshttps://doi.org/10.3745/kipsta.2005.12a.2.171openalex-snapshot
An Efficient Hybrid Replication Protocol for High Available Distributed System
inferred← citeshttps://doi.org/10.5815/ijcnis.2012.10.02openalex-snapshot
Self Organized Replica Overlay Scheme for P2P Networks
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.