On the public citation graph
A Statistical Theory of Chord Under Churn
0 signed · 86 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.1007/978-3-540-30183-7_9openalex-snapshot
Comparing the Performance of Distributed Hash Tables Under Churn
inferredcites →https://doi.org/10.1016/b978-0-444-52965-7.x5000-4openalex-snapshot
Stochastic Processes in Physics and Chemistry
inferredcites →https://doi.org/10.1109/dsn.2004.1311872openalex-snapshot
Performance and dependability of structured peer-to-peer overlays
inferredcites →https://doi.org/10.1109/glocom.2003.1258952openalex-snapshot
On resilience of structured peer-to-peer systems
inferredcites →https://doi.org/10.1109/tkde.2004.1318567openalex-snapshot
Efficient, Self-Contained Handling of Identity in Peer-to-Peer Systems
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1145/571825.571862openalex-snapshot
Fault-tolerant routing in peer-to-peer systems
inferredcites →https://doi.org/10.1145/571825.571863openalex-snapshot
Analysis of the evolution of peer-to-peer systems
inferredcites →https://doi.org/10.1524/zpch.1995.188.part_1_2.310aopenalex-snapshot
Stochastic Processes in Physics and Chemistry
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1152openalex-snapshot
An analytical study on optimizing the lookup performance of distributed hash table systems under churn
inferred← citeshttps://doi.org/10.1002/dac.1001openalex-snapshot
Multi‐factors oriented study of P2P Churn
inferred← citeshttps://doi.org/10.1007/978-0-387-09751-0_9openalex-snapshot
Overview of Structured Peer-to-Peer Overlay Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-50463-6_17openalex-snapshot
Performance Evaluation of Peer-to-Peer Structured Overlays over Mobile Ad Hoc Networks Having Low Dynamism
inferred← citeshttps://doi.org/10.1007/978-3-540-69962-0_2openalex-snapshot
Improving the Performance and Robustness of Kademlia-Based Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72990-7_56openalex-snapshot
Estimating Churn in Structured P2P Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-88140-7_30openalex-snapshot
Grid Service Discovery Based on Cross-VO Service Domain Model
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_51openalex-snapshot
Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn
inferred← citeshttps://doi.org/10.1007/978-3-642-32808-4_6openalex-snapshot
Enhancing Collaborative Intrusion Detection Methods Using a Kademlia Overlay Network
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_6openalex-snapshot
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers
inferred← citeshttps://doi.org/10.1016/b978-0-12-374214-8.00036-2openalex-snapshot
ReferencesChapter 2Chapter 3Chapter 4Chapter 5Chapter 6Chapter 7Chapter 8Chapter 9Chapter 10Chapter 11Chapter 12Chapter 13Chapter 14Chapter 15
inferred← citeshttps://doi.org/10.1016/b978-0-12-374214-8.x0001-3openalex-snapshot
P2P Networking and Applications
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.08.008openalex-snapshot
Stochastic analysis of the interplay between object maintenance and churn
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.01.051openalex-snapshot
Resilience of structured P2P systems under churn: The reachable component method
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.12.043openalex-snapshot
Self Management and the Future of Software Design
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.052openalex-snapshot
Verification of Peer-to-peer Algorithms: A Case Study
inferred← citeshttps://doi.org/10.1016/j.future.2013.09.009openalex-snapshot
Flat and hierarchical epidemics in P2P systems: Energy cost models and analysis
inferred← citeshttps://doi.org/10.1016/j.ins.2013.02.034openalex-snapshot
Understanding the effects of P2P dynamics on trust bootstrapping
inferred← citeshttps://doi.org/10.1016/j.jnca.2010.07.011openalex-snapshot
Randomized load balancing strategies with churn resilience in peer-to-peer networks
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.01.004openalex-snapshot
Identification of dynamic community in temporal network via joint learning graph representation and nonnegative matrix factorization
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.025openalex-snapshot
Proving properties of the Chord protocol using the ASM formalism
inferred← citeshttps://doi.org/10.1016/s1005-8885(13)60003-5openalex-snapshot
Dynamic modeling approach to analyze user churn in a large P2P downloading system
inferred← citeshttps://doi.org/10.1088/1742-6596/473/1/012017openalex-snapshot
The physics of distributed information systems
inferred← citeshttps://doi.org/10.1109/cit.2010.184openalex-snapshot
Distinguishing the Master to Defend DDoS Attack in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/dsn.2006.4openalex-snapshot
A General Framework for Scalability and Performance Analysis of DHT Routing Systems
inferred← citeshttps://doi.org/10.1109/icnp.2005.27openalex-snapshot
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
inferred← citeshttps://doi.org/10.1109/icnp.2006.320196openalex-snapshot
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/icpads.2008.42openalex-snapshot
Scheduling Peers Based on Credit Construction Period in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/iiki.2016.65openalex-snapshot
Correctness of the Chord Protocol
inferred← citeshttps://doi.org/10.1109/infcom.2007.246openalex-snapshot
On Node Isolation Under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes
inferred← citeshttps://doi.org/10.1109/infcom.2007.255openalex-snapshot
On the Stability-Scalability Tradeoff of DHT Deployment
inferred← citeshttps://doi.org/10.1109/infcom.2007.53openalex-snapshot
Residual-Based Measurement of Peer and Link Lifetimes in Gnutella Networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195745openalex-snapshot
On superposition of heterogeneous edge processes in dynamic random graphs
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566974openalex-snapshot
Unstructured P2P link lifetimes redux
inferred← citeshttps://doi.org/10.1109/infocom.2006.329openalex-snapshot
Improving Lookup Performance Over a Widely-Deployed DHT
inferred← citeshttps://doi.org/10.1109/infocom.2008.159openalex-snapshot
Understanding Disconnection and Stabilization of Chord
inferred← citeshttps://doi.org/10.1109/infocom.2008.38openalex-snapshot
Link Lifetimes and Randomized Neighbor Selection in DHTs
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639269openalex-snapshot
An adaptive stabilization framework for distributed hash tables
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536282openalex-snapshot
Random choices for churn resilient load balancing in peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/ispdc.2016.50openalex-snapshot
An Optimized DHT for Linux Package Distribution
inferred← citeshttps://doi.org/10.1109/p2p.2006.4openalex-snapshot
Analytical Study on Improving DHT Lookup Performance under Churn
inferred← citeshttps://doi.org/10.1109/p2p.2009.5284546openalex-snapshot
On routing in Distributed Hash Tables: Is reputation a shelter from malicious behavior and churn?
inferred← citeshttps://doi.org/10.1109/p2p.2009.5284550openalex-snapshot
Robust lifetime measurement in large-scale P2P systems with non-stationary arrivals
inferred← citeshttps://doi.org/10.1109/p2p.2011.6038752openalex-snapshot
SocialHelpers: Introducing social trust to ameliorate churn in P2P reputation systems
inferred← citeshttps://doi.org/10.1109/p2p.2014.6934306openalex-snapshot
On the tradeoff between resilience and degree overload in dynamic P2P graphs
inferred← citeshttps://doi.org/10.1109/pdp.2008.18openalex-snapshot
Comparing Maintenance Strategies for Overlays
inferred← citeshttps://doi.org/10.1109/percom.2008.14openalex-snapshot
Evaluation of Peer-to-Peer Overlays for First Response
inferred← citeshttps://doi.org/10.1109/srds.2008.19openalex-snapshot
Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols
inferred← citeshttps://doi.org/10.1109/synasc.2014.74openalex-snapshot
Expressing BBUFs Lookup Using the π-Calculus
inferred← citeshttps://doi.org/10.1109/tetci.2024.3386844openalex-snapshot
Graph Contrastive Learning for Tracking Dynamic Communities in Temporal Networks
inferred← citeshttps://doi.org/10.1109/tnet.2007.893199openalex-snapshot
On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/tnet.2007.905590openalex-snapshot
An Analytical Study of a Structured Overlay in the Presence of Dynamic Membership
inferred← citeshttps://doi.org/10.1109/tnet.2007.911433openalex-snapshot
On Static and Dynamic Partitioning Behavior of Large-Scale P2P Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.2001727openalex-snapshot
Residual-Based Estimation of Peer and Link Lifetimes in P2P Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.925626openalex-snapshot
Node Isolation Model and Age-Based Neighbor Selection in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/tnet.2014.2306153openalex-snapshot
Unstructured P2P Link Lifetimes Redux
inferred← citeshttps://doi.org/10.1109/tpds.2010.114openalex-snapshot
Understanding Disconnection and Stabilization of Chord
inferred← citeshttps://doi.org/10.1109/tpds.2011.101openalex-snapshot
Analysis of Link Lifetimes and Neighbor Selection in Switching DHTs
inferred← citeshttps://doi.org/10.1109/tpds.2013.163openalex-snapshot
Unifying Models of Churn and Resilience for Unstructured P2P Graphs
inferred← citeshttps://doi.org/10.1109/tse.2017.2655056openalex-snapshot
Reasoning About Identifier Spaces: How to Make Chord Correct
inferred← citeshttps://doi.org/10.1109/wicom.2007.483openalex-snapshot
An Efficient Broadcast Algorithm in Distributed Hash Table Under Churn
inferred← citeshttps://doi.org/10.1145/1925019.1925027openalex-snapshot
In-degree dynamics of large-scale P2P systems
inferred← citeshttps://doi.org/10.1145/2185376.2185383openalex-snapshot
Using lightweight modeling to understand chord
inferred← citeshttps://doi.org/10.1145/3368510openalex-snapshot
Consistent Sampling of Churn Under Periodic Non-Stationary Arrivals in Distributed Systems
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.24openalex-snapshot
Overcoming Software Fragility with Interacting Feedback Loops and Reversible Phase Transitions
inferred← citeshttps://doi.org/10.22028/d291-25924openalex-snapshot
Approximate information filtering in structured peer-to-peer networks
inferred← citeshttps://doi.org/10.25972/opus-2250openalex-snapshot
Performance Analysis of Structured Overlay Networks
inferred← citeshttps://doi.org/10.26083/tuprints-00002198openalex-snapshot
Peer-to-Peer Concepts for Emergency First Response
inferred← citeshttps://doi.org/10.4304/jnw.1.3.9-17openalex-snapshot
An EMST Based Look-up Protocol for Peer to Peer Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1208.0712openalex-snapshot
Description of the Chord Protocol using ASMs Formalism
inferred← citeshttps://doi.org/10.48550/arxiv.1902.02174openalex-snapshot
Blockchain Storage Load Balancing Among DHT Clustered Nodes
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3615openalex-snapshot
SoS: self-organizing substrates
inferred← citeshttps://doi.org/10.5555/1251203.1251211openalex-snapshot
Bandwidth-efficient management of DHT routing tables
inferred← citeshttps://doi.org/10.70675/3b547b33z9e86z41b2z97e8z4a0eb9a87281openalex-snapshot
Extension événementielle d'une méthode formelle légère et application à l'analyse du protocole distribué Chord
inferred← citeshttps://doi.org/10.7916/d8zc8908openalex-snapshot
Mitigating Network Service Disruptions in High-bandwidth, Intermittently Connected, and Peer-to-Peer 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.