On the public citation graph
Impact ofWAN Channel Behavior on End-to-end Latency of Replication Protocols
0 signed · 40 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.1002/(sici)1096-9942(1997)3:1<31::aid-tapo4>3.0.co;2-aopenalex-snapshot
Building reliable distributed systems with CORBA
inferredcites →https://doi.org/10.1002/(sici)1096-9942(1998)4:2<81::aid-tapo3>3.0.co;2-aopenalex-snapshot
Consistent object replication in the Eternal system
inferredcites →https://doi.org/10.1002/(sici)1097-024x(19990725)29:9<741::aid-spe259>3.0.co;2-iopenalex-snapshot
A review of experiences with reliable multicast
inferredcites →https://doi.org/10.1007/3-540-36520-6_5openalex-snapshot
Performance Analysis of Java Group Toolkits: A Case Study
inferredcites →https://doi.org/10.1007/3-540-45706-2_79openalex-snapshot
A Fault-Tolerant Sequencer for Timed Asynchronous Systems
inferredcites →https://doi.org/10.1016/j.jpdc.2005.06.021openalex-snapshot
A classification of total order specifications and its application to fixed sequencer-based implementations
inferredcites →https://doi.org/10.1109/2.585156openalex-snapshot
Software-based replication for fault tolerance
inferredcites →https://doi.org/10.1109/71.910869openalex-snapshot
Implementing E-transactions with asynchronous replication
inferredcites →https://doi.org/10.1109/90.779192openalex-snapshot
End-to-end Internet packet dynamics
inferredcites →https://doi.org/10.1109/ftcs.1988.5327openalex-snapshot
The Delta-4 approach to dependability in open distributed computing systems
inferredcites →https://doi.org/10.1109/ftcs.1992.243618openalex-snapshot
Active replication in Delta-4
inferredcites →https://doi.org/10.1109/ftcsh.1995.532668openalex-snapshot
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
inferredcites →https://doi.org/10.1109/icdcs.1998.679498openalex-snapshot
A suite of database replication protocols based on group communication primitives
inferredcites →https://doi.org/10.1109/mrd.1992.242619openalex-snapshot
Highly-available services using the primary-backup approach
inferredcites →https://doi.org/10.1109/reldis.1997.632808openalex-snapshot
Fast replicated state machines over partitionable networks
inferredcites →https://doi.org/10.1109/reldis.2002.1180179openalex-snapshot
Active software replication through a three-tier approach
inferredcites →https://doi.org/10.1109/tc.2002.1024739openalex-snapshot
The timely computing base model and architecture
inferredcites →https://doi.org/10.1109/tnet.2003.810312openalex-snapshot
End-to-end WAN service availability
inferredcites →https://doi.org/10.1109/tpds.2006.89openalex-snapshot
Fully distributed three-tier active software replication
inferredcites →https://doi.org/10.1145/1165389.945470openalex-snapshot
Separating agreement from execution for byzantine fault tolerant services
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/248052.248062openalex-snapshot
Efficient message ordering in dynamic networks
inferredcites →https://doi.org/10.1145/505202.505228openalex-snapshot
On the constancy of internet path properties
inferredcites →https://doi.org/10.1145/571825.571864openalex-snapshot
Evaluating the running time of a communication round over the internet
inferredcites →https://doi.org/10.1145/571860.571864openalex-snapshot
Evaluating the running time of a communication round over the internet
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/945469.945470openalex-snapshot
Separating agreement from execution for byzantine fault tolerant services
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-76848-7_47openalex-snapshot
An Adaptive Coupling-Based Algorithm for Internal Clock Synchronization of Large Scale Dynamic Systems
inferred← citeshttps://doi.org/10.1007/s10922-011-9199-8openalex-snapshot
Supporting NGNs Core Software Services: A Hybrid Architecture and its Performance Analysis
inferred← citeshttps://doi.org/10.1109/ares.2007.126openalex-snapshot
Revisiting Hot Passive Replication
inferred← citeshttps://doi.org/10.1109/cnsm.2010.5691247openalex-snapshot
Moving core services to the edge in NGNs for reducing managed infrastructure size
inferred← citeshttps://doi.org/10.1109/ipdps.2012.86openalex-snapshot
Dynamic Message Ordering for Topic-Based Publish/Subscribe Systems
inferred← citeshttps://doi.org/10.1109/prdc.2008.38openalex-snapshot
A Peer-to-Peer Filter-Based Algorithm for Internal Clock Synchronization in Presence of Corrupted Processes
inferred← citeshttps://doi.org/10.1109/tpds.2009.111openalex-snapshot
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
inferred← citeshttps://doi.org/10.1145/2997654openalex-snapshot
Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-Value Stores
inferred← citeshttps://doi.org/10.1515/9782760523821-028openalex-snapshot
Authors’ Contact Information
inferred← citeshttps://doi.org/10.5555/1487652.1487653openalex-snapshot
A theoretical evaluation of peer-to-peer internal clock synchronization
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.