Download now Free registration required
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 DHTs have been implemented in real systems and deployed on a large scale. One exception is KAD, a DHT based on Kademlia, which is part of e-Donkey, a peer-to-peer file sharing system with several million simultaneous users. The authors have been crawling a representative subset of KAD every five minutes for six months and obtained information about geographical distribution of peers, session times, daily usage, and peer lifetime. They have found that session times are Weibull distributed and they show how this information can be exploited to make the publishing mechanism much more efficient.
- Format: PDF
- Size: 591.17 KB