Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Exploiting P2P systems for DDoS attacks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Exploiting KAD: possible uses and misuses
ACM SIGCOMM Computer Communication Review
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Measurements and mitigation of peer-to-peer-based botnets: a case study on storm worm
LEET'08 Proceedings of the 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enabling global multimedia distributed services based on hierarchical DHT overlay networks
International Journal of Internet Protocol Technology
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Towards complete node enumeration in a peer-to-peer botnet
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Capacity estimation of ADSL links
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Maintaining replicas in unstructured P2P systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Decentralized Bootstrapping of P2P Systems: A Practical View
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
Active measurement of routing table in Kad
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Efficient data management using the session log in DHT and its evaluation
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurement and diagnosis of address misconfigured P2P traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
A Walkable Kademlia network for virtual worlds
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Large-scale monitoring of DHT traffic
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Performance comparison of erasure codes for different churn models in P2P storage systems
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Comet: an active distributed key-value store
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Pr2-P2PSIP: privacy preserving P2P signaling for VoIP and IM
Principles, Systems and Applications of IP Telecommunications
AntBot: Anti-pollution peer-to-peer botnets
Computer Networks: The International Journal of Computer and Telecommunications Networking
Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
Computer Communications
RatBot: anti-enumeration peer-to-peer botnets
ISC'11 Proceedings of the 14th international conference on Information security
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Montra: A large-scale DHT traffic monitor
Computer Networks: The International Journal of Computer and Telecommunications Networking
eDonkey & eMule's Kad: Measurements & Attacks
Fundamenta Informaticae
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
A bird's eye view on the I2P anonymous file-sharing environment
NSS'12 Proceedings of the 6th international conference on Network and System Security
In-network redundancy generation for opportunistic speedup of data backup
Future Generation Computer Systems
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
On the interplay between data redundancy and retrieval times in P2P storage systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.