On the public citation graph
Query-load balancing in structured overlays
0 signed · 29 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/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-49543-6_13openalex-snapshot
“Balls into Bins” — A Simple and Tight Analysis
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-71661-7_32openalex-snapshot
Optimal Caching for First-Order Query Load-Balancing in Decentralized Index Structures
inferredcites →https://doi.org/10.1016/b978-012088469-8.50041-3openalex-snapshot
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
inferredcites →https://doi.org/10.1109/71.963420openalex-snapshot
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/ccgrid.2006.38openalex-snapshot
Effective Load Balancing in P2P Systems
inferredcites →https://doi.org/10.1109/mic.2007.81openalex-snapshot
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/774763.774772openalex-snapshot
A blueprint for introducing disruptive technology into the Internet
inferredcites →https://doi.org/10.1145/964723.383072openalex-snapshot
A scalable content-addressable network
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-39940-9_1043openalex-snapshot
Load Balancing in Peer-to-Peer Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_1043openalex-snapshot
Load Balancing in Peer-to-Peer Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_1043-2openalex-snapshot
Load Balancing in Peer-to-Peer Overlay Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-54426-2_4openalex-snapshot
Distributed Large-Scale Information Filtering
inferred← citeshttps://doi.org/10.1007/s00607-012-0199-7openalex-snapshot
A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
inferred← citeshttps://doi.org/10.1007/springerreference_64012openalex-snapshot
Load Balancing in Peer-to-Peer Overlay Networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2012.04.012openalex-snapshot
A dynamic load balancing strategy with the push and pull approaches in DHT networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2013.07.006openalex-snapshot
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks
inferred← citeshttps://doi.org/10.1109/bigcomp.2018.00039openalex-snapshot
Load Balancing with Load Threshold Adjustment in Structured P2P
inferred← citeshttps://doi.org/10.1109/hpcc.2008.112openalex-snapshot
Decreasing System Load by Caching in Structured P2P Systems
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00266openalex-snapshot
DDLB: A Dynamic and Distributed Load Balancing Strategy
inferred← citeshttps://doi.org/10.1109/sasow.2008.50openalex-snapshot
Using Global Information for Load Balancing in DHTs
inferred← citeshttps://doi.org/10.1145/1853079.1853093openalex-snapshot
Frequency-aware reconstruction of forwarding tables in name-based routing
inferred← citeshttps://doi.org/10.18452/16621openalex-snapshot
Consistent key-based routing in decentralized and reconfigurable data services
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4133openalex-snapshot
Sharing of probabilistically correlated data in peer-to-peer networks
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4280openalex-snapshot
Query-driven indexing in large-scale distributed systems
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.