Sciweavers

Share
NCA
2006
IEEE

Congestion Control for Distributed Hash Tables

10 years 4 months ago
Congestion Control for Distributed Hash Tables
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.
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where NCA
Authors Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
Comments (0)
books