On the public citation graph

Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

0 signed · 44 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_20openalex-snapshot
Dynamic Load Balancing in Distributed Hash Tables
inferredcites →https://doi.org/10.1007/11558989_24openalex-snapshot
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks
inferredcites →https://doi.org/10.1007/3-540-44702-4_4openalex-snapshot
Freenet: A Distributed Anonymous Information Storage and Retrieval System
inferredcites →https://doi.org/10.1007/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
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.1007/3-540-45748-8_9openalex-snapshot
Can Heterogeneity Make Gnutella Scalable?
inferredcites →https://doi.org/10.1007/978-3-540-30183-7_27openalex-snapshot
SmartBoa: Constructing p2p Overlay Network in the Heterogeneous Internet Using Irregular Routing Tables
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_6openalex-snapshot
Load Balancing in Structured P2P Systems
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_7openalex-snapshot
Simple Load Balancing for Distributed Hash Tables
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_9openalex-snapshot
Koorde: A Simple Degree-Optimal Distributed Hash Table
inferredcites →https://doi.org/10.1007/978-3-662-25853-8_21openalex-snapshot
Auf der Heide
inferredcites →https://doi.org/10.1016/j.peva.2005.01.004openalex-snapshot
Cycloid: A constant-degree and lookup-efficient P2P overlay network
inferredcites →https://doi.org/10.1103/physreve.64.046135openalex-snapshot
Search in power-law networks
inferredcites →https://doi.org/10.1109/71.963420openalex-snapshot
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/icpp.2005.49openalex-snapshot
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
inferredcites →https://doi.org/10.1109/infcom.2004.1354648openalex-snapshot
Load balancing in dynamic structured P2P systems
inferredcites →https://doi.org/10.1109/infcom.2005.1497926openalex-snapshot
Heterogeneity and load balance in distributed hash tables
inferredcites →https://doi.org/10.1109/sfcs.2002.1182005openalex-snapshot
Load balancing with memory
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.1109/tpds.2007.1040openalex-snapshot
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
inferredcites →https://doi.org/10.1117/12.449977openalex-snapshot
Measurement study of peer-to-peer file sharing systems
inferredcites →https://doi.org/10.1145/1011767.1011797openalex-snapshot
Balanced binary trees for ID management and load balance in distributed hash tables
inferredcites →https://doi.org/10.1145/1015467.1015507openalex-snapshot
Mercury
inferredcites →https://doi.org/10.1145/1031495.1031525openalex-snapshot
Synopsis diffusion for robust aggregation in sensor networks
inferredcites →https://doi.org/10.1145/258492.258521openalex-snapshot
On the analysis of randomized load balancing schemes
inferredcites →https://doi.org/10.1145/258533.258660openalex-snapshot
Consistent hashing and random trees
inferredcites →https://doi.org/10.1145/2591635.2667182openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/571825.571857openalex-snapshot
Viceroy
inferredcites →https://doi.org/10.1145/863955.864000openalex-snapshot
Making gnutella-like P2P systems scalable
inferredcites →https://doi.org/10.3233/jcs-2002-10302openalex-snapshot
Hordes: a multicast based protocol for anonymity1
inferredcites →https://doi.org/10.5555/1251203.1251210openalex-snapshot
Debunking some myths about structured and unstructured overlays
inferredcites →https://doi.org/10.5555/1251203.1251211openalex-snapshot
Bandwidth-efficient management of DHT routing tables
inferredcites →https://doi.org/10.5555/1898953.1898975openalex-snapshot
Hash-based proximity clustering for load balancing in heterogeneous DHT networks

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-72524-4_15openalex-snapshot
A Fair Load Balancing Algorithm for Hypercube-Based DHT Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13971-0_24openalex-snapshot
Resource Adaptive Distributed Information Sharing
inferred← citeshttps://doi.org/10.1007/s11432-011-4377-6openalex-snapshot
Survey of DHT topology construction techniques in virtual computing environments
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.01.012openalex-snapshot
P2P consistency support for large-scale interactive applications
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.1109/euc.2008.131openalex-snapshot
The Effect of Routing-Load Dispersion on Congestion Control in Structured P2P Networks
inferred← citeshttps://doi.org/10.1109/icpp.2007.26openalex-snapshot
Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks
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/tpds.2009.127openalex-snapshot
An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems
inferred← citeshttps://doi.org/10.1109/tpds.2009.51openalex-snapshot
Elastic Routing Table with Provable Performance for Congestion Control in DHT 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.