Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
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
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
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
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash functions spread even skewed key distributions almost evenly over the ID space. They neglect the problem that many applications produce data with common keys (multi-sets) that entail hash collisions and therewith load imbalance concerning query and storage load. A second drawback of using hash functions in DHTs is the lack of range queries needed in many scenarios. This paper presents a solution for how to use the routing structure of the P2P network Pastry to create a new alphanumerical overlay with very little additional costs. This overlay is capable of storing data in a totally ordered manner instead of using hashed keys. Therewith, it enables range queries and sophisticated load balancing. We discuss the impact on Pastry that arises when nodes are relocated during load balancing. This possibly causes a skewed distribution of nodes in the circular id space. We demonstrate the feasibility of our idea including advantages and problems through an evaluation of simulations.