Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead

DMCA

Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead (2003)

Cached

Download Links

by Indranil Gupta , Ken Birman , Prakash Linga , Al Demers , Robbert van Renesse

Venue:	Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03
Citations:	124 - 12 self

BibTeX

@INPROCEEDINGS{Gupta03kelips:building,
    author = {Indranil Gupta and Ken Birman and Prakash Linga and Al Demers and Robbert van Renesse},
    title = { Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead},
    booktitle = {Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03},
    year = {2003},
    publisher = {}
}

OpenURL

Abstract

A peer-to-peer (p2p) distributed hash table (DHT) system allows hosts to join and fail silently (or leave), as well as to insert and retrieve files (objects). This paper explores a new point in design space in which increased memory usage and constant background communication overheads are tolerated to reduce file lookup times and increase stability to failures and churn. Our system, called Kelips, uses peer-to-peer gossip to partially replicate file index information. In Kelips, (a) under normal conditions, file lookups are resolved with O(1) time and complexity (i.e., independent of system size), and (b) membership changes (e.g., even when a large number of nodes fail) are detected and disseminated to the system quickly. Per-node memory requirements are small in medium-sized systems. When there are failures, lookup success is ensured through query rerouting. Kelips achieves load balancing comparable to existing systems. Locality is supported by using topologically aware gossip mechanisms. Initial results of an ongoing experimental study are also discussed.

Keyphrases

background overhead stable p2p dht medium-sized system large number design space file lookup time ongoing experimental study aware gossip mechanism file lookup initial result new point constant background communication overhead lookup success system size normal condition per-node memory requirement membership change memory usage file index information peer-to-peer gossip query rerouting hash table

DMCA