Comparing the Performance of Distributed Hash Tables Under Churn (2004)
Cached
Download Links
- [pdos.lcs.mit.edu]
- [www.pdos.lcs.mit.edu]
- [www.comp.nus.edu.sg]
- [pdos.lcs.mit.edu]
- [pdos.lcs.mit.edu]
- [pdos.csail.mit.edu]
- [www.pdos.lcs.mit.edu]
- [www.pdos.csail.mit.edu]
- [www.pdos.csail.mit.edu]
- [pdos.csail.mit.edu]
- [www.news.cs.nyu.edu]
- [www.ic.unicamp.br]
- [www.ic.unicamp.br]
- [iris.csail.mit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. IPTPS |
| Citations: | 62 - 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 = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
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.
