On the public citation graph
A General Framework for Scalability and Performance Analysis of DHT Routing Systems
0 signed · 37 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/11558989_9openalex-snapshot
A Statistical Theory of Chord Under Churn
inferredcites →https://doi.org/10.1007/3-540-45748-8_5openalex-snapshot
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
inferredcites →https://doi.org/10.1016/j.jpdc.2004.09.009openalex-snapshot
Analyzing and enhancing the resilience of structured peer-to-peer systems
inferredcites →https://doi.org/10.1109/dsn.2006.4openalex-snapshot
A General Framework for Scalability and Performance Analysis of DHT Routing Systems
inferredcites →https://doi.org/10.1109/infcom.2005.1497894openalex-snapshot
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
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/1005686.1005712openalex-snapshot
Failure recovery for structured P2P networks
inferredcites →https://doi.org/10.1145/1012888.1005712openalex-snapshot
Failure recovery for structured P2P networks
inferredcites →https://doi.org/10.1145/1073814.1073854openalex-snapshot
Routing complexity of faulty networks
inferredcites →https://doi.org/10.1145/258492.258523openalex-snapshot
Accessing nearby copies of replicated objects in a distributed environment
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/571825.571863openalex-snapshot
Analysis of the evolution of peer-to-peer systems
inferredcites →https://doi.org/10.1145/863955.863998openalex-snapshot
The impact of DHT routing geometry on resilience and proximity
inferredcites →https://doi.org/10.1145/863955.863999openalex-snapshot
Graph-theoretic analysis of structured peer-to-peer systems
inferredcites →https://doi.org/10.1201/9781315274386openalex-snapshot
Introduction To Percolation Theory
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-0-387-09751-0_14openalex-snapshot
Mathematical Modeling of Routing in DHTs
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_28openalex-snapshot
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat
inferred← citeshttps://doi.org/10.1007/s12083-007-0002-2openalex-snapshot
DHT routing analysis in a logarithmically transformed space
inferred← citeshttps://doi.org/10.1007/s12083-008-0010-xopenalex-snapshot
SUPNET: An end-to-end solution to scalable unstructured P2P networking
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.017openalex-snapshot
Stochastic maintenance of overlays in structured P2P systems
inferred← citeshttps://doi.org/10.1016/j.jnca.2011.02.007openalex-snapshot
Proactive replication for rare objects in unstructured peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/access.2018.2801259openalex-snapshot
d-SHAM: A Constant Degree-Scalable Homogeneous Addressing Mechanism for Structured P2P Networks
inferred← citeshttps://doi.org/10.1109/aina.2018.00019openalex-snapshot
d-SHAM: An O(d) Scalable Routing Algorithm
inferred← citeshttps://doi.org/10.1109/dest.2009.5276715openalex-snapshot
Multi-Agent simulation framework for interdisciplinary research in digital ecosystems
inferred← citeshttps://doi.org/10.1109/p2p.2007.45openalex-snapshot
An End-to-End Solution to Scalable Unstructured P2P Networking
inferred← citeshttps://doi.org/10.1109/p2p.2007.9openalex-snapshot
Price of Structured Routing and Its Mitigation in P2P Systems under Churn
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.1145/2019591.2019596openalex-snapshot
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
inferred← citeshttps://doi.org/10.1515/piko.2008.005openalex-snapshot
A graph theoretical lower bound on maintenance overhead of structured P2P overlays
inferred← citeshttps://doi.org/10.25972/opus-2250openalex-snapshot
Performance Analysis of Structured Overlay Networks
inferred← citeshttps://doi.org/10.3390/fi3010014openalex-snapshot
A Distributed Public Key Infrastructure Based on Threshold Cryptography for the HiiMap Next Generation Internet Architecture
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4559openalex-snapshot
The Accuracy of Tree-based Counting in Dynamic Networks
showing the first 19 of 20 · page through all 20
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.