Simple efficient load-balancing algorithms for peer-to-peer systems

DOI10.1007/S00224-006-1246-6MaRDI QIDQ863188zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

hashing data structure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Network design and communication in computer systems (68M10)

Recommendations

• A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Load balancing and locality in range-queriable data structures
• Algorithms – ESA 2004
• Load balancing in peer-to-peer systems using a diffusive approach

Cited in

(25)

• A simple yet effective load balancing extension to the PVM software system
• A scheme for load balancing in heterogenous distributed hash tables
• Analysis of Simple Algorithms for Dynamic Load Balancing
• Multiple choice tries and distributed hash tables
• Engineering Self-Organising Systems
• Choosing a random peer in Chord
• Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
• Ciss: an efficient object clustering framework for dht-based peer-to-peer applications
• Efficient schemes for nearest neighbor load balancing
• Self-stabilizing local \(k\)-placement of replicas with local minimum variance
• Balanced binary trees for ID management and load balance in distributed hash tables
• Decentralized proportional load balancing
• Load balanced distributed directories
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Load balancing in peer-to-peer systems using a diffusive approach
• Efficient distributed computation of distance sketches in networks
• Load balancing and locality in range-queriable data structures
• scientific article; zbMATH DE number 2087773 (Why is no real title available?)
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Multiple random walks on graphs: mixing few to cover many
• A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
• Novel load balancing DHT scheme for the heterogeneous system
• Algorithms – ESA 2004
• Practical load balancing for content requests in peer-to-peer networks
• Approaching neighbor proximity and load balance for range query in P2P networks

Describes a project that uses

Uses Software

• Pastry

This page was built for publication: Simple efficient load-balancing algorithms for peer-to-peer systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863188)