On the public citation graph

Random choices for churn resilient load balancing in peer-to-peer networks

https://doi.org/10.1109/ipdps.2008.4536282
0 signed · 46 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_9openalex-snapshot
A Statistical Theory of Chord Under Churn
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/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-662-25853-8_21openalex-snapshot
Auf der Heide
inferredcites →https://doi.org/10.1016/j.peva.2005.01.003openalex-snapshot
Load balancing in dynamic structured peer-to-peer systems
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.1109/71.963420openalex-snapshot
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/icdcs.2003.1203500openalex-snapshot
Building topology-aware overlays using global soft-state
inferredcites →https://doi.org/10.1109/icdcs.2006.35openalex-snapshot
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
inferredcites →https://doi.org/10.1109/icde.2003.1260781openalex-snapshot
Designing a super-peer network
inferredcites →https://doi.org/10.1109/icnp.2006.320196openalex-snapshot
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks
inferredcites →https://doi.org/10.1109/infcom.1996.493353openalex-snapshot
How to model an internetwork
inferredcites →https://doi.org/10.1109/infcom.2005.1497926openalex-snapshot
Heterogeneity and load balance in distributed hash tables
inferredcites →https://doi.org/10.1109/infocom.2006.132openalex-snapshot
Proportional Replication in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/jsac.2003.818784openalex-snapshot
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
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.2005.46openalex-snapshot
Efficient, proximity-aware load balancing for DHT-based P2P systems
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.1137/s0097539795288490openalex-snapshot
Balanced Allocations
inferredcites →https://doi.org/10.1145/1007912.1007921openalex-snapshot
Geometric generalizations of the power of two choices
inferredcites →https://doi.org/10.1145/1073814.1073872openalex-snapshot
A scheme for load balancing in heterogenous distributed hash tables
inferredcites →https://doi.org/10.1145/1073970.1073990openalex-snapshot
Decentralized algorithms using both local and random probes for P2P load balancing
inferredcites →https://doi.org/10.1145/1177080.1177105openalex-snapshot
Understanding churn in peer-to-peer 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/276698.276790openalex-snapshot
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/502034.502054openalex-snapshot
Wide-area cooperative storage with CFS
inferredcites →https://doi.org/10.1145/502051.502054openalex-snapshot
Wide-area cooperative storage with CFS
inferredcites →https://doi.org/10.1145/571825.571857openalex-snapshot
Viceroy
inferredcites →https://doi.org/10.1145/990064.990079openalex-snapshot
Hood
inferredcites →https://doi.org/10.1201/9780429454820openalex-snapshot
Large Deviations For Performance Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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.1049/iet-com.2010.0624openalex-snapshot
Robustness analysis of an unstructured overlay for media communication
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386734openalex-snapshot
Load Balancing Algorithms and Their Impacts on Apache Kafka
inferred← citeshttps://doi.org/10.1109/c2i456876.2022.10051393openalex-snapshot
Analyzer for Heterogeneous Peer Server Nodes with ADCD Technique for Load Diversion
inferred← citeshttps://doi.org/10.1109/ds-rt47707.2019.8958709openalex-snapshot
A Randomized Low Latency Resource Sharing Algorithm for Fog Computing
inferred← citeshttps://doi.org/10.1109/saso.2011.28openalex-snapshot
A Self-Organized Load-Balancing Algorithm for Overlay-Based Decentralized Service Networks
inferred← citeshttps://doi.org/10.1109/services.2011.35openalex-snapshot
VirtualRank: A Prediction Based Load Balancing Technique in Virtual Computing Environment
inferred← citeshttps://doi.org/10.1109/tcc.2020.2968443openalex-snapshot
Power of Random Choices Made Efficient for Fog Computing
inferred← citeshttps://doi.org/10.1109/tpds.2007.1040openalex-snapshot
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.4018/978-1-60566-661-7.ch008openalex-snapshot
Load Balancing in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.5121/ijcnc.2010.2510openalex-snapshot
A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution
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.