Simple Load Balancing for Distributed Hash Tables

DMCA

Simple Load Balancing for Distributed Hash Tables (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by John Byers , Jeffrey Considine , Michael Mitzenmacher

Citations:

135 - 1 self

BibTeX

@INPROCEEDINGS{Byers02simpleload,
    author = {John Byers and Jeffrey Considine and Michael Mitzenmacher},
    title = {Simple Load Balancing for Distributed Hash Tables},
    booktitle = {},
    year = {2002},
    pages = {80--87}
}

OpenURL

Abstract

Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can be achieved more simply and more cost-effectively. First, we suggest the direct application of the "power of two choices" paradigm, whereby an item is stored at the less loaded of two (or more) random alterna- tives. We then consider how associating a small constant number of hash values with a key can naturally be extended to support other load balancing methods, including load-stealing or load-shedding schemes, as well as providing natural fault-tolerance mechanisms.

Keyphrases

distributed hash table simple load balancing hash value random alterna tives hash table choice paradigm useful building block current scheme small constant number substantial storage overhead direct application considerable implementation complexity distributed application natural fault-tolerance mechanism load-shedding scheme consistent hashing

DMCA