Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Estimating network size from local information
Information Processing Letters
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
A scheme for load balancing in heterogenous distributed hash tables
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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
Indexing data-oriented overlay networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Establishing and protecting digital identity in federation systems
Proceedings of the 2005 workshop on Digital identity management
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Establishing and protecting digital identity in federation systems
Journal of Computer Security - The First ACM Workshop on Digital Identity Management -- DIM 2005
Balanced allocations with heterogenous bins
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
Journal of Systems and Software
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Ranged hash functions and the price of churn
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Dynamic load balancing in RCAN content addressable network
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Data Access in a Cyber World: Making Use of Cyberinfrastructure
Transactions on Data Privacy
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
Passive/Active Load Balancing with Informed Node Placement in DHTs
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA)
Proceedings of the 2010 ACM Symposium on Applied Computing
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
Dynamic load balancing in distributed hash tables
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
The dynamic and-or quorum system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Bounding communication cost in dynamic load balancing of distributed hash tables
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A case for design methodology research in self-* distributed systems
Self-star Properties in Complex Information Systems
Hi-index | 0.00 |
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit interval [0, 1). At any time, the set of IDs splits the interval into disjoint partitions. Hosts do not possess global knowledge of other IDs in the system. The challenge then is to design an efficient decentralized algorithm that maintains roughly equi-sized partitions, in the face of arrivals, departures and changes in the average number of hosts.Our ID management algorithm is the first to enjoy all of the following properties: (a) both arrivals and departures of hosts are handled, (b) departure of a host causes at most one existing host to change its ID, (c) the ratio of the largest to the smallest partition is at most 4, with high probability, and (d) the expected cost per arrival/departure is Θ(R + log n) messages, where n denotes the current number of participants, and R denotes the cost of routing one message in the DHT. In fact, our algorithm is independent of the topology of the overlay network used for routing.Variations of our algorithm diminish the ratio between the largest and the smallest partition to (1 + ε), for any ε 0, albeit at the cost of re-assigning the IDs of O(1/ε) existing hosts per arrival/departure. Ours is the first algorithm that allows such fine-tuning.Finally, our ID management algorithm enables (a) estimation of the total number of hosts in the system by making only local measurements, and (b) emulation of a variety of deterministic and randomized families of routing topologies, in a straightforward fashion. Among these families are several networks that require O(log n/log k) routing hops in an n-node network with k links per node.