Improving Lookup Performance Over a Widely-Deployed DHT
Improving Lookup Performance Over a Widely-Deployed DHT
复制标题
DOI：
10.1109/infocom.2006.329
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
D. Stutzbach;R. Rejaie
中科院分区：
文献类型：
--
作者：
D. Stutzbach;R. Rejaie
近年来，分布式哈希表（DHT）通过仿真和分析得到了广泛的研究。然而，由于它们的有限部署，在实践中不可能观察到广泛部署的DHT的行为。最近，流行的eMule文件共享软件整合了一个基于Kademlia的DHT，称为Kad，目前有大约100万同时用户。在本文中，我们实证研究的关键DHT操作，查找，在KAD的性能。首先，我们分析得出不同的方式来增加丰富的路由表在基于Kademlia的DHT的好处。其次，我们经验性地表征了Kad中路由表的准确性的两个方面，即完整性和新鲜度，并表征了它们对Kad的查找性能的影响。最后，我们研究了如何在Kad查找的效率和一致性可以提高执行并行查找和维护多个副本，分别。我们的研究结果指出了最佳的操作点的查找并行度和Kad的复制度。
During recent years, Distributed Hash Tables (DHTs) 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.