Skip to main content
Article thumbnail
Location of Repository

A Scheme for Load Balancing in Heterogeneous Distributed Hash Tables

By et al. George Giakkoupis

Abstract

We present a scheme for evenly partitioning the key space in distributed hash tables among the participating nodes. The scheme is based on the multiple random choices paradigm [3, 19], and handles both node joins and leaves. It achieves, with high probability, a ratio of at most 4 between the loads of the most and least burdened nodes, in the face or arbitrary node arrivals and departures. Each join or leave operation incurs message cost that is, with high probability, O(log 2 n), where n is the number of nodes, and causes the relocation of keys from at most one node (for joins) or three nodes (for leaves). A version of our scheme is suitable for heterogeneous systems, where the capacities of nodes to serve keys can vary widely

Topics: Categories and Subject Descriptors C.2.4 [Distributed Systems, Distributed applications— load balancing, G.3 [Probability and Statistics, Stochastic processes, E.1 [Data Structures, Distributed data structures General Terms Algorithms, Performance, Theory Keywords Peer-to-peer, distributed hash tables, load balancing
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.4682
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.dcl.utoronto.ca/~gg... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.