DocumentCode
2301947
Title
Congestion Control for Distributed Hash Tables
Author
Klemm, Fabius ; Le Boudec, Jean-Yves ; Aberer, Karl
Author_Institution
Sch. of Comput. & Commun. Sci., Ecole Polytech. Fed. de Lausanne
fYear
2006
fDate
24-26 July 2006
Firstpage
189
Lastpage
195
Abstract
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
Keywords
file organisation; peer-to-peer computing; table lookup; telecommunication congestion control; DHT; congestion control mechanism; distributed hash tables; lookup requests; overlay network; Communication system control; Distributed computing; Distributed control; Maintenance; Network address translation; Peer to peer computing; Relays; Routing; Sockets; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Computing and Applications, 2006. NCA 2006. Fifth IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7695-2640-3
Type
conf
DOI
10.1109/NCA.2006.19
Filename
1659491
Link To Document