Xiaomin Wang, Matthieu Latapy, Michèle Soria
Xiaomin Wang, Matthieu Latapy, Michèle Soria
Xiaomin Wang, Matthieu Latapy, Michèle Soria
Xiaomin Wang, Matthieu Latapy, Michèle Soria
Adrien Friggeri, Jean-Philippe Cointet and Matthieu Latapy
Adrien Friggeri, Jean-Philippe Cointet and Matthieu Latapy
Matthieu Latapy, Clémence Magnien and Frédéric Ouédraogo
Matthieu Latapy, Clémence Magnien and Frédéric Ouédraogo
> By Christophe Berger, Clémence Magnien, Matthieu Latapy, Firas Bessadok and Phillipe Jarlov We conduct a measurement of files available in eDonkey as follows. Our client connects to all eDonkey servers it discovers (it knows an initial lists of servers and explores the set of all servers reachable from these). Then it sends every 12 […]
> By Clémence Magnien and Matthieu Latapy Download When one wants to study a complex network, one generally first has to conduct an intricate and expensive measurement. This measurement gives a sample of the network which is generally partial and may be biased. In Complex Network Measurements: Estimating the Relevance of Observed Properties we propose […]
> Guillaume Valadon, Clémence Magnien and Frédéric Ouédraogo We performed an experiment similar to Growth of the number of IP around me and Dynamics of IP addresses around me. Here, the measurements were done from eleven monitors probing the same destination set. We combined the measurements in order to determine if IP addresses are discovered […]
This paper presents a capture of the queries managed by an eDonkey server during almost 10 weeks, leading to the observation of almost 9 billion messages involving almost 90 million users and more than 275 million distinct files. Acquisition and management of such data raises several challenges, which we discuss as well as the solutions we developed. We obtain a very rich dataset, orders of magnitude larger than previously avalaible ones, which we provide for public use. We finally present basic analysis of the obtained data, which already gives evidence of non-trivial features.
Frédéric Aidouni, Matthieu Latapy and Clémence Magnien
> By Wang Xiaomin, Matthieu Latapy and Michèle Soria The basic approach to construct a map of the internet as a graph is as follows: one runs the traceroute tool from some machines, called monitors, towards some others, called destinations, and then merges all the obtained paths. The view obtained from each monitor is roughly […]
> By Lamia Benamara and Clémence Magnien In a P2P system, we study the time users stay connected to the system, which we approximate by the time elapsed between the first and the last query made by a given user. This plot shows the inverse cumulative distribution of this life-duration: the x axis represents the […]
> By Elie Rotenberg and Christophe Crespelle This plot shows how distance between hosts seen among traceroute outputs and the targets of these traceroutes are likely to be multiple regarding to their average distance. The data is gathered as follows. We first pick up 60 random, ping-answering IP addresses. We then send successively one traceroute […]