Load-driven neighbourhood reconfiguration of Gnutella overlay
Computer Communications
Wikipedia workload analysis for decentralized hosting
Computer Networks: The International Journal of Computer and Telecommunications Networking
Marvin: Distributed reasoning over large-scale Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Mind the data skew: distributed inferencing by speeddating in elastic regions
Proceedings of the 19th international conference on World wide web
Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA)
Proceedings of the 2010 ACM Symposium on Applied Computing
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
A self-adaptive resource index and discovery system in distributed computing environments
International Journal of Ad Hoc and Ubiquitous Computing
Replica-aided load balancing in overlay networks
Journal of Network and Computer Applications
Self-stabilizing local k-placement of replicas with minimal variance
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Journal of the ACM (JACM)
DBalancer: distributed load balancing for NoSQL data-stores
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
ODSA: Chord-Based Object Discovery Service Architecture for the Internet of Things
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Load balancing is a critical issue for the efficient operation of peer-to-peer (P2P) networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord's logarithmic query time and near-optimal data migration cost.Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a P2P system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space.Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items "randomly" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).Our second protocol aims to balance directly the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations "where they are needed." As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data.