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.


Published in:
Network Computing and Applications 2006
Presented at:
The 5th IEEE International Symposium on Network Computing and Applications (IEEE NCA06), Cambridge, MA USA, July 24 - 26, 2006
Year:
2006
Publisher:
IEEE
ISBN:
0-7695-2640-3
Keywords:
Laboratories:




 Record created 2006-08-02, last modified 2018-03-18

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)