Statistical analysis of a p2p query graph based on degrees and their time-evolution

Authors:
Jean-Loup Guillaume;Matthieu Latapy;Stevens Le-Blond
Affiliations:
liafa – cnrs – Université Paris 7, Paris, France;liafa – cnrs – Université Paris 7, Paris, France;liafa – cnrs – Université Paris 7, Paris, France
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 3
Cited 7

Analyzing peer-to-peer traffic across large networks

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Deconstructing the Kazaa Network

WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications

Preface

Theoretical Computer Science - Complex networks
A formal framework for the performance analysis of P2P networks protocols

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Generating constrained random graphs using multiple edge switches

Journal of Experimental Algorithmics (JEA)
Combining the use of clustering and scale-free nature of user exchanges into a simple and efficient p2p system

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Clustering in p2p exchanges and consequences on performances

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
File diffusion in a dynamic peer-to-peer network

Proceedings of the 21st international conference companion on World Wide Web
Internal link prediction: A new approach for predicting links in bipartite graphs

Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a running environment using a semi-centralised p2p system (eDonkey). To achieve this, we use a trace of the queries made to a large server managing up to fifty thousands peers simultaneously, and a few thousands queries per second. We analyse these data using complex network methods, and focus in particular on the degrees, their correlations, and their time-evolution. Results show a large variety of observed phenomena, including the variety of peers behaviors and heterogeneity of data queries, which should be taken into account when designing p2p systems.