Distributed Balanced Tables: A New Approach

Distributed Hash Tables (DHT) implements a distributed dictionary, supporting key insertion, deletion and lookup They use hashing to enable efficient dictionary operations, and achieve storage balance across the participant nodes Hashing can be inappropriate for both problems, as it destroys data ordering, thus making sequential key access and range queries expensive, and fails to provide storage balance when keys are not unique We propose generalizing DHTs to create Distributed Balanced Tables (DBTs), which eliminate the above two problems To solve problem, we discuss how DHT routing structures can be adapted for use in DBTs, while preserving the costs of the standard dictionary operations and supporting efficient range queries To solve problem, we describe an efficient algorithm that guarantees storage balance, even against an adversarial insertion and deletion of keys.

[1]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[2]  Divyakant Agrawal,et al.  Approximate Range Selection Queries in Peer-to-Peer Systems , 2003, CIDR.

[3]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[6]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[7]  Scott Shenker,et al.  Range Queries over DHTs , 2003 .

[8]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[9]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[10]  Abraham Silberschatz,et al.  Database Systems Concepts , 1997 .

[11]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[12]  Ion Stoica,et al.  Peer-to-Peer Systems II , 2003, Lecture Notes in Computer Science.

[13]  David R. Karger,et al.  New Algorithms for Load Balancing in Peer-to-Peer Systems , 2003 .

[14]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[15]  Richard M. Karp,et al.  A stochastic process on the hypercube with applications to peer-to-peer networks , 2003, STOC '03.

[16]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[17]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

[18]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.