STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improved Bounds for On-line Load Balancing
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Load Balancing for Response Time
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Spreading the Load Using Consistent Hashing: A Preliminary Report
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
A multi-swarm approach for neighbor selection in peer-to-peer networks
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Performance analysis of allocation policies for interGrid resource provisioning
Information and Software Technology
Dynamic load balancing in RCAN content addressable network
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
P2P Networking and Applications
P2P Networking and Applications
Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters
Proceedings of the 18th ACM international symposium on High performance distributed computing
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Autonomic Application-Level Message Delivery Using Virtual Magnetic Fields
Journal of Network and Systems Management
Multi-objective peer-to-peer neighbor-selection strategy using genetic algorithm
HiPC'07 Proceedings of the 14th international conference on High performance computing
Resource allocation in decentralised computational systems: an evolutionary market-based approach
Autonomous Agents and Multi-Agent Systems
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
Computer Networks: The International Journal of Computer and Telecommunications Networking
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
Using diffusive load balancing to improve performance of peer-to-peer systems for hosting services
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
P2P-based multidimensional indexing methods: A survey
Journal of Systems and Software
FloRA: flock-based resource allocation for decentralized distributed virtual environments
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
A dynamic load balancing strategy with the push and pull approaches in DHT networks
Computers and Electrical Engineering
A fault-tolerant cache service for web search engines: RADIC evaluation
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Replica-aided load balancing in overlay networks
Journal of Network and Computer Applications
Load Balancing to Increase the Consistency of Replicas in Data Grids
International Journal of Distributed Systems and Technologies
A multi-resource load balancing algorithm for cloud cache systems
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having Θ(log N) times as many objects as the average node. Further imbalance may result due to nonuniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes.In this paper, we propose an algorithm for load balancing in such heterogeneous, dynamic P2P systems. Our simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, our algorithm improves load balance by more than an order of magnitude for system utilizations as high as 80% while incurring an overhead of only about 6%. We also show that our distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of our algorithm. Although many of these results are dependent on the workload, we believe the efficiency and performance improvement demonstrated over the case of no load balancing shows that our technique holds promise for deployed systems.