A global view of kad
A global view of kad
复制标题
DOI：
10.1145/1298306.1298323
复制
发表时间：
2007-10
影响因子：
4.6
通讯作者：
Moritz Steiner;T. En-Najjary;E. Biersack
中科院分区：
文献类型：
--
作者：
Moritz Steiner;T. En-Najjary;E. Biersack
分布式哈希表(DHTs)在文献中得到了积极的研究，并就如何组织分布式哈希表中的对等点提出了许多不同的建议。然而，很少有分布式哈希表在实际系统中实现并大规模部署。一个例外是Kad，这是一个基于Kademlia的分布式哈希表，它是eDonkey2000的一部分，eDonkey2000是一个拥有数百万同时用户的点对点文件共享系统。我们已经连续爬行KAD大约六个月了，并获得了关于在线节点总数及其地理分布的信息。对等体由所谓的KAD ID来标识，到目前为止，该ID被认为在会话之间保持相同。然而，我们观察到情况并非如此：有大量的同龄人，特别是在中国，改变他们的KAD ID，有时就像在每个会话之后一样频繁。KAD ID的这种变化使得很难确定最终用户的可用性或成员更替的特征。
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHT shave been implemented in real systems and deployed on alarge scale. One exception is KAD, a DHT based on Kademlia, which is part of eDonkey2000, a peer-to-peer file sharing system with several million simultaneous users. We have been crawling KAD continuously for about six months and obtained information about the total number of peers online and their geographical distribution. Peers are identified by the so called KAD ID, which was up to now assumed to remain the same across sessions. However, we observed that this is not the case: There is a large number of peers, in particular in China, that change their KAD ID, sometimes as frequently as after each session. This change of KAD IDs makes it difficult to characterize end-user availability or membership turnover.