have been extensively studied through simulation and analysis. However, due to their limited deployment, it has not been possible to observe the behavior of a widely-deployed DHT in practice. Recently, the popular eMule file-sharing software incorporated a Kademlia-based DHT, called Kad, which currently has around one million simultaneous users. In this paper, we empirically study the performance of the key DHT operation, lookup, over Kad. First, we analytically derive the benefits of different ways to increase the richness of routing tables in Kademlia-based DHTs. Second, we empirically characterize two aspects of the accuracy of routing tables in Kad, namely completeness and freshness, and characterize their impact on Kad's lookup performance. Finally, we investigate how the efficiency and consistency of lookup in Kad can be improved by performing parallel lookup and maintaining multiple replicas, respectively. Our results pinpoint the best operating point for the degree of lookup parallelism and the degree of replication for Kad.
Stutzbach et al. REF investigated how the efficiency and consistency of lookup in Kad can be improved by performing parallel lookup and maintaining multiple replicas, and they empirically showed the best operating point for the degree of lookup parallelism and the degree of replication.
Improving Lookup Performance Over a Widely-Deployed DHT
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Computer Science