Comparing the Performance of Distributed Hash Tables Under Churn

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

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

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

Datum	Value	Source
TITLE	Comparing the performance of distributed hash tables under churn	SVM HeaderParse 0.1
AUTHOR NAME	Jinyang Li	SVM HeaderParse 0.1
AUTHOR NAME	Jeremy Stribling	SVM HeaderParse 0.1
AUTHOR NAME	Thomer M. Gil	SVM HeaderParse 0.1
AUTHOR NAME	Robert Morris	SVM HeaderParse 0.1
AUTHOR NAME	M. Frans Kaashoek	SVM HeaderParse 0.1
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. 1	SVM HeaderParse 0.1
CITATIONS	16 found	ParsCit 1.0