loading...
Congestion Control for Distributed Hash Tables
Cambridge, Massachusetts July 24-July 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2006.19Fifth IEEE International Symposium on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer, "Congestion Control for Distributed Hash Tables," Network Computing and Applications, IEEE International Symposium on, pp. 189-195, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/NCA.2006.19,
author = {Fabius Klemm and Jean-Yves Le Boudec and Karl Aberer},
title = {Congestion Control for Distributed Hash Tables},
journal ={Network Computing and Applications, IEEE International Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2640-3},
pages = {189-195},
doi = {http://doi.ieeecomputersociety.org/10.1109/NCA.2006.19},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Network Computing and Applications, IEEE International Symposium on
TI - Congestion Control for Distributed Hash Tables
SN - 0-7695-2640-3
SP189
EP195
A1 - Fabius Klemm,
A1 - Jean-Yves Le Boudec,
A1 - Karl Aberer,
PY - 2006
KW - null
VL - 0
JA - Network Computing and Applications, IEEE International Symposium on
ER -
 
Fabius Klemm, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Jean-Yves Le Boudec, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Karl Aberer, Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, we look at congestion control for DHTs. Our goal is to control the flow of lookup requests that are routed in the overlay network. We first show that congestion control is essential for certain applications with high lookup rates. We then present two congestion control mechanisms for DHTs and compare their performances in different network conditions.
Citation:
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer, "Congestion Control for Distributed Hash Tables," nca, pp.189-195, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.