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
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
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Misusing Kademlia Protocol to Perform DDoS Attacks
ISPA '08 Proceedings of the 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications
DDoS Attacks by Subverting Membership Management in P2P Systems
NPSEC '07 Proceedings of the 2007 3rd IEEE Workshop on Secure Network Protocols
A measurement study of attacks on BitTorrent leechers
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
How many eyes are spying on your shared folders?
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
| Hi-index | 0.00 |
As the first DHT implemented in real applications and involving millions of simultaneous users, all aspects of Kad must be analyzed and measured carefully. This paper focuses on measuring the routing table of Kad in eMule/aMule. We present and analyze the availability and stability of routing table by crawling actively. We find the phenomenon of ID repetition in Kad that many peers use a same ID simultaneously, which will decrease the performance of routing and then reduce the availability of routing table. The connection availability of global routing table is relatively low, the average of which is about 64.9%. Connection availability influences the efficiency of searching and routing in Kad network directly.