Probabilistic modelling
A practical guide to heavy tails
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
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
Is remote host availability governed by a universal law?
ACM SIGMETRICS Performance Evaluation Review
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ACM SIGMETRICS Performance Evaluation Review
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Exploiting availability prediction in distributed systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Exploiting KAD: possible uses and misuses
ACM SIGCOMM Computer Communication Review
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
Evaluating the accuracy of captured snapshots by peer-to-peer crawlers
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
BTWorld: towards observing the global BitTorrent file-sharing network
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
An experimental study of peer behavior in a pure P2P network
Journal of Systems and Software
A quantitative analysis of redundancy schemes for peer-to- peer storage systems
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Traffic localization for DHT-based BitTorrent networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
Computer Communications
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Quality of data delivery in peer-to-peer video streaming
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on P2P Streaming
CPSCox: A survival analysis model of peer behavior in large scale DHT system
Computer Communications
Still Alive: Extending Keep-Alive Intervals in P2P Overlay Networks
Mobile Networks and Applications
How many eyes are spying on your shared folders?
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
Understanding the effects of P2P dynamics on trust bootstrapping
Information Sciences: an International Journal
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
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 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 eDonkey, a peer-to-peer file sharing system with several million simultaneous users. We 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. We have found that session times are Weibull distributed and we show how this information can be exploited to make the publishing mechanism much more efficient. Peers are identified by the so-called KAD ID, which up to now was assumed to be persistent. However, we observed that a fraction of peers changes their KAD ID as frequently as once a session. This change of KAD IDs makes it difficult to characterize end-user behavior. For this reason we have been crawling the entire KAD network once a day for more than a year to track end-users with static IP addresses, which allows us to estimate end-user lifetime and the fraction of end-users changing their KAD ID.