Actively Monitoring Peers in KAD
Actively Monitoring Peers in KAD
复制标题
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Moritz Steiner;E. Biersack;T. En-Najjary
中科院分区：
文献类型：
--
作者：
Moritz Steiner;E. Biersack;T. En-Najjary
近年来，已经提出了大量的DHT。然而，它们中很少有被部署在现实生活中的大规模系统。一个例外是KAD，一个基于Kademlia的分布式哈希表，它是广泛使用的eMule点对点系统的一部分，该系统拥有超过150万的并发用户。我们已经开发了一个非常快的爬虫，并探索了一个多月的KAD通过爬行部分KAD ID空间，这只需要几秒钟。我们发现，有两类同行，长寿的同行，参加KAD数周和短命的同行，留在KAD不超过几天前，他们永久离开。大多数第一次加入KAD的同行都是短命的同行。由于会话间时间可能长达一周，因此需要爬行KAD一周以上，以便能够识别和描述短命对等体。
In recent years, a large number of DHTs have been proposed. However, very few of them have been deployed in real-life large scale systems. An exception is KAD, a DHT based on Kademlia that is part of the widely used eMule peer-to-peer system, which has more than 1.5 million simultaneous users. We have developed a very fast crawler and explored KAD for more than a month by crawling part of the KAD ID space, which takes only a few seconds. We find that there are two classes of peers, long-lived peers that participate in KAD for weeks and short-lived peers that remain in KAD no more than few days before they permanently leave. Most of the peers that join KAD for the first time are short-lived peers. Since inter-session times can be as large as one week, one needs to crawl KAD for more than a week to be able to identify and characterize short-lived peers.