Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Deconstructing the Kazaa Network
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Exploiting Semantic Proximity in Peer-to-Peer Content Searching
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Exploiting semantic clustering in the eDonkey P2P network
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Statistical analysis of a p2p query graph based on degrees and their time-evolution
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Theoretical Computer Science - Complex networks
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Structuring unstructured peer-to-peer networks
HiPC'07 Proceedings of the 14th international conference on High performance computing
The GOSSPLE anonymous social network
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Clustering Coefficients in Protein Interaction Hypernetworks
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Detecting community structure in bipartite networks based on matrix factorisation
International Journal of Wireless and Mobile Computing
Internal link prediction: A new approach for predicting links in bipartite graphs
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
Hi-index | 0.00 |
We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term of data exchanged by peers having provided or queried at least one data in common. We introduce a method to capture these correlations (namely the data clustering), and study it in detail. We then use it to propose a very simple and efficient way to group data into clusters and show the impact of this underlying structure on search in typical P2P systems. Finally, we use these results to evaluate the relevance and limitations of a model proposed in a previous publication. We indicate some realistic values for the parameters of this model, and discuss some possible improvements.