Simple efficient load-balancing algorithms for peer-to-peer systems
From MaRDI portal
Publication:863188
DOI10.1007/s00224-006-1246-6zbMath1115.68018MaRDI QIDQ863188
David R. Karger, Matthias Ruhl
Publication date: 25 January 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1246-6
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68P05: Data structures
Related Items
Multiple random walks on graphs: mixing few to cover many, Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks, Load balancing in peer-to-peer systems using a diffusive approach, A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, Efficient distributed computation of distance sketches in networks, Self-stabilizing local \(k\)-placement of replicas with local minimum variance, Practical load balancing for content requests in peer-to-peer networks, Choosing a random peer in Chord, Decentralized Proportional Load Balancing, Multiple choice tries and distributed hash tables
Uses Software