On the public citation graph

Analytical Study on Improving DHT Lookup Performance under Churn

0 signed · 53 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/11558989_9openalex-snapshot
A Statistical Theory of Chord Under Churn
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/infocom.2006.329openalex-snapshot
Improving Lookup Performance Over a Widely-Deployed DHT
inferredcites →https://doi.org/10.1145/1005686.1005712openalex-snapshot
Failure recovery for structured P2P networks
inferredcites →https://doi.org/10.1145/571825.571863openalex-snapshot
Analysis of the evolution of peer-to-peer systems
inferredcites →https://doi.org/10.2307/1909118openalex-snapshot
Stochastic Processes: Basic Theory and its Applications
inferredcites →https://doi.org/10.5555/1251203.1251211openalex-snapshot
Bandwidth-efficient management of DHT routing tables

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-1-4614-5483-0_11openalex-snapshot
CR-Chord
inferred← citeshttps://doi.org/10.1007/978-1-4614-9008-1_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-9008-1_2openalex-snapshot
DHT Theory
inferred← citeshttps://doi.org/10.1007/978-1-4614-9008-1_3openalex-snapshot
DHT Platforms
inferred← citeshttps://doi.org/10.1007/978-1-4614-9008-1_4openalex-snapshot
DHT Applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-9008-1_5openalex-snapshot
Summary
inferred← citeshttps://doi.org/10.1007/978-3-319-39577-7_2openalex-snapshot
Evaluating the Cost and Robustness of Self-organizing Distributed Hash Tables
inferred← citeshttps://doi.org/10.1007/s12083-007-0002-2openalex-snapshot
DHT routing analysis in a logarithmically transformed space
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.08.006openalex-snapshot
Scalable blind search and broadcasting over Distributed Hash Tables
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.comnet.2009.09.022openalex-snapshot
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.04.020openalex-snapshot
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
inferred← citeshttps://doi.org/10.1080/17445760.2016.1203917openalex-snapshot
Performance analysis of structured peer-to-peer overlays for mobile 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/atnac.2010.5680244openalex-snapshot
R/Kademlia: Recursive and topology-aware overlay routing
inferred← citeshttps://doi.org/10.1109/car.2010.5456714openalex-snapshot
Designing a novel Peer-to-Peer network
inferred← citeshttps://doi.org/10.1109/ccnc.2010.5421710openalex-snapshot
DHT Performance for Peer-to-Peer SIP - A Mobile Phone Perspective
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683782openalex-snapshot
Analysis of Messaging Load in a P2PP Overlay Network under Churn
inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903714openalex-snapshot
Self-optimization of DHT lookups through run-time performance analysis
inferred← citeshttps://doi.org/10.1109/icccn.2011.6005906openalex-snapshot
Towards a Basic DHT Service: Analyzing Network Characteristics of a Widely Deployed DHT
inferred← citeshttps://doi.org/10.1109/iccw.2008.36openalex-snapshot
Energy Aspects of Peer Cooperation Measurements with a Mobile DHT System
inferred← citeshttps://doi.org/10.1109/icftic57696.2022.10075293openalex-snapshot
Research on Improvement of Routing Algorithm Kademlia in IPFS
inferred← citeshttps://doi.org/10.1109/icie.2009.131openalex-snapshot
Constructing a Churned Peer-to-Peer Network for Efficient Search
inferred← citeshttps://doi.org/10.1109/icpads.2013.63openalex-snapshot
Policies for Efficient Data Replication in P2P Systems
inferred← citeshttps://doi.org/10.1109/inm.2015.7140312openalex-snapshot
Automatic network configuration with dynamic churn prediction
inferred← citeshttps://doi.org/10.1109/mines.2011.121openalex-snapshot
Kad-D: An Improved Model Based on Kademlia
inferred← citeshttps://doi.org/10.1109/nca.2013.29openalex-snapshot
Rollerchain: A DHT for Efficient Replication
inferred← citeshttps://doi.org/10.1109/netsys.2015.7089070openalex-snapshot
Integrating churn into the formal analysis of routing algorithms
inferred← citeshttps://doi.org/10.1109/ngmast.2008.59openalex-snapshot
Optimizing Energy Consumption of Mobile Nodes in Heterogeneous Kademlia-Based Distributed Hash Tables
inferred← citeshttps://doi.org/10.1109/pimrc.2009.5450134openalex-snapshot
Effects of different churn models on the performance of structured peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/srds.2014.40openalex-snapshot
Overnesia: A Resilient Overlay Network for Virtual Super-Peers
inferred← citeshttps://doi.org/10.1145/1364654.1364690openalex-snapshot
Building a reliable P2P system out of unreliable P2P clients
inferred← citeshttps://doi.org/10.1145/2088960.2088977openalex-snapshot
Rollerchain
inferred← citeshttps://doi.org/10.17487/rfc6940openalex-snapshot
REsource LOcation And Discovery (RELOAD) Base Protocol
inferred← citeshttps://doi.org/10.25972/opus-2250openalex-snapshot
Performance Analysis of Structured Overlay Networks
inferred← citeshttps://doi.org/10.2991/aetr-17.2018.12openalex-snapshot
Research on P2P Network Resource Search Model
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.255-260.2121openalex-snapshot
Enhancing the Flexibility of Kademlia under Churn
inferred← citeshttps://doi.org/10.5120/17461-8398openalex-snapshot
A New Protocol for Resource Discovery in Grid Systems
inferred← citeshttps://doi.org/10.5121/ijcnc.2017.9504openalex-snapshot
Performance Analysis of R/KADEMLIA, Pastry and Bamboo Using Recursive Routing in Mobile Networks
inferred← citeshttps://doi.org/10.5121/ijdms.2020.12100openalex-snapshot
inferred← citeshttps://doi.org/10.5121/ijdms.2020.12200openalex-snapshot
inferred← citeshttps://doi.org/10.5121/ijdms.2020.12300openalex-snapshot
inferred← citeshttps://doi.org/10.5121/ijdms.2020.1250openalex-snapshot
inferred← citeshttps://doi.org/10.5121/ijdms.2020.12501openalex-snapshot
Big Data Storage System Based on a Distributed Hash Tables System
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.