Xiaomin Wang, Matthieu Latapy, Michèle Soria

Xiaomin Wang, Matthieu Latapy, Michèle Soria

Xiaomin Wang, Matthieu Latapy, Michèle Soria

The degree distribution of the Internet topology is considered as one of its main properties. However, it is only known through a measurement procedure which gives a biased estimate. This measurement may in first approximation be modeled by a BFS (Breadth-First Search) tree. We explore here our ability to infer the type (Poisson or power-law) of the degree distribution from such a limited knowledge. We design procedures which estimate the degree distribution of a graph from a BFS of it, and show experimentally (on models and real-world data) that this approach succeeds in making the difference between Poisson and power-law degree distributions.

Xiaomin Wang, Matthieu Latapy, Michèle Soria

Posted in Papers Also tagged degree distribution, graph, internet, simulations, Topology, traceroute

Adrien Friggeri, Jean-Philippe Cointet and Matthieu Latapy

We designed an experiment to observe a spreading phenomenon in the blogosphere. This experiment relies on a small applet that participants copy on their own web page. We present the obtained dataset, which we freely provide for study, and conduct basic analysis. We conclude that, despite the classical assumption, in this experiment famous blogs do not necessarily act as super spreaders.

Adrien Friggeri, Jean-Philippe Cointet and Matthieu Latapy

Posted in Papers Also tagged complex networks, epidemiology, gossip, Graphs, social networks, spreading, viral marketing

Matthieu Latapy, Clémence Magnien and Frédéric Ouédraogo

Mapping the internet's topology is a challenge in itself, and studying its dynamics is even more difficult. Achieving this would however provide key information on the nature of the internet, crucial for modeling and simulation. Moreover, detecting anomalies in this dynamics is a key issue for security. We introduce here a new measurement approach which makes it possible to capture internet dynamics at a scale of a few minutes in a radar-like manner. By conducting and analyzing large-scale measurements of this kind, we rigorously and automatically detect events in the observed dynamics, which is totally out of reach of previous approaches.

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 […]

Frédéric Aidouni, Matthieu Latapy and Clémence Magnien

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 […]