论文信息 - A global view of kad

A global view of kad

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 <scp>KAD</scp>, 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 <scp>KAD</scp> 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 <scp>KAD</scp> 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 <scp>KAD</scp> ID, sometimes as frequently as after each session. This change of <scp>KAD</scp> IDs makes it difficult to characterize end-user availability or membership turnover.

[1] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[2] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.

[3] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[4] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[5] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[6] Stefan Savage,et al. Understanding Availability , 2003, IPTPS.

[7] Thomas Fuhrmann,et al. Measuring Large Overlay Networks - The Overnet Example , 2005, KiVS.

[8] Daniel Stutzbach,et al. Improving Lookup Performance Over a Widely-Deployed DHT , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9] Daniel Stutzbach,et al. Understanding churn in peer-to-peer networks , 2006, IMC '06.

[10] Keith W. Ross,et al. Exploiting P2P systems for DDoS attacks , 2006, InfoScale '06.

[11] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[12] Taoufik En-Najjary,et al. Actively Monitoring Peers in KAD , 2007, IPTPS.