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
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Efficient topology-aware overlay network
ACM SIGCOMM Computer Communication Review
Secure routing for structured peer-to-peer overlay networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Scalable and Secure Internet Services and Architecture (Chapman & Hall/Crc Computer & I)
Scalable and Secure Internet Services and Architecture (Chapman & Hall/Crc Computer & I)
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
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
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
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
Fast and proximity-aware multi-source overlay multicast under heterogeneous environment
Computer Communications
A proactive low-overhead file replication scheme for structured P2P content delivery networks
Journal of Parallel and Distributed Computing
Biased random walks on resource network graphs for load balancing
The Journal of Supercomputing
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
A flabellate overlay network for multi-attribute search
Journal of Parallel and Distributed Computing
Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
Computer Communications
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
Context-sensitive trust computing in distributed environments
Knowledge-Based Systems
Contextual Trust Aided Enhancement of Data Availability in Peer-to-Peer Backup Storage Systems
Journal of Network and Systems Management
Web search results caching service for structured P2P networks
Future Generation Computer Systems
Hi-index | 0.00 |
Structured peer-to-peer overlay networks, like distributed hash tables (DHTs), map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Data redistribution algorithms based on randomized matching of heavily loaded nodes with light ones can deal with the dynamics of DHTs. However, they are unable to consider the proximity of the nodes simultaneously. There are other methods that rely on auxiliary networks to facilitate locality-aware load redistribution. Due to the cost of network construction and maintenance, the locality-aware algorithms can hardly work for DHTs with churn. This paper presents a locality-aware randomized load-balancing algorithm to deal with both the proximity and network churn at the same time. We introduce a factor of randomness in the probing of lightly loaded nodes in a range of proximity. We further improve the efficiency by allowing the probing of multiple candidates (d-way) at a time. Simulation results show the superiority of the locality-aware two-way randomized algorithm in comparison with other random or locality-aware algorithms. In DHTs with churn, it performs no worse than the best churn-resilient algorithm. It takes advantage of node capacity heterogeneity and achieves good load balance effectively even in a skewed distribution of items.