Comparing the performance of distributed hash tables under churn

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsG.M. Voelker, S. Shenker
Pages87-99
Number of pages13
Volume3279
StatePublished - 2004
EventThird International Workshop on Peer-to-Peer Systems, IPTPS 2004 - La Jolla, CA, United States
Duration: Feb 26 2004Feb 27 2004

Other

OtherThird International Workshop on Peer-to-Peer Systems, IPTPS 2004
CountryUnited States
CityLa Jolla, CA
Period2/26/042/27/04

Fingerprint

Costs
Communication

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Li, J., Stribling, J., Gil, T. M., Morris, R., & Frans Kaashoek, M. (2004). Comparing the performance of distributed hash tables under churn. In G. M. Voelker, & S. Shenker (Eds.), Lecture Notes in Computer Science (Vol. 3279, pp. 87-99)

Comparing the performance of distributed hash tables under churn. / Li, Jinyang; Stribling, Jeremy; Gil, Thomer M.; Morris, Robert; Frans Kaashoek, M.

Lecture Notes in Computer Science. ed. / G.M. Voelker; S. Shenker. Vol. 3279 2004. p. 87-99.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, J, Stribling, J, Gil, TM, Morris, R & Frans Kaashoek, M 2004, Comparing the performance of distributed hash tables under churn. in GM Voelker & S Shenker (eds), Lecture Notes in Computer Science. vol. 3279, pp. 87-99, Third International Workshop on Peer-to-Peer Systems, IPTPS 2004, La Jolla, CA, United States, 2/26/04.
Li J, Stribling J, Gil TM, Morris R, Frans Kaashoek M. Comparing the performance of distributed hash tables under churn. In Voelker GM, Shenker S, editors, Lecture Notes in Computer Science. Vol. 3279. 2004. p. 87-99
Li, Jinyang ; Stribling, Jeremy ; Gil, Thomer M. ; Morris, Robert ; Frans Kaashoek, M. / Comparing the performance of distributed hash tables under churn. Lecture Notes in Computer Science. editor / G.M. Voelker ; S. Shenker. Vol. 3279 2004. pp. 87-99
@inproceedings{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",
editor = "G.M. Voelker and S. Shenker",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

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 contribution

VL - 3279

SP - 87

EP - 99

BT - Lecture Notes in Computer Science

A2 - Voelker, G.M.

A2 - Shenker, S.

ER -