Publications

Conference papers

A Long Way to the Top: Significance, Structure, and Stability [PDF] [BibTeX] [COMMUNITY CONTRIBUTION AWARD]
of Internet Top Lists

Quirin Scheitle, Oliver Hohlfeld, Julien Gamba, Jonas Jelten, Torsten Zimmermann, Stephen Strowes and Narseo Vallina-Rodriguez.
In IMC 2018, Oct. 31 - Nov. 2, Boston, MA, USA.

An Analysis of Pre-installed Android Software [PDF] [BibTeX]

Julien Gamba, Mohammed Rashed, Abbas Razaghpanah, Narseo Vallina-Rodriguez and Juan Tapiador.
In JNIC 2018, 13-15 June, San Sebastián, Spain.

This Is My Private Business! Privacy Risks on Adult Websites [PDF] [BibTeX]

Pelayo Vallina-Rodriguez, Julien Gamba, Álvaro Feal, Narseo Vallina-Rodriguez and Antonio Fernández.
In JNIC 2018, 13-15 June, San Sebastián, Spain.

BGP Table Fragmentation: what & who? [PDF] [slides] [BibTeX]

Julien Gamba, Romain Fontugne, Cristel Pelsser, Randy Bush and Emile Aben.
In CoRes 2017, 29-30 May, Quiberon, France.
Video presentation from RIPE 74.

Thesis

Conception rules for IGP and iBGP topologies to ensure BGP correctness

[PDF] [slides] [BibTeX]
Master's thesis, University of Strasbourg, France (2017).

The current Internet routing protocol, the border gateway protocol (BGP), offers a large flexibility of configuration for operators.However, because of this flexibility, anomalies can arise: BGP may fail to converge, some routers may be deprived of connectivity to the outside world, or routing loops can be created. Avoiding or fixing such anomalies can be complicated, especially for large topologies.

In this thesis, we will first review the existing models to capture the behaviour of BGP and introduce a decision problem, the stable path problem (SPP). The SPP model aim to track routing anomalies: by applying this model on a network topology, we can assure whether the given topology will be correct, or if it will be subject to anomalies. We will review the different kinds of anomalies discovered by the research community and classify them.

In the second part, we will give our definition of congruency in the context of BGP topologies, and show that any topology that respects this definition is correct.Then, we will present algorithms to correct a topology by making sure that it respects our definition of congruency.

We will conclude this thesis by giving a brief overview of the other existing approaches to the study of BGP correctness, and study the different perspectives opened by this work.