Profiling a million user dht

Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, Thomas Anderson
2007 Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07  
Distributed hash tables (DHTs) provide scalable, key-based lookup of objects in dynamic network environments. Although DHTs have been studied extensively from an analytical perspective, only recently have wide deployments enabled empirical examination. This paper reports measurements of the Azureus BitTorrent client's DHT, which is in active use by more than 1 million nodes on a daily basis. The Azureus DHT operates on untrusted, unreliable endhosts, offering a glimpse into the implementation
more » ... allenges associated with making structured overlays work in practice. Our measurements provide characterizations of churn, overhead, and performance in this environment. We leverage these measurements to drive the design of a modified DHT lookup algorithm that reduces median DHT lookup time by an order of magnitude for a nominal increase in overhead.
doi:10.1145/1298306.1298325 dblp:conf/imc/FalknerPJKA07 fatcat:v5fkdttydbdf5ls3xhyds672fy