A performance vs. cost framework for evaluating DHT design tradeoffs under churn

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

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

Abstract

Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
EditorsK. Makki, E. Knightly
Pages225-235
Number of pages11
Volume1
StatePublished - 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period3/13/053/17/05

Fingerprint

Costs
Stabilization
Bandwidth
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Li, J., Stribling, J., Morris, R., Kaashoek, M. F., & Gil, T. M. (2005). A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM (Vol. 1, pp. 225-235)

A performance vs. cost framework for evaluating DHT design tradeoffs under churn. / Li, Jinyang; Stribling, Jeremy; Morris, Robert; Kaashoek, M. Frans; Gil, Thomer M.

Proceedings - IEEE INFOCOM. ed. / K. Makki; E. Knightly. Vol. 1 2005. p. 225-235.

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

Li, J, Stribling, J, Morris, R, Kaashoek, MF & Gil, TM 2005, A performance vs. cost framework for evaluating DHT design tradeoffs under churn. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM. vol. 1, pp. 225-235, IEEE INFOCOM 2005, Miami, FL, United States, 3/13/05.
Li J, Stribling J, Morris R, Kaashoek MF, Gil TM. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM. Vol. 1. 2005. p. 225-235
Li, Jinyang ; Stribling, Jeremy ; Morris, Robert ; Kaashoek, M. Frans ; Gil, Thomer M. / A performance vs. cost framework for evaluating DHT design tradeoffs under churn. Proceedings - IEEE INFOCOM. editor / K. Makki ; E. Knightly. Vol. 1 2005. pp. 225-235
@inproceedings{8a16e137d328473eb6ac523481897a51,
title = "A performance vs. cost framework for evaluating DHT design tradeoffs under churn",
abstract = "Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.",
author = "Jinyang Li and Jeremy Stribling and Robert Morris and Kaashoek, {M. Frans} and Gil, {Thomer M.}",
year = "2005",
language = "English (US)",
volume = "1",
pages = "225--235",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - A performance vs. cost framework for evaluating DHT design tradeoffs under churn

AU - Li, Jinyang

AU - Stribling, Jeremy

AU - Morris, Robert

AU - Kaashoek, M. Frans

AU - Gil, Thomer M.

PY - 2005

Y1 - 2005

N2 - Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.

AB - Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.

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

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

M3 - Conference contribution

AN - SCOPUS:25844481024

VL - 1

SP - 225

EP - 235

BT - Proceedings - IEEE INFOCOM

A2 - Makki, K.

A2 - Knightly, E.

ER -