Comparing the Performance of Distributed Hash Tables Under Churn

DMCA

Comparing the Performance of Distributed Hash Tables Under Churn (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jinyang Li , Jeremy Stribling , Thomer M. Gil , Robert Morris , M. Frans Kaashoek

Venue:	IN PROC. IPTPS
Citations:	91 - 2 self

BibTeX

@INPROCEEDINGS{Li04comparingthe,
    author = {Jinyang Li and Jeremy Stribling and Thomer M. Gil and Robert Morris and M. Frans Kaashoek},
    title = {Comparing the Performance of Distributed Hash Tables Under Churn},
    booktitle = {IN PROC. IPTPS},
    year = {2004},
    publisher = {}
}

OpenURL

Abstract

A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn---changes in membership---in order to maintain its ability to route lookups efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined into a single cost measure (bytes), and performance benefits are reduced to a single latency measure. This approach correctly accounts for background maintenance traffic and timeouts during lookup due to stale routing data, and also correctly leaves open the possibility of different preferences in the tradeoff of lookup time versus communication cost. Using the unified framework, this paper analyzes the effects of DHT parameters on the performance of four protocols under churn.

Keyphrases

distributed hash table communication cost unified framework background maintenance traffic churn change different preference single cost measure dht parameter single latency measure performance benefit lookup time versus communication cost stale routing data

DMCA