Comparing the performance of distributed hash tables under churn

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

Comparing the performance of distributed hash tables under churn

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

Computer Science

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English (US)
Pages (from-to)	87-99
Number of pages	13
Journal	Lecture Notes in Computer Science
Volume	3279
State	Published - 2004
Event	Third International Workshop on Peer-to-Peer Systems, IPTPS 2004 - La Jolla, CA, United States Duration: Feb 26 2004 → Feb 27 2004

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

@article{1acf94fca2894f6e8fbe5dede1d54006,

title = "Comparing the performance of distributed hash tables under churn",

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.",

author = "Jinyang Li and Jeremy Stribling and Gil, {Thomer M.} and Robert Morris and {Frans Kaashoek}, M.",

year = "2004",

language = "English (US)",

volume = "3279",

pages = "87--99",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "Third International Workshop on Peer-to-Peer Systems, IPTPS 2004 ; Conference date: 26-02-2004 Through 27-02-2004",

}

TY - JOUR

T1 - Comparing the performance of distributed hash tables under churn

AU - Li, Jinyang

AU - Stribling, Jeremy

AU - Gil, Thomer M.

AU - Morris, Robert

AU - Frans Kaashoek, M.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23944488798&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23944488798&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:23944488798

SN - 0302-9743

VL - 3279

SP - 87

EP - 99

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Third International Workshop on Peer-to-Peer Systems, IPTPS 2004

Y2 - 26 February 2004 through 27 February 2004

ER -

Comparing the performance of distributed hash tables under churn

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this