Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Novel architectures for P2P applications: the continuous-discrete approach
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
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Geometric generalizations of the power of two choices
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems
IEEE Transactions on Parallel and Distributed Systems
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A P2P-based intelligent resource discovery mechanism in Internet-based distributed systems
Journal of Parallel and Distributed Computing
A proactive low-overhead file replication scheme for structured P2P content delivery networks
Journal of Parallel and Distributed Computing
PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
Replica-aided load balancing in overlay networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network nodes in proportion to their capacity so as to eliminate traffic bottleneck. It is challenging because of the dynamism, proximity and heterogeneity natures of DHT networks and time-varying load characteristics. In this paper, we present a hash-based proximity clustering approach for load balancing in heterogeneous DHTs. In the approach, DHT nodes are classified as regular nodes and supernodes according to their computing and networking capacities. Regular nodes are grouped and associated with supernodes via consistent hashing of their physical proximity information on the Internet. The supernodes form a self-organized and churn-resilient auxiliary network for load balancing. The hierarchical structure facilitates the design and implementation of a locality-aware randomized (LAR) load balancing algorithm. The algorithm introduces a factor of randomness in the load balancing processes in a range of neighborhood so as to deal with both the proximity and dynamism. Simulation results show the superiority of the clustering approach with LAR, in comparison with a number of other DHT load balancing algorithms. The approach performs no worse than existing proximity-aware algorithms and exhibits strong resilience to the effect of churn. It also greatly reduces the overhead of resilient randomized load balancing due to the use of proximity information.