STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer 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
Stability and Efficiency of a Random Local Load Balancing Protocol
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Efficient algorithms for new computational models
Efficient algorithms for new computational models
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Publish/subscribe functionality in IR environments using structured overlay networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stealth distributed hash table: unleashing the real potential of peer-to-peer
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
PRISM: indexing multi-dimensional data in P2P networks using reference vectors
Proceedings of the 13th annual ACM international conference on Multimedia
Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
Storage load balancing via local interactions among peers in unstructured P2P networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
Distributed data storage for opportunistic grids
Proceedings of the 3rd international Middleware doctoral symposium
Dynamic storage load balancing with analogy to thermal diffusion for P2P file sharing
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Balanced allocations with heterogenous bins
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Availability of multi-object operations
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
Wildcard Search in Structured Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
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
Range queries on structured overlay networks
Computer Communications
Ranged hash functions and the price of churn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Continuous multi-way joins over distributed hash tables
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Proceedings of the 2nd international conference on Scalable information systems
Stealth distributed hash table: a robust and flexible super-peered DHT
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Future Generation Computer Systems
Multi-set DHT for Range Queries on Dynamic Data for Grid Information Service
Globe '08 Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems
Adaptive indexing for content-based search in P2P systems
Data & Knowledge Engineering
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
Clustering players for load balancing in virtual worlds
International Journal of Advanced Media and Communication
RDFS Reasoning and Query Answering on Top of DHTs
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Dynamic load balancing in RCAN content addressable network
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Exchangeable, application-independent load balancing for P2P simulation frameworks
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient range queries in spatial databases over Peer-to-Peer Networks
International Journal of Internet Protocol Technology
A scheme for balancing heterogeneous request load in DHT-based P2P systems
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Extending Pastry by an Alphanumerical Overlay
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Fair load balancing under skewed popularity patterns in heterogeneous DHT-based P2P systems
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
ESAW '09 Proceedings of the 10th International Workshop on Engineering Societies in the Agents World X
A random walk model for infection on graphs
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Aspects of adaptivity in P2P information retrieval
AMR'06 Proceedings of the 4th international conference on Adaptive multimedia retrieval: user, context, and feedback
On triple dissemination, forward-chaining, and load balancing in DHT based RDF stores
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
SFDHT: a DHT designed for server farm
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
Computer Networks: The International Journal of Computer and Telecommunications Networking
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
Discrete Event Dynamic Systems
Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
Computer Communications
A correlation-aware data placement strategy for key-value stores
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
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
Towards balanced allocations for DHTs
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Combining resource and location awareness in DHTs
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
An efficient approach to representing and mining knowledge from Qing court medical records
Frontiers of Computer Science in China
A structured peer-to-peer system with integrated index and storage load balancing
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
PRoBe: multi-dimensional range queries in p2p networks
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Evaluating conjunctive triple pattern queries over large structured overlay networks
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Long range contacts in overlay networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Peer-to-peer data structures for cooperative traffic information systems
Pervasive and Mobile Computing
The dynamic and-or quorum system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Building a network-aware and load-balanced peer-to-peer system for range queries
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Toward scalable Web systems on multicore clusters: making use of virtual machines
The Journal of Supercomputing
The Yahoo!: cloud datastore load balancer
Proceedings of the fourth international workshop on Cloud data management
Information Sciences: an International Journal
Web search results caching service for structured P2P networks
Future Generation Computer Systems
Hi-index | 0.00 |
Load balancing is a critical issue for the efficient operation of peer-to-peer 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 peer-to-peer 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 directly balance 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.