Jean-Romain Luttringer

Jean-Romain Luttringer

Ph.D. Candidate in Computer Science

ICube, University of Strasbourg

Biography

I am currentlly working on my Ph. D. funded by a governemental fellowship at the University of Strasbourg, in the Networks Teams of the ICube laboratory.

My work is on constrained path computation for large-scale Segment Routing domains (which lead to the BEST2COP algorithm). I am also working on OPTIC, a way to mitigate the impact of hot-potato BGP routing on transit traffic and its P4 implementation. My work is supervised by Pr. Cristel Pelsser and Dr. Pascal Mérindol.

Besides my work on Segment Routing, I have also worked on Internet topology discovery, more precisely on hidden MPLS tunnels revelation in the wild and on large-scale multi-domain tunnels measurements (Geant GN4).

I have also taught ~ 192h in the past 3 years (and thoroughly enjoyed doing so!).

Download my resumé.

Interests
  • Routing & Path computation
  • Programmable Networks
  • Network measurements/discovery
Education
  • PhD Candidate in Computer Science (Computer networks), 2022 (Projection)

    University of Strasbourg

  • MSc in Computer Networks and Embedded Systems, 2019, with high honors

    University of Strasbourg

  • BSc in Mathematics and Computer Science, 2017, with honors

    University of Strasbourg

Recent Publications

Find a publication quickly by filtering publications.
(2021). Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks. In ArXiv.

PDF Cite Code Dataset Poster DOI

(2021). L'Art d'Anticiper les Changements IGP pour Acheminer Optimalement la Patate en Transit. In CORES.

PDF Cite Dataset Slides Video DOI

(2021). Le Problème à trois Contraintes: Calcul et Déploiement de Segments de Routage. In ALGOTEL.

BEST PAPER AWARD PDF Cite Code Poster Slides Video

(2021). A Fast-Convergence Routing of the Hot-Potato. In IEEE INFOCOM.

PDF Cite Dataset Slides Video DOI

(2019). Let there be light: Revealing hidden MPLS tunnels with TNT. In IEEE TNSM.

PDF Cite Code Dataset DOI

(2019). TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels. In TMA.

PDF Cite Code Dataset DOI

Awards

Best Paper Award of ALGOTEL 21

For Le Problème à trois Contraintes: Calcul et Déploiement de Segments de Routage. A three-way tie was broken according to the presentation.

Internet Techincal Comittee/ISOC Paper of the Year 2019

For TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels.

Best Paper Award of TMA 19

For TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels.

Runner Up for Best Open Dataset of TMA 19

For TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels.

Best Poster Award (doctoral school)

For my thesis’ poster. Chosen among ~100 Students.

Experience & Research

 
 
 
 
 
Ph.D. Student in Computer Science: Beyond Best Effort
Oct 2019 – Present Strasbourg, France
Conception and evaluation of a multi-constrained shortest paths algorithm for massive-scale Traffic-Engineering with Segment Routing. In collaboration with Cisco Systems. Continued work on the BGP/IGP protection scheme OPTIC and its P4 implementation. Governemental fellowship.
 
 
 
 
 
Master thesis: OPTIC, Protecting BGP traffic from internal events
Feb 2019 – Jul 2019 Strasbourg, France
Conception of OPTIC, a forwarding scheme protecting transiting BGP trafic from the effect of hot potato routing.
 
 
 
 
 
Inter-Domain netwotk services supervision
May 2018 – Sep 2018 Strasbourg, France
European project aiming at monitoring multi-domain VPN through active measurements within a distributed platform. Development of a python tools aggretating and correlating the measurements.
 
 
 
 
 
Discovering Hidden MPLS tunnels
May 2017 – Jul 2017 Strasbourg, France
Finding ways to detect and reveal hidden MPLS in the wild in a testbed, and implement the detection/revelation methods in a python tool.
 
 
 
 
 
Parallel image reconstruction method for cryo-EM
Sep 2016 – Dec 2016 Strasbourg, France
Porting to an HP grid of an image reconstruction algorithm. Live selection and duplication of most promising executions within a VM network to converge quicker to an optimum.